In mathematical analysis and in probability theory, a σ-algebra ("sigma algebra"; also σ-field, where the σ comes from the German "Summe" ) on a set X is a nonempty collection Σ of subsets of X closed under complement, countable unions, and countable intersections. The ordered pair (X, \Sigma) is called a measurable space. A σ-algebra of subsets is a set algebra of subsets; elements of the latter only need to be closed under the union or intersection of finitely many subsets, which is a weaker condition. The main use of σ-algebras is in the definition of measures; specifically, the collection of those subsets for which a given measure is defined is necessarily a σ-algebra. This concept is important in mathematical analysis as the foundation for Lebesgue integration, and in probability theory, where it is interpreted as the collection of events which can be assigned probabilities. Also, in probability, σ-algebras are pivotal in the definition of conditional expectation. In statistics, (sub) σ-algebras are needed for the formal mathematical definition of a sufficient statistic, particularly when the statistic is a function or a random process and the notion of conditional density is not applicable. If one possible σ-algebra on X is where \varnothing is the empty set. In general, a finite algebra is always a σ-algebra. If is a countable partition of X then the collection of all unions of sets in the partition (including the empty set) is a σ-algebra. A more useful example is the set of subsets of the real line formed by starting with all open intervals and adding in all countable unions, countable intersections, and relative complements and continuing this process (by transfinite iteration through all countable ordinals) until the relevant closure properties are achieved (a construction known as the Borel hierarchy).

Motivation

There are at least three key motivators for σ-algebras: defining measures, manipulating limits of sets, and managing partial information characterized by sets.

Measure

A measure on X is a function that assigns a non-negative real number to subsets of X; this can be thought of as making precise a notion of "size" or "volume" for sets. We want the size of the union of disjoint sets to be the sum of their individual sizes, even for an infinite sequence of disjoint sets. One would like to assign a size to subset of X, but in many natural settings, this is not possible. For example, the axiom of choice implies that when the size under consideration is the ordinary notion of length for subsets of the real line, then there exist sets for which no size exists, for example, the Vitali sets. For this reason, one considers instead a smaller collection of privileged subsets of X. These subsets will be called the measurable sets. They are closed under operations that one would expect for measurable sets, that is, the complement of a measurable set is a measurable set and the countable union of measurable sets is a measurable set. Non-empty collections of sets with these properties are called σ-algebras.

Limits of sets

Many uses of measure, such as the probability concept of almost sure convergence, involve limits of sequences of sets. For this, closure under countable unions and intersections is paramount. Set limits are defined as follows on σ-algebras. The inner limit is always a subset of the outer limit: If these two sets are equal then their limit exists and is equal to this common set:

Sub σ-algebras

In much of probability, especially when conditional expectation is involved, one is concerned with sets that represent only part of all the possible information that can be observed. This partial information can be characterized with a smaller σ-algebra which is a subset of the principal σ-algebra; it consists of the collection of subsets relevant only to and determined only by the partial information. Formally, if are σ-algebras on X, then \Sigma' is a sub σ-algebra of \Sigma if. An example will illustrate how this idea arises. Imagine two people are betting on a game that involves flipping a coin repeatedly and observing whether it comes up Heads (H) or Tails (T). Both players are assumed to be infinitely wealthy, so there is no limit to how long the game can last. This means the sample space Ω must consist of all possible infinite sequences of H or T: The observed information after n flips have occurred is one of the 2^n possibilities describing the sequence of the first n flips. This is codified as the sub σ-algebra which locks down the first n flips and is agnostic about the result of the remaining ones. Observe that then where is the smallest σ-algebra containing all the others.

Definition and properties

Definition

