TheoremBase

Disjointifies a sequence to show that π- and λ-systems together are σ-algebras, then shows by the two-step argument that the smallest λ-system containing a π-system is a π-system, hence a σ-algebra containing the generated one.

Proof

Throughout, σ\sigma-algebras, π\pi-systems and λ\lambda-systems are on XX, and the union ⋃n∈NAn\bigcup_{n\in\mathbb{N}}A_{n} of a sequence (An)n∈N(A_{n})_{n\in\mathbb{N}} is the union of the family, whose elements are the xx with x∈Anx\in A_{n} for some n∈Nn\in\mathbb{N}.

Proof of (i). Let F\mathcal{F} be a σ\sigma-algebra. By σ-Algebra and Measurable Space (i), F⊆P(X)\mathcal{F}\subseteq\mathcal{P}(X), X∈FX\in\mathcal{F}, X∖A∈FX\setminus A\in\mathcal{F} for every A∈FA\in\mathcal{F}, and the union of every sequence in F\mathcal{F} lies in F\mathcal{F}, in particular the union of every sequence in F\mathcal{F} with pairwise disjoint terms; so F\mathcal{F} is a λ\lambda-system by λ-System (i). By Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (ix), A∩B∈FA\cap B\in\mathcal{F} for all A,B∈FA,B\in\mathcal{F}, so F\mathcal{F} is a π\pi-system by π-System (i).

Conversely, let F⊆P(X)\mathcal{F}\subseteq\mathcal{P}(X) be both a π\pi-system and a λ\lambda-system. By λ-System (i), X∈FX\in\mathcal{F} and X∖A∈FX\setminus A\in\mathcal{F} for every A∈FA\in\mathcal{F}. Let (An)n∈N(A_{n})_{n\in\mathbb{N}} be a sequence in F\mathcal{F}. Once ⋃n∈NAn∈F\bigcup_{n\in\mathbb{N}}A_{n}\in\mathcal{F} is shown, F\mathcal{F} is a σ\sigma-algebra by σ-Algebra and Measurable Space (i). For n∈Nn\in\mathbb{N} let

Cn={x∈X:x∉Ak for every k∈N with k<n},Bn=An∩Cn.C_{n}=\{x\in X:x\notin A_{k}\text{ for every }k\in\mathbb{N}\text{ with }k<n\},\qquad B_{n}=A_{n}\cap C_{n}.

First, Cn∈FC_{n}\in\mathcal{F} for every n∈Nn\in\mathbb{N}. There is no k∈Nk\in\mathbb{N} with k<1k<1: by Arithmetic and Order of the Natural Numbers (x) and Arithmetic and Order of the Natural Numbers (vi), 1<k1<k or 1=k1=k, and neither is compatible with k<1k<1 by Arithmetic and Order of the Natural Numbers (vii). Hence C1=X∈FC_{1}=X\in\mathcal{F}. Let n∈Nn\in\mathbb{N} with Cn∈FC_{n}\in\mathcal{F}. For k∈Nk\in\mathbb{N}, k<n+1k<n+1 holds if and only if k<nk<n or k=nk=n (as n+1n+1 is the successor S(n)S(n) of nn by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (v), k<n+1k<n+1 holds if and only if k≤nk\le n by The Order on Omega Is a Well-Order with Membership as Its Strict Order, and Nothing Lies between n and Its Successor (iv), that is, if and only if k<nk<n or k=nk=n by Arithmetic and Order of the Natural Numbers (vi)). Hence Cn+1=Cn∩(X∖An)C_{n+1}=C_{n}\cap(X\setminus A_{n}), which lies in F\mathcal{F} by π-System (i), as CnC_{n} and X∖AnX\setminus A_{n} do. By Arithmetic and Order of the Natural Numbers (xiii), applied to the set of all n∈Nn\in\mathbb{N} with Cn∈FC_{n}\in\mathcal{F}, the claim holds for every n∈Nn\in\mathbb{N}.

