(3): For every closed set F, there exists n→∞limsupPn(F)≤P(F)
(4): For every open set G, there exists P(G)≤n→∞liminfPn(G)
(5): For every A such that P(∂A)=0, there exists n→∞limPn(A)=P(A)
Description
Portmanteau is an English word meaning ‘made up of a variety of elements’ or ‘hybrid’. Translating this directly as a hybrid theorem is not very smooth, so traditionally, it is read similar to [폴ㅌ맨퉈] and translated as a hybrid theorem because it is difficult to guess the meaning by that alone. The hybrid theorem is actually generalizable not just to probability measures but also to finite measuresμ, and it provides an equivalent condition for weak convergence of measures, making it a very important theorem.
Proof
Strategy: To prove this, we introduce the following notation. We recommend reading the detailed explanation.
For elements x∈S and subsets A⊂S, and δ>0ρ(x,A):=inf{ρ(x,a):a∈A}
Aδ:={x∈S:ρ(x,A)<δ}
For some fixed F⊂Sfδ(x):==(1−ρ(x,F)/δ)+⎩⎨⎧11−ρ(x,F)/δ0,x∈F,x∈/F∧x∈Fδ,x∈/Fδ
fε(x):=(1−ρ(x,F)/ε)+
If fε is defined as above, then fε is bounded and uniformly continuous. Also, for all ε>0, there exists IF(x)≤fε(x)≤IFε(x), so
∫SIFdPn≤∫SfεdPn≤∫IFεdPn
Where Pn(F)=∫FdPn=∫S1FdPn, thus
Pn(F)≤∫SfεdPn
Taking both sides by n→∞limsup, since fε was bounded and uniformly continuous, according to (2)n→∞limsupPn(F)≤=≤n→∞limsup∫SfεdPn∫SfεdPP(Fε)
Taking both sides by ε→0lim, by the continuity from above of measuresn→∞limsupPn(F)=≤=ε→0limn→∞limsupPn(F)ε→0limP(Fε)P(F)
If F is a closed set, then because F=Fn→∞limsupPn(F)≤P(F)
Part 3. (3)⟺(4)
Let G:=Fc, then G is an open set
⟺⟺⟺⟺n→∞limsupPn(F)≤P(F)−P(F)≤−n→∞limsupPn(F)1−P(F)≤1−n→∞limsupPn(F)P(G)≤n→∞liminf[1−Pn(F)]P(G)≤n→∞liminfPn(G)
A∘⊂A⊂AHere, the interior A∘ is the largest open subset of A, and the closure A is the smallest closed superset of A. Also, the boundary ∂A=A∖A∘ of A is naturally disjoint from A∘.
According to (3)n→∞limsupPn(A)≤n→∞limsupPn(A)≤P(A)
According to (4)P(A∘)≤n→∞liminfPn(A∘)≤n→∞liminfPn(A)
Since P(∂A)=0, P(A∘)=P(A)=P(A) holds,
P(A)=P(A∘)≤n→∞liminfPn(A)≤n→∞limsupPn(A)≤P(A)=P(A)
Thus,
n→∞limPn(A)=P(A)
Part 5. (5)⟹(1)
Let g∈Cb(S), in other words, g be a bounded and continuous function as defined in S. Let us define ν for A∈B(S) as follows.
ν(A):=P(g−1(A))
Since g is bounded, for all x∈S, we can choose a and b that satisfy a≤g(x)≤b. Here,
D:={α:ν({α})=0}
If we consider
Dc={α:ν({α})>0}=n=1⋃∞{α:ν({α})>n1}
If a natural number n∈N is fixed, {α:ν({α})>n1} must be a finite set because ν(R)<∞. If it is not a finite set, it means that there are infinitely many α that satisfy ν({α})>n1, contradicting ν(R)<∞. Therefore, Dc is a countable union of finite sets, and thus, there can be at most countably many such α∈[a,b] that satisfy ν({α})>0.
Now, we can choose t0,⋯,tm that satisfies the following three conditions:
(i): a=t0<t1<⋯<tm=b
(ii): ν({ti})=0
(iii): ti−ti−1<ε
Upon setting as Ai=g−1([ti−1,ti)), Ai∈B(S) holds, and i=1⋃mAi=S. Meanwhile, since the preimage of a continuous function preserves openness and closedness, g−1((ti−1,ti)) is an open set in S, and g−1([ti−1,ti]) is a closed set in S. Also, the interior Ai∘ of Ai is its largest open subset, and the closure Ai is its smallest closed superset, so
g−1((ti−1,ti))⊂Ai∘⊂Ai⊂Ai⊂g−1([ti−1,ti])
Whereas in condition (ii), since it was ν({ti})=0 hence,
P(Ai∘)=P(Ai)=P(Ai)
This means P(∂Ai)=0, so according to the assumption (5), n→∞limPn(Ai)=P(Ai) holds.
h(x):=i=1∑mti−11Ai(x)
Now, let’s define a new function h as above. h becomes a simple function with m finite values, and from condition (iii), we can see that h(x)≤g(x)≤h(x)+ε.
∣Pn(g)−P(g)∣==≤≤≤∫SgdPn−∫SgdP∫S(g−h)dPn+∫ShdPn−∫ShdP+∫S(h−g)dP∫S(g−h)dPn+∫ShdPn−∫ShdP+∫S(h−g)dPε+i=1∑mti−1∫S1AiPn−i=1∑mti−1∫S1AiP+ε2ε+i=1∑mti−1[Pn(Ai)−P(Ai)]
Meanwhile, since n→∞limPn(Ai)=P(Ai), when n→∞, Pn(g)→P(g) holds. Since g is bounded and continuous, by the definition of weak convergence, Pn→WP holds.