World Library  
Flag as Inappropriate
Email this Article


Article Id: WHEBN0000029586
Reproduction Date:

Title: Sigma-algebra  
Author: World Heritage Encyclopedia
Language: English
Subject: Boolean algebras canonically defined, Measure (mathematics), Sample space, Event (probability theory), Probability space
Collection: Boolean Algebra, Measure Theory, Probability Theory, Set Families
Publisher: World Heritage Encyclopedia


In mathematical analysis and in probability theory, a σ-algebra (also sigma-algebra, σ-field, sigma-field) on a set X is a collection Σ of subsets of X that is closed under countable-fold set operations (complement, union of countably many sets and intersection of countably many sets). By contrast, an algebra is only required to be closed under finitely many set operations. That is, a σ-algebra is an algebra of sets, completed to include countably infinite operations. The pair (X, Σ) is also a field of sets, called a measurable space.

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 a formal mathematical definition of sufficient statistic,[1] particularly when the statistic is a function or a random process and the notion of conditional density is not applicable.

If X = {a, b, c, d}, one possible σ-algebra on X is Σ = { ∅, {a, b}, {c, d}, {a, b, c, d} }, where ∅ is the empty set. However, a finite algebra is always a σ-algebra.

If {A1, A2, A3, …} 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 1
    • Measure 1.1
    • Limits of sets 1.2
    • Sub σ-algebras 1.3
  • Definition and properties 2
    • Definition 2.1
    • Dynkin's π-λ theorem 2.2
    • Combining σ-algebras 2.3
    • σ-algebras for subspaces 2.4
    • Relation to σ-ring 2.5
    • Typographic note 2.6
  • Examples 3
    • Simple set-based examples 3.1
    • Stopping time sigma-algebras 3.2
  • σ-algebras generated by families of sets 4
    • σ-algebra generated by an arbitrary family 4.1
    • σ-algebra generated by a function 4.2
    • Borel and Lebesgue σ-algebras 4.3
    • Product σ-algebra 4.4
    • σ-algebra generated by cylinder sets 4.5
    • σ-algebra generated by random variable or vector 4.6
    • σ-algebra generated by a stochastic process 4.7
  • See also 5
  • References 6
  • External links 7


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


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 every 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 limit supremum of a sequence A1, A2, A3, ..., each of which is a subset of X, is
\limsup_{n\to\infty}A_n=\bigcap_{n=1}^\infty\bigcup_{m=n}^\infty A_m.
  • The limit infimum of a sequence A1, A2, A3, ..., each of which is a subset of X, is
\liminf_{n\to\infty}A_n=\bigcup_{n=1}^\infty\bigcap_{m=n}^\infty A_m.
  • If, in fact,
then the \lim_{n\to\infty}A_n exists as that 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. A simple example suffices to illustrate this idea.

Imagine you are playing a game that involves flipping a coin repeatedly and observing whether it comes up Heads (H) or Tails (T). Since you and your opponent are each infinitely wealthy, 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:

\Omega=\{H,T\}^\infty=\{(x_1,x_2,x_3,\dots):x_i\in\{H,T\}, i\ge 1\}.

However, after n flips of the coin, you may want to determine or revise your betting strategy in advance of the next flip. The observed information at that point can be described in terms of the 2n possibilities for the first n flips. Formally, since you need to use subsets of Ω, this is codified as the σ-algebra


Observe that then


where \mathcal{G}_\infty is the smallest σ-algebra containing all the others.

Definition and properties


Let X be some set, and let 2X represent its power set. Then a subset Σ ⊂ 2X is called a σ-algebra if it satisfies the following three properties:[2]

  1. X is in Σ.
  2. Σ is closed under complementation: If A is in Σ, then so is its complement, X\A.
  3. Σ is closed under countable unions: If A1, A2, A3, ... are in Σ, then so is A = A1A2A3 ∪ … .

From these properties, it follows that the σ-algebra is also closed under countable empty set ∅ is in Σ, since by (1) X is in Σ and (2) asserts that its complement, the empty set, is also in Σ. Moreover, by (3) it follows as well that {X, ∅} is the smallest possible σ-algebra.