Consequently Bn∈FB_{n}\in\mathcal{F} for every n∈Nn\in\mathbb{N}, by π-System (i), and n↦Bnn\mapsto B_{n} is a sequence in F\mathcal{F} (by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (iv), applied to (An)(A_{n}), a sequence in P(X)\mathcal{P}(X) as F⊆P(X)\mathcal{F}\subseteq\mathcal{P}(X), there are sequences (Cn′)(C'_{n}) and (Bn′)(B'_{n}) in P(X)\mathcal{P}(X) with C1′=XC'_{1}=X, Cn+1′=Cn′∩(X∖An)C'_{n+1}=C'_{n}\cap(X\setminus A_{n}) and Bn′=An∩Cn′B'_{n}=A_{n}\cap C'_{n} for every n∈Nn\in\mathbb{N}; by the identities C1=XC_{1}=X and Cn+1=Cn∩(X∖An)C_{n+1}=C_{n}\cap(X\setminus A_{n}) shown above, whose derivation does not use Cn∈FC_{n}\in\mathcal{F}, and Arithmetic and Order of the Natural Numbers (xiii), Cn′=CnC'_{n}=C_{n}, and so Bn′=BnB'_{n}=B_{n}, for every n∈Nn\in\mathbb{N}; and (Bn′)(B'_{n}) is a sequence in F\mathcal{F} by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v)). Its terms are pairwise disjoint: let m,n∈Nm,n\in\mathbb{N} with m≠nm\neq n; by Arithmetic and Order of the Natural Numbers (vii), m<nm<n or n<mn<m, and as disjointness is symmetric we may take m<nm<n; then every element of Bn⊆CnB_{n}\subseteq C_{n} lies outside AmA_{m}, while Bm⊆AmB_{m}\subseteq A_{m}, so BmB_{m} and BnB_{n} are disjoint. Hence ⋃n∈NBn∈F\bigcup_{n\in\mathbb{N}}B_{n}\in\mathcal{F} by λ-System (i).

Finally ⋃n∈NBn=⋃n∈NAn\bigcup_{n\in\mathbb{N}}B_{n}=\bigcup_{n\in\mathbb{N}}A_{n}. As Bn⊆AnB_{n}\subseteq A_{n} for every nn, the left side is contained in the right. Conversely, let x∈Anx\in A_{n} for some n∈Nn\in\mathbb{N}. The set S={k∈N:x∈Ak}S=\{k\in\mathbb{N}:x\in A_{k}\} has the element nn, so by Arithmetic and Order of the Natural Numbers (xv) it has an element mm with m≤vm\le v for every v∈Sv\in S. For k∈Nk\in\mathbb{N} with k<mk<m we have x∉Akx\notin A_{k}: otherwise k∈Sk\in S, so m≤km\le k, that is m<km<k or m=km=k by Arithmetic and Order of the Natural Numbers (vi), and either contradicts k<mk<m by Arithmetic and Order of the Natural Numbers (vii). As x∈Am⊆Xx\in A_{m}\subseteq X, it follows that x∈Cmx\in C_{m}, hence x∈Bmx\in B_{m}. Thus ⋃n∈NAn=⋃n∈NBn∈F\bigcup_{n\in\mathbb{N}}A_{n}=\bigcup_{n\in\mathbb{N}}B_{n}\in\mathcal{F}.

Disjoint pairs in a λ\lambda-system. Let M\mathcal{M} be a λ\lambda-system and let A,B∈MA,B\in\mathcal{M} be disjoint. Then A∪B∈MA\cup B\in\mathcal{M}. Indeed, X∖X∈MX\setminus X\in\mathcal{M} by λ-System (i); the set X∖XX\setminus X has no element, so it equals the empty set ∅\emptyset by Elements Are Sets, and the Empty Set and the Pair of Two Sets Exist and Are Unique (ii), and ∅∈M\emptyset\in\mathcal{M}. By Arithmetic and Order of the Natural Numbers (xiv), 2=1+12=1+1 is a natural number, and 2≠12\neq1 by Arithmetic and Order of the Natural Numbers (xi). For n∈Nn\in\mathbb{N} let

En={x∈A:n=1}∪{x∈B:n=2}.E_{n}=\{x\in A:n=1\}\cup\{x\in B:n=2\}.

Then E1=AE_{1}=A and E2=BE_{2}=B, and for every n∈Nn\in\mathbb{N} other than 11 and 22 the set EnE_{n} has no element, so En=∅E_{n}=\emptyset by Elements Are Sets, and the Empty Set and the Pair of Two Sets Exist and Are Unique (ii); so n↦Enn\mapsto E_{n} is a sequence in M\mathcal{M} (as A,B⊆XA,B\subseteq X, because M⊆P(X)\mathcal{M}\subseteq\mathcal{P}(X), Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (iii) gives a sequence in P(X)\mathcal{P}(X) with first term AA, second term BB and every other term ∅\emptyset, which is n↦Enn\mapsto E_{n}; it is a sequence in M\mathcal{M} by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v), as AA, BB and ∅\emptyset lie in M\mathcal{M}). Its terms are pairwise disjoint: if x∈Em∩Enx\in E_{m}\cap E_{n} for some m,n∈Nm,n\in\mathbb{N} with m≠nm\neq n, then each of mm and nn is 11 or 22, so one of them is 11 and the other is 22, and x∈A∩Bx\in A\cap B, which has no element. Its union is A∪BA\cup B, as every EnE_{n} is contained in A∪BA\cup B while A=E1A=E_{1} and B=E2B=E_{2}. Hence A∪B∈MA\cup B\in\mathcal{M} by λ-System (i).

