Measurable functionIn mathematics and in particular measure theory, a measurable function is a function between the underlying sets of two measurable spaces that preserves the structure of the spaces: the of any measurable set is measurable. This is in direct analogy to the definition that a continuous function between topological spaces preserves the topological structure: the preimage of any open set is open. In real analysis, measurable functions are used in the definition of the Lebesgue integral.
Measurable cardinalIn mathematics, a measurable cardinal is a certain kind of large cardinal number. In order to define the concept, one introduces a two-valued measure on a cardinal κ, or more generally on any set. For a cardinal κ, it can be described as a subdivision of all of its subsets into large and small sets such that κ itself is large, ∅ and all singletons , α ∈ κ are small, complements of small sets are large and vice versa. The intersection of fewer than κ large sets is again large.
Simple functionIn the mathematical field of real analysis, a simple function is a real (or complex)-valued function over a subset of the real line, similar to a step function. Simple functions are sufficiently "nice" that using them makes mathematical reasoning, theory, and proof easier. For example, simple functions attain only a finite number of values. Some authors also require simple functions to be measurable; as used in practice, they invariably are.
Non-measurable setIn mathematics, a non-measurable set is a set which cannot be assigned a meaningful "volume". The mathematical existence of such sets is construed to provide information about the notions of length, area and volume in formal set theory. In Zermelo–Fraenkel set theory, the axiom of choice entails that non-measurable subsets of exist. The notion of a non-measurable set has been a source of great controversy since its introduction. Historically, this led Borel and Kolmogorov to formulate probability theory on sets which are constrained to be measurable.
Sigma-additive set functionIn mathematics, an additive set function is a function mapping sets to numbers, with the property that its value on a union of two disjoint sets equals the sum of its values on these sets, namely, If this additivity property holds for any two sets, then it also holds for any finite number of sets, namely, the function value on the union of k disjoint sets (where k is a finite number) equals the sum of its values on the sets. Therefore, an additive set function is also called a finitely additive set function (the terms are equivalent).