TheoremBase

Finite additivity extends a finite family by empty sets to a sequence; monotonicity and differences split B into A and B minus A; subadditivity and continuity from below use the disjointing sequence; continuity from above passes to the differences A1A_1 minus AmA_m.

Proof

Throughout, (X,F,ΞΌ)(X,\mathcal{F},\mu) and the notation are as in the statement. By Οƒ-Algebra and Measurable Space (i), FβŠ†P(X)\mathcal{F}\subseteq\mathcal{P}(X), with P(X)\mathcal{P}(X) the power set; a sequence in F\mathcal{F} is thus a sequence in P(X)\mathcal{P}(X), and a sequence in P(X)\mathcal{P}(X) whose terms lie in F\mathcal{F} is a sequence in F\mathcal{F} (Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v)). For a sequence (En)(E_{n}) in F\mathcal{F}, n↦μ(En)n\mapsto\mu(E_{n}) is a sequence in [0,∞][0,\infty], the composite of (En)(E_{n}) with ΞΌ\mu (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii)); this applies to (ΞΌ(En))(\mu(E_{n})), (ΞΌ(Am))(\mu(A_{m})), (ΞΌ(Bm))(\mu(B_{m})) and (ΞΌ(Dm))(\mu(D_{m})) below. Countable additivity and ΞΌ(βˆ…)=0\mu(\emptyset)=0 are those of Measure, Measure Space, and Probability Measure (i).

Finite additivity. Let rr and (Ai)i∈[r](A_{i})_{i\in[r]} be as in (i). By Maps Defined by Cases (i), applied on N\mathbb{N} to the condition n∈[r]n\in[r] with the values An∈FA_{n}\in\mathcal{F} and βˆ…βˆˆF\emptyset\in\mathcal{F} (Closure Properties of Οƒ-Algebras, Intersections and Traces of Οƒ-Algebras, and the Generated Οƒ-Algebra (vi)), there is a sequence (En)(E_{n}) in F\mathcal{F} with En=AnE_{n}=A_{n} for n∈[r]n\in[r] and En=βˆ…E_{n}=\emptyset for n∈Nβˆ–[r]n\in\mathbb{N}\setminus[r]. It is pairwise disjoint: for mβ‰ km\neq k in N\mathbb{N}, either m,k∈[r]m,k\in[r] and Em∩Ek=Am∩Ak=βˆ…E_{m}\cap E_{k}=A_{m}\cap A_{k}=\emptyset, or one of Em,EkE_{m},E_{k} is βˆ…\emptyset. Its union is ⋃i=1rAi\bigcup_{i=1}^{r}A_{i}: an element of some EnE_{n} shows Enβ‰ βˆ…E_{n}\neq\emptyset, so n∈[r]n\in[r] and the element lies in AnA_{n}; and Ai=EiA_{i}=E_{i} for i∈[r]i\in[r]. Hence ⋃i=1rAi=⋃n∈NEn∈F\bigcup_{i=1}^{r}A_{i}=\bigcup_{n\in\mathbb{N}}E_{n}\in\mathcal{F} by Οƒ-Algebra and Measurable Space (i), and countable additivity gives ΞΌ(⋃i=1rAi)=βˆ‘n∈NΞΌ(En)\mu\bigl(\bigcup_{i=1}^{r}A_{i}\bigr)=\sum_{n\in\mathbb{N}}\mu(E_{n}). If k∈Nk\in\mathbb{N} and r<kr<k, then k≀rk\le r fails by Arithmetic and Order of the Natural Numbers (vi) and Arithmetic and Order of the Natural Numbers (vii), so kβˆ‰[r]k\notin[r] by Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (i), and ΞΌ(Ek)=ΞΌ(βˆ…)=0\mu(E_{k})=\mu(\emptyset)=0. By Sums of Sequences in [0,∞]: Real Series, Linearity, Comparison, Rearrangement, Double Series and Monotone Convergence (vii), βˆ‘n∈NΞΌ(En)\sum_{n\in\mathbb{N}}\mu(E_{n}) is therefore the rr-th partial sum of (ΞΌ(En))(\mu(E_{n})), the iterated sum of its restriction to [r][r] (Iterated Operations: Finite Sums and Finite Products (ii)). That restriction is the map i↦μ(Ai)i\mapsto\mu(A_{i}) on [r][r], as Ei=AiE_{i}=A_{i} for i∈[r]i\in[r], so the partial sum is βˆ‘i=1rΞΌ(Ai)\sum_{i=1}^{r}\mu(A_{i}).