Proper differences in a λ\lambda-system. Let M\mathcal{M} be a λ\lambda-system and let A,B∈MA,B\in\mathcal{M} with A⊆BA\subseteq B. Then B∖A∈MB\setminus A\in\mathcal{M}. Indeed, X∖B∈MX\setminus B\in\mathcal{M} by λ-System (i), and AA and X∖BX\setminus B are disjoint as A⊆BA\subseteq B; so A∪(X∖B)∈MA\cup(X\setminus B)\in\mathcal{M} by the paragraph on disjoint pairs, and X∖(A∪(X∖B))∈MX\setminus\bigl(A\cup(X\setminus B)\bigr)\in\mathcal{M} by λ-System (i). This set is B∖AB\setminus A: its elements are the x∈Xx\in X with x∉Ax\notin A and x∈Bx\in B, and B⊆XB\subseteq X since M⊆P(X)\mathcal{M}\subseteq\mathcal{P}(X).

Proof of (ii). Let

L0={B∈P(X):B∈M for every λ-system M on X with E⊆M}.\mathcal{L}_{0}=\{B\in\mathcal{P}(X):B\in\mathcal{M}\text{ for every }\lambda\text{-system }\mathcal{M}\text{ on }X\text{ with }\mathcal{E}\subseteq\mathcal{M}\}.

This is a set (by Predicative Formulas for σ-Algebras, π-Systems and λ-Systems, and the Sets of Them Containing a Given Family (iii), applied with C=E\mathcal{C}=\mathcal{E}, a subset of P(X)\mathcal{P}(X) by π-System (i), the λ\lambda-systems M\mathcal{M} on XX with E⊆M\mathcal{E}\subseteq\mathcal{M} are the elements of a set S\mathcal{S}, and L0\mathcal{L}_{0} is the set of those B∈P(X)B\in\mathcal{P}(X) with B∈MB\in\mathcal{M} for every M∈S\mathcal{M}\in\mathcal{S}). Then E⊆L0\mathcal{E}\subseteq\mathcal{L}_{0}, since E⊆P(X)\mathcal{E}\subseteq\mathcal{P}(X) by π-System (i), and L0⊆L\mathcal{L}_{0}\subseteq\mathcal{L}, since L\mathcal{L} is one of the λ\lambda-systems M\mathcal{M} in the condition. Moreover, if M\mathcal{M} is a λ\lambda-system with E⊆M\mathcal{E}\subseteq\mathcal{M}, then L0⊆M\mathcal{L}_{0}\subseteq\mathcal{M}.

L0\mathcal{L}_{0} is a λ\lambda-system. It is a subset of P(X)\mathcal{P}(X). By λ-System (i), applied to each λ\lambda-system M\mathcal{M} with E⊆M\mathcal{E}\subseteq\mathcal{M}: XX lies in every such M\mathcal{M}, so X∈L0X\in\mathcal{L}_{0}; for A∈L0A\in\mathcal{L}_{0}, X∖AX\setminus A is a subset of XX lying in every such M\mathcal{M}, so X∖A∈L0X\setminus A\in\mathcal{L}_{0}; and a sequence in L0\mathcal{L}_{0} with pairwise disjoint terms is a sequence in every such M\mathcal{M}, as L0⊆M\mathcal{L}_{0}\subseteq\mathcal{M}, so its union lies in every such M\mathcal{M}, and that union is a set by The Union and Product of a Family of Sets Indexed by a Set, and the Intersection of a Family with an Inhabited Index Class, Are Sets (i), contained in XX as every term is; so the union lies in L0\mathcal{L}_{0}.

