A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Convergence in Probability

Graduate Depth 103 in the knowledge graph ☐ I know this ☆ Set as goal
87topics build on this
640prerequisites beneath it
See this on the map →
Random Variables as Measurable FunctionsConvergence of Markov Chains+1 more→→Almost Sure ConvergenceConsistency of Estimators+3 more
convergence probability limit-theorems

Core Idea

A sequence {Xₙ} converges to X in probability if for all ε > 0, lim_{n→∞} P(|Xₙ - X| > ε) = 0. Intuitively, Xₙ is close to X with high probability for large n. Convergence in probability is weaker than almost sure convergence but stronger than convergence in distribution.

Explainer

In deterministic analysis, a sequence of numbers xₙ converges to L if xₙ gets arbitrarily close to L for large enough n — every number in the tail of the sequence eventually lands near L. For random variables, the situation is richer: Xₙ is not a single number but a whole distribution. What does it mean for a random variable to "converge"? There are several answers depending on what you require. Convergence in probability is the most commonly encountered notion, and it has a natural intuitive reading.

The formal definition says: Xₙ converges to X in probability if, for every tolerance ε > 0, the probability that Xₙ is more than ε away from X goes to zero as n → ∞. In notation: P(|Xₙ − X| > ε) → 0 for all ε > 0. Concretely, pick any small margin — say, ε = 0.01. For large enough n, the chance that Xₙ differs from X by more than 0.01 becomes negligible. It's not that Xₙ is guaranteed to be close to X; it's that *most* of the probability mass of Xₙ is concentrated near X, and the exceptional events (large deviations) become rarer and rarer.

Think of a shrinking distribution as the key image. If Xₙ has a normal distribution with mean 0 and variance 1/n, then as n → ∞, the distribution collapses to a spike at 0. For any ε, the probability of landing outside (−ε, ε) is the tail probability of N(0, 1/n), which goes to 0. So Xₙ → 0 in probability. Notice that no individual outcome is guaranteed to be close to 0 — the randomness doesn't disappear, but the mass of the distribution concentrates. This is different from saying "Xₙ always stays near 0."

This distinction matters when comparing convergence modes. Almost sure convergence requires that the set of outcomes where Xₙ does *not* converge to X has probability zero — every path (except a null set) eventually stays near X. Convergence in probability is weaker: it only requires that the *probability* of straying far from X vanishes, not that every path behaves well. A classic counterexample (the "typewriter sequence") shows that convergence in probability does not imply almost sure convergence. Convergence in probability is the mode relevant to the Weak Law of Large Numbers: the sample mean converges in probability to the true mean, even though individual samples may occasionally be far off.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Fundamental Theorem of Calculus Part 1 → Fundamental Theorem of Calculus Part 2 → U-Substitution → Partial Fraction Decomposition for Integration → Improper Integrals - Convergence → Integral Test → P-Series → Comparison Test → Limit Comparison Test → Series Convergence Test Strategy → Power Series → Radius and Interval of Convergence → Taylor Series → Moment Generating Functions → Characteristic Functions → Convergence in Distribution → Stationary Distributions → Convergence of Markov Chains → Convergence in Probability

Longest path: 104 steps · 640 total prerequisite topics

Prerequisites (3)

Leads To (5)