Two sets. Let A,BA,B be as in (ii). By Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (iii), with U=AU=A and V=BV=B, there is a sequence (En)(E_{n}) in P(X)\mathcal{P}(X) with E1=AE_{1}=A, E2=BE_{2}=B and En=βˆ…E_{n}=\emptyset for nβ‰ 1,2n\neq1,2; its terms lie in F\mathcal{F} (Closure Properties of Οƒ-Algebras, Intersections and Traces of Οƒ-Algebras, and the Generated Οƒ-Algebra (vi)), so it is a sequence in F\mathcal{F}. Since 2=1+12=1+1 by Arithmetic and Order of the Natural Numbers (xiv), 1<21<2 by Arithmetic and Order of the Natural Numbers (xi). The sequence is pairwise disjoint: for mβ‰ km\neq k, either {m,k}={1,2}\{m,k\}=\{1,2\} and Em∩Ek=A∩B=βˆ…E_{m}\cap E_{k}=A\cap B=\emptyset, or one of Em,EkE_{m},E_{k} is βˆ…\emptyset. Its union is AβˆͺBA\cup B, since an element of some EnE_{n} shows Enβ‰ βˆ…E_{n}\neq\emptyset, so n=1n=1 or n=2n=2. Countable additivity gives ΞΌ(AβˆͺB)=βˆ‘n∈NΞΌ(En)\mu(A\cup B)=\sum_{n\in\mathbb{N}}\mu(E_{n}). If k∈Nk\in\mathbb{N} and 2<k2<k, then kβ‰ 2k\neq2 by Arithmetic and Order of the Natural Numbers (vii), and 1<k1<k by Arithmetic and Order of the Natural Numbers (vi), so kβ‰ 1k\neq1; thus ΞΌ(Ek)=ΞΌ(βˆ…)=0\mu(E_{k})=\mu(\emptyset)=0. By Sums of Sequences in [0,∞]: Real Series, Linearity, Comparison, Rearrangement, Double Series and Monotone Convergence (vii) with n=2n=2 and Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (i) with n=1n=1, βˆ‘n∈NΞΌ(En)=βˆ‘k=12ΞΌ(Ek)=ΞΌ(E1)+ΞΌ(E2)=ΞΌ(A)+ΞΌ(B)\sum_{n\in\mathbb{N}}\mu(E_{n})=\sum_{k=1}^{2}\mu(E_{k})=\mu(E_{1})+\mu(E_{2})=\mu(A)+\mu(B).

Monotonicity. Let AβŠ†BA\subseteq B in F\mathcal{F}. Then Bβˆ–A∈FB\setminus A\in\mathcal{F} by Closure Properties of Οƒ-Algebras, Intersections and Traces of Οƒ-Algebras, and the Generated Οƒ-Algebra (x), A∩(Bβˆ–A)=βˆ…A\cap(B\setminus A)=\emptyset, and Aβˆͺ(Bβˆ–A)=BA\cup(B\setminus A)=B because AβŠ†BA\subseteq B. By (ii), ΞΌ(B)=ΞΌ(A)+ΞΌ(Bβˆ–A)\mu(B)=\mu(A)+\mu(B\setminus A), and ΞΌ(A)≀μ(A)+ΞΌ(Bβˆ–A)\mu(A)\le\mu(A)+\mu(B\setminus A) by Arithmetic in [0,∞]: Monoid Laws, Distributivity, Monotonicity and Cancellation (v).

