Continuous mapping theorem
Probability theorem
- 3 min read
- 2 chapters
Related on Lably
Through Continuous function and Classification of discontinuities
This theorem was first proved by Henry Mann and Abraham Wald in 1943, and it is therefore sometimes called the Mann–Wald theorem. Meanwhile, Denis Sargan refers to it as the general transformation theorem.
Statement
Let {Xn}, X be random elements defined on a metric space S. Suppose a function g: S→S′ (where S′ is another metric space) has the set of discontinuity points Dg such that Pr[X ∈ Dg] = 0. Then
where the superscripts, "d", "p", and "a.s." denote convergence in distribution, convergence in probability, and almost sure convergence respectively.
Sign in to keep reading
One more chapter is free with a Lably account.
Proof
This proof has been adopted from (van der Vaart 1998, Theorem 2.3)
Spaces S and S′ are equipped with certain metrics. For simplicity we will denote both of these metrics using the |x − y| notation, even though the metrics may be arbitrary and not necessarily Euclidean.
Convergence in distribution
We will need a particular statement from the portmanteau theorem: that convergence in distribution is equivalent to
- for every bounded continuous functional f.
So it suffices to prove that for every bounded continuous functional f. For simplicity we assume g continuous. Note that is itself a bounded continuous functional. And so the claim follows from the statement above. The general case is slightly more technical.
Convergence in probability
Fix an arbitrary ε > 0. Then for any δ > 0 consider the set Bδ defined as
This is the set of continuity points x of the function g(·) for which it is possible to find, within the δ-neighborhood of x, a point which maps outside the ε-neighborhood of g(x). By definition of continuity, this set shrinks as δ goes to zero, so that limδ → 0Bδ = ∅.
Now suppose that |g(X) − g(Xn)| > ε. This implies that at least one of the following is true: either |X−Xn| ≥ δ, or X ∈ Dg, or X∈Bδ. In terms of probabilities this can be written as
On the right-hand side, the first term converges to zero as n → ∞ for any fixed δ, by the definition of convergence in probability of the sequence {Xn}. The second term converges to zero as δ → 0, since the set Bδ shrinks to an empty set. And the last term is identically equal to zero by assumption of the theorem. Therefore, the conclusion is that
which means that g(Xn) converges to g(X) in probability.
Note: The above proof treats as a Borel subset of , which is not clear in general. This can be circumvented easily as follows. By assumption, we have , where is the event "for all such that , we have ":Now, fix an arbitrary . Since the sequence is non-decreasing, we have , hence there exists such that . Finally, we can write
It follows that , which shows that as , since was arbitrary.
Almost sure convergence
By definition of the continuity of the function g(·),
at each point X(ω) where g(·) is continuous. Therefore,
because the intersection of two almost sure events is almost sure.
By definition, we conclude that g(Xn) converges to g(X) almost surely.

