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.
Consistency and Limiting Distributions
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
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Transformations, Rank-Nullity and Quotient Spaces
- 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
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- 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
- Statistical Experiments, Models and Identifiability
- 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 Topology of Euclidean Space
- 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
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
This page fixes the stochastic-order notation and using the Euclidean norm for fixed finite-dimensional random vectors. It proves the finite-dimensional sum and bilinear-product rules, tightness of weakly convergent sequences, and vector Slutsky convergence with a constant probability limit. The vector result is proved locally; the scalar Slutsky theorem is not treated as a vector theorem.
For an IID statistical experiment, an estimator sequence is a measurable map on each finite product sample space. Consistency here is pointwise at a fixed parameter, and an asymptotic distribution is a weak limit of laws; neither term implies uniformity or moment convergence. If two parameter values induce the same observation law but have distinct target values, no estimator sequence can be consistent at both. For a real-valued observation with finite first absolute moment, Khinchin's weak law gives consistency of the sample mean at each fixed parameter. The law's integrability hypothesis is retained exactly.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Stochastic order and convergence notation for finite-dimensional random vectors
Definition
For each positive integer , let be a probability space and let be measurable into the Borel sigma-algebra generated by the Euclidean open sets, where is fixed and has the Euclidean norm (Euclidean spheres and closed balls as subspaces of , Random elements and real random variables, Probability measures and probability spaces). The spaces and measures may depend on ; no common probability space is required.
Write if for every , Write , or say that is bounded in probability, if for every there is such that For real-valued variables on one common probability space, is convergence in probability to zero as defined in Convergence in probability.
The norms and tail probabilities are part of the definition. Independence is not implicit in either notation.
Asymptotic distribution
Definition
Let be fixed, and equip with the Borel sigma-algebra generated by its Euclidean open sets. Let be measurable random elements of this Borel space, not necessarily defined on a common probability space, and let be a Borel probability measure on . The sequence has asymptotic distribution if its laws converge weakly to ; equivalently, for any random vector with law (Convergence in distribution of random elements, Weak convergence of borel probability measures).
For an estimator, any centering or scaling, such as , is part of the sequence whose asymptotic distribution is being specified; it is not implicit in the term. Weak convergence alone does not assert convergence of moments.
Finite-dimensional stochastic-order calculus and tightness
Statement
Let all random vectors with index be defined on a common probability space for that ; the spaces may vary with . In any fixed finite-dimensional Euclidean space, the following rules hold:
- If and , then . If and , then .
- For positive integers , let be a fixed map for which there is a constant with for all . Assume in each application that is a random vector on the same probability space as , for every . If and , or conversely, then . If both are , then .
- If in , then .
The last conclusion is finite-dimensional boundedness in probability. No independence or Axiom of Choice is assumed.
Facts & Assumptions
Given: Random vectors on probability spaces as in the statement; in part 3, .
Stochastic order and convergence notation for finite-dimensional random vectors: means for every ; means that for every there is with .
Convergence in distribution of random elements: Random elements with values in the same metric space converge in distribution if their laws converge weakly. They may be defined on different probability spaces.
Portmanteau theorem: For Borel probabilities on a metric space , the closed-set bound is for every closed .
Continuity from above when one set has finite measure: For a decreasing sequence of measurable sets, if one set has finite measure then the measure of the intersection is the infimum of the measures.
Euclidean spheres and closed balls as subspaces of : On , is the Euclidean metric, and every vector has finite Euclidean norm.
Open ball, closed ball and sphere in a metric space: The open ball is for radius .
Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed: Every open metric ball is open.
The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement: A set is closed when its complement is open.
Proof
Given: The random vectors and hypotheses in the statement.
Suppose in . For positive integers , set , where [F5] identifies the Euclidean distance with the norm and [F6] gives the metric-ball definition. By [F7] each ball is open, so [F8] makes closed. The sets decrease to the empty set because every vector has finite norm, and their probabilities are at most one. By [F4], . For each , [F2] and [F3] give . Choosing with right side below any prescribed proves by [F1].
If and in one Euclidean space, the triangle inequality gives . The union bound and [F1] show that the left event has probability tending to zero.
If and , choose using [F1]. The event is contained in , so its limiting upper probability is at most the sum of the two chosen tail bounds. Since the bounds can be arbitrarily small, .
If , then for all . Suppose , , and . For any , choose with . The norm bound for gives . By [F1], the second event has probability tending to zero, so the limiting upper probability of the left event is at most ; arbitrariness of proves . The same argument applies when the small factor is in the second coordinate.
If both inputs to are , choose so that the limiting upper probability of either input exceeding its bound is at most an arbitrary . Outside the union of these two tail events, . The union bound makes the limiting upper probability above this fixed bound at most . Letting decrease to zero proves .
Remarks
The composite random-vector hypothesis in part 2 is necessary. A norm bound on an arbitrary map does not establish measurability of its composites. For an explicit counterexample to the original claim without that premise, suppose a non-Borel set is supplied, and let on the supplied uniform probability space with its Borel sigma-algebra. Set on , where is zero outside . This map satisfies for every pair. Taking and gives bounded-in-probability inputs, but is not a measurable event, so the output is not a random variable and has no classification under the definition. Taking instead gives an input and the same nonmeasurable positive-set inverse image, despite the pointwise bound by . This argument assumes the stated non-Borel set and uniform Borel probability space; it does not supply an existence proof for that set. Requiring only the actually used composites to be random vectors retains arbitrary norm-bounded maps, without imposing Borel measurability, bilinearity, or continuity on itself.
Vector Slutsky theorem
Statement
Let be fixed. For each , let and be random vectors on one probability space; the probability space may vary with . Let be a random vector on any probability space, and let be constant. If and , then Consequently, for every continuous , . No independence between and is required.
Facts & Assumptions
Given: The random vectors and convergence hypotheses in the statement.
Finite-dimensional stochastic-order calculus and tightness: If in a finite-dimensional Euclidean space, then .
Weak convergence of borel probability measures: For Borel probability measures on a metric space , weak convergence means convergence of integrals for every bounded continuous real-valued function.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: A subset of finite-dimensional Euclidean space is compact if and only if it is closed and bounded.
Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: A continuous map from a compact metric space to a metric space is uniformly continuous.
Continuous mapping theorem: If and is measurable with a -null discontinuity set, then .
Convergence in distribution of random elements: Random elements converge in distribution when their laws converge weakly; they need not share a probability space.
Euclidean spheres and closed balls as subspaces of : The Euclidean closed ball is the set of vectors whose Euclidean distance from its centre is at most its radius.
as the set of functions , and , , are metrics on it: On , the Euclidean metric is .
Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric: A metric satisfies symmetry and the triangle inequality.
Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed: Closed balls are closed subsets of a metric space.
Proof
Given: The objects and hypotheses in the statement. Write for the probability measure carrying .
By [F1], . Fix a bounded continuous , and let . The definition of gives with .
Let . The factor balls are closed by [F11]. The coordinate projections are continuous because [F9] gives and the analogous inequality for , so is closed. For , [F9] and [F10] give , so is bounded. By [F4], is compact. By [F5], is uniformly continuous. For any , choose such that points of at distance less than have -values differing by less than . By [F8], on both pair values lie in , and their Euclidean distance is at most . Therefore By [F2], the second tail tends to zero. Taking the limiting upper bound, then letting and decrease to zero, proves that the expectation difference tends to zero.
By [F7], means weak convergence of its laws. The function is bounded and continuous, so [F3] gives . Together with step 1.2, bounded-continuous-test convergence gives .
The map is continuous everywhere, hence measurable with empty discontinuity set. Apply [F6] to step 2.1 to obtain .
Estimator sequences in IID experiments
Definition
Let be a parametric model on a statistical experiment, and let be an estimand whose target set is equipped with a metric (Statistical experiments, Parametric statistical models, Estimands on a statistical model, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric). For , the IID sample-size- experiment has sample space , product sigma-algebra , and sampling law at parameter (The product sigma-algebra and its finite iterates). The product law is defined recursively from ; each factor is a probability measure and hence sigma-finite, so the finite product theorem supplies its existence, rectangle formula, and uniqueness (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique).
A nonrandomized estimator sequence of is a sequence of measurable maps, in the sense of A measurable function between measurable spaces, where is the sigma-algebra generated by the open sets of the metric , that is, the Borel sigma-algebra of its metric topology (The Borel sigma-algebra of a topological space). Its sampling distribution at and sample size is the pushforward of by .
This definition fixes IID repeated sampling and data-measurable estimators. It imposes no measurability on the parameter map or on .
Pointwise consistency in probability
Definition
Let be an estimator sequence of an estimand with metric target , and fix . The sequence is consistent in probability at if for every ,
The error event is measurable: by the triangle inequality, is continuous, so its strict superlevel set at is open in the target metric topology and hence Borel; its preimage under is measurable.
The consistency is pointwise because is fixed before the limit. It does not assert uniform convergence over (Estimator sequences in IID experiments).
Consistency of the IID sample mean under a finite first moment
Statement
Let with its Borel sigma-algebra, and let be a parametric statistical experiment on . Define the mean estimand by and suppose it is finite for every . For a fixed , suppose an IID sequence with one-observation law is given and . The sample-mean estimator is consistent in probability for at in the IID sample-size experiments.
The assertion is pointwise in . The existence of a common probability space carrying the IID sequence is part of the hypothesis.
Facts & Assumptions
Given: The experiment, finite mean, and IID sequence in the statement.
Identical distribution and IID families: A family is IID when it is identically distributed and the whole family is independent; no moment assumption is implicit.
Partial sums, row sums and sample means: For real random variables , and ; these finite sums and means are random variables.
Independent random elements have product joint law: A finite independent family of random elements has joint law equal to the finite product of its marginal laws.
Khinchin weak law for integrable IID variables: If are IID real random variables and , then in probability.
Estimator sequences in IID experiments: The size- sample space is with law , and the estimator is a measurable map on that space.
Pointwise consistency in probability: The estimator is consistent at when for every .
Estimands on a statistical model: An estimand is a specified function from the parameter set to its target set.
Expectation of a nonnegative or integrable random variable: For an integrable real random variable, expectation is its finite Lebesgue integral against the probability measure.
Arithmetic and lattice operations preserve measurability whenever they are defined: Finite sums and scalar multiples of measurable real-valued functions are measurable whenever the operations are pointwise defined.
Change of variables for expectation: If a real random variable has law , is Borel measurable, and is integrable, then .
Statistical experiments: An experiment supplies the observation measurable space and its parameter-indexed family of sampling laws.
Parametric statistical models: The parametric model is the map on that experiment.
The Borel sigma-algebra of a topological space: The Borel sigma-algebra on is generated by its open subsets.
The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded: The usual absolute-value distance on is a metric.
Proof
Given: The objects and hypotheses in the statement.
The statistical experiment and parametric model in [F11]–[F12] specify the sampling law . Each coordinate projection on is measurable because the preimage of a Borel set is the cylinder rectangle in the product sigma-algebra [F5]. Thus [F9] makes measurable into the Borel target [F13], so it is the estimator in [F5]; applied to the given sequence, it is the finite sample mean in [F2]. By [F1] and [F3], the law of is . Since has law and is integrable, [F10] gives ; the mean is the estimand [F7].
The hypotheses of [F4] hold for this IID sequence, so in probability on its given common probability space.
For each , step 1.1 identifies the joint data law with ; applying the same measurable sample-mean map therefore gives exactly the error probabilities in [F6] for the absolute-value metric [F14]. Step 1.2 makes those probabilities tend to zero for every , which is consistency at . No infinite-product extension is constructed or needed.
Nonidentifiability precludes simultaneous consistency
Statement
Let be a parametric statistical model, let be a metric-valued estimand, and let be a nonrandomized estimator sequence for IID samples from this model. If is not identifiable, then there is a pair of observationally equivalent parameters with distinct target values, and no estimator sequence is consistent in probability at both parameters.
Facts & Assumptions
Given: The model, estimand, estimator sequence, and hypotheses in the statement.
Parametric statistical models: A parametric statistical model is the parameter map with .
Observational equivalence: exactly when as measures on the observation space.
Estimands on a statistical model: An estimand is a specified function .
Identifiability of an estimand: An estimand is identifiable exactly when implies .
Estimator sequences in IID experiments: The size- experiment has law on , and an estimator is a measurable map on that space.
Pointwise consistency in probability: Consistency at means for every .
The product sigma-algebra and its finite iterates: The finite product sigma-algebra is generated recursively by measurable rectangles.
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: The product measure exists and gives each measurable rectangle the product of the factor measures.
Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: Measures agreeing on a generating -system and on an increasing finite-measure exhaustion from it agree on the generated sigma-algebra.
Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric: A metric is nonnegative, symmetric, separates distinct points, and satisfies the triangle inequality.
A measurable function between measurable spaces: A map is measurable when the preimage of every target-measurable set is measurable.
The Borel sigma-algebra of a topological space: The Borel sigma-algebra of a metric space contains every closed subset.
Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed: Every closed ball in a metric space is closed.
Proof
Given: The objects and hypotheses in the statement.
By [F4], nonidentifiability supplies with and . Fix this pair.
Fix . By [F1], the observation laws in the model are . Measurable rectangles in form a -system generating by [F7]. For every rectangle , [F8] and [F2] give . The full space is itself a rectangle and is an increasing exhaustion of finite mass one. Applying [F9] shows on all of .
Put and . The two closed target balls are disjoint: a point in both would give by [F10].
Suppose, for contradiction, that the estimator sequence is consistent at both parameters. For let . These events are measurable because each is closed by [F13] and Borel by [F12], while is measurable by [F5] and preimages of Borel sets are measurable by [F11]. By [F6], for each .
For each , step 2.1 gives one common sample law for both probabilities, and step 2.2 gives disjoint events, so their probabilities sum to at most one. Step 3.1 says both probabilities tend to one, so their sum tends to two, a contradiction. Therefore the estimator sequence cannot be consistent at both parameters.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 16, PDF pp. 9–12
- John Duchi, Theory of Statistics, Stats 300B Lecture 2, Winter 2018, PDF pp. 1–3
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 16, PDF p. 8
- John Duchi, Theory of Statistics, Stats 300B Lecture 2, Winter 2018, PDF pp. 1–2
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 16, PDF pp. 9–11
- John Duchi, Theory of Statistics, Stats 300B Lecture 2, Winter 2018, PDF p. 1
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 15, PDF pp. 2–6
- John Duchi, Theory of Statistics, Stats 300B Lecture 3, Winter 2018, PDF pp. 3–4
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 15, PDF pp. 6–7
- S. R. S. Varadhan, Probability Theory, Theorem 3.3, Chapter 3, PDF pp. 55–57
- Rick Durrett, Probability: Theory and Examples, 5th ed., Theorem 2.2.14, §2.2, PDF pp. 64–65
- John Duchi, Theory of Statistics, Stats 300B Lecture 3, Winter 2018, PDF p. 4
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 15, PDF pp. 6–8