Elements of the σ-algebra are called measurable sets. An ordered pair (X, Σ), where X is a set and Σ 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 [0, ∞].

A σ-algebra is both a π-system and a Dynkin system (λ-system). The converse is true as well, by Dynkin's theorem (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.

A π-system P is a collection of subsets of Σ that is closed under finitely many intersections, and
a Dynkin system (or λ-system) D is a collection of subsets of Σ that contains Σ and is closed under complement and under countable unions of disjoint subsets.

Dynkin's π-λ theorem says, if P is a π-system and D is a Dynkin system that contains P then the σ-algebra σ(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 σ(P) enjoy the property, avoiding the task of checking it for an arbitrary set in σ(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:

\mathbb{P}(X\in A)=\int_A \,F(dx) for all A in the Borel σ-algebra on R,

where F(x) is the cumulative distribution function for X, defined on R, while \mathbb{P} is a probability measure, defined on a σ-algebra Σ of subsets of some sample space Ω.

Combining σ-algebras

Suppose \textstyle\{\Sigma_\alpha:\alpha\in\mathcal{A}\} is a collection of σ-algebras on a space X.

  • 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 Σ 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 Σ. Therefore, Σ is a σ-algebra.
  • 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
\mathcal{P}=\left \{\bigcap_{i=1}^nA_i:A_i\in\Sigma_{\alpha_i},\alpha_i\in\mathcal{A},\ n\ge1 \right\}.
Sketch of Proof: By the case n = 1, it is seen that each \Sigma_\alpha\subset\mathcal{P}, 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, Σ) be a measurable space.

  • The collection {YB: B ∈ Σ} is a σ-algebra of subsets of Y.
  • Suppose (Y, Λ) is a measurable space. The collection {AX : AY ∈ Λ} is a σ-algebra of subsets of X.

Relation to σ-ring

A σ-algebra Σ is just a σ-ring that contains the universal set X.[3] 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, Σ) may be denoted as \scriptstyle(X,\,\mathcal{F}) or \scriptstyle(X,\,\mathfrak{F}).


Simple set-based examples

Let X be any set.

  • The family consisting only of the empty set and the set X, called the minimal or trivial σ-algebra over X.
  • The power set of X, called the discrete σ-algebra.
  • The collection {∅, A, Ac, X} is a simple σ-algebra generated by the subset A.
  • The collection of subsets of X which are countable or whose complements are countable is a σ-algebra (which is distinct from the power set of X if and only if X is uncountable). This is the σ-algebra generated by the singletons of X. Note: "countable" includes finite or empty.
  • The collection of all unions of sets in a countable partition of X is a σ-algebra.

Stopping time sigma-algebras

A stopping time \tau can define a \sigma-algebra \mathcal{F}_{\tau}, 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 \mathcal{F}_{\tau}.[4]

σ-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 σ(F) and is called the σ-algebra generated by F.

For a simple example, consider the set X = {1, 2, 3}. Then the σ-algebra generated by the single subset {1} is σ() = {∅, {1}, {2, 3}, {1, 2, 3}}. By an abuse of notation, when a collection of subsets contains only one element, A, one may write σ(A) instead of σ({A}); in the prior example σ({1}) instead of σ(). Indeed, using σ(A1, A2, ...) to mean σ({A1, A2, ...}) 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 σ-algebra of subsets of Y, then the σ-algebra generated by the function f, denoted by σ(f), is the collection of all inverse images f−1(S) of the sets S in B. i.e.

\sigma (f) = \{ f^{-1}(S) \, | \, S\in B \}.

A function f from a set X to a set Y is measurable with respect to a σ-algebra Σ of subsets of X if and only if σ(f) is a subset of Σ.

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 Rn then σ(f) is generated by the family of subsets which are inverse images of intervals/rectangles in Rn:


A useful property is the following. Assume f is a measurable map from (X, ΣX) to (S, ΣS) and g is a measurable map from (X, ΣX) to (T, ΣT). If there exists a measurable function h from T to S such that f(x) = h(g(x)) then σ(f) ⊂ σ(g). If S is finite or countably infinite or if (S, ΣS) is a standard Borel space (e.g., a separable complete metric space with its associated Borel sets) then the converse is also true.[5] Examples of standard Borel spaces include Rn with its Borel sets and R 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). Note that 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 Rn, another σ-algebra is of importance: that of all Lebesgue measurable sets. This σ-algebra contains more sets than the Borel σ-algebra on Rn and is preferred in integration theory, as it gives a complete measure space.