Differences. Let AβŠ†BA\subseteq B in F\mathcal{F} with ΞΌ(B)<∞\mu(B)<\infty. As in the previous paragraph, ΞΌ(B)=ΞΌ(A)+ΞΌ(Bβˆ–A)\mu(B)=\mu(A)+\mu(B\setminus A). By (iii), ΞΌ(A)≀μ(B)\mu(A)\le\mu(B) and, as Bβˆ–AβŠ†BB\setminus A\subseteq B, ΞΌ(Bβˆ–A)≀μ(B)\mu(B\setminus A)\le\mu(B); so ΞΌ(A)\mu(A) and ΞΌ(Bβˆ–A)\mu(B\setminus A) are real (Small Facts about [0,∞]: Zero, Finiteness and Sums of Zeros (iii)). By Addition and Multiplication on [0,∞] (i), ΞΌ(A)+ΞΌ(Bβˆ–A)\mu(A)+\mu(B\setminus A) is then the sum in R\mathbb{R}, so ΞΌ(B)\mu(B) is real and ΞΌ(Bβˆ–A)=ΞΌ(B)βˆ’ΞΌ(A)\mu(B\setminus A)=\mu(B)-\mu(A) (Differences, Quotients and Absolute Values of Real Numbers, Read in the Type Real (i)). If ΞΌ\mu is finite, then ΞΌ(X)<∞\mu(X)<\infty by Measure, Measure Space, and Probability Measure (iii), X∈FX\in\mathcal{F} by Οƒ-Algebra and Measurable Space (i) and AβŠ†XA\subseteq X for A∈FA\in\mathcal{F}, so the case B=XB=X gives ΞΌ(Xβˆ–A)=ΞΌ(X)βˆ’ΞΌ(A)\mu(X\setminus A)=\mu(X)-\mu(A), which is (v).

The disjointing sequence. This paragraph prepares the next ones. Let (An)(A_{n}) be 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), 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∩CnB_{n}=A_{n}\cap C_{n} for every n∈Nn\in\mathbb{N}. By The Disjointing Sequence of a Sequence of Sets, these sequences have the following properties. (D1) (Bn)(B_{n}) is a sequence in F\mathcal{F}, by The Disjointing Sequence of a Sequence of Sets (v), as every AnA_{n} lies in F\mathcal{F}. (D2) BnβŠ†AnB_{n}\subseteq A_{n} for every nn, by The Disjointing Sequence of a Sequence of Sets (ii), and (Bn)(B_{n}) is pairwise disjoint, Bm∩Bk=βˆ…B_{m}\cap B_{k}=\emptyset for mβ‰ km\neq k, by The Disjointing Sequence of a Sequence of Sets (iii). (D3) If n∈Nn\in\mathbb{N} and x∈Anx\in A_{n}, then x∈Bmx\in B_{m} for some m∈Nm\in\mathbb{N} with m≀nm\le n, that is, for some m∈[n]m\in[n] by Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (i); and ⋃n∈NBn=⋃n∈NAn\bigcup_{n\in\mathbb{N}}B_{n}=\bigcup_{n\in\mathbb{N}}A_{n}; both by The Disjointing Sequence of a Sequence of Sets (iv).

Countable subadditivity. Let (Am)(A_{m}) be a sequence in F\mathcal{F} and (Bm)(B_{m}) its disjointing sequence as above. By (D3), (D1), (D2) and countable additivity, ΞΌ(⋃mAm)=ΞΌ(⋃mBm)=βˆ‘m∈NΞΌ(Bm)\mu\bigl(\bigcup_{m}A_{m}\bigr)=\mu\bigl(\bigcup_{m}B_{m}\bigr)=\sum_{m\in\mathbb{N}}\mu(B_{m}). By (D2) and (iii), ΞΌ(Bm)≀μ(Am)\mu(B_{m})\le\mu(A_{m}) for every mm, so βˆ‘m∈NΞΌ(Bm)β‰€βˆ‘m∈NΞΌ(Am)\sum_{m\in\mathbb{N}}\mu(B_{m})\le\sum_{m\in\mathbb{N}}\mu(A_{m}) by Sums of Sequences in [0,∞]: Real Series, Linearity, Comparison, Rearrangement, Double Series and Monotone Convergence (x).

Subadditivity for two sets. Let A,B∈FA,B\in\mathcal{F}. Then Bβˆ–A∈FB\setminus A\in\mathcal{F} by Closure Properties of Οƒ-Algebras, Intersections and Traces of Οƒ-Algebras, and the Generated Οƒ-Algebra (x), A∩(Bβˆ–A)=βˆ…A\cap(B\setminus A)=\emptyset and Aβˆͺ(Bβˆ–A)=AβˆͺBA\cup(B\setminus A)=A\cup B, so ΞΌ(AβˆͺB)=ΞΌ(A)+ΞΌ(Bβˆ–A)\mu(A\cup B)=\mu(A)+\mu(B\setminus A) by (ii). As Bβˆ–AβŠ†BB\setminus A\subseteq B, ΞΌ(Bβˆ–A)≀μ(B)\mu(B\setminus A)\le\mu(B) by (iii), and then ΞΌ(A)+ΞΌ(Bβˆ–A)≀μ(A)+ΞΌ(B)\mu(A)+\mu(B\setminus A)\le\mu(A)+\mu(B) by Arithmetic in [0,∞]: Monoid Laws, Distributivity, Monotonicity and Cancellation (iv) and the commutativity in Arithmetic in [0,∞]: Monoid Laws, Distributivity, Monotonicity and Cancellation (i).

