Probability theory and stochastic processes Modes of convergence Theorem
Slutsky's theorem
Builds on Convergence in distributionConvergence in probabilityContinuous mapping theorem
Statement
For each , let and be real random variables on one probability space. Let be a real random variable and a constant. Assume that in distribution and in probability. Then, in distribution:
- ;
- ;
- , provided , where is given any fixed value on the event .
Remarks
Proof idea: since the limit of is a constant, the pair converges in distribution to . Each of the three maps , and is continuous at the points , so the continuous mapping theorem applies. Example: let be i.i.d. with mean and variance , with sample mean and sample standard deviation . The central limit theorem gives , and the law of large numbers gives in probability; so in distribution. The limit must be a constant. Let be standard normal and ; the variables and have the same law. With one gets , and with one gets . So convergence in law of both terms does not determine the law of the limit of the sum. The theorem holds in the same way for random vectors, and for random matrices that converge in probability to a constant matrix . For the quotient one needs to be invertible.
Going deeper
For a student
Slutsky's theorem is used constantly in asymptotic statistics, together with the central limit theorem and the delta method. It justifies the use of estimated standard errors in confidence intervals and test statistics such as the Student statistic for large samples. It follows from the continuous mapping theorem applied to the pair . Its key point is that joint convergence comes for free when one limit is constant.
Reading path
To understand this page from the ground up, read these 58 pages in order. The foundations come first.
- Almost sure convergence concept
- Construction of the reals from Cauchy sequences concept
- Continuous function concept
- Convergence in distribution concept
- Convergence in probability concept
- Element definition
- Integers object
- Metric space concept
- Ordered field definition
- Proposition concept
- Random experiment concept
- Rational numbers object
- Real numbers object
- Set definition
- Ring of integers statement
- Disjunction definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Union definition
- Existential quantifier definition
- Universal quantifier definition
- Sample space definition
- The rationals form a field statement
- Cartesian product definition
- Uniqueness quantifier definition
- Subset definition
- The rationals form an ordered field statement
- Binary relation definition
- Universal set definition
- Order on the reals definition
- Power set definition
- Function definition
- Interval definition
- Complement definition
- Injective function definition
- Preimage of a set definition
- Sigma-algebra definition
- Countable set definition
- Event definition
- Borel sigma-algebra definition
- Probability axioms concept
- Probability measure definition
- Probability distribution definition
- Probability space definition
- Almost surely definition
- Random variable definition
- Almost sure convergence definition
- Cumulative distribution function definition
- Discrete random variable definition
- Convergence in probability definition
- Random variable with a density definition
- Convergence in distribution definition
- Expected value definition
- Convergence in mean definition
- Convergence of random variables concept
- Continuous mapping theorem statement
- Slutsky's theorem statement
Further reading
About this page
| Tag | GCV10B5HES |
|---|---|
| URI | m2://GCV10B5HES |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 60F05, 62E20 |
| Status | This copy of the site has no build data. Run m2 status GCV10B5HES. |
| About | Convergence in distribution |
| Uses | Convergence in distribution, Convergence in probability, Continuous mapping theorem |
| Same as | |
| Changed | 2 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.