Sheet 6

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

Consider a metric space (E,d). For xE and BE, define

d(x,B):=inf{d(x,y):yB}.
  1. (i)

    If d(x,B)=0, then xB¯, the closure of B.

    Solution.

    Assume that xB¯c. By definition

    B¯=AB closedA

    we have

    xB¯c=AB closedAc=OBc openO.

    So by the definition of open sets, there exists ϵ>0, such that Bϵ(x)OBc for some open set O. So we have for any yB, d(x,y)>ϵ. Therefore d(x,B)>ϵ>0. So for all d(x,B)=0 we necessarily have xB¯. ∎

  2. (ii)

    Suppose that B. Prove that

    |d(x,B)-d(y,B)|d(x,y).

    This is to say, the function xd(x,B) is 1-Lipschitz.

    Solution.

    To remove the infimum choose some ε>0. Then we can choose zB such that we are ε-close to the infimum

    d(y,z)d(y,B)+ε-d(y,B)ε-d(y,z).

    For zB we always have d(x,B)d(x,z). Together this results in

    d(x,B)-d(y,B) d(x,z)-d(y,z)+ε
    Δd(x,y)+ε.

    Using that ε was arbitrary and symmetry of x,y we conclude

    |d(x,B)-d(y,B)| d(x,y)
  3. (iii)

    Let AE be closed. Show that, for any ϵ>0, the function

    fAϵ(x)=(1-d(x,A)/ϵ)+

    satisfies the following properties:

    • xA, fAϵ(x)=1

      Solution.

      For xA=A¯ we have by (i) d(x,A)=0 and thus fAε(x)=1. ∎

    • if d(x,A)ϵ then fAϵ(x)=0,

      Solution.

      if d(x,A)ϵ, then by definition

      fAε(x) =(1-d(x,A))ε0)+=0.
    • fAϵ𝟙A pointwise for ε0,

      Solution.

      For all xA¯=A we have

      fAε(x)=1=𝟙A

      For all xAc we have by (i) d(x,A)>0. Therefore there exists εd(x,A) such that

      fAε(x) =0=𝟙A.
    • fAϵ1

      Solution.

      Follows from positiveness of metrics d(x,B)0 and ε>0. ∎

    • fAϵLip1/ϵ(E) and fAϵCb(E)

      Solution.

      We know from (ii) that g1:xd(x,A) is 1-Lipschitz. The same is true for g3:x(1-x)+. Because g2:xxε is 1ε-Lipschitz we have by repeated application of the definition that

      fAϵ=g3g2g1

      is 1ε-Lipschitz. fAεCb(E) now follows from the previous statement. ∎

    • Why do we have to assume A to be closed?

      Solution.

      We would otherwise have fAϵ𝟙A¯, because d(x,A)=d(x,A¯). ∎