Continuity from below. Let (Am)(A_{m}) and AA be as in (viii), and (Bm)(B_{m}) the disjointing sequence of (Am)(A_{m}). First, AkβŠ†AnA_{k}\subseteq A_{n} whenever n∈Nn\in\mathbb{N} and k∈[n]k\in[n], as then k≀nk\le n by Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (i) (Monotone Sequences of Sets, Unions of Traces, and Disjointness of Smaller Sets (i)). Now fix n∈Nn\in\mathbb{N}. The family (Bk)k∈[n](B_{k})_{k\in[n]}, the restriction of (Bk)(B_{k}) to [n][n], is pairwise disjoint with terms in F\mathcal{F} by (D1) and (D2), and its union is AnA_{n}: for k∈[n]k\in[n], BkβŠ†AkβŠ†AnB_{k}\subseteq A_{k}\subseteq A_{n} by (D2) and the inclusions just shown, and every x∈Anx\in A_{n} lies in BmB_{m} for some m∈[n]m\in[n] by (D3). By (i) with r=nr=n, ΞΌ(An)=βˆ‘k=1nΞΌ(Bk)\mu(A_{n})=\sum_{k=1}^{n}\mu(B_{k}), which is the nn-th partial sum sns_{n} of (ΞΌ(Bk))(\mu(B_{k})) (Iterated Operations: Finite Sums and Finite Products (ii)). Hence {sn:n∈N}={ΞΌ(An):n∈N}\{s_{n}:n\in\mathbb{N}\}=\{\mu(A_{n}):n\in\mathbb{N}\}, and by (D3), countable additivity and Sum of a Sequence in [0,∞] (ii),

ΞΌ(A)=ΞΌ(⋃k∈NBk)=βˆ‘k∈NΞΌ(Bk)=sup⁑{sn:n∈N}=sup⁑nΞΌ(An).\mu(A)=\mu\Bigl(\bigcup_{k\in\mathbb{N}}B_{k}\Bigr)=\sum_{k\in\mathbb{N}}\mu(B_{k})=\sup\{s_{n}:n\in\mathbb{N}\}=\sup_{n}\mu(A_{n}).

