Exterior Measure
📂Measure TheoryExterior Measure
Definition
Given E⊂R, {In∈I ∣ n∈N}, {En∈P(R) ∣ n∈N}, we define the function m∗(E):=infZE as an Outer Measure.
Fundamental Properties
The outer measure has the following properties:
- [1] Generalization of Length: I∈I⟹m∗(I)=l(I)
- [2] Non-Negativity: N∈N⟺m∗(N)=0
- [3] Monotonicity: E1⊂E2⟹m∗(E1)≤m∗(E2)
- [4] Invariance under Transformation: t∈R⟹m∗(E)=m∗(E+t)
- [5] Countable Subadditivity: m∗(n=1⋃∞En)≤n=1∑∞m∗(En)
Explanation
Since the elements of ZE sum up the distances, it is evident that ZE is bounded below and the existence of infZE is trivial. The condition requires satisfaction of E⊂n=1⋃∞In, and choosing the smallest inf can be thought of as ’narrowing down from the outside.’ Therefore, the outer measure is also referred to as the (Lebesgue) Exterior Measure, and this naming is considered to be valid.
As can be guessed from property [1], the outer measure is a concept devised for generalizing ’length.’ Naturally, it should cover the lengths we have intuitively and conventionally used. In this sense, properties [2]~[5] are obligatory, and without them, it could hardly be called a generalization.
Particularly in [5], it mirrors the triangle inequality of norms with the difference that the number of terms is countably infinite. Common sensically, if for all i=j and when Ei∩Ej=∅,
m∗(n=1⋃∞En)=n=1∑∞m∗(En)
holds, i.e., if m∗(n=1⨆∞En)=n=1∑∞m∗(En) is true, then the generalization of length can be considered successful. (Here, ⨆ denotes the symbol for the union of mutually disjoint sets.)
Limitations of the Outer Measure
The issue is even with such strong conditions set, there’s an “abnormal” counterexample that fails to satisfy the equation. To satisfy this equality, mathematicians, including Lebesgue, have sought out new conditions.
Counterexample
For all i=j, the following does not always hold:
Ei∩Ej=∅⟹m∗(n=1⨆∞En)=n=1∑∞m∗(En)
Disproof
Providing a counterexample for Ei∩Ej=∅⟹m∗(n=1⨆∞En)=n=1∑∞m∗(En) is sufficient.
Defining the relation where if x,y∈[0,1] and y−x∈Q, then x∼y, we can easily show that ∼ is an equivalence relation. ∼ determines the equivalence class Aα, and since [0,1] is uncountable, for all α∈[0,1], an Aα exists, making Aα uncountably many. Meanwhile, each Aα is a countable set due to x∈Aα and q∈Q∩[0,1] being true for x−(x−q)=q∈Q.
Now, consider the set E gathered by picking one element from all Aα. The construction of such a set E is guaranteed by the Axiom of Choice.
Then for any given qn∈Q∩[0,1], we can define En:=E+qn. Assuming z∈Ei∩Ej,
aα+qi=z=aβ+qjaα−aβ=qj−qi∈Q
implies aα−aβ∈Q, and means aα and aβ belong to some Aλ simultaneously. However, since E includes only one element from each Aα, this is a contradiction, and thus for i=j, Ei∩Ej=∅ must hold.
Since [0,1]⊂n=1⨆∞En⊂[−1,2], by [3] Monotonicity,
m∗[0,1]≤m∗(n=1⨆∞En)≤m∗[−1,2]
If we assume m∗(n=1⨆∞En)=n=1∑∞m∗(En),
1≤n=1∑∞m∗(En)≤3
By [4] Invariance under Transformation, since m∗(En)=m∗(E+qn)=m∗(E),
1≤n=1∑∞m∗(En)=m∗(E)+m∗(E)+⋯≤3
For 1≤n=1∑∞m∗(E) to hold, n=1∑∞m∗(E)=∞ must, and for n=1∑∞m∗(E)≤3 to occur, n=1∑∞m∗(E)=0 must. Satisfying both conditions simultaneously is impossible, therefore,
m∗(n=1⨆∞En)=n=1∑∞m∗(En)
■
It’s not just the counterexample itself, but the fact that a brain capable of conceiving such a counterexample exists in the world is even more shocking. If you’ve discovered a counterexample that’s not similar and is original, it’s recommended to visit either a psychiatric hospital or graduate school.