Sheet 7

Prof. Leif Döring, Felix Benning
††course: Wahrscheinlichkeitstheorie 1††semester: FSS 2022††tutorialDate: 04.04.2022††dueDate: 10:15 in the exercise on Monday 04.04.2022
Exercise 1 (Portmonteau).

True of false? Justify your answer by proving or disproving the statement. Let (μn,n≥1),μ be finite measures (not necessarily probability measure) on ℝ.

  1. (i)

    If μn→μ weakly, then limn→∞⁡μn⁢(ℝ)=μ⁢(ℝ).

    Solution.

    True. If μn→(w)μ, then ∫ℝ1⁢dμn→∫ℝ1⁢dμ. Alternatively: ℝ is open and closed. ∎

  2. (ii)

    If μn→μ weakly, then limn→∞⁡μn⁢((-∞,x])=μ⁢((-∞,x]) for all x∈ℝ.

    Solution.

    False. Let xn↓x, then we have δxn→δx by Sheet 6, Exercise 4(i). But for all n∈ℕ we have δxn⁢((-∞,x])=0 while δx⁢((-∞,x])=1. ∎

  3. (iii)

    If limn→∞⁡μn⁢((-∞,x])=μ⁢((-∞,x]) for all x∈ℝ, then μn→μ weakly.

    Solution.

    False. Let μn⁢(A)=∫nn+1𝟙A⁢dx and μ⁢(A)≡0. Then we have μn⁢(ℝ)=1 for all n but μ⁢(ℝ)=0. But we also have μn⁢((-∞,x])→0=μ⁢((-∞,x]).

    Here we abused the fact that tightness was not a given. Since we also have that any sequence which converges would converge to μ, as (-∞,x] is a generator and uniquely determines the limit by Dynkin argumnets, we would get convergence with tightness (cf. Prohorov and Prop. 7.2.7) ∎

  4. (iv)

    Suppose that μn,μ∈ℳ1⁢(ℝ). If limn→∞⁡μn⁢((-∞,x])=μ⁢((-∞,x]) for all x∈ℝ, then μn→μ weakly.

    Solution.

    True. Convergence of cumulative distribution functions implies convergence of measures (cf. 4.5.9). ∎

  5. (v)

    Let f be a measurable bounded function on ℝ which is μ-a.e. continuous. If μn→μ weakly, then ∫ℝf⁢dμn→∫ℝf⁢dμ.

    Solution.

    Either we use the general continuous mapping theorem for almost surely continuous f (comment after Theorem 7.2.5). I.e. μn∘f→μ∘f as n goes to infinity. Then as f is bounded there exists B such that |f⁢(x)|≤B for all x so using the transformation theorem (Thm. 3.1.16) we get

    ∫ℝf⁢dμn =∫ℝ(f⁢(x)⁢𝟙|f⁢(x)|≤Bε)⁢dμn⁢(x)
    =∫ℝx⁢𝟙|x|≤Bε⁢(μn∘f)⁢(d⁢x)→∫ℝx⁢𝟙|x|≤Bε⁢(μ∘f)⁢(d⁢x)=∫ℝf⁢dμ

    Or to do it properly (because this general continuous mapping theorem is no longer part of the lecture), we can use the Skorokhod trick from Stochastics 1. I.e. we use the cumulative distribution functions Fn,F for μn,μ and U∼𝒰⁢[0,1] to get

    Xn:=Fn-1(U)→F-1(U)=:X a.s.

    with Xn∼μn and X∼μ. Since f is continuous μ-a.e. we get f⁢(Xn)→f⁢(X) a.s. and therefore in distribution, which means that μn∘f→μ∘f. We finish with the same argument as before. ∎

Exercise 2 (Tightness).

Let (μn,n≥1) be finite measures on ℝ. Show that the family is tight, if and only if there exists a non-negative measurable function f with lim|x|→∞⁡f⁢(x)=∞, such that

supn≥1⁡∫ℝf⁢dμn<∞.
Solution.
\enquote

⇐: Take some ϵ>0, and define for such an f

C:=supn≥1⁡∫ℝf⁢dμn<∞.

Since f⁢(x)→∞ we know there exists M such that f⁢(x)>Cε for all |x|>M. Therefore for all n

μn⁢([-M,M]c)⋅Cε≤∫ℝf⁢dμn≤C

Hence, supn≥1⁡μn⁢([-M,M]c)≤ε.

\enquote

⇒: Suppose that μn is tight. Then for all j>0 exists Kj, such that supn≥1⁡μn⁢(ℝ∖Kj)<1j3. Without loss of generality Kj=[-kj,kj] with 0≤k1≤…⁢kj and we define f⁢(x)=j for all x∈Kj+1∖Kj. This implies f⁢(x)→∞ for |x|→∞ and