Continuity from above. Let (Am)(A_{m}) and AA be as in (ix); A∈FA\in\mathcal{F} by Closure Properties of Οƒ-Algebras, Intersections and Traces of Οƒ-Algebras, and the Generated Οƒ-Algebra (viii). As A1∈FβŠ†P(X)A_{1}\in\mathcal{F}\subseteq\mathcal{P}(X), every subset of A1A_{1} is a subset of XX, so P(A1)βŠ†P(X)\mathcal{P}(A_{1})\subseteq\mathcal{P}(X). By Monotone Sequences of Sets, Unions of Traces, and Disjointness of Smaller Sets (ii), AmβŠ†A1A_{m}\subseteq A_{1} for every mm; so (Am)(A_{m}), a sequence in P(X)\mathcal{P}(X) whose terms lie in the subset P(A1)\mathcal{P}(A_{1}) of P(X)\mathcal{P}(X), is a sequence in P(A1)\mathcal{P}(A_{1}) (Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v)), and Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (i), applied to A1A_{1}, gives the sequence (Dm)(D_{m}) in P(A1)\mathcal{P}(A_{1}) with Dm=A1βˆ–AmD_{m}=A_{1}\setminus A_{m}. As the range of (Dm)(D_{m}) lies in P(A1)βŠ†P(X)\mathcal{P}(A_{1})\subseteq\mathcal{P}(X), (Dm)(D_{m}) is a sequence in P(X)\mathcal{P}(X) by Functions, Values of a Function, and Functions from One Class to Another (iii). Its terms lie in F\mathcal{F} by Closure Properties of Οƒ-Algebras, Intersections and Traces of Οƒ-Algebras, and the Generated Οƒ-Algebra (x), so 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). Also AβŠ†AmA\subseteq A_{m} for every mm, by Indexed Families of Sets and Their Union, Intersection and Product (iii). As ΞΌ(A1)<∞\mu(A_{1})<\infty, (iv) with B=A1B=A_{1} shows that ΞΌ(A1)\mu(A_{1}), ΞΌ(A)\mu(A) and every ΞΌ(Am)\mu(A_{m}) are real, ΞΌ(Dm)=ΞΌ(A1)βˆ’ΞΌ(Am)\mu(D_{m})=\mu(A_{1})-\mu(A_{m}) for every mm, and ΞΌ(A1βˆ–A)=ΞΌ(A1)βˆ’ΞΌ(A)\mu(A_{1}\setminus A)=\mu(A_{1})-\mu(A). Moreover DmβŠ†Dm+1D_{m}\subseteq D_{m+1}, as Am+1βŠ†AmA_{m+1}\subseteq A_{m}; and ⋃mDm=A1βˆ–A\bigcup_{m}D_{m}=A_{1}\setminus A, since xx lies in some DmD_{m} exactly when x∈A1x\in A_{1} and xβˆ‰Amx\notin A_{m} for some mm, that is, x∈A1x\in A_{1} and xβˆ‰β‹‚mAmx\notin\bigcap_{m}A_{m}. By (viii) applied to (Dm)(D_{m}),

ΞΌ(A1)βˆ’ΞΌ(A)=ΞΌ(A1βˆ–A)=sup⁑mΞΌ(Dm).\mu(A_{1})-\mu(A)=\mu(A_{1}\setminus A)=\sup_{m}\mu(D_{m}).

Let S={ΞΌ(Am):m∈N}S=\{\mu(A_{m}):m\in\mathbb{N}\}. We show that ΞΌ(A)\mu(A) is the greatest lower bound of SS, which makes it the infimum inf⁑mΞΌ(Am)\inf_{m}\mu(A_{m}) by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv). It is a lower bound of SS: ΞΌ(A)≀μ(Am)\mu(A)\le\mu(A_{m}) by (iii), as AβŠ†AmA\subseteq A_{m}. Let b∈[βˆ’βˆž,∞]b\in[-\infty,\infty] be a lower bound of SS. If b=βˆ’βˆžb=-\infty, then b≀μ(A)b\le\mu(A) by Order and Suprema in the Extended Real Line (ii). Otherwise b≀μ(A1)b\le\mu(A_{1}) with ΞΌ(A1)\mu(A_{1}) real, so bβ‰ βˆžb\neq\infty by Order and Suprema in the Extended Real Line (ii), and b∈Rb\in\mathbb{R} by The Extended Real Line, Its Order, and [0,∞] (ii). For every mm, b≀μ(Am)b\le\mu(A_{m}) holds in R\mathbb{R} by Order and Suprema in the Extended Real Line (i), so ΞΌ(Dm)=ΞΌ(A1)βˆ’ΞΌ(Am)≀μ(A1)βˆ’b\mu(D_{m})=\mu(A_{1})-\mu(A_{m})\le\mu(A_{1})-b (Differences, Quotients and Absolute Values of Real Numbers, Read in the Type Real (i)). Thus the real number ΞΌ(A1)βˆ’b\mu(A_{1})-b is an upper bound of {ΞΌ(Dm):m∈N}\{\mu(D_{m}):m\in\mathbb{N}\}, and the supremum, being the least upper bound (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv)), satisfies ΞΌ(A1)βˆ’ΞΌ(A)=sup⁑mΞΌ(Dm)≀μ(A1)βˆ’b\mu(A_{1})-\mu(A)=\sup_{m}\mu(D_{m})\le\mu(A_{1})-b. Both sides are real, so this holds in R\mathbb{R} by Order and Suprema in the Extended Real Line (i), and b≀μ(A)b\le\mu(A) (Differences, Quotients and Absolute Values of Real Numbers, Read in the Type Real (i)). Hence ΞΌ(A)=inf⁑mΞΌ(Am)\mu(A)=\inf_{m}\mu(A_{m}).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…