Exercise 2 (Totally Bounded Spaces).
  1. (i)

    Show that totally bounded sets are always bounded.

    Solution.

    Let AE be totally bounded, where (E,d) is a metric space. By definition there are x1,,xnA such that

    Ak=1nBϵ(xk).

    Choose some xA and define m:=maxk=1,,nd(x,xk). Then for all yA we have some k such that yBϵ(xk) and therefore

    d(x,y)d(x,xk)+d(y,xk)ϵ+m

    This implies ABm+ϵ(x). Therefore A is bounded. ∎

  2. (ii)

    Prove that total boundedness and boundedness are equivalent on d for any metric induced by a norm.

    Solution.

    As the other statement holds in general, we only need to prove boundedness implies total boundedness. Without loss of generality we are going to use the sup-norm (by norm equivalence boundedness in one implies the other). And total boundedness in the sup-norm can be converted back to any other norm with norm equivalence using smaller epsilon.

    Assume there is some bounded set ABm(x) with m>0. Using m~=m+d(x,0) we can assume without loss of generality that x=0. By selecting the finite set

    {x1,,xn}:={(k1ϵ,,kdϵ)d:k1,,kd{-mϵ,,mϵ}}

    we get

    Ak=1nBϵ(xk).

    Because for any yA we have

    my=supi=1,,d|y(i)|,

    and for every i there is k^i{-mϵ,,mϵ} such that |y(i)-k^iϵ|ϵ. Therefore

    y Bϵ((k^1ϵ,,k^dϵ)).
  3. (iii)

    Prove that no infinite set is totally bounded in the discrete metric

    d(x,y)={0x=y1xy.
    Solution.

    Assume A is totally bounded and let x1,,xn be the points in the definition for ϵ=12. Then we have

    Ak=1nB12(xk)=k=1n{xk}={x1,,xn}

    Therefore A is finite. ∎

  4. (iv)

    Prove that the closure of a totally bounded set is totally bounded.

    Remark.

    In a complete metric space totally bounded is therefore by Lemma 7.1.8 equivalent to relatively compact.

    Solution.

    Let A be totally bounded, and select ϵ>0. Because

    Ak=1nBϵ2(xk)

    for some x1,,xnA, we have with M1M2 implies M¯1M¯2

    A¯k=1nBϵ2(xk)¯(*)k=1nBϵ2(xk)¯k=1nBϵ(xk)

    where (*) is due to the fact that finite unions of closed sets are closed and the closure is the smallest closed set which contains the original. ∎

Exercise 3 (Non-separable Space).

Consider endowed with the Lebesgue measure λ. Let L be the space of measurable functions that are bounded almost everywhere, with the essential supremum of its absolute value as a norm: for any measurable function f,

f=inf{C0:λ(f>C)=0}.

Show that the metric space L (with metric induced by the norm ) is not separable.

Hint.

consider all the indicator functions 𝟙[0,r), r>0

Solution.

The set of indicator functions I={𝟙[0,r):r>0} is a subset of L and for any r1r2 (without loss of generality <) we have

𝟙[0,r2)-𝟙[0,r1)=𝟙[r1,r2)=1.

So we have an uncountable set of functions which are all at distance 1 to each other. This rules out separability. Because if we had

ILnBε(fn),

we could find r1r2 with 𝟙[0,r1),𝟙[0,r2)Bε(fn), since I is uncountable and the number of fn is just countable. But then

1=𝟙[0,r1)-𝟙[0,r2)𝟙[0,r1)-fn+fn-𝟙[0,r2)2ε

which is a contradiction for small epsilon. ∎

Exercise 4 (Weak Limits).

Find the weak limit, if exists, of the following sequence.

  1. (i)

    Assume xnx in some metric space (E,d). Prove that δxnδx.

    Solution.

    We have for any fCb(E) by continuity

    fdδxn =f(xn)f(x)=fdδx.
  2. (ii)

    n=𝒩(0,1/n), the normal distribution.

    Hint.

    What does weak convergence have to do with random variables?

    Solution.

    Let Xnn, then

    𝔼[|Xn-0|2]=Var(Xn)=1n0

    therefore Xn0 in L2. This implies convergence in distribution, i.e.

    𝔼[f(Xn)]𝔼[f(0)]

    for all fCb. Therefore we have nδ0 weakly. ∎

Exercise 5 (Borel σ-Algebra).

Let (E,d) be a metric space with Borel σ-Algebra

(E):=σ({OE:O open)}
  1. (i)

    Assume there exists a countable base π of the topology τ of E. Prove that σ(π)=(E).

    Solution.

    For any set Oτ we have O=nOn with Onπ. This implies Oσ(π) and therefore τσ(π). But since πτ we have

    (E) =σ(τ)=σ(π).
  2. (ii)

    Assume that E is separable (has a countable dense subset A). Prove that

    π:={Bq(x):xA,q}

    is a (countable) base of τ.

    Remark.

    In case of , this base π is the set of all intervals with rational endpoints.

    Hint.

    {Bπ:BO}=O

    Solution.

    Let Oτ. We claim that

    U:={Bπ:BO}=O.

    By definition UO holds. So consider yO. Since O is open, there exists an ϵ>0 (without loss of generality in ) such that Bϵ(y)O. Since A is dense, there exists xA with d(x,y)<ϵ2 (otherwise Bϵ2(y)A¯c=Ec=). This implies

    yBϵ2(x)πBϵ(y)O.

    Since y was arbitrary we have UO. ∎

  3. (iii)

    Prove that σ({Bϵ(x),xE,ϵ>0})=(E) if E is separable.

    Solution.

    Using π from (ii), we have

    (E) =(i)σ(π)σ({Bϵ(x),xE,ϵ>0})(E).