∫ℝf⁢dμn =∑j≥1j⋅μn⁢(Kj+1∖Kj)
≤∑j≥1j⋅μn⁢(ℝ∖Kj)
≤∑j≥1j⁢1j3<∞∎
Exercise 3 (Totally Bounded).

Let (E,d) be a metric space and A⊂E. Compare Lemma 4.3.4.  with this exercise.

  1. (i)

    Suppose that, for all ϵ>0, there exists finitely many points x1,…⁢xn∈E (not necessarily in A) such that A⊆⋃k=1n(Bϵ,k). Show that A is totally bounded.

    Solution.

    For all ε>0 we have x1,…,xn∈E such that

    A⊆⋃k=1nB⁢(xk,ε2).

    Take yk∈B⁢(xk,ε2)∩A, (if it was empty it was not needed to cover A so it could be discarded). Then we have B⁢(xk,ε2)⊆B⁢(yk,ε) because for any z in the first set we have

    d⁢(z,yk)≤d⁢(z,xk)+d⁢(xk,yk)≤ε

    which finally implies

    A ⊆⋃k=1nB⁢(xk,ε2)⊆⋃k=1nB⁢(yk,ε).∎
  2. (ii)

    Let E=ℚ, endowed with the usual Euclidean metric. Show that, A=ℚ∩(0,1) is totally bounded, but not relatively compact. Why is this not a contradiction to Sheet 6, Exercise 2(iv)?

    Solution.

    Since [0,1] is compact in ℝ it is also totally bounded. Therefore A⊆[0,1] is totally bounded as a subset, because the epsilon coverings still contain all the previous elements. We just have to select new mid points, but this is no issue because ℚ is dense and we can start with ε/2.

    The closure of A in ℚ is A∩[0,1], which is not complete. There are Cauchy sequences which do not converge in A and therefore have no converging subseqence. It can therefore not be compact.

    It is not a contradiction to Sheet 6, Exercise 2(iv) because the space E is not complete. In other words: compactness is totally boundedness + completeness. ∎

Exercise 4 (Weak Convergence of Dirac Measures).

Let xn∈E, where (E,d) is a separable and complete metric space.

  1. (i)

    Prove that δxn is tight, if and only if (xn)n∈ℕ is totally bounded in E.

    Solution.

    Assume that δxn are tight, then there exists a compact set K, such that

    supn∈ℕ⁡δxn⁢(Kc)<12

    As the Dirac measure can only be zero or one, this implies

    supn∈ℕ⁡δxn⁢(Kc)=0

    and therefore xn∈K for all n∈ℕ. But K is totally bounded as a compact set, therefore the (xn)n∈ℕ are totally bounded.

    For the opposite direction note that the closure of a totally bounded set is still totally bounded by Sheet 6, Exercise 2(iv). So the closure K is compact and includes all xn. Therefore

    supn∈ℕ⁡δxn⁢(Kc)=0,

    and the dirac measures are tight. ∎

  2. (ii)

    For E=ℝ suppose that δxn converges weakly to some μ. Show that, there exists x∈ℝ, such that xn→x and therefore μ=δx.

    Hint.

    Assume you could use the identity as a test function in weak convergence. While this does not work (the identity is not bounded) it provides some intuition how the actual proof would work. Then try an invertible sigmoid function instead (e.g. f⁢(x)=11+e-x)

    Solution.

    Let Xn∼δxn and X∼μ. Then we have for f⁢(x)=11+e-x∈Cb⁢(ℝ)

    limn→∞f⁢(xn)⏟=⁣:yn=limn→∞𝔼[f(Xn)]=𝔼[f(X)]=:y

    Now if y=1, then xn=f-1⁢(yn)→∞. Or for y=0 xn→-∞ respectively. Both would imply by (i) that δxn is not tight. But this would contradict Theorem 7.3.4. Therefore y∈(0,1). And by continuity of f-1 on (0,1), we can define

    limn→∞xn=limn→∞f-1(yn)=f-1(y)=:x.

    By Sheet 6, Exercise 5 (i), we therefore have δxn→δx weakly which implies δx=μ. ∎

Exercise 5 (Arzelà-Ascoli).

We are going to prove the Arzelà-Ascoli theorem in this exercise. While it is usually formulated with (relative) compactness, we have already seen this is equivalent to total boundedness in a complete space.

Definition (Equicontinuity).

Let (E,d),(F,d) be metric spaces and ℱ a set of functions from E to F. Then ℱ is equicontinuous iff

∀ε>0,∃δ>0,∀f∈ℱ:d⁢(x,y)<δ⟹d⁢(f⁢(x),f⁢(y))<ε.