Product σ-algebra

Let (X_1,\Sigma_1) and (X_2,\Sigma_2) be two measurable spaces. The σ-algebra for the corresponding product space X_1\times X_2 is called the product σ-algebra and is defined by

\Sigma_1\times\Sigma_2=\sigma(\{B_1\times B_2:B_1\in\Sigma_1,B_2\in\Sigma_2\}).

Observe that \{B_1\times B_2:B_1\in\Sigma_1,B_2\in\Sigma_2\} is a π-system.

The Borel σ-algebra for Rn is generated by half-infinite rectangles and by finite rectangles. For example,

\mathcal{B}(\mathbb{R}^n)=\sigma \left(\left \{(-\infty,b_1]\times\cdots\times(-\infty,b_n]:b_i\in\mathbb{R} \right \}\right) = \sigma\left(\left \{(a_1,b_1]\times\cdots\times(a_n,b_n]:a_i,b_i\in\mathbb{R} \right \}\right).

For each of these two examples, the generating family is a π-system.

σ-algebra generated by cylinder sets


X\subset\mathbb{R}^{\mathbb{T}}=\{f:f(t)\in\mathbb{R},\ t\in\mathbb{T}\}

is a set of real-valued functions. Let \mathcal{B}(\mathbb{R}) denote the Borel subsets of R. A cylinder subset of X is a finitely restricted set defined as

C_{t_1,\dots,t_n}(B_1,\dots,B_n)=\{f\in X:f(t_i)\in B_i, 1\le i \le n\}.


\{C_{t_1,\dots,t_n}(B_1,\dots,B_n):B_i\in\mathcal{B}(\mathbb{R}), 1\le i \le n\}

is a π-system that generates a σ-algebra \textstyle\Sigma_{t_1,\dots,t_n}. Then the family of subsets

\mathcal{F}_X=\bigcup_{n=1}^\infty\bigcup_{t_i\in\mathbb{T},i\le n}\Sigma_{t_1,\dots,t_n}

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 \mathbb{R}^{\mathbb{T}} 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

C_n(B_1,\dots,B_n)=(B_1\times\cdots\times B_n\times\mathbb{R}^\infty)\cap X=\{(x_1,x_2,\dots,x_n,x_{n+1},\dots)\in X:x_i\in B_i,1\le i\le n\},

for which

\Sigma_n=\sigma(\{C_n(B_1,\dots,B_n):B_i\in\mathcal{B}(\mathbb{R}), 1\le i \le n\})

is a non-decreasing sequence of σ-algebras.

σ-algebra generated by random variable or vector

Suppose (\Omega,\Sigma,\mathbb{P}) is a probability space. If \textstyle Y:\Omega\to\mathbb{R}^n is measurable with respect to the Borel σ-algebra on Rn then Y is called a random variable (n = 1) or random vector (n ≥ 1). The σ-algebra generated by Y is

\sigma (Y) = \{ Y^{-1}(A): A\in\mathcal{B}(\mathbb{R}^n) \}.

σ-algebra generated by a stochastic process

Suppose (\Omega,\Sigma,\mathbb{P}) is a probability space and \mathbb{R}^\mathbb{T} is the set of real-valued functions on \mathbb{T}. If \textstyle Y:\Omega\to X\subset\mathbb{R}^\mathbb{T} is measurable with respect to the cylinder σ-algebra \sigma(\mathcal{F}_X) (see above) for X then Y is called a stochastic process or random process. The σ-algebra generated by Y is

\sigma(Y) = \left \{ Y^{-1}(A): A\in\sigma(\mathcal{F}_X) \right \}= \sigma(\{ Y^{-1}(A): A\in\mathcal{F}_X\}),

the σ-algebra generated by the inverse images of cylinder sets.

See also


  1. ^
  2. ^
  3. ^
  4. ^
  5. ^

External links

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.