How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Modes of Convergence for Random Variables — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These constructions delimit the implication diagram and make the subsequence and uniform-integrability mechanisms concrete.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Convergence in probability need not be almost sure
Statement refuted
Convergence in probability need not imply almost-sure convergence.
Facts & Assumptions
Given: Independent events with , and .
Pairwise independent events with divergent probability sum occur infinitely often almost surely (Second Borel-Cantelli lemma under pairwise independence).
Convergence in probability is fixed-threshold tail convergence (Convergence in probability).
Counterexample
For , ; for it is zero. Hence in probability by [L2].
But , so [L1] gives infinitely often almost surely. On that event has infinitely many values , and therefore cannot converge to .
Almost-sure convergence need not imply convergence
Statement refuted
Almost-sure convergence need not imply convergence, even for .
Facts & Assumptions
Given: Lebesgue probability space , , and for .
Almost-sure convergence is pointwise convergence outside a null set (Almost-sure convergence of real random variables).
convergence requires the norm of the difference to vanish ( convergence for random variables).
Counterexample
For every , eventually , so . Thus everywhere on , hence almost surely by [L1].
Yet , so [step 1.1, L2] for every . By [L2], there is no convergence to zero.
convergence need not imply almost-sure convergence
Statement refuted
convergence need not imply almost-sure convergence, for any fixed .
Facts & Assumptions
Given: Lebesgue probability space and, for , the dyadic intervals , listed block by block; let be their indicators in that order.
convergence is vanishing of the th moment of the difference ( convergence for random variables).
Almost-sure convergence requires pointwise convergence off a null set (Almost-sure convergence of real random variables).
Counterexample
In the block of level , every has . As the block level tends to infinity with , ; hence in by [L1].
Every non-dyadic belongs to exactly one interval in each level- block, but misses all the other intervals in that block. Thus equals both and infinitely often. The exceptional dyadic endpoints are null, so [L2] rules out almost-sure convergence.
Convergence in distribution need not be convergence in probability
Statement refuted
Convergence in distribution need not imply convergence in probability.
Facts & Assumptions
Given: A random variable with , and .
Distributional convergence is convergence of the corresponding CDFs at continuity points (Convergence in distribution for real random variables).
Probability convergence makes every positive error probability vanish (Convergence in probability).
Counterexample
The symmetric two-point law of equals that of , so for every . Therefore by [L1].
But almost surely, so for every . By [L2], does not converge to in probability.
Convergence in probability need not imply convergence
Statement refuted
Convergence in probability need not imply convergence, for .
Facts & Assumptions
Given: , events with , and for .
Convergence in probability is fixed-threshold tail convergence (Convergence in probability).
convergence requires the th moment of the difference to tend to zero ( convergence for random variables).
Counterexample
For fixed , is nonzero only on , hence [L1] . Thus in probability by [L1].
Nevertheless, [step 1.1, L2] for all . By [L2], does not converge to zero in .
convergence need not imply convergence when
Statement refuted
For , convergence need not imply convergence.
Facts & Assumptions
Given: Lebesgue probability space , , and for .
convergence is vanishing of for the relevant exponent ( convergence for random variables).
Counterexample
Direct calculation gives [L1] , since . Thus in by [L1].
But for every , so the [step 1.1, L1] norm never tends to zero. Hence [L1] rules out convergence.
Almost-sure convergence does not imply convergence of expectations
Statement refuted
Almost-sure convergence alone need not imply convergence of expectations.
Facts & Assumptions
Given: Lebesgue probability space and for .
Almost-sure convergence is pointwise convergence off a null set (Almost-sure convergence of real random variables).
Expectation is integration against the probability measure (Expectation of a nonnegative or integrable random variable).
Counterexample
For every , eventually , so . [L1] Hence almost surely by [L1].
Yet [L2] gives [step 1.1, L2] for every , whereas . Thus the expectations do not converge.
A probability-convergent sequence with a prescribed fast almost-sure subsequence
Example
Suppose in probability. Given any sequences with and with , one can choose increasing so that and almost surely.
Facts & Assumptions
Given: in probability, with , and with .
Probability convergence supplies a later index for every positive threshold and positive bound (Convergence in probability).
The least-index construction with a summable error schedule yields an almost-surely convergent subsequence (An almost-surely convergent subsequence from convergence in probability).
Verification
After , choose least with ; [L1] makes every choice possible.
The proof of [L2] uses only that the displayed probabilities are summable and that . Thus it applies to these and gives almost-sure convergence.
Uniform integrability repairs the expectation limit
Example
Let in probability and suppose almost surely for one finite constant and every . Then in and .
Facts & Assumptions
Given: in probability and almost surely for all .
Uniform integrability is the uniform decay of tail integrals (A uniformly integrable family).
Under probability convergence, uniform integrability is equivalent to convergence (Uniform integrability characterizes convergence under probability convergence).
Verification
If , then almost surely for every . Hence the family is uniformly integrable by [L1].
By [L2], in . Therefore , proving convergence of expectations.