TheoremBase

The sets on which the traces of the two measures on a set of finite measure agree form a λ-system containing the π-system, so Dynkin's theorem makes them all of the σ-algebra; with the whole space this gives the finite case, and with the disjointed pieces of the cover and countable additivity the σ-finite case.

Proof

Throughout, F⊆P(X)\mathcal{F}\subseteq\mathcal{P}(X) by σ-Algebra and Measurable Space (i), and E⊆σ(E)=F\mathcal{E}\subseteq\sigma(\mathcal{E})=\mathcal{F} by Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii). The union ⋃n∈NAn\bigcup_{n\in\mathbb{N}}A_{n} of a sequence (An)(A_{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}.

Agreement on traces. Let G∈FG\in\mathcal{F} with μ(G)=ν(G)\mu(G)=\nu(G) and μ(G)<∞\mu(G)<\infty, and with μ(E∩G)=ν(E∩G)\mu(E\cap G)=\nu(E\cap G) for every E∈EE\in\mathcal{E}. We show that μ(A∩G)=ν(A∩G)\mu(A\cap G)=\nu(A\cap G) for every A∈FA\in\mathcal{F}. Note that A∩G∈FA\cap G\in\mathcal{F} for every A∈FA\in\mathcal{F}, by Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (ix). Let LG={A∈F:μ(A∩G)=ν(A∩G)}\mathcal{L}_{G}=\{A\in\mathcal{F}:\mu(A\cap G)=\nu(A\cap G)\}, a set by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (vii), as μ(A∩G)\mu(A\cap G) and ν(A∩G)\nu(A\cap G) are the values at AA of the maps μ∘gG\mu\circ g_{G} and ν∘gG\nu\circ g_{G} into [0,∞][0,\infty] (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii)), with gGg_{G} the trace map A↦A∩GA\mapsto A\cap G of Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (ii), a map F→F\mathcal{F}\to\mathcal{F} by Functions, Values of a Function, and Functions from One Class to Another (iii) as its values lie in F\mathcal{F}, so typed terms by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (i) and Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iii); by that clause it is a subset of F\mathcal{F}, hence of P(X)\mathcal{P}(X).

First, X∈LGX\in\mathcal{L}_{G}: X∈FX\in\mathcal{F} by σ-Algebra and Measurable Space (i), and X∩G=GX\cap G=G as G⊆XG\subseteq X, while μ(G)=ν(G)\mu(G)=\nu(G).

Next, let A∈LGA\in\mathcal{L}_{G}. Then X∖A∈FX\setminus A\in\mathcal{F} by σ-Algebra and Measurable Space (i), and (X∖A)∩G=G∖(A∩G)(X\setminus A)\cap G=G\setminus(A\cap G) as G⊆XG\subseteq X, where A∩G∈FA\cap G\in\mathcal{F} and A∩G⊆GA\cap G\subseteq G. As μ(G)<∞\mu(G)<\infty and ν(G)=μ(G)\nu(G)=\mu(G), also ν(G)<∞\nu(G)<\infty. As (X,F,μ)(X,\mathcal{F},\mu) and (X,F,ν)(X,\mathcal{F},\nu) are measure spaces by Measure, Measure Space, and Probability Measure (ii), Basic Properties of a Measure (iv) applies to μ\mu and to ν\nu: the values μ(G)\mu(G), ν(G)\nu(G), μ(A∩G)\mu(A\cap G) and ν(A∩G)\nu(A\cap G) are real, and

μ(G∖(A∩G))=μ(G)−μ(A∩G)=ν(G)−ν(A∩G)=ν(G∖(A∩G)).\mu\bigl(G\setminus(A\cap G)\bigr)=\mu(G)-\mu(A\cap G)=\nu(G)-\nu(A\cap G)=\nu\bigl(G\setminus(A\cap G)\bigr).

Hence X∖A∈LGX\setminus A\in\mathcal{L}_{G}.

