In some sense, this dV is a function dV:E→R which computes the volume of E⊂Rn, a tiny control volume we are interested in. It would be very natural to ask for this function to satisfy:
The question would be, when can we find such a function. Trivially we can obtain such property by sending every A to 0. However, for more practical purposes of modeling the world, we would like nicer properties. In particular, let’s consider this compeletly reasonable demand on Rn.
R=(−∞,∞) is a generalized open interval, hence R∈T(B). More explicitly, we can cover it by ∪a=0∞{(a,a+1),(−a−1,−a)}
Property 2: Closed under arbitrary unions
Let U⊆T(B) be an arbitrary collection of sets in T(B). For each U∈U, we have U=∪B∈BUB for some BU⊆B. Then ∪U∈UU=∪U∈U(∪B∈BUB)=∪B∈∪U∈UBUB. Since ∪U∈UBU⊆B, we have ∪U∈UU∈T(B)
Property 3: Closed under finite intersections
By induction on the number n of sets.
Base case (n=1): Trivial, U∈T(B).
Inductive step: Assume U1∩⋯∩Un∈T(B) for any n sets in T(B).
For n+1 sets, write (U1∩⋯∩Un)∩Un+1. By induction hypothesis, U1∩⋯∩Un=∪i∈I(ai,bi)
for some countable collection of open intervals. Then
Each (ai,bi)∩Un+1 is an intersection of an open interval with a union of open intervals, which is
a finite union of open intervals (or empty). Hence (U1∩⋯∩Un+1)∈T(B).
I claim the union is just (c,d) where c=inf{a:(a,b)∈Bx} and d=sup{b:(a,b)∈Bx} where we allow ∞ and −∞. Clearly (c,d) covers ∪Bx. It suffice to show ∪Bx covers (c,d). Suppose ∃y∈(c,d) and y∈/∪Bx. This means ∪Bx has a hole and there must exists a pair of open interval in Bx that is disjoint, contradicting that all open intervals in Bx contains x(in that case no pair should be disjoint).
Now what’s left to show is (1) Only countable number of Bx′ is needed. (2) each Bx′ is countable. The later is obvious by construction. The former can be argued by countability of Q. Pick a q∈Q in one of the open interval of Bx′, this is always possible by density of rationals. Suppose uncountable Bx′ is needed to cover ∪B′′ then U=∪B′′ would contain uncountable number of rationals. This finishes the proof.
By definition, BR is the smallest σ-algebra containing T(B). Therefore the inclusion holds by construction.
We only need to show (b), (c), and (e) since (a) and (d) are generalized open
intervals and are actually shown by (5).
Case (b): Closed intervalsE2={[a,b]:a<b}
M(E2)⊆BR: Note that [a,b]=∩j=1∞(a−1/j,b+1/j)
is a countable intersection of open intervals, so E2⊂BR.
BR⊆M(E2): (a,b)=∪j=1∞[a+1/j,b−1/j]
is a countable union of closed intervals, so B⊂M(E2) and hence
BR=M(B)⊂M(E2).
Case (c): Half-open intervalsE3={(a,b]:a<b}
M(E3)⊆BR: (a,b]=(a,b)∪{b} where (a,b)∈BR
and {b}=∩j=1∞(b−1/j,b+1/j)∈BR.
BR⊆M(E3): (a,b)=∪j=1∞(a,b−1/j]
is a countable union of half-open intervals, so B⊂M(E3) and hence
BR⊂M(E3).
Case (e): Closed raysE7={[a,∞):a∈R}
M(E7)⊆BR: [a,∞)=∩j=1∞(a−1/j,∞)
is a countable intersection of open rays (generalized open intervals), so E7⊂BR.
BR⊆M(E7): (a,b)=(a,∞)∩(−∞,b) where
(a,∞)=∪j=1∞[a+1/j,∞) and (−∞,b)=R∖[b,∞) are in M(E7),
so B⊂M(E7) and hence BR⊂M(E7).
The later can be shown using (2). M(B) contains all countable unions of open intervals B while T(B) contains arbitrary union. (2) bridges the gap by claiming the arbitrary union can actually be replaced by countable union.
Stage 1 to 2: Create a notion of size on arbitrary sets A⊂P(X) by approximating them using “building blocks”(A∈E) which has a notion of size ∣⋅∣. This scarifices additivity and we instead of countable sub-additivity
Stage 2 to 3: Shrink the domain by restrict to a particular family M∣μ∗⊂P(X). This gives us countable additivity and μ is now a complete measure
So how do we actually construct measures no matter what set we are working on?(Though in this book we are really interested in just Rn). A general guidline is:
Find some elementary setE where premeasure is defined on the disjoint uniont of E.
Define the measure of arbitrary subset A∈P(X) as the the size of “smallest” cover of A using the elementary set:
More generally we can define an outer measure as follows:
We note that property (2),(3) are both derived properties of measure. So we can think the definition of outer measure as a relaxation of measure: take out countable additvity and adds back two derived property. In addition, We note that (15) obeys Definition 2
How do we then obtain measure from outer measure? We note that what outer measure lacks is finite additivity, so we can further ask, is there a collection of subset M⊂P(X) such that μ∗ is actually finitey additive? The answer is actually YES! However this seems rather arbitrary:
We call elements of Mμ∗-measureable. In plain English, this saying A can “split measure” arbitrary F⊂X by measuring the intersection and the complement separetly and add them together.
THe workflow (12) is already very promising except one key issue:
The next theorem prevents this by starting with an algebraA instead of just a plain family of sets E. The plain notion of size on E is replaced by the so-called premeasure.
(⟹) Suppose E is μ∗-measurable. Now by (1), for each n we can find An∈Aσ with E⊂An and μ∗(An)≤μ∗(E)+n1. The An need not be decreasing, so replace them by A~n:=⋂k=1nAk; since Aσ is closed under finite intersections (intersection distributes over the countable unions defining each Ak), A~n∈Aσ, and now A~n is a decreasing sequence with E⊂A~n⊂An, so still μ∗(E)≤μ∗(A~n)≤μ∗(An)≤μ∗(E)+n1. Define:
Combining with μ∗(B)=μ∗(E)<∞ and subtracting the finite common value μ∗(E) from both sides gives μ∗(B∖E)=0, as desired.
(⟸) Suppose there exists B∈Aσδ such that E⊂B and μ∗(B∖E)=0. Note any B∈Aσδ is μ∗-measurable since A⊂Mμ∗(by extension theorem).
We would like for all F⊂X
Suppose μ0 is σ-finite then ∃{Xn}, μ0(Xn)<∞ such that X=∪nXn. Now define En=Xn∩E, we can apply (2) to each En(There existss Bn∈Aσδ satisfying the property iff En∈M).
(⟹) Say we already have desired set Bn for each En (each Bn∈Aσδ, En⊂Bn, μ∗(Bn∖En)=0)[2]. Take the union B=∪nBn; it covers E since En⊂Bn and E=∪nEn. It also satisfies the null-excess property: since En⊂E we have Bn∖E⊂Bn∖En for each n, so B∖E=⋃n(Bn∖E)⊂⋃n(Bn∖En), and by countable subadditivity:
(⟸) Suppose there is such B for E (possibly of infinite outer-measure). Define En=Xn∩E as before, and now also Bn:=Xn∩B∈Aσδ (intersecting with Xn∈A preserves membership in Aσδ). Then En⊂Bn, and
Since μ∗(En)≤μ0(Xn)<∞, part (2) applies to En and gives En∈M. Now we want to show E∈M but this is trivial as M is a σ-algebra closed under countable union and E=∪nEn
(⟹) Suppose E is μ∗-measurable. Then so is Ec, and since X=E⊔Ec∈A, additivity gives μ0(X)=μ∗(X)=μ∗(E)+μ∗(Ec), i.e. μ∗(E)=μ∗(E).
(⟸) Suppose μ∗(E)+μ∗(Ec)=μ0(X)=μ∗(X)<∞. Fix ϵ>0; by Exercise 3 part (1), pick A,A′∈Aσ⊂Mμ∗ with E⊂A, Ec⊂A′, μ∗(A)≤μ∗(E)+ϵ, μ∗(A′)≤μ∗(Ec)+ϵ. Then A∪A′=X, so
Since A∖E⊂A∩A′, μ∗(A∖E)≤2ϵ. Taking ϵ=n1 gives An⊃E with μ∗(An∖E)≤n2; let B:=⋂nAn∈Mμ∗. Then E⊂B and μ∗(B∖E)≤μ∗(An∖E)→0, so μ∗(B∖E)=0.
This is exactly the hypothesis of the (⟸) direction of Exercise 3 part (2) (only measurability of B was used there, not B∈Aσδ), which concludes E is μ∗-measurable. As desired.
The following exercise is assumed everywhere in mathematics and is not directly related to outer measure. But they are invokded multiple times, for instance, in subadditivity of outer measure.
Denote s=supsn,t=suptn. By definition of supremum, we can pick N1,N2 such that sN1>s−ϵ/2 and tN2>t−ϵ/2. Let N=max(N1,N2); since sn,tn are non-decreasing, ∀n≥N we have sn≥sN1>s−ϵ/2 and tn≥tN2>t−ϵ/2, hence:
Taking supn on the left gives sup(sn+tn)≥s+t−ϵ=supsn+suptn−ϵ. As desired, since ϵ>0 was arbitrary. (2) then easily follows by taking the claim in (1) and then let
Now we have an algebra A where elements of the algebra A∈A has an elementary decomposition A={Ij} to h-intervals I=(aj,bj], which is equipped with a notion of size bj−aj. A natural way to define the notion of size for A is hence:
Let A=∪Aj,Aj=(aj,bj] be an arbitary, potentially infinite cover. Consider Aj′=(aj,bj+2jϵ), clearly [a,b]⊂∪Aj′. By compactness, we can pick a finite subcover:
where δjk≤ϵ/2jk. Denote ck=ajk,dk=bjk+δjk. We have [a,b]=⋃k=1n(ck,dk). Note since implies dn>b,cn<a.
Without loss of generality, we can assume dk+1>ck. Hence:
First we isolate the special case when c=0. In that case cE+d={d} and outer measure of singleton is 0 so the equality is trivial. Now we assume c=0.
we claim that every cover A=∪Aj for cE+d can be obtained by transforming a cover for E. Specifically, suppose A=⋃(aj,bj] is a cover for cE+d then
is a cover for E, furthermore cB+d=A. We consider the positive case first, the negative case follows similarily. Since for all e∈E, ce+d∈cE+d hence ∃(at,bt] such that ce+d∈(at,bt]. Hence e∈(cat−d,cbt−d]. Now
The set is open because it is a countable union of open balls. Threrefore its complement is closed and has measure ∞−ϵ=∞(by additivity of measure). It’s left to show that the complement is nowhere dense. We need (R∖Aϵ)∘=∅, since R∖Aϵ is closed it suffices to show R∖Aϵ has empty interior, i.e., contains no open interval. Suppose (a,b)⊂R∖Aϵ, then ∀j,Bϵ/2j+1o(qj)∩(a,b)=∅. But rationals are dense in R hence there must exists q∈(a,b),q∈Q, contradicts.
Strictly, Aσδ need not be closed under countable unions (only finite ones) — the analogous fact for Gδ sets in R fails: Q=⋃q{q} is a countable union of Gδ singletons yet is not itself Gδ. So B=∪nBn below should be read as living in Mμ∗ (a genuine σ-algebra), which is all that is actually used afterward.
Note that in definiting a notion of size μ0 on A∈A, we requires A to have a concrete representation ∪jIj. If the result is independent on
how we choose this representation(i.e. different elementary decomposition{Ij}), then this notion of size is indeed fundamentally correct. Otherwise if μ0 is dependent on how we choose representation, then it is not a credibe notion of size. Such “representational invariance” is called well-definedness in mathematics.