Convergence in Probability

Graduate Depth 88 in the knowledge graph I know this Set as goal
Unlocks 45 downstream topics
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

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsCombining Like TermsOne-Step EquationsTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIndefinite IntegralsBasic Integration RulesRiemann SumsDefinite Integral DefinitionFundamental Theorem of Calculus Part 1Fundamental Theorem of Calculus Part 2U-SubstitutionPartial Fraction Decomposition for IntegrationImproper Integrals - ConvergenceIntegral TestP-SeriesComparison TestLimit Comparison TestAbsolute vs. Conditional ConvergencePower SeriesTaylor PolynomialsTaylor SeriesMoment Generating FunctionsCharacteristic FunctionsConvergence in DistributionStationary DistributionsConvergence of Markov ChainsConvergence in Probability

Longest path: 89 steps · 466 total prerequisite topics

Prerequisites (3)

Leads To (5)