Let X be some set, and let P(X) represent its power set. Then a subset is called a σ-algebra if and only if it satisfies the following three properties: From these properties, it follows that the σ-algebra is also closed under countable intersections (by applying De Morgan's laws). It also follows that the empty set \varnothing is in \Sigma, since by (1) X is in \Sigma and (2) asserts that its complement, the empty set, is also in \Sigma. Moreover, since satisfies condition (3) as well, it follows that is the smallest possible σ-algebra on X. The largest possible σ-algebra on X is P(X). Elements of the σ-algebra are called measurable sets. An ordered pair where X is a set and \Sigma is a σ-algebra over X, is called a measurable space. A function between two measurable spaces is called a measurable function if the preimage of every measurable set is measurable. The collection of measurable spaces forms a category, with the measurable functions as morphisms. Measures are defined as certain types of functions from a σ-algebra to A σ-algebra is both a π-system and a Dynkin system (λ-system). The converse is true as well, by Dynkin's theorem (see below).

Dynkin's π-λ theorem

This theorem (or the related monotone class theorem) is an essential tool for proving many results about properties of specific σ-algebras. It capitalizes on the nature of two simpler classes of sets, namely the following. Dynkin's π-λ theorem says, if P is a π-system and D is a Dynkin system that contains P, then the σ-algebra \sigma(P) generated by P is contained in D. Since certain π-systems are relatively simple classes, it may not be hard to verify that all sets in P enjoy the property under consideration while, on the other hand, showing that the collection D of all subsets with the property is a Dynkin system can also be straightforward. Dynkin's π-λ Theorem then implies that all sets in \sigma(P) enjoy the property, avoiding the task of checking it for an arbitrary set in \sigma(P). One of the most fundamental uses of the π-λ theorem is to show equivalence of separately defined measures or integrals. For example, it is used to equate a probability for a random variable X with the Lebesgue-Stieltjes integral typically associated with computing the probability: for all A in the Borel σ-algebra on \Reals, where F(x) is the cumulative distribution function for X, defined on \Reals, while \mathbb{P} is a probability measure, defined on a σ-algebra \Sigma of subsets of some sample space \Omega.

Combining σ-algebras

Suppose is a collection of σ-algebras on a space X. Meet The intersection of a collection of σ-algebras is a σ-algebra. To emphasize its character as a σ-algebra, it often is denoted by: Sketch of Proof: Let \Sigma^* denote the intersection. Since X is in every is not empty. Closure under complement and countable unions for every implies the same must be true for \Sigma^. Therefore, \Sigma^ is a σ-algebra. Join The union of a collection of σ-algebras is not generally a σ-algebra, or even an algebra, but it generates a σ-algebra known as the join which typically is denoted A π-system that generates the join is Sketch of Proof: By the case n = 1, it is seen that each so This implies by the definition of a σ-algebra generated by a collection of subsets. On the other hand, which, by Dynkin's π-λ theorem, implies

σ-algebras for subspaces

Suppose Y is a subset of X and let (X, \Sigma) be a measurable space.

Relation to σ-ring

A σ-algebra \Sigma is just a σ-ring that contains the universal set X. A σ-ring need not be a σ-algebra, as for example measurable subsets of zero Lebesgue measure in the real line are a σ-ring, but not a σ-algebra since the real line has infinite measure and thus cannot be obtained by their countable union. If, instead of zero measure, one takes measurable subsets of finite Lebesgue measure, those are a ring but not a σ-ring, since the real line can be obtained by their countable union yet its measure is not finite.

Typographic note

σ-algebras are sometimes denoted using calligraphic capital letters, or the Fraktur typeface. Thus (X, \Sigma) may be denoted as or

Particular cases and examples

Separable σ-algebras

A separable \sigma-algebra (or separable \sigma-field) is a \sigma-algebra \mathcal{F} that is a separable space when considered as a metric space with metric for and a given finite measure \mu (and with \triangle being the symmetric difference operator). Any \sigma-algebra generated by a countable collection of sets is separable, but the converse need not hold. For example, the Lebesgue \sigma-algebra is separable (since every Lebesgue measurable set is equivalent to some Borel set) but not countably generated (since its cardinality is higher than continuum). A separable measure space has a natural pseudometric that renders it separable as a pseudometric space. The distance between two sets is defined as the measure of the symmetric difference of the two sets. The symmetric difference of two distinct sets can have measure zero; hence the pseudometric as defined above need not to be a true metric. However, if sets whose symmetric difference has measure zero are identified into a single equivalence class, the resulting quotient set can be properly metrized by the induced metric. If the measure space is separable, it can be shown that the corresponding metric space is, too.

Simple set-based examples

Let X be any set.

Stopping time sigma-algebras

A stopping time \tau can define a \sigma-algebra the so-called stopping time sigma-algebra, which in a filtered probability space describes the information up to the random time \tau in the sense that, if the filtered probability space is interpreted as a random experiment, the maximum information that can be found out about the experiment from arbitrarily often repeating it until the time \tau is

σ-algebras generated by families of sets

σ-algebra generated by an arbitrary family

Let F be an arbitrary family of subsets of X. Then there exists a unique smallest σ-algebra which contains every set in F (even though F may or may not itself be a σ-algebra). It is, in fact, the intersection of all σ-algebras containing F. (See intersections of σ-algebras above.) This σ-algebra is denoted \sigma(F) and is called the σ-algebra generated by F. If F is empty, then Otherwise \sigma(F) consists of all the subsets of X that can be made from elements of F by a countable number of complement, union and intersection operations. For a simple example, consider the set Then the σ-algebra generated by the single subset {1} is By an abuse of notation, when a collection of subsets contains only one element, A, \sigma(A) may be written instead of in the prior example instead of Indeed, using to mean is also quite common. There are many families of subsets that generate useful σ-algebras. Some of these are presented here.

σ-algebra generated by a function

If f is a function from a set X to a set Y and B is a \sigma-algebra of subsets of Y, then the \sigma**-algebra generated by the function** f, denoted by \sigma (f), is the collection of all inverse images f^{-1} (S) of the sets S in B. That is, A function f from a set X to a set Y is measurable with respect to a σ-algebra \Sigma of subsets of X if and only if \sigma(f) is a subset of \Sigma. One common situation, and understood by default if B is not specified explicitly, is when Y is a metric or topological space and B is the collection of Borel sets on Y. If f is a function from X to \Reals^n then \sigma(f) is generated by the family of subsets which are inverse images of intervals/rectangles in \Reals^n: A useful property is the following. Assume f is a measurable map from to and g is a measurable map from to If there exists a measurable map h from to such that for all x, then If S is finite or countably infinite or, more generally, is a standard Borel space (for example, a separable complete metric space with its associated Borel sets), then the converse is also true. Examples of standard Borel spaces include \Reals^n with its Borel sets and with the cylinder σ-algebra described below.

Borel and Lebesgue σ-algebras

An important example is the Borel algebra over any topological space: the σ-algebra generated by the open sets (or, equivalently, by the closed sets). This σ-algebra is not, in general, the whole power set. For a non-trivial example that is not a Borel set, see the Vitali set or Non-Borel sets. On the Euclidean space \Reals^n, another σ-algebra is of importance: that of all Lebesgue measurable sets. This σ-algebra contains more sets than the Borel σ-algebra on \Reals^n and is preferred in integration theory, as it gives a complete measure space.

Product σ-algebra

Let and be two measurable spaces. The σ-algebra for the corresponding product space is called the product σ-algebra and is defined by Observe that is a π-system. The Borel σ-algebra for \Reals^n is generated by half-infinite rectangles and by finite rectangles. For example, For each of these two examples, the generating family is a π-system.

σ-algebra generated by cylinder sets

Suppose is a set of real-valued functions. Let denote the Borel subsets of \Reals. A cylinder subset of X is a finitely restricted set defined as Each is a π-system that generates a σ-algebra Then the family of subsets is an algebra that generates the cylinder σ-algebra for X. This σ-algebra is a subalgebra of the Borel σ-algebra determined by the product topology of restricted to X. An important special case is when \mathbb{T} is the set of natural numbers and X is a set of real-valued sequences. In this case, it suffices to consider the cylinder sets for which is a non-decreasing sequence of σ-algebras.

Ball σ-algebra

The ball σ-algebra is the smallest σ-algebra containing all the open (and/or closed) balls. This is never larger than the Borel σ-algebra. Note that the two σ-algebra are equal for separable spaces. For some nonseparable spaces, some maps are ball measurable even though they are not Borel measurable, making use of the ball σ-algebra useful in the analysis of such maps.

σ-algebra generated by random variable or vector

Suppose is a probability space. If is measurable with respect to the Borel σ-algebra on \Reals^n then Y is called a random variable (n = 1) or random vector (n > 1). The σ-algebra generated by Y is

σ-algebra generated by a stochastic process

Suppose is a probability space and is the set of real-valued functions on \mathbb{T}. If is measurable with respect to the cylinder σ-algebra (see above) for X then Y is called a stochastic process or random process. The σ-algebra generated by Y is the σ-algebra generated by the inverse images of cylinder sets.