Continuous mapping theorem

This is an old revision of this page, as edited by Stpasha (talk | contribs) at 02:30, 13 September 2009 (References: +cats). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In probability theory, continuous mapping theorem states that continuous functions retain their limit-preserving properties in the scope of the convergence of random variables. A continuous function, in Heine’s definition, is such a function which maps convergent sequences into convergent sequences: if xn → x then g(xn) → g(x). The continuous mapping theorem states that this will also be true if we replace deterministic sequence {xn} with a sequence of random variables {Xn}, and the standard notion of convergence of real numbers “→” with one of the types of convergence of random variables.

This theorem was first proved by (Mann & Wald 1943), and therefore sometimes is called the Mann–Wald theorem.[1]

Statement

Let {Xn}, X be random elements defined on a metric space S. Suppose a function g: SS′ has the set of discontinuity points Dg such that P[XDg] = 0. Then [2][3][4]

  1.  
  2.  
  3.  

Proof

Convergence in distribution

Convergence in probability

Convergence almost surely

References

See also

Literature

  • Amemiya, Takeshi (1985). Advanced Econometrics. Cambridge, MA: Harvard University Press. ISBN 0674005600. {{cite book}}: Unknown parameter |lcc= ignored (help)
  • Billingsley, Patrick (1969). Convergence of Probability Measures. John Wiley & Sons. ISBN 0471072427.
  • Billingsley, Patrick (1999). Convergence of Probability Measures (2nd ed.). John Wiley & Sons. ISBN 0471197459.
  • Template:Cite article
  • van der Vaart, A. W. (1998). Asymptotic statistics. New York: Cambridge University Press. ISBN 9780521496032. {{cite book}}: Unknown parameter |lcc= ignored (help)CS1 maint: ref duplicates default (link)

Notes

  1. ^ Amemiya 1985, p. 88
  2. ^ van der Vaart 1998, Theorem 2.3
  3. ^ Billingsley 1969, p. 31, Corollary 1
  4. ^ Billingsley 1999, p. 21, Theorem 2.7