For A∈L0A\in\mathcal{L}_{0} let DA={B∈P(X):A∩B∈L0}\mathcal{D}_{A}=\{B\in\mathcal{P}(X):A\cap B\in\mathcal{L}_{0}\}. Then DA\mathcal{D}_{A} is a λ\lambda-system. First, X∈DAX\in\mathcal{D}_{A}, as A∩X=AA\cap X=A. Next let B∈DAB\in\mathcal{D}_{A}. As A⊆XA\subseteq X, A∩(X∖B)=A∖(A∩B)A\cap(X\setminus B)=A\setminus(A\cap B), where A∩B⊆AA\cap B\subseteq A and both lie in L0\mathcal{L}_{0}; so A∩(X∖B)∈L0A\cap(X\setminus B)\in\mathcal{L}_{0} by the paragraph on proper differences, applied to the λ\lambda-system L0\mathcal{L}_{0}, and X∖B∈DAX\setminus B\in\mathcal{D}_{A}. Last let (Bn)n∈N(B_{n})_{n\in\mathbb{N}} be a sequence in DA\mathcal{D}_{A} with pairwise disjoint terms. Then n↦A∩Bnn\mapsto A\cap B_{n} is a sequence in L0\mathcal{L}_{0} (Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (ii), applied with Y=AY=A to the sequence (Bn)(B_{n}) in DA\mathcal{D}_{A}, gives a sequence in P(A)\mathcal{P}(A), hence in P(X)\mathcal{P}(X) as A⊆XA\subseteq X, with terms Bn∩A=A∩BnB_{n}\cap A=A\cap B_{n}; it is a sequence in L0\mathcal{L}_{0} by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v), as A∩Bn∈L0A\cap B_{n}\in\mathcal{L}_{0} for every nn by the definition of DA\mathcal{D}_{A}) whose terms are pairwise disjoint, as (A∩Bm)∩(A∩Bn)⊆Bm∩Bn(A\cap B_{m})\cap(A\cap B_{n})\subseteq B_{m}\cap B_{n}; so its union lies in L0\mathcal{L}_{0} by λ-System (i). That union is A∩⋃n∈NBnA\cap\bigcup_{n\in\mathbb{N}}B_{n}, and ⋃n∈NBn\bigcup_{n\in\mathbb{N}}B_{n} is a set by The Union and Product of a Family of Sets Indexed by a Set, and the Intersection of a Family with an Inhabited Index Class, Are Sets (i), contained in XX; so ⋃n∈NBn∈DA\bigcup_{n\in\mathbb{N}}B_{n}\in\mathcal{D}_{A}. By λ-System (i), DA\mathcal{D}_{A} is a λ\lambda-system, and therefore L0⊆DA\mathcal{L}_{0}\subseteq\mathcal{D}_{A} whenever E⊆DA\mathcal{E}\subseteq\mathcal{D}_{A}.

Let C∈EC\in\mathcal{E}. Then C∈L0C\in\mathcal{L}_{0}, and C∩B∈E⊆L0C\cap B\in\mathcal{E}\subseteq\mathcal{L}_{0} for every B∈EB\in\mathcal{E} by π-System (i); so E⊆DC\mathcal{E}\subseteq\mathcal{D}_{C}, hence L0⊆DC\mathcal{L}_{0}\subseteq\mathcal{D}_{C}, that is, C∩B∈L0C\cap B\in\mathcal{L}_{0} for every B∈L0B\in\mathcal{L}_{0}. Now let A∈L0A\in\mathcal{L}_{0}. For C∈EC\in\mathcal{E}, A∩C=C∩A∈L0A\cap C=C\cap A\in\mathcal{L}_{0} by what was just shown; so E⊆DA\mathcal{E}\subseteq\mathcal{D}_{A}, hence L0⊆DA\mathcal{L}_{0}\subseteq\mathcal{D}_{A}, that is, A∩B∈L0A\cap B\in\mathcal{L}_{0} for every B∈L0B\in\mathcal{L}_{0}. Thus L0\mathcal{L}_{0} is a π\pi-system by π-System (i), and, being also a λ\lambda-system, a σ\sigma-algebra by (i). As E⊆L0\mathcal{E}\subseteq\mathcal{L}_{0}, Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iv) gives σ(E)⊆L0\sigma(\mathcal{E})\subseteq\mathcal{L}_{0}, and so σ(E)⊆L0⊆L\sigma(\mathcal{E})\subseteq\mathcal{L}_{0}\subseteq\mathcal{L}.

Proof of (iii). Let L0\mathcal{L}_{0} be as in the proof of (ii); it is the set described in (iii), and σ(E)⊆L0\sigma(\mathcal{E})\subseteq\mathcal{L}_{0} was shown there. By Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii), σ(E)\sigma(\mathcal{E}) is a σ\sigma-algebra with E⊆σ(E)\mathcal{E}\subseteq\sigma(\mathcal{E}), so it is a λ\lambda-system by (i), and hence L0⊆σ(E)\mathcal{L}_{0}\subseteq\sigma(\mathcal{E}). Therefore σ(E)=L0\sigma(\mathcal{E})=\mathcal{L}_{0}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…