In other words: δ is independent of f∈ℱ (and also of x,y, i.e. we also have uniform continuity).

  1. (i)

    Prove that any finite subset of C⁢(K) for a compact space K is equicontinuous.

    Solution.

    Let {f1,…,fd}⊆C⁢(K). As any continuous function is uniformly continuous on a compact set, we have

    ∀ϵ>0,∀i∈{1,…,d},∃δi>0:d⁢(x,y)<δi⟹d⁢(fi⁢(x),fi⁢(y))<ϵ

    With δ:=mini=1,…,d⁡δi we get equicontinuity. ∎

  2. (ii)

    Prove that total boundedness of a subset of (C(K),∥⋅∥∞) implies equicontinuity.

    Solution.

    Let ℱ⊆C⁢(K) be a totally bounded set and choose some ϵ>0. Then we have by total boundedness f1,…,fd such that for all f∈ℱ exists an fi with

    ∥f-fi∥∞<ϵ4.

    And since the f1,…,fd are equicontinuous by (i), we can find some δ>0, such that

    d⁢(x,y)<δ⟹|fi⁢(x)-fi⁢(y)|<ϵ2 ∀i=1,…,d

    Putting things together we have for all f∈ℱ, all x,y∈K with d⁢(x,y)<δ

    |f⁢(x)-f⁢(y)| ≤|f⁢(x)-fi⁢(x)|⏟≤∥f-fi∥∞⁣≤ϵ4+|fi⁢(x)-fi⁢(y)|⏟≤ϵ2+|fi⁢(y)-f⁢(y)|⏟≤∥f-fi∥∞⁣≤ϵ4
    ≤ϵ.∎
  3. (iii)

    Let ℱ⊆C⁢(K) be a pointwise bounded set, i.e.

    ∀x∈K,∃M⁢(x)>0:|f⁢(x)|<M⁢(x) ∀f∈ℱ.

    Prove that for any finite set {x1,…,xd}⊆K, the set

    Φ={(f⁢(x1),…,f⁢(xd)):f∈ℱ}

    is totally bounded.

    Solution.

    Φ is bounded in (ℝd,∥⋅∥∞) by maxi=1d⁡M⁢(xi). Therefore it is totally bounded as this is equivalent on ℝd. ∎

  4. (iv)

    Prove that pointwise boundedness and equicontinuity of ℱ⊆C⁢(K) imply total boundedness (with regard to the sup-norm ∥⋅∥∞).

    Hint.

    Use equicontinuity to extend (iii) to all points. Do not forget that K is totally bounded!

    Solution.

    For a given ϵ>0 we want to find an ϵ covering. Since ℱ is equicontinuous, we can select δ>0, such that for all d⁢(x,y)<δ we have

    |f⁢(x)-f⁢(y)|≤ϵ4 ∀f∈ℱ. (1)

    Since K is totally bounded, we can find a δ covering, i.e. there exist x1,…,xd, such that for all x∈K there exists k with

    d⁢(x,xk)≤δ. (2)

    Due to total boundedness of Φ by (iii) there exist f1,…,fm such that for any ϕ⁢(f)∈Φ we can find i with

    ∥ϕ⁢(f)-(fi⁢(x1),…,fi⁢(xd))⏟=⁣:ϕ⁢(fi)∥∞<ϵ2. (3)

    So take any f∈ℱ and choose fi such that (3) is satisfied. Then for all x∈K there exists an xk by (2) such that d⁢(x,xk)<δ and hence

    |f⁢(x)-fi⁢(x)|≤|f⁢(x)-f⁢(xk)|⏟≤(⁢1⁢)ϵ4+|f⁢(xk)-fi⁢(xk)|⏟≤∥ϕ⁢(f)-ϕ⁢(fi)∥∞⁣≤ϵ2+|fi⁢(xk)-fi⁢(x)|⏟≤(⁢1⁢)ϵ4

    As x was arbitrary we have

    ∥f-fi∥∞≤ϵ.

    Therefore f1,…,fm are an ϵ covering of ℱ, proving its total boundedness. ∎

Putting (ii) and (iv) together we therefore have

Theorem (Arzelà-Ascoli).

Let K⊆E be totally bounded in a metric space (E,d). A set of continuous functions mapping to ℝ, ℱ⊆C⁢(K), is totally bounded with regard to the sup-norm iff it is pointwise bounded and equicontinuous.

  1. (v)

    Deduce that 𝒫:={x↦xn:n∈ℕ}⊆C⁢([0,1]) is bounded but not totally bounded.

    Solution.

    Since p⁢(x)∈[0,1] for all p∈𝒫, the set is bounded. To show that it is not totally bounded, we will show it is not equicontinuous. Take any ϵ>0 and choose some δ>0. Then there exists a polynomial such that

    |p⁢(1)-p⁢(1-δ)|=1-(1-δ)n>ϵ

    for some n∈ℕ. Therefore the set 𝒫 can not be equicontinuous. ∎