Last, let (An)(A_{n}) be a sequence in LG\mathcal{L}_{G} whose terms are pairwise disjoint, and let U=⋃n∈NAnU=\bigcup_{n\in\mathbb{N}}A_{n}. As LG⊆F\mathcal{L}_{G}\subseteq\mathcal{F}, (An)(A_{n}) is a sequence in F\mathcal{F} and U∈FU\in\mathcal{F} by σ-Algebra and Measurable Space (i). By Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (ii) with Y=GY=G, the map n↦An∩Gn\mapsto A_{n}\cap G is a sequence in P(G)\mathcal{P}(G), hence in P(X)\mathcal{P}(X) as G⊆XG\subseteq X, and as each An∩GA_{n}\cap G lies in F\mathcal{F} it 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 in the sense of Measure, Measure Space, and Probability Measure (i): for m≠nm\neq n, the disjoint sets AmA_{m} and AnA_{n} satisfy Am∩An=∅A_{m}\cap A_{n}=\emptyset (Monotone Sequences of Sets, Unions of Traces, and Disjointness of Smaller Sets (iv)), and as An∩G⊆AnA_{n}\cap G\subseteq A_{n} for every nn, (Am∩G)∩(An∩G)=∅(A_{m}\cap G)\cap(A_{n}\cap G)=\emptyset (Monotone Sequences of Sets, Unions of Traces, and Disjointness of Smaller Sets (v)). Its union is U∩GU\cap G (Monotone Sequences of Sets, Unions of Traces, and Disjointness of Smaller Sets (iii)). By the countable additivity of Measure, Measure Space, and Probability Measure (i), applied to μ\mu and to ν\nu,

μ(U∩G)=∑n∈Nμ(An∩G),ν(U∩G)=∑n∈Nν(An∩G).\mu(U\cap G)=\sum_{n\in\mathbb{N}}\mu(A_{n}\cap G),\qquad \nu(U\cap G)=\sum_{n\in\mathbb{N}}\nu(A_{n}\cap G).

The sequences n↦μ(An∩G)n\mapsto\mu(A_{n}\cap G) and n↦ν(An∩G)n\mapsto\nu(A_{n}\cap G) in [0,∞][0,\infty] have equal terms, as every AnA_{n} lies in LG\mathcal{L}_{G}; so they are the same sequence, and their sums coincide. Hence μ(U∩G)=ν(U∩G)\mu(U\cap G)=\nu(U\cap G), and U∈LGU\in\mathcal{L}_{G}.

By λ-System (i), LG\mathcal{L}_{G} is therefore a λ\lambda-system on XX. It contains E\mathcal{E}, as every E∈EE\in\mathcal{E} lies in F\mathcal{F} and satisfies μ(E∩G)=ν(E∩G)\mu(E\cap G)=\nu(E\cap G) by assumption. By Dynkin's Pi-Lambda Theorem (ii), F=σ(E)⊆LG\mathcal{F}=\sigma(\mathcal{E})\subseteq\mathcal{L}_{G}, that is, μ(A∩G)=ν(A∩G)\mu(A\cap G)=\nu(A\cap G) for every A∈FA\in\mathcal{F}.

Proof of (i). Take G=XG=X in the paragraphs on agreement on traces: X∈FX\in\mathcal{F}, μ(X)=ν(X)\mu(X)=\nu(X) and μ(X)<∞\mu(X)<\infty by assumption, and for E∈EE\in\mathcal{E} we have E∩X=EE\cap X=E, as E⊆XE\subseteq X, so μ(E∩X)=ν(E∩X)\mu(E\cap X)=\nu(E\cap X) by the hypothesis on E\mathcal{E}. Hence, for every A∈FA\in\mathcal{F}, μ(A)=μ(A∩X)=ν(A∩X)=ν(A)\mu(A)=\mu(A\cap X)=\nu(A\cap X)=\nu(A), as A⊆XA\subseteq X. Since μ\mu and ν\nu are maps on F\mathcal{F} with the same values, μ=ν\mu=\nu (Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv)).

Proof of (ii). Let (Em)(E_{m}) be a sequence in E\mathcal{E} with ⋃m∈NEm=X\bigcup_{m\in\mathbb{N}}E_{m}=X and μ(Em)<∞\mu(E_{m})<\infty for every m∈Nm\in\mathbb{N}. Fix n∈Nn\in\mathbb{N} and take G=EnG=E_{n} in the paragraphs on agreement on traces: En∈E⊆FE_{n}\in\mathcal{E}\subseteq\mathcal{F}, μ(En)=ν(En)\mu(E_{n})=\nu(E_{n}) by the hypothesis on E\mathcal{E}, μ(En)<∞\mu(E_{n})<\infty, and for E∈EE\in\mathcal{E} we have E∩En∈EE\cap E_{n}\in\mathcal{E} by π-System (i), so μ(E∩En)=ν(E∩En)\mu(E\cap E_{n})=\nu(E\cap E_{n}). Hence

