Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
σ-algebra
open-in-new
<h2 id="examples-of--algebras">Examples of σ-algebras</h2> <p>If X = { a , b , c , d } {\displaystyle X=\{a,b,c,d\}} one possible σ-algebra on X {\displaystyle X} is Σ = { ∅ , { a , b } , { c , d } , { a , b , c , d } } , {\displaystyle \Sigma =\{\varnothing ,\{a,b\},\{c,d\},\{a,b,c,d\}\},} where ∅ {\displaystyle \varnothing } is the <a href="/facts/Empty_set/ffEk3eA6">empty set</a>. In general, a finite algebra is always a σ-algebra. </p><p>If { A 1 , A 2 , A 3 , … } , {\displaystyle \{A_{1},A_{2},A_{3},\ldots \},} is a countable <a href="/facts/Partition_of_a_set/VeP9g8CA">partition</a> of X {\displaystyle X} then the collection of all unions of sets in the partition (including the empty set) is a σ-algebra. </p><p>A more useful example is the set of subsets of the <a href="/facts/Real_line/6eq42xX5">real line</a> formed by starting with all <a href="/facts/Open_interval/e9se3vTe">open intervals</a> and adding in all countable unions, countable intersections, and relative complements and continuing this process (by <a href="/facts/Transfinite_iteration/XlolgTDl">transfinite iteration</a> through all <a href="/facts/Countable_ordinal/GelFLjJt">countable ordinals</a>) until the relevant closure properties are achieved (a construction known as the <a href="/facts/Borel_hierarchy/u15QcVmv">Borel hierarchy</a>). </p> <h2 id="motivation">Motivation</h2> <p>There are at least three key motivators for σ-algebras: defining measures, manipulating limits of sets, and managing partial information characterized by sets. </p> <h3>Measure</h3> <p>A <a href="/facts/Measure_(mathematics)/yCq7zlI4">measure</a> on X {\displaystyle X} is a <a href="/facts/Function_(mathematics)/CdReEKCh">function</a> that assigns a non-negative <a href="/facts/Real_number/R02gw5Pb">real number</a> to subsets of X ; {\displaystyle 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 <a href="/facts/Disjoint_sets/nLr8XRVd">disjoint sets</a>. </p><p>One would like to assign a size to every subset of X , {\displaystyle X,} but in many natural settings, this is not possible. For example, the <a href="/facts/Axiom_of_choice/1Ura2HTh">axiom of choice</a> 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 <a href="/facts/Vitali_set/pwdETXCf">Vitali sets</a>. For this reason, one considers instead a smaller collection of privileged subsets of X . {\displaystyle 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. </p> <h3>Limits of sets</h3> <p>Many uses of measure, such as the probability concept of <a href="/facts/Convergence_of_random_variables/pWdatFlY">almost sure convergence</a>, involve <a href="/facts/Set-theoretic_limit/NoJtcsqr">limits of sequences of sets</a>. For this, closure under countable unions and intersections is paramount. Set limits are defined as follows on σ-algebras. </p> <ul><li>The <a href="/facts/Limit_supremum/QeAhlygs">limit supremum</a> or outer limit of a sequence A 1 , A 2 , A 3 , … {\displaystyle A_{1},A_{2},A_{3},\ldots } of subsets of X {\displaystyle X} is lim sup n → ∞ A n = ⋂ n = 1 ∞ ⋃ m = n ∞ A m = ⋂ n = 1 ∞ A n ∪ A n + 1 ∪ ⋯ . {\displaystyle \limsup _{n\to \infty }A_{n}=\bigcap _{n=1}^{\infty }\bigcup _{m=n}^{\infty }A_{m}=\bigcap _{n=1}^{\infty }A_{n}\cup A_{n+1}\cup \cdots .} It consists of all points x {\displaystyle x} that are in infinitely many of these sets (or equivalently, that are in <a href="/facts/Cofinal_(mathematics)/l5Hoqx3o">cofinally many</a> of them). That is, x ∈ lim sup n → ∞ A n {\displaystyle x\in \limsup _{n\to \infty }A_{n}} if and only if there exists an infinite <a href="/facts/Subsequence/GdC2Qwau">subsequence</a> A n 1 , A n 2 , … {\displaystyle A_{n_{1}},A_{n_{2}},\ldots } (where n 1 < n 2 < ⋯ {\displaystyle n_{1}<n_{2}<\cdots } ) of sets that all contain x ; {\displaystyle x;} that is, such that x ∈ A n 1 ∩ A n 2 ∩ ⋯ . {\displaystyle x\in A_{n_{1}}\cap A_{n_{2}}\cap \cdots .} </li> <li>The <a href="/facts/Limit_infimum/QeAhlygs">limit infimum</a> or inner limit of a sequence A 1 , A 2 , A 3 , … {\displaystyle A_{1},A_{2},A_{3},\ldots } of subsets of X {\displaystyle X} is lim inf n → ∞ A n = ⋃ n = 1 ∞ ⋂ m = n ∞ A m = ⋃ n = 1 ∞ A n ∩ A n + 1 ∩ ⋯ . {\displaystyle \liminf _{n\to \infty }A_{n}=\bigcup _{n=1}^{\infty }\bigcap _{m=n}^{\infty }A_{m}=\bigcup _{n=1}^{\infty }A_{n}\cap A_{n+1}\cap \cdots .} It consists of all points that are in all but finitely many of these sets (or equivalently, that are eventually in all of them). That is, x ∈ lim inf n → ∞ A n {\displaystyle x\in \liminf _{n\to \infty }A_{n}} if and only if there exists an index N ∈ N {\displaystyle N\in \mathbb {N} } such that A N , A N + 1 , … {\displaystyle A_{N},A_{N+1},\ldots } all contain x ; {\displaystyle x;} that is, such that x ∈ A N ∩ A N + 1 ∩ ⋯ . {\displaystyle x\in A_{N}\cap A_{N+1}\cap \cdots .} </li></ul> <p>The inner limit is always a subset of the outer limit: lim inf n → ∞ A n ⊆ lim sup n → ∞ A n . {\displaystyle \liminf _{n\to \infty }A_{n}~\subseteq ~\limsup _{n\to \infty }A_{n}.} If these two sets are equal then their limit lim n → ∞ A n {\displaystyle \lim _{n\to \infty }A_{n}} exists and is equal to this common set: lim n → ∞ A n := lim inf n → ∞ A n = lim sup n → ∞ A n . {\displaystyle \lim _{n\to \infty }A_{n}:=\liminf _{n\to \infty }A_{n}=\limsup _{n\to \infty }A_{n}.} </p> <h3>Sub σ-algebras</h3> <p>In much of probability, especially when <a href="/facts/Conditional_expectation/3GxG1Q3x">conditional expectation</a> 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 Σ , Σ ′ {\displaystyle \Sigma ,\Sigma '} are σ-algebras on X {\displaystyle X} , then Σ ′ {\displaystyle \Sigma '} is a sub σ-algebra of Σ {\displaystyle \Sigma } if Σ ′ ⊆ Σ {\displaystyle \Sigma '\subseteq \Sigma } . </p><p>The <a href="/facts/Bernoulli_process/AF9E3jpu">Bernoulli process</a> provides a simple example. This consists of a sequence of random coin flips, coming up Heads ( H {\displaystyle H} ) or Tails ( T {\displaystyle T} ), of unbounded length. The <a href="/facts/Sample_space/WVldkN4F">sample space</a> Ω consists of all possible infinite sequences of H {\displaystyle H} or T : {\displaystyle T:} Ω = { H , T } ∞ = { ( x 1 , x 2 , x 3 , … ) : x i ∈ { H , T } , i ≥ 1 } . {\displaystyle \Omega =\{H,T\}^{\infty }=\{(x_{1},x_{2},x_{3},\dots ):x_{i}\in \{H,T\},i\geq 1\}.} </p><p>The full sigma algebra can be generated from an ascending sequence of subalgebras, by considering the information that might be obtained after observing some or all of the first n {\displaystyle n} coin flips. This sequence of subalgebras is given by G n = { A × { Ω } : A ⊆ { H , T } n } {\displaystyle {\mathcal {G}}_{n}=\{A\times \{\Omega \}:A\subseteq \{H,T\}^{n}\}} Each of these is finer than the last, and so can be ordered as a <a href="/facts/Filtration_(probability_theory)/PHGDKA5f">filtration</a> </p><p> G 0 ⊆ G 1 ⊆ G 2 ⊆ ⋯ ⊆ G ∞ {\displaystyle {\mathcal {G}}_{0}\subseteq {\mathcal {G}}_{1}\subseteq {\mathcal {G}}_{2}\subseteq \cdots \subseteq {\mathcal {G}}_{\infty }} </p><p>The first subalgebra G 0 = { ∅ , Ω } {\displaystyle {\mathcal {G}}_{0}=\{\varnothing ,\Omega \}} is the trivial algebra: it has only two elements in it, the empty set and the total space. The second subalgebra G 1 {\displaystyle {\mathcal {G}}_{1}} has four elements: the two in G 0 {\displaystyle {\mathcal {G}}_{0}} plus two more: sequences that start with H {\displaystyle H} and sequences that start with T {\displaystyle T} . Each subalgebra is finer than the last. The n {\displaystyle n} 'th subalgebra contains 2 n + 1 {\displaystyle 2^{n+1}} elements: it divides the total space Ω {\displaystyle \Omega } into all of the possible sequences that might have been observed after n {\displaystyle n} flips, including the possible non-observation of some of the flips. </p><p>The limiting algebra G ∞ {\displaystyle {\mathcal {G}}_{\infty }} is the smallest σ-algebra containing all the others. It is the algebra generated by the <a href="/facts/Product_topology/0hg02IaX">product topology</a> or <a href="/facts/Weak_topology/XJASE9Up">weak topology</a> on the product space { H , T } ∞ . {\displaystyle \{H,T\}^{\infty }.} </p> <h2 id="definition-and-properties">Definition and properties</h2> <h3>Definition</h3> <p>Let X {\displaystyle X} be some set, and let P ( X ) {\displaystyle P(X)} represent its <a href="/facts/Power_set/FVuf8PDD">power set</a>, the set of all subsets of X {\displaystyle X} . Then a subset Σ ⊆ P ( X ) {\displaystyle \Sigma \subseteq P(X)} is called a σ-algebra if and only if it satisfies the following three properties:<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> </p> <ol><li> X {\displaystyle X} is in Σ {\displaystyle \Sigma } .</li> <li> Σ {\displaystyle \Sigma } is <i>closed under complementation</i>: If some set A {\displaystyle A} is in Σ , {\displaystyle \Sigma ,} then so is its <a href="/facts/Complement_(set_theory)/yWUePIYY">complement</a>, X ∖ A . {\displaystyle X\setminus A.} </li> <li> Σ {\displaystyle \Sigma } is <i>closed under countable unions</i>: If A 1 , A 2 , A 3 , … {\displaystyle A_{1},A_{2},A_{3},\ldots } are in Σ , {\displaystyle \Sigma ,} then so is A = A 1 ∪ A 2 ∪ A 3 ∪ ⋯ . {\displaystyle A=A_{1}\cup A_{2}\cup A_{3}\cup \cdots .} </li></ol> <p>From these properties, it follows that the σ-algebra is also closed under countable <a href="/facts/Intersection_(set_theory)/RPfUNJh9">intersections</a> (by applying <a href="/facts/De_Morgan%2527s_laws/dj3F8xpt">De Morgan's laws</a>). </p><p>It also follows that the <a href="/facts/Empty_set/ffEk3eA6">empty set</a> ∅ {\displaystyle \varnothing } is in Σ , {\displaystyle \Sigma ,} since by (1) X {\displaystyle X} is in Σ {\displaystyle \Sigma } and (2) asserts that its complement, the empty set, is also in Σ . {\displaystyle \Sigma .} Moreover, since { X , ∅ } {\displaystyle \{X,\varnothing \}} satisfies all 3 conditions, it follows that { X , ∅ } {\displaystyle \{X,\varnothing \}} is the smallest possible σ-algebra on X . {\displaystyle X.} The largest possible σ-algebra on X {\displaystyle X} is P ( X ) . {\displaystyle P(X).} </p><p>Elements of the σ-algebra are called <a href="/facts/Measurable_set/yCq7zlI4">measurable sets</a>. An ordered pair ( X , Σ ) , {\displaystyle (X,\Sigma ),} where X {\displaystyle X} is a set and Σ {\displaystyle \Sigma } is a σ-algebra over X , {\displaystyle X,} is called a measurable space. A function between two measurable spaces is called a <a href="/facts/Measurable_function/NgIHnb1b">measurable function</a> if the <a href="/facts/Preimage/KANefMAl">preimage</a> of every measurable set is measurable. The collection of measurable spaces forms a <a href="/facts/Category_(mathematics)/7WzxUThf">category</a>, with the <a href="/facts/Measurable_function/NgIHnb1b">measurable functions</a> as <a href="/facts/Morphism/Kdpuyz3S">morphisms</a>. <a href="/facts/Measure_(mathematics)/yCq7zlI4">Measures</a> are defined as certain types of functions from a σ-algebra to [ 0 , ∞ ] . {\displaystyle [0,\infty ].} </p><p> A σ-algebra is both a <a href="/facts/Pi-system/LILhJywk">π-system</a> and a <a href="/facts/Dynkin_system/6IzeEKbF">Dynkin system</a> (λ-system). The converse is true as well, by Dynkin's theorem (see below). </p> <h3>Dynkin's π-λ theorem</h3> <p class="note">See also: <a href="/facts/%25CE%25A0-%25CE%25BB_theorem/6IzeEKbF">π-λ theorem</a></p> <p>This theorem (or the related <a href="/facts/Monotone_class_theorem/7kk5VbNj">monotone class theorem</a>) 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. </p> <ul><li>A <a href="/facts/Pi-system/LILhJywk">π-system</a> P {\displaystyle P} is a collection of subsets of X {\displaystyle X} that is closed under finitely many intersections, and</li> <li>A <a href="/facts/Dynkin_system/6IzeEKbF">Dynkin system</a> (or λ-system) D {\displaystyle D} is a collection of subsets of X {\displaystyle X} that contains X {\displaystyle X} and is closed under complement and under countable unions of <i>disjoint</i> subsets.</li></ul> <p>Dynkin's π-λ theorem says, if P {\displaystyle P} is a π-system and D {\displaystyle D} is a Dynkin system that contains P , {\displaystyle P,} then the σ-algebra σ ( P ) {\displaystyle \sigma (P)} <a href="/facts/Sigma-algebra/8LJINLNc">generated</a> by P {\displaystyle P} is contained in D . {\displaystyle D.} Since certain π-systems are relatively simple classes, it may not be hard to verify that all sets in P {\displaystyle P} enjoy the property under consideration while, on the other hand, showing that the collection D {\displaystyle 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 ) {\displaystyle \sigma (P)} enjoy the property, avoiding the task of checking it for an arbitrary set in σ ( P ) . {\displaystyle \sigma (P).} </p><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 {\displaystyle X} with the <a href="/facts/Lebesgue-Stieltjes_integral/W4GD5Tlr">Lebesgue-Stieltjes integral</a> typically associated with computing the probability: P ( X ∈ A ) = ∫ A F ( d x ) {\displaystyle \mathbb {P} (X\in A)=\int _{A}\,F(dx)} for all A {\displaystyle A} in the Borel σ-algebra on R , {\displaystyle \mathbb {R} ,} where F ( x ) {\displaystyle F(x)} is the <a href="/facts/Cumulative_distribution_function/WaKU8tp4">cumulative distribution function</a> for X , {\displaystyle X,} defined on R , {\displaystyle \mathbb {R} ,} while P {\displaystyle \mathbb {P} } is a <a href="/facts/Probability_measure/8BjhgoPR">probability measure</a>, defined on a σ-algebra Σ {\displaystyle \Sigma } of subsets of some <a href="/facts/Sample_space/WVldkN4F">sample space</a> Ω . {\displaystyle \Omega .} </p> <h3>Combining σ-algebras</h3> <p>Suppose { Σ α : α ∈ A } {\displaystyle \textstyle \left\{\Sigma _{\alpha }:\alpha \in {\mathcal {A}}\right\}} is a collection of σ-algebras on a space X . {\displaystyle X.} </p><p>Meet </p><p>The intersection of a collection of σ-algebras is a σ-algebra. To emphasize its character as a σ-algebra, it often is denoted by: ⋀ α ∈ A Σ α . {\displaystyle \bigwedge _{\alpha \in {\mathcal {A}}}\Sigma _{\alpha }.} </p><p>Sketch of Proof: Let Σ ∗ {\displaystyle \Sigma ^{*}} denote the intersection. Since X {\displaystyle X} is in every Σ α , Σ ∗ {\displaystyle \Sigma _{\alpha },\Sigma ^{*}} is not empty. Closure under complement and countable unions for every Σ α {\displaystyle \Sigma _{\alpha }} implies the same must be true for Σ ∗ . {\displaystyle \Sigma ^{*}.} Therefore, Σ ∗ {\displaystyle \Sigma ^{*}} is a σ-algebra. </p><p>Join </p><p>The union of a collection of σ-algebras is not generally a σ-algebra, or even an algebra, but it <a href="/facts/Sigma-algebra/8LJINLNc">generates</a> a σ-algebra known as the join which typically is denoted ⋁ α ∈ A Σ α = σ ( ⋃ α ∈ A Σ α ) . {\displaystyle \bigvee _{\alpha \in {\mathcal {A}}}\Sigma _{\alpha }=\sigma \left(\bigcup _{\alpha \in {\mathcal {A}}}\Sigma _{\alpha }\right).} A π-system that generates the join is P = { ⋂ i = 1 n A i : A i ∈ Σ α i , α i ∈ A , n ≥ 1 } . {\displaystyle {\mathcal {P}}=\left\{\bigcap _{i=1}^{n}A_{i}:A_{i}\in \Sigma _{\alpha _{i}},\alpha _{i}\in {\mathcal {A}},\ n\geq 1\right\}.} Sketch of Proof: By the case n = 1 , {\displaystyle n=1,} it is seen that each Σ α ⊂ P , {\displaystyle \Sigma _{\alpha }\subset {\mathcal {P}},} so ⋃ α ∈ A Σ α ⊆ P . {\displaystyle \bigcup _{\alpha \in {\mathcal {A}}}\Sigma _{\alpha }\subseteq {\mathcal {P}}.} This implies σ ( ⋃ α ∈ A Σ α ) ⊆ σ ( P ) {\displaystyle \sigma \left(\bigcup _{\alpha \in {\mathcal {A}}}\Sigma _{\alpha }\right)\subseteq \sigma ({\mathcal {P}})} by the definition of a σ-algebra <a href="/facts/Sigma-algebra/8LJINLNc">generated</a> by a collection of subsets. On the other hand, P ⊆ σ ( ⋃ α ∈ A Σ α ) {\displaystyle {\mathcal {P}}\subseteq \sigma \left(\bigcup _{\alpha \in {\mathcal {A}}}\Sigma _{\alpha }\right)} which, by Dynkin's π-λ theorem, implies σ ( P ) ⊆ σ ( ⋃ α ∈ A Σ α ) . {\displaystyle \sigma ({\mathcal {P}})\subseteq \sigma \left(\bigcup _{\alpha \in {\mathcal {A}}}\Sigma _{\alpha }\right).} </p> <h3>σ-algebras for subspaces</h3> <p>Suppose Y {\displaystyle Y} is a subset of X {\displaystyle X} and let ( X , Σ ) {\displaystyle (X,\Sigma )} be a measurable space. </p> <ul><li>The collection { Y ∩ B : B ∈ Σ } {\displaystyle \{Y\cap B:B\in \Sigma \}} is a σ-algebra of subsets of Y . {\displaystyle Y.} </li> <li>Suppose ( Y , Λ ) {\displaystyle (Y,\Lambda )} is a measurable space. The collection { A ⊆ X : A ∩ Y ∈ Λ } {\displaystyle \{A\subseteq X:A\cap Y\in \Lambda \}} is a σ-algebra of subsets of X . {\displaystyle X.} </li></ul> <h3>Relation to σ-ring</h3> <p>A <i>σ</i>-algebra Σ {\displaystyle \Sigma } is just a <a href="/facts/Sigma-ring/XGV10C4l"><i>σ</i>-ring</a> that contains the universal set X . {\displaystyle X.} <a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> A <i>σ</i>-ring need not be a <i>σ</i>-algebra, as for example measurable subsets of zero Lebesgue measure in the real line are a <i>σ</i>-ring, but not a <i>σ</i>-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 <a href="/facts/Ring_of_sets/l3vKYcHu">ring</a> but not a <i>σ</i>-ring, since the real line can be obtained by their countable union yet its measure is not finite. </p> <h3>Typographic note</h3> <p><i>σ</i>-algebras are sometimes denoted using <a href="/facts/Calligraphic/lFIUgDeW">calligraphic</a> capital letters, or the <a href="/facts/Fraktur_(typeface)/1MlTtGvl">Fraktur typeface</a>. Thus ( X , Σ ) {\displaystyle (X,\Sigma )} may be denoted as ( X , F ) {\displaystyle \scriptstyle (X,\,{\mathcal {F}})} or ( X , F ) . {\displaystyle \scriptstyle (X,\,{\mathfrak {F}}).} </p> <h2 id="particular-cases-and-examples">Particular cases and examples</h2> <h3>Separable σ-algebras</h3> <p>A separable σ {\displaystyle \sigma } -algebra (or separable σ {\displaystyle \sigma } -field) is a σ {\displaystyle \sigma } -algebra F {\displaystyle {\mathcal {F}}} that is a <a href="/facts/Separable_space/2bmU73bk">separable space</a> when considered as a <a href="/facts/Metric_space/gnBBRXtc">metric space</a> with <a href="/facts/Metric_(mathematics)/RkUptSo8">metric</a> ρ ( A , B ) = μ ( A △ B ) {\displaystyle \rho (A,B)=\mu (A{\mathbin {\triangle }}B)} for A , B ∈ F {\displaystyle A,B\in {\mathcal {F}}} and a given finite <a href="/facts/Measure_(mathematics)/yCq7zlI4">measure</a> μ {\displaystyle \mu } (and with △ {\displaystyle \triangle } being the <a href="/facts/Symmetric_difference/W2QST1Qr">symmetric difference</a> operator).<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> Any σ {\displaystyle \sigma } -algebra generated by a <a href="/facts/Countable/Wj4DmWPv">countable</a> collection of <a href="/facts/Set_(mathematics)/BfucfHMq">sets</a> is separable, but the converse need not hold. For example, the Lebesgue σ {\displaystyle \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). </p><p>A separable measure space has a natural <a href="/facts/Pseudometric_space/uy1o2lhk">pseudometric</a> that renders it <a href="/facts/Separable_space/2bmU73bk">separable</a> as a <a href="/facts/Pseudometric_space/uy1o2lhk">pseudometric space</a>. The distance between two sets is defined as the measure of the <a href="/facts/Symmetric_difference/W2QST1Qr">symmetric difference</a> 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 <a href="/facts/Equivalence_class/1d2sh0TB">equivalence class</a>, the resulting <a href="/facts/Equivalence_class/1d2sh0TB">quotient set</a> 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. </p> <h3>Simple set-based examples</h3> <p>Let X {\displaystyle X} be any set. </p> <ul><li>The family consisting only of the empty set and the set X , {\displaystyle X,} called the minimal or trivial σ-algebra over X . {\displaystyle X.} </li> <li>The <a href="/facts/Power_set/FVuf8PDD">power set</a> of X , {\displaystyle X,} called the discrete σ-algebra.</li> <li>The collection { ∅ , A , X ∖ A , X } {\displaystyle \{\varnothing ,A,X\setminus A,X\}} is a simple σ-algebra generated by the subset A . {\displaystyle A.} </li> <li>The collection of subsets of X {\displaystyle X} which are countable or whose complements are countable is a σ-algebra (which is distinct from the power set of X {\displaystyle X} if and only if X {\displaystyle X} is uncountable). This is the σ-algebra generated by the <a href="/facts/Singleton_(mathematics)/LtNVfujT">singletons</a> of X . {\displaystyle X.} Note: "countable" includes finite or empty.</li> <li>The collection of all unions of sets in a countable <a href="/facts/Partition_of_a_set/VeP9g8CA">partition</a> of X {\displaystyle X} is a σ-algebra.</li></ul> <h3>Stopping time sigma-algebras</h3> <p>A <a href="/facts/Stopping_time/D5R69WXt">stopping time</a> τ {\displaystyle \tau } can define a σ {\displaystyle \sigma } -algebra F τ , {\displaystyle {\mathcal {F}}_{\tau },} the so-called <a href="/facts/Filtration_(mathematics)/qcvLvKRI">stopping time sigma-algebra</a>, which in a <a href="/facts/Filtration_(mathematics)/qcvLvKRI">filtered probability space</a> describes the information up to the random time τ {\displaystyle \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 τ {\displaystyle \tau } is F τ . {\displaystyle {\mathcal {F}}_{\tau }.} <a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p> <h2 id="-algebras-generated-by-families-of-sets">σ-algebras generated by families of sets</h2> <h3>σ-algebra generated by an arbitrary family</h3> <p>Let F {\displaystyle F} be an arbitrary family of subsets of X . {\displaystyle X.} Then there exists a unique smallest σ-algebra which contains every set in F {\displaystyle F} (even though F {\displaystyle F} may or may not itself be a σ-algebra). It is, in fact, the intersection of all σ-algebras containing F . {\displaystyle F.} (See intersections of σ-algebras above.) This σ-algebra is denoted σ ( F ) {\displaystyle \sigma (F)} and is called the σ-algebra generated by F . {\displaystyle F.} </p><p>If F {\displaystyle F} is empty, then σ ( ∅ ) = { ∅ , X } . {\displaystyle \sigma (\varnothing )=\{\varnothing ,X\}.} Otherwise σ ( F ) {\displaystyle \sigma (F)} consists of all the subsets of X {\displaystyle X} that can be made from elements of F {\displaystyle F} by a countable number of complement, union and intersection operations. </p><p>For a simple example, consider the set X = { 1 , 2 , 3 } . {\displaystyle X=\{1,2,3\}.} Then the σ-algebra generated by the single subset { 1 } {\displaystyle \{1\}} is σ ( { 1 } ) = { ∅ , { 1 } , { 2 , 3 } , { 1 , 2 , 3 } } . {\displaystyle \sigma (\{1\})=\{\varnothing ,\{1\},\{2,3\},\{1,2,3\}\}.} By an <a href="/facts/Abuse_of_notation/D4W6n85F">abuse of notation</a>, when a collection of subsets contains only one element, A , {\displaystyle A,} σ ( A ) {\displaystyle \sigma (A)} may be written instead of σ ( { A } ) ; {\displaystyle \sigma (\{A\});} in the prior example σ ( { 1 } ) {\displaystyle \sigma (\{1\})} instead of σ ( { { 1 } } ) . {\displaystyle \sigma (\{\{1\}\}).} Indeed, using σ ( A 1 , A 2 , … ) {\displaystyle \sigma \left(A_{1},A_{2},\ldots \right)} to mean σ ( { A 1 , A 2 , … } ) {\displaystyle \sigma \left(\left\{A_{1},A_{2},\ldots \right\}\right)} is also quite common. </p><p>There are many families of subsets that generate useful σ-algebras. Some of these are presented here. </p> <h3>σ-algebra generated by a function</h3> <p>If f {\displaystyle f} is a function from a set X {\displaystyle X} to a set Y {\displaystyle Y} and B {\displaystyle B} is a σ {\displaystyle \sigma } -algebra of subsets of Y , {\displaystyle Y,} then the σ {\displaystyle \sigma } -algebra generated by the function f , {\displaystyle f,} denoted by σ ( f ) , {\displaystyle \sigma (f),} is the collection of all inverse images f − 1 ( S ) {\displaystyle f^{-1}(S)} of the sets S {\displaystyle S} in B . {\displaystyle B.} That is, σ ( f ) = { f − 1 ( S ) : S ∈ B } . {\displaystyle \sigma (f)=\left\{f^{-1}(S)\,:\,S\in B\right\}.} </p><p>A function f {\displaystyle f} from a set X {\displaystyle X} to a set Y {\displaystyle Y} is <a href="/facts/Measurable_function/NgIHnb1b">measurable</a> with respect to a σ-algebra Σ {\displaystyle \Sigma } of subsets of X {\displaystyle X} if and only if σ ( f ) {\displaystyle \sigma (f)} is a subset of Σ . {\displaystyle \Sigma .} </p><p>One common situation, and understood by default if B {\displaystyle B} is not specified explicitly, is when Y {\displaystyle Y} is a <a href="/facts/Metric_space/gnBBRXtc">metric</a> or <a href="/facts/Topological_space/v2ut7CbK">topological space</a> and B {\displaystyle B} is the collection of <a href="/facts/Borel_set/jvSsfpkP">Borel sets</a> on Y . {\displaystyle Y.} </p><p>If f {\displaystyle f} is a function from X {\displaystyle X} to R n {\displaystyle \mathbb {R} ^{n}} then σ ( f ) {\displaystyle \sigma (f)} is generated by the family of subsets which are inverse images of intervals/rectangles in R n : {\displaystyle \mathbb {R} ^{n}:} σ ( f ) = σ ( { f − 1 ( [ a 1 , b 1 ] × ⋯ × [ a n , b n ] ) : a i , b i ∈ R } ) . {\displaystyle \sigma (f)=\sigma \left(\left\{f^{-1}(\left[a_{1},b_{1}\right]\times \cdots \times \left[a_{n},b_{n}\right]):a_{i},b_{i}\in \mathbb {R} \right\}\right).} </p><p>A useful property is the following. Assume f {\displaystyle f} is a measurable map from ( X , Σ X ) {\displaystyle \left(X,\Sigma _{X}\right)} to ( S , Σ S ) {\displaystyle \left(S,\Sigma _{S}\right)} and g {\displaystyle g} is a measurable map from ( X , Σ X ) {\displaystyle \left(X,\Sigma _{X}\right)} to ( T , Σ T ) . {\displaystyle \left(T,\Sigma _{T}\right).} If there exists a measurable map h {\displaystyle h} from ( T , Σ T ) {\displaystyle \left(T,\Sigma _{T}\right)} to ( S , Σ S ) {\displaystyle \left(S,\Sigma _{S}\right)} such that f ( x ) = h ( g ( x ) ) {\displaystyle f(x)=h(g(x))} for all x , {\displaystyle x,} then σ ( f ) ⊆ σ ( g ) . {\displaystyle \sigma (f)\subseteq \sigma (g).} If S {\displaystyle S} is finite or countably infinite or, more generally, ( S , Σ S ) {\displaystyle \left(S,\Sigma _{S}\right)} is a <a href="/facts/Standard_Borel_space/RRWXf2ES">standard Borel space</a> (for example, a separable complete metric space with its associated Borel sets), then the converse is also true.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> Examples of standard Borel spaces include R n {\displaystyle \mathbb {R} ^{n}} with its Borel sets and R ∞ {\displaystyle \mathbb {R} ^{\infty }} with the cylinder σ-algebra described below. </p> <h3>Borel and Lebesgue σ-algebras</h3> <p>An important example is the <a href="/facts/Borel_algebra/jvSsfpkP">Borel algebra</a> over any <a href="/facts/Topological_space/v2ut7CbK">topological space</a>: the σ-algebra generated by the <a href="/facts/Open_set/QfTCIqMu">open sets</a> (or, equivalently, by the <a href="/facts/Closed_set/upYnRTUj">closed sets</a>). This σ-algebra is not, in general, the whole power set. For a non-trivial example that is not a Borel set, see the <a href="/facts/Vitali_set/pwdETXCf">Vitali set</a> or <a href="/facts/Borel_set/jvSsfpkP">Non-Borel sets</a>. </p><p>On the <a href="/facts/Euclidean_space/R2UbzmzM">Euclidean space</a> R n , {\displaystyle \mathbb {R} ^{n},} another σ-algebra is of importance: that of all <a href="/facts/Lebesgue_measure/8us9cGoW">Lebesgue measurable</a> sets. This σ-algebra contains more sets than the Borel σ-algebra on R n {\displaystyle \mathbb {R} ^{n}} and is preferred in <a href="/facts/Integral/V7lyV997">integration</a> theory, as it gives a <a href="/facts/Complete_measure/pB3gYaox">complete measure space</a>. </p> <h3>Product σ-algebra</h3> <p>Let ( X 1 , Σ 1 ) {\displaystyle \left(X_{1},\Sigma _{1}\right)} and ( X 2 , Σ 2 ) {\displaystyle \left(X_{2},\Sigma _{2}\right)} be two measurable spaces. The σ-algebra for the corresponding <a href="/facts/Product_space/0hg02IaX">product space</a> X 1 × X 2 {\displaystyle X_{1}\times X_{2}} is called the product σ-algebra and is defined by Σ 1 × Σ 2 = σ ( { B 1 × B 2 : B 1 ∈ Σ 1 , B 2 ∈ Σ 2 } ) . {\displaystyle \Sigma _{1}\times \Sigma _{2}=\sigma \left(\left\{B_{1}\times B_{2}:B_{1}\in \Sigma _{1},B_{2}\in \Sigma _{2}\right\}\right).} </p><p>Observe that { B 1 × B 2 : B 1 ∈ Σ 1 , B 2 ∈ Σ 2 } {\displaystyle \{B_{1}\times B_{2}:B_{1}\in \Sigma _{1},B_{2}\in \Sigma _{2}\}} is a π-system. </p><p>The Borel σ-algebra for R n {\displaystyle \mathbb {R} ^{n}} is generated by half-infinite rectangles and by finite rectangles. For example, B ( R n ) = σ ( { ( − ∞ , b 1 ] × ⋯ × ( − ∞ , b n ] : b i ∈ R } ) = σ ( { ( a 1 , b 1 ] × ⋯ × ( a n , b n ] : a i , b i ∈ R } ) . {\displaystyle {\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\{\left(a_{1},b_{1}\right]\times \cdots \times \left(a_{n},b_{n}\right]:a_{i},b_{i}\in \mathbb {R} \right\}\right).} </p><p>For each of these two examples, the generating family is a π-system. </p> <h3>σ-algebra generated by cylinder sets</h3> <p class="note">Main article: <a href="/facts/Cylinder_%25CF%2583-algebra/DhdNMwxm">Cylinder σ-algebra</a></p> <p>Suppose X ⊆ R T = { f : f ( t ) ∈ R , t ∈ T } {\displaystyle X\subseteq \mathbb {R} ^{\mathbb {T} }=\{f:f(t)\in \mathbb {R} ,\ t\in \mathbb {T} \}} </p><p>is a set of real-valued functions. Let B ( R ) {\displaystyle {\mathcal {B}}(\mathbb {R} )} denote the Borel subsets of R . {\displaystyle \mathbb {R} .} A <a href="/facts/Cylinder_set/CKkd6XhG">cylinder subset</a> of X {\displaystyle X} is a finitely restricted set defined as C t 1 , … , t n ( B 1 , … , B n ) = { f ∈ X : f ( t i ) ∈ B i , 1 ≤ i ≤ n } . {\displaystyle C_{t_{1},\dots ,t_{n}}(B_{1},\dots ,B_{n})=\left\{f\in X:f(t_{i})\in B_{i},1\leq i\leq n\right\}.} </p><p>Each { C t 1 , … , t n ( B 1 , … , B n ) : B i ∈ B ( R ) , 1 ≤ i ≤ n } {\displaystyle \left\{C_{t_{1},\dots ,t_{n}}\left(B_{1},\dots ,B_{n}\right):B_{i}\in {\mathcal {B}}(\mathbb {R} ),1\leq i\leq n\right\}} is a π-system that generates a σ-algebra Σ t 1 , … , t n . {\displaystyle \textstyle \Sigma _{t_{1},\dots ,t_{n}}.} Then the family of subsets F X = ⋃ n = 1 ∞ ⋃ t i ∈ T , i ≤ n Σ t 1 , … , t n {\displaystyle {\mathcal {F}}_{X}=\bigcup _{n=1}^{\infty }\bigcup _{t_{i}\in \mathbb {T} ,i\leq n}\Sigma _{t_{1},\dots ,t_{n}}} is an algebra that generates the <a href="/facts/Cylinder_%25CF%2583-algebra/DhdNMwxm">cylinder σ-algebra</a> for X . {\displaystyle X.} This σ-algebra is a subalgebra of the Borel σ-algebra determined by the <a href="/facts/Product_topology/0hg02IaX">product topology</a> of R T {\displaystyle \mathbb {R} ^{\mathbb {T} }} restricted to X . {\displaystyle X.} </p><p>An important special case is when T {\displaystyle \mathbb {T} } is the set of natural numbers and X {\displaystyle X} is a set of real-valued sequences. In this case, it suffices to consider the cylinder sets C n ( B 1 , … , B n ) = ( B 1 × ⋯ × B n × R ∞ ) ∩ X = { ( x 1 , x 2 , … , x n , x n + 1 , … ) ∈ X : x i ∈ B i , 1 ≤ i ≤ n } , {\displaystyle C_{n}\left(B_{1},\dots ,B_{n}\right)=\left(B_{1}\times \cdots \times B_{n}\times \mathbb {R} ^{\infty }\right)\cap X=\left\{\left(x_{1},x_{2},\ldots ,x_{n},x_{n+1},\ldots \right)\in X:x_{i}\in B_{i},1\leq i\leq n\right\},} for which Σ n = σ ( { C n ( B 1 , … , B n ) : B i ∈ B ( R ) , 1 ≤ i ≤ n } ) {\displaystyle \Sigma _{n}=\sigma \left(\{C_{n}\left(B_{1},\dots ,B_{n}\right):B_{i}\in {\mathcal {B}}(\mathbb {R} ),1\leq i\leq n\}\right)} is a non-decreasing sequence of σ-algebras. </p> <h3>Ball σ-algebra</h3> <p>The ball σ-algebra is the smallest σ-algebra containing all the open (and/or closed) balls. This is never larger than the <a href="/facts/Borel_set/jvSsfpkP">Borel σ-algebra</a>. 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.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> </p> <h3>σ-algebra generated by random variable or vector</h3> <p>Suppose ( Ω , Σ , P ) {\displaystyle (\Omega ,\Sigma ,\mathbb {P} )} is a <a href="/facts/Probability_space/dEcv2VrU">probability space</a>. If Y : Ω → R n {\displaystyle \textstyle Y:\Omega \to \mathbb {R} ^{n}} is measurable with respect to the Borel σ-algebra on R n {\displaystyle \mathbb {R} ^{n}} then Y {\displaystyle Y} is called a <a href="/facts/Random_variable/TwTBXnLT">random variable</a> ( n = 1 {\displaystyle n=1} ) or random vector ( n > 1 {\displaystyle n>1} ). The σ-algebra generated by Y {\displaystyle Y} is σ ( Y ) = { Y − 1 ( A ) : A ∈ B ( R n ) } . {\displaystyle \sigma (Y)=\left\{Y^{-1}(A):A\in {\mathcal {B}}\left(\mathbb {R} ^{n}\right)\right\}.} </p> <h3>σ-algebra generated by a stochastic process</h3> <p>Suppose ( Ω , Σ , P ) {\displaystyle (\Omega ,\Sigma ,\mathbb {P} )} is a <a href="/facts/Probability_space/dEcv2VrU">probability space</a> and R T {\displaystyle \mathbb {R} ^{\mathbb {T} }} is the set of real-valued functions on T . {\displaystyle \mathbb {T} .} If Y : Ω → X ⊆ R T {\displaystyle \textstyle Y:\Omega \to X\subseteq \mathbb {R} ^{\mathbb {T} }} is measurable with respect to the cylinder σ-algebra σ ( F X ) {\displaystyle \sigma \left({\mathcal {F}}_{X}\right)} (see above) for X {\displaystyle X} then Y {\displaystyle Y} is called a <a href="/facts/Stochastic_process/Ng1n1dnB">stochastic process</a> or random process. The σ-algebra generated by Y {\displaystyle Y} is σ ( Y ) = { Y − 1 ( A ) : A ∈ σ ( F X ) } = σ ( { Y − 1 ( A ) : A ∈ F X } ) , {\displaystyle \sigma (Y)=\left\{Y^{-1}(A):A\in \sigma \left({\mathcal {F}}_{X}\right)\right\}=\sigma \left(\left\{Y^{-1}(A):A\in {\mathcal {F}}_{X}\right\}\right),} the σ-algebra generated by the inverse images of cylinder sets. </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Measurable_function/NgIHnb1b">Measurable function</a> – Kind of mathematical function</li> <li><a href="/facts/Sample_space/WVldkN4F">Sample space</a> – Set of all possible outcomes or results of a statistical trial or experiment</li> <li><a href="/facts/Sigma-additive_set_function/gpgoKIeU">Sigma-additive set function</a> – Mapping function</li> <li><a href="/facts/Sigma-ring/XGV10C4l">Sigma-ring</a> – Family of sets closed under countable unions</li></ul> <table><tbody><tr><th colspan="11"><a href="/facts/Family_of_sets/WbYof7lP">Families F {\displaystyle {\mathcal {F}}} of sets</a> over Ω {\displaystyle \Omega } <ul><li>v</li><li>t</li><li>e</li></ul></th></tr><tr><th>Is necessarily true of F : {\displaystyle {\mathcal {F}}\colon } or, is F {\displaystyle {\mathcal {F}}} <a href="/facts/Closure_(mathematics)/Ct6r2fJz">closed under:</a></th><td><a href="/facts/Directed_set/GmWcqe3L">Directedby ⊇ {\displaystyle \,\supseteq } </a></td><td> A ∩ B {\displaystyle A\cap B} </td><td> A ∪ B {\displaystyle A\cup B} </td><td> B ∖ A {\displaystyle B\setminus A} </td><td> Ω ∖ A {\displaystyle \Omega \setminus A} </td><td> A 1 ∩ A 2 ∩ ⋯ {\displaystyle A_{1}\cap A_{2}\cap \cdots } </td><td> A 1 ∪ A 2 ∪ ⋯ {\displaystyle A_{1}\cup A_{2}\cup \cdots } </td><td> Ω ∈ F {\displaystyle \Omega \in {\mathcal {F}}} </td><td> ∅ ∈ F {\displaystyle \varnothing \in {\mathcal {F}}} </td><td><a href="/facts/Finite_intersection_property/xg5uX9n0">F.I.P.</a></td></tr><tr><th><a href="/facts/Pi-system/LILhJywk">π-system</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><th><a href="/facts/Ring_of_sets/l3vKYcHu">Semiring</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Never</td></tr><tr><th><a href="/facts/Ring_of_sets/l3vKYcHu">Semialgebra (Semifield)</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Never</td></tr><tr><th><a href="/facts/Monotone_class/7kk5VbNj">Monotone class</a></th><td></td><td></td><td></td><td></td><td></td><td>only if A i ↘ {\displaystyle A_{i}\searrow } </td><td>only if A i ↗ {\displaystyle A_{i}\nearrow } </td><td></td><td></td><td></td></tr><tr><th><a href="/facts/Dynkin_system/6IzeEKbF">𝜆-system (Dynkin System)</a></th><td></td><td></td><td></td><td>only if A ⊆ B {\displaystyle A\subseteq B} </td><td></td><td></td><td>only if A i ↗ {\displaystyle A_{i}\nearrow } orthey are <a href="/facts/Disjoint_sets/nLr8XRVd">disjoint</a></td><td></td><td></td><td>Never</td></tr><tr><th><a href="/facts/Ring_of_sets/l3vKYcHu">Ring (Order theory)</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><th><a href="/facts/Ring_of_sets/l3vKYcHu">Ring (Measure theory)</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Never</td></tr><tr><th><a href="/facts/Delta-ring/u8ehT61k">δ-Ring</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Never</td></tr><tr><th><a href="/facts/Sigma-ring/XGV10C4l">𝜎-Ring</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Never</td></tr><tr><th><a href="/facts/Field_of_sets/4E3vQl4f">Algebra (Field)</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Never</td></tr><tr><th>𝜎-Algebra (𝜎-Field)</th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Never</td></tr><tr><th><a href="/facts/Dual_ideal/7f3zk55u">Dual ideal</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><th><a href="/facts/Filter_(set_theory)/7f3zk55u">Filter</a></th><td></td><td></td><td></td><td>Never</td><td>Never</td><td></td><td></td><td></td><td> ∅ ∉ F {\displaystyle \varnothing \not \in {\mathcal {F}}} </td><td></td></tr><tr><th><a href="/facts/Prefilter/7f3zk55u">Prefilter (Filter base)</a></th><td></td><td></td><td></td><td>Never</td><td>Never</td><td></td><td></td><td></td><td> ∅ ∉ F {\displaystyle \varnothing \not \in {\mathcal {F}}} </td><td></td></tr><tr><th><a href="/facts/Filter_subbase/7f3zk55u">Filter subbase</a></th><td></td><td></td><td></td><td>Never</td><td>Never</td><td></td><td></td><td></td><td> ∅ ∉ F {\displaystyle \varnothing \not \in {\mathcal {F}}} </td><td></td></tr><tr><th><a href="/facts/Topology_(structure)/v2ut7CbK">Open Topology</a></th><td></td><td></td><td></td><td></td><td></td><td></td><td>(even arbitrary ∪ {\displaystyle \cup } )</td><td></td><td></td><td>Never</td></tr><tr><th><a href="/facts/Topology_(structure)/v2ut7CbK">Closed Topology</a></th><td></td><td></td><td></td><td></td><td></td><td>(even arbitrary ∩ {\displaystyle \cap } )</td><td></td><td></td><td></td><td>Never</td></tr><tr><th>Is necessarily true of F : {\displaystyle {\mathcal {F}}\colon } or, is F {\displaystyle {\mathcal {F}}} <a href="/facts/Closure_(mathematics)/Ct6r2fJz">closed under:</a></th><td><a href="/facts/Directed_downward/7f3zk55u">directeddownward</a></td><td>finiteintersections</td><td>finiteunions</td><td>relativecomplements</td><td>complementsin Ω {\displaystyle \Omega } </td><td>countableintersections</td><td>countableunions</td><td>contains Ω {\displaystyle \Omega } </td><td>contains ∅ {\displaystyle \varnothing } </td><td><a href="/facts/Finite_intersection_property/xg5uX9n0">FiniteIntersectionProperty</a></td></tr><tr><td colspan="11"><p>Additionally, a <a href="/facts/Ring_of_sets/l3vKYcHu">semiring</a> is a <a href="/facts/Pi-system/LILhJywk">π-system</a> where every complement B ∖ A {\displaystyle B\setminus A} is equal to a finite <a href="/facts/Disjoint_union/x9QSfkr5">disjoint union</a> of sets in F . {\displaystyle {\mathcal {F}}.} A <a href="/facts/Ring_of_sets/l3vKYcHu">semialgebra</a> is a semiring where every complement Ω ∖ A {\displaystyle \Omega \setminus A} is equal to a finite <a href="/facts/Disjoint_union/x9QSfkr5">disjoint union</a> of sets in F . {\displaystyle {\mathcal {F}}.} A , B , A 1 , A 2 , … {\displaystyle A,B,A_{1},A_{2},\ldots } are arbitrary elements of F {\displaystyle {\mathcal {F}}} and it is assumed that F ≠ ∅ . {\displaystyle {\mathcal {F}}\neq \varnothing .} </p></td></tr></tbody></table> <h2 id="external-links">External links</h2> <ul><li><a href="https://www.encyclopediaofmath.org/index.php?title=Algebra_of_sets">"Algebra of sets"</a>, <i><a href="/facts/Encyclopedia_of_Mathematics/WC6mGtPm">Encyclopedia of Mathematics</a></i>, <a href="/facts/European_Mathematical_Society/B3h7b672">EMS Press</a>, 2001 [1994]</li> <li>Sigma Algebra from PlanetMath.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Elstrodt, J. (2018). Maß- Und Integrationstheorie. Springer Spektrum Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57939-8 <a href="https://doi.org/10.1007/978-3-662-57939-8" target="_blank">https://doi.org/10.1007/978-3-662-57939-8</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Rudin, Walter (1987). Real & Complex Analysis. McGraw-Hill. ISBN 0-07-054234-1. <a href="0-07-054234-1" target="_blank">0-07-054234-1</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Vestrup, Eric M. (2009). The Theory of Measures and Integration. John Wiley & Sons. p. 12. ISBN 978-0-470-31795-2. <a href="978-0-470-31795-2" target="_blank">978-0-470-31795-2</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Džamonja, Mirna; Kunen, Kenneth (1995). "Properties of the class of measure separable compact spaces" (PDF). Fundamenta Mathematicae: 262. If μ {\displaystyle \mu } is a Borel measure on X , {\displaystyle X,} the measure algebra of ( X , μ ) {\displaystyle (X,\mu )} is the Boolean algebra of all Borel sets modulo μ {\displaystyle \mu } -null sets. If μ {\displaystyle \mu } is finite, then such a measure algebra is also a metric space, with the distance between the two sets being the measure of their symmetric difference. Then, we say that μ {\displaystyle \mu } is separable if and only if this metric space is separable as a topological space. <a href="/wiki/Kenneth_Kunen" target="_blank">/wiki/Kenneth_Kunen</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Fischer, Tom (2013). "On simple representations of stopping times and stopping time sigma-algebras". Statistics and Probability Letters. 83 (1): 345–349. arXiv:1112.1603. doi:10.1016/j.spl.2012.09.024. <a href="https://dx.doi.org/10.1016/j.spl.2012.09.024" target="_blank">https://dx.doi.org/10.1016/j.spl.2012.09.024</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Kallenberg, Olav (2001). Foundations of Modern Probability (2nd ed.). Springer. p. 7. ISBN 0-387-95313-2. <a href="0-387-95313-2" target="_blank">0-387-95313-2</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>van der Vaart, A. W., & Wellner, J. A. (1996). Weak Convergence and Empirical Processes. In Springer Series in Statistics. Springer New York. https://doi.org/10.1007/978-1-4757-2545-2 <a href="https://doi.org/10.1007/978-1-4757-2545-2" target="_blank">https://doi.org/10.1007/978-1-4757-2545-2</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> </ol>