Proof of the Karatheodory's Theorem
📂Measure TheoryProof of the Karatheodory's Theorem
Definition
For all A⊂X, if the following equation holds, then E⊂X is said to satisfy the Caratheodory condition, or E is said to be μ∗-measurable.
μ∗(A)=μ∗(A∩E)+μ∗(A∩Ec)
μ∗ is an outer measure.
Theorem
Let L be the set that includes all E⊂X that satisfy the Caratheodory condition. Then, L is a σ-algebra. Also, μ∗ becomes a measure on L.
This is known as the Caratheodory theorem.
Explanation
If we say X=Rn, then L is called the Lebesgue σ-algebra of Rn. And, E is called the Lebesgue measurable set or simply measurable set of Rn. And at this time, the outer measure μ∗ is called the Lebesgue measure on Rn.
Proof
To show that μ∗ becomes a measure on L, it suffices to check if the following three conditions are met by definition.
Measure
(D1) μ∗(∅)=0
(D2) μ∗:L→[0,∞]
(D3) For distinct Ei⊂X, μ∗(i=1⨆∞Ei)=i=1∑∞μ∗(Ei)
However, this is trivially satisfied by the definition and properties of the outer measure.
To show that L is a σ-algebra, it suffices to check if the following conditions are met by definition.
σ-algebra
Let a set X be given. The collection E⊂P(X) of subsets of X that satisfies the following conditions is called a σ-algebra.
- (D1) ∅,X∈E
- (D2) E∈E⟹Ec∈E
- (D3) Ek∈E (∀k∈N)⟹⋃k=1∞Ek∈E
(D1)
By substituting E with ∅, and X, it’s easy to verify that it holds based on the Caratheodory condition.
(D2)
This trivially holds by the definition of the Caratheodory condition.
(D3)
Unlike the previous two conditions, this is not straightforward to verify. First, it will be shown that when E1 and E2 satisfy (def1), then E1∪E2 also satisfies (def1).
Part 1.
Since E1 satisfies (def1) by assumption, the following holds:
μ∗(A)=μ∗(A∩E1)+μ∗(A∩E1c)
Similarly, since E2 also satisfies (def1), the following holds:
μ∗(A)=μ∗(A∩E1)+μ∗(A∩E1c)=μ∗((A∩E1)∩E2)+μ∗((A∩E1)∩E2c)+μ∗((A∩E1c)∩E2)+μ∗((A∩E1c)∩E2c)
By the countable subadditivity of the outer measure, the following equation holds:
μ∗([A∩E1∩E2]∪[A∩E1∩E2c]∪[A∩E1c∩E2])≤μ∗(A∩E1∩E2)+μ∗(A∩E1∩E2c)+μ∗(A∩E1c∩E2)
Thus, the following holds:
≥===μ∗(A)μ∗([A∩E1∩E2]∪[A∩E1∩E2c]∪[A∩E1c∩E2])+μ∗(A∩E1c∩E2c) μ∗(A∩[(E1∩E2)∪(E1∩E2c)∪(E1c∩E2)])+μ∗(A∩E1c∩E2c) μ∗(A∩(E1∪E2))+μ∗(A∩E1c∩E2c) μ∗(A∩(E1∪E2))+μ∗(A∩(E1∪E2)c)
Therefore, when E1 and E2 satisfy (def1), E1∪E2 also satisfies (def1). By repeating this, it can be understood that any given N distinct Eis satisfying (def1) implies that ⨆i=1NEi also satisfies (def1).
Part 2.
The initial condition lacks the distinctness of each Ei, which is necessary for the proof, so a bit of trickery is needed. First, define each E~i as follows:
E~1E~2E~3E~4=E1=E2∩E~1c=E3∩(E~1∪E~2)c=E4∩(E~1∪E~2∪E~3)c⋮
Then, each of the E~is are disjoint, satisfy (def1), and the following holds:
i=1⨆∞E~i=i=1⨆∞Ei
This can be easily verified by direct calculation. Therefore, it can now be shown without loss of generality that when each of the E~is satisfies (def1), ⨆i=1∞E~i also satisfies (def1), completing the proof.
Part 3.
By the countable subadditivity, the following holds:
μ∗(A)≤μ∗(A∩(i=1⨆∞E~i))+μ∗(A∩(i=1⨆∞E~i)c)
Showing the opposite direction of inequality completes the proof. Since it was shown in Part 1. that it holds for N, the following holds:
μ∗(A)=μ∗(A∩(i=1⨆NE~i))+μ∗(A∩(i=1⨆NE~i)c)≥μ∗(A∩(i=1⨆NE~i))+μ∗(A∩(i=1⨆∞E~i)c)=i=1∑Nμ∗(A∩E~i)+μ∗(A∩(i=1⨆∞E~i)c)
This inequality holds for all N, so the following equation holds:
μ∗(A)≥i=1∑∞μ∗(A∩E~i)+μ∗(A∩(i=1⨆∞E~i)c)≥μ∗(A∩(i=1⨆∞E~i))+μ∗(A∩(i=1⨆∞E~i)c)
The second inequality holds by countable subadditivity.
■