Historical Context & Motivation
The study of convergence of random variables matured rapidly in the early twentieth century as probability theory transitioned from an informal collection of heuristics into a rigorous mathematical discipline. A persistent challenge was understanding how operations on sequences of random variables—sums, products, and general transformations—interact with different modes of convergence. Two results that answered this question in elegant, complementary ways are Slutsky's theorem and the continuous mapping theorem. Together they form the algebraic backbone of asymptotic statistics, allowing practitioners to derive the limiting distributions of complex estimators from simpler building blocks.
Before these theorems were formalized, statisticians relied on ad hoc arguments to justify asymptotic approximations. For instance, showing that a sample mean converges in distribution is only the beginning: in practice we often divide by a sample standard deviation, add a bias correction, or apply a nonlinear link function. Without a systematic rule explaining how convergence in distribution behaves under arithmetic operations and continuous transformations, each new estimator required a bespoke proof—a situation that was both tedious and error-prone.
The central question these theorems address can be stated simply: if we know that a random variable Xn converges (in some sense) to X, and we apply an operation—adding a term, multiplying, or evaluating a function g—what can we say about the convergence of the resulting sequence? Slutsky's theorem handles the case where one operand is converging to a constant, while the continuous mapping theorem handles the case of applying a continuous function.
Core Principles & Definitions
Before stating the two theorems, we need to recall three modes of convergence that form the hierarchy at the heart of asymptotic theory. Understanding the relationships among these modes is essential because each theorem's hypotheses specify precisely which mode of convergence is required for each input sequence.
Convergence in Distribution (⇒d)
Convergence in Probability (⇒p)
Almost Sure Convergence (⇒a.s.)
Slutsky's Theorem — Key Idea
Continuous Mapping Theorem — Key Idea
Visual Explanation — Convergence Hierarchy & Theorem Flow
The diagram below illustrates the logical relationship between the three modes of convergence and shows exactly where Slutsky's theorem and the continuous mapping theorem fit into the picture. Notice that the continuous mapping theorem preserves whichever mode of convergence you start with, while Slutsky's theorem specifically transforms a convergence-in-distribution input combined with a convergence-in-probability-to-constant input into a convergence-in-distribution output.
A critical detail visible in the diagram is that Slutsky's theorem requires Yn to converge in probability to a constant, not merely to another random variable. If Yn were converging in distribution to a non-degenerate random variable Y, we could not in general conclude that Xn + Yn →d X + Y without additional information about the joint distribution. The continuous mapping theorem, by contrast, applies to a single sequence and a deterministic transformation g, which is why it works uniformly across all convergence modes.
Mathematical Framework
Slutsky's Theorem — Formal Statement
The proof relies on the characterization of convergence in distribution via characteristic functions or the Portmanteau lemma. Because Yn →p c, the pair (Xn, Yn) converges jointly in distribution to (X, c), which is a degenerate joint distribution. The continuous function h(x, y) = x + y (or x · y) then preserves this convergence via the continuous mapping theorem, making Slutsky's theorem a corollary of the CMT when viewed in the right framework.
Continuous Mapping Theorem — Formal Statement
The almost-sure case follows immediately from the definition: if Xn(ω) → X(ω) for ω in a set of measure 1, and g is continuous at X(ω) for almost all such ω, then g(Xn(ω)) → g(X(ω)) by the topological definition of continuity. The convergence-in-probability case uses a subsequence argument: every subsequence of g(Xn) has a further sub-subsequence converging almost surely, which then converges by the a.s. case. The convergence-in-distribution case is the most delicate and proceeds via the Portmanteau theorem: for any closed set F in ℝm, g−1(F) is closed (up to the negligible discontinuity set), so lim sup P(g(Xn) ∈ F) ≤ P(g(X) ∈ F).
Key Applications & Classification of Uses
The power of these two theorems becomes apparent when you realize that nearly every asymptotic result in statistics involves composing simpler convergence statements. The table below classifies the most common application patterns, each of which reduces a seemingly complex derivation to a one- or two-line argument once the right theorem is invoked.
The most ubiquitous pattern is the derivation of the asymptotic distribution of the t-statistic. The Central Limit Theorem gives √n(X̄n − μ)/σ →d N(0,1), and the weak law of large numbers gives Sn →p σ (a constant). Slutsky's theorem with the ratio form immediately yields √n(X̄n − μ)/Sn →d N(0,1). This one-line argument replaces what would otherwise require a careful joint-distribution calculation.
Worked Example — Asymptotic Distribution of a Ratio Estimator
Suppose X₁, X₂, …, Xn are i.i.d. with mean μ = 5 and variance σ² = 4. We want the asymptotic distribution of Tn = √n(X̄n − μ) / Sn, and then the asymptotic distribution of Tn², where Sn is the sample standard deviation.
Comparing Slutsky's Theorem & the Continuous Mapping Theorem
Although Slutsky's theorem can be viewed as a special case of the continuous mapping theorem (as noted in Section 4), they serve distinct roles in practice and are stated with different hypotheses. The following table clarifies the similarities and differences so you can choose the right tool in each situation.
| Feature | Slutsky's Theorem | Continuous Mapping Theorem |
|---|---|---|
| Input sequences | Two sequences: Xₙ →ᵈ X and Yₙ →ᵖ c (constant) | One sequence: Xₙ → X in any mode |
| Operation | Arithmetic: addition, multiplication, division | Any continuous (or a.e.-continuous) function g |
| Output mode | Convergence in distribution | Same mode as the input |
| Key restriction | One operand must converge to a constant, not a random variable | g must be continuous at least on a set of full probability under the limit |
| Typical use case | Replacing unknown parameters with consistent estimators (e.g., σ by Sₙ) | Transforming a convergent sequence (e.g., squaring, exponentiating, log) |
| Multivariate extension | Xₙ can be a vector in ℝᵏ; Yₙ can be a matrix converging to a constant matrix | Extends naturally to g : ℝᵏ → ℝᵐ |
Connections to Advanced Theory
Slutsky's theorem and the continuous mapping theorem serve as gateways to more sophisticated asymptotic tools. In advanced courses you will encounter generalizations that relax hypotheses, extend to function spaces, or incorporate rates of convergence. The table below provides a map from the introductory versions you have learned here to their more general counterparts.
| Introductory Result | Advanced Generalization | Key Extension |
|---|---|---|
| CMT for random variables in ℝᵏ | CMT for random elements in metric spaces | Xₙ can be a random function in C[0,1] or D[0,1]; g : C[0,1] → ℝ |
| Slutsky's theorem (Yₙ →ᵖ c) | Joint convergence + CMT | If (Xₙ, Yₙ) →ᵈ (X, Y) jointly, then h(Xₙ, Yₙ) →ᵈ h(X, Y) for continuous h |
| CMT + Delta Method | Second-order Delta Method | When g'(θ) = 0, the rate changes to n (not √n) and the limit is a scaled χ² distribution |
| Convergence in distribution in ℝ | Weak convergence in (D[0,1], J₁) | Functional CLT (Donsker's theorem); process-level convergence where CMT applies to functionals like sup, integral, etc. |
Perhaps the most important advanced application is the Delta Method, which is essentially a first-order Taylor expansion combined with the continuous mapping theorem. If √n(θ̂n − θ) →d N(0, σ²) and g is differentiable at θ with g'(θ) ≠ 0, then √n(g(θ̂n) − g(θ)) →d N(0, [g'(θ)]²σ²). This result is used ubiquitously in maximum likelihood theory, biostatistics, and econometrics to construct confidence intervals for transformed parameters.
Practice Problems
Summary & Review
Slutsky's theorem states that if Xₙ converges in distribution to X and Yₙ converges in probability to a constant c, then their sum, product, and ratio converge in distribution to X + c, cX, and X/c respectively. The requirement that the limit of Yₙ be a constant (degenerate random variable) is essential because convergence in distribution captures only marginal behavior, not joint dependence. This theorem is the workhorse for replacing unknown parameters with consistent estimators in asymptotic arguments—for instance, substituting the sample standard deviation for the population standard deviation in a z-statistic to produce a t-statistic.
The continuous mapping theorem (CMT) asserts that applying a continuous function g to a convergent sequence preserves the mode of convergence—whether almost sure, in probability, or in distribution. Crucially, g need only be continuous on a set whose complement has probability zero under the limit distribution. Together, these two theorems form the algebraic engine of asymptotic statistics, enabling the derivation of limiting distributions for test statistics, confidence intervals, and estimators through a modular, composable framework that extends naturally to the Delta Method and functional weak convergence.