proof of Choquet’s capacitability theorem
Let (X,ℱ) be a paved space such that ℱ is closed under finite unions and finite intersections, and let I be an ℱ-capacity (http://planetmath.org/ChoquetCapacity). We prove the capacitability theorem, which states that all ℱ-analytic (http://planetmath.org/AnalyticSet2) sets are (ℱ,I)-capacitable (http://planetmath.org/ChoquetCapacity). The idea is to deduce it from the following special case.
Lemma.
With the above notation, every set in Fσδ is (F,I)-capacitable.
Recall that ℱσδ is the collection of countable
intersections of countable unions in ℱ and, since countable unions and intersections of analytic sets are analytic, all such sets are analytic. According to the capacitability theorem they should then be capacitable, and the lemma is indeed a special case.
Supposing that the lemma is true, then the capacitability theorem can be deduced as follows. For an ℱ-analytic set A⊆X, there is a compact paved space (http://planetmath.org/PavedSpace) (K,𝒦) and S∈(ℱ×𝒦)σδ such that A=πX(S), where πX is the projection map from X×K to X. Letting 𝒢 be the closure under finite unions and finite intersections of the paving ℱ×𝒦, then the composition
I∘πX is a 𝒢-capacity, and the projection of any (𝒢,I∘πX)-capacitable set onto X is itself (ℱ,I)-capacitable (see extending a capacity to a Cartesian product (http://planetmath.org/ExtendingACapacityToACartesianProduct)). In particular, S∈𝒢σδ so, by the lemma, is (𝒢,I∘πX)-capacitable. Therefore, A=πX(S) is (ℱ,I)-capacitable. It only remains to prove the lemma.
Proof of lemma.
If S∈ℱσδ then there exists Sm,n∈ℱ such that
S=⋂n⋃mSm,n. |
For any positive integers m1,m2,…,mk let us write
S(m1,m2,…,mk)≡(⋂n≤k⋃m≤mnSm,n)⋂(⋂n>k⋃mSm,n). |
In particular, S()=S and, I(S())=I(S). For any ϵ>0 and k∈ℕ suppose that we have chosen positive integers m1,…,mk-1 such that I(S(m1,…,mk-1))>I(S)-ϵ. Since I is a capacity and S(m1,…,mk) increases to S(m1,…,mk-1) as mk increases to infinity,
I(S(m1,…,mk))→I(S(m1,…,mk-1)) |
as mk tends to infinity. So, by choosing mk large enough, we have
I(S(m1,…,mk))>I(S)-ϵ. |
Then, by induction, we can find an infinite
sequence m1,m2,… such that this inequality holds for every k.
Setting
Ak≡⋂n≤k⋃m≤mnSm,n∈ℱ, | ||
A≡⋂n⋃m≤mnSm,n=⋂kAk∈ℱδ, |
then A⊆S. Furthermore, Ak contains S(m1,…,mk) and decreases to A as k tends to infinity. As I is an ℱ-capacity this gives
I(A)=lim |
So is -capacitable, as required. ∎
Title | proof of Choquet’s capacitability theorem |
---|---|
Canonical name | ProofOfChoquetsCapacitabilityTheorem |
Date of creation | 2013-03-22 18:47:51 |
Last modified on | 2013-03-22 18:47:51 |
Owner | gel (22282) |
Last modified by | gel (22282) |
Numerical id | 4 |
Author | gel (22282) |
Entry type | Proof |
Classification | msc 28A05 |
Classification | msc 28A12 |