Math 2.0

Probability theory and stochastic processes Modes of convergence Theorem

Skorokhod's representation theorem

Builds on Metric spaceSeparable spaceProbability measureAlmost sure convergenceQuantile function

Statement

Let SS be a separable metric space with its Borel σ-algebra. Let μ,μ1,μ2,…\mu, \mu_1, \mu_2, \dots be probability measures on SS such that μn\mu_n converges weakly to μ\mu. Then there are a probability space (Ω,ℱ,P)(\Omega, \mathcal{F}, P) and random variables X,X1,X2,…X, X_1, X_2, \dots on it with values in SS with the following properties. The variable XX has law μ\mu, each XnX_n has law μn\mu_n, and Xn→XX_n \to X almost surely.

Remarks

On S=ℝS = \R there is a short proof: let UU be uniform on (0,1)(0, 1), and set Xn=Fn−1(U)X_n = F_n^{-1}(U) and X=F−1(U)X = F^{-1}(U), where Fn−1F_n^{-1} and F−1F^{-1} are the quantile functions of μn\mu_n and μ\mu. Weak convergence implies Fn−1(u)→F−1(u)F_n^{-1}(u) \to F^{-1}(u) at each continuity point uu of F−1F^{-1}, and F−1F^{-1} is monotone, so it has only countably many discontinuities, a null set for UU. The general proof builds the variables from fine partitions of SS into small sets whose boundaries have μ\mu-measure 00. The theorem gives quick proofs of facts about weak convergence: for example, if Xn→XX_n \to X in distribution and hh is continuous, then h(Xn)→h(X)h(X_n) \to h(X) in distribution, which is the continuous mapping theorem. It also gives E[∣X∣]≤lim inf⁡nE[∣Xn∣]E[\abs{X}] \le \liminf_n E[\abs{X_n}] for real variables, by Fatou's lemma. The new variables only have the right laws; the original random variables, if any, need not converge almost surely.

Going deeper

For a student

The theorem is a standard device in weak convergence theory. It appears in proofs of the continuous mapping theorem and of results on uniform integrability and convergence of moments. It is also used for stochastic processes with values in function spaces. In the real case it is just the quantile coupling. It should not be confused with Skorokhod's embedding theorem, which embeds a random walk into a Brownian motion.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Almost sure convergence concept
  2. Metric space concept
  3. Probability measure concept
  4. Quantile function concept
  5. Separable space concept
  6. Skorokhod's representation theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Skorokhod%27s_representation_theorem
About this page
TagJPD7Q0P4F6
URIm2://JPD7Q0P4F6
Kindstatement, theorem
WritingW0 stub
MSC60B10, 60F05
StatusThis copy of the site has no build data. Run m2 status JPD7Q0P4F6.
AboutAlmost sure convergence
UsesMetric space, Separable space, Probability measure, Almost sure convergence, Quantile function
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.