μ(A∩En)=ν(A∩En)for every A∈F and every n∈N.(∗)\mu(A\cap E_{n})=\nu(A\cap E_{n})\quad\text{for every }A\in\mathcal{F}\text{ and every }n\in\mathbb{N}.\tag{$*$}

As E⊆P(X)\mathcal{E}\subseteq\mathcal{P}(X), (Em)(E_{m}) is a sequence in P(X)\mathcal{P}(X), and by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (iv) there are exactly one sequence (Cn)(C_{n}) in P(X)\mathcal{P}(X) with C1=XC_{1}=X and Cn+1=Cn∩(X∖En)C_{n+1}=C_{n}\cap(X\setminus E_{n}) for every n∈Nn\in\mathbb{N}, and exactly one sequence (Bn)(B_{n}) in P(X)\mathcal{P}(X) with Bn=En∩CnB_{n}=E_{n}\cap C_{n} for every n∈Nn\in\mathbb{N}. As every EnE_{n} lies in E⊆F\mathcal{E}\subseteq\mathcal{F}, The Disjointing Sequence of a Sequence of Sets (v) gives Cn∈FC_{n}\in\mathcal{F} for every n∈Nn\in\mathbb{N}. By The Disjointing Sequence of a Sequence of Sets (ii), Bn⊆EnB_{n}\subseteq E_{n} for every n∈Nn\in\mathbb{N}; by The Disjointing Sequence of a Sequence of Sets (iii), BmB_{m} and BnB_{n} are disjoint for all m,n∈Nm,n\in\mathbb{N} with m≠nm\neq n; and by The Disjointing Sequence of a Sequence of Sets (iv), ⋃n∈NBn=⋃m∈NEm=X\bigcup_{n\in\mathbb{N}}B_{n}=\bigcup_{m\in\mathbb{N}}E_{m}=X.

Finally let A∈FA\in\mathcal{F}. By Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (ii) with Y=AY=A, applied to the sequence (Bn)(B_{n}) in P(X)\mathcal{P}(X), the map n↦Bn∩An\mapsto B_{n}\cap A is a sequence in P(A)\mathcal{P}(A), hence in P(X)\mathcal{P}(X) as A⊆XA\subseteq X, and as each Bn∩A=(A∩Cn)∩EnB_{n}\cap A=(A\cap C_{n})\cap E_{n} lies in F\mathcal{F} by Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (ix), AA, CnC_{n} and EnE_{n} lying in F\mathcal{F}, it 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 in the sense of Measure, Measure Space, and Probability Measure (i): Bm∩Bn=∅B_{m}\cap B_{n}=\emptyset for m≠nm\neq n by The Disjointing Sequence of a Sequence of Sets (iii), and as Bn∩A⊆BnB_{n}\cap A\subseteq B_{n} for every nn, (Bm∩A)∩(Bn∩A)=∅(B_{m}\cap A)\cap(B_{n}\cap A)=\emptyset (Monotone Sequences of Sets, Unions of Traces, and Disjointness of Smaller Sets (v)). Its union is (⋃n∈NBn)∩A\bigl(\bigcup_{n\in\mathbb{N}}B_{n}\bigr)\cap A (Monotone Sequences of Sets, Unions of Traces, and Disjointness of Smaller Sets (iii)), that is, X∩A=AX\cap A=A. For every n∈Nn\in\mathbb{N}, Bn∩A=(A∩Cn)∩EnB_{n}\cap A=(A\cap C_{n})\cap E_{n} with A∩Cn∈FA\cap C_{n}\in\mathcal{F}, so μ(Bn∩A)=ν(Bn∩A)\mu(B_{n}\cap A)=\nu(B_{n}\cap A) by (∗)(*); thus the sequences n↦μ(Bn∩A)n\mapsto\mu(B_{n}\cap A) and n↦ν(Bn∩A)n\mapsto\nu(B_{n}\cap A) in [0,∞][0,\infty] are the same sequence. By the countable additivity of Measure, Measure Space, and Probability Measure (i), applied to μ\mu and to ν\nu, and the sum of that sequence,

μ(A)=∑n∈Nμ(Bn∩A)=∑n∈Nν(Bn∩A)=ν(A).\mu(A)=\sum_{n\in\mathbb{N}}\mu(B_{n}\cap A)=\sum_{n\in\mathbb{N}}\nu(B_{n}\cap A)=\nu(A).

Since μ\mu and ν\nu are maps on F\mathcal{F} with the same values, μ=ν\mu=\nu (Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv)).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…