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.
Finite-dependent vector central limit theorem
Statement
Assume the Axiom of Choice. Let and be finite integers, and let be a centered strictly stationary sequence of -valued random vectors with . Strict stationarity means that every finite-dimensional law is invariant under integer shifts. Assume -dependence: for each , the sigma-algebras generated by and are independent, in the sense of Independent sigma-algebras and independent events. Set where (Moments, variance, and covariance on a probability space). Then is symmetric positive semidefinite and The conclusion allows singular , including .
Facts & Assumptions
Given: Assume AC. Let be centered, strictly stationary, -dependent -valued random vectors with finite second moment, as in the Statement.
The Axiom of Choice is assumed (The Axiom of Choice).
A centered row-wise independent triangular array with finite second moments and the Lindeberg condition has a standard normal normalized row-sum limit (Lindeberg-Feller central limit theorem: sufficiency); the row and Lindeberg conventions are those of Row-wise independent centered triangular array and Total row variance and the Lindeberg condition.
Slutsky's theorem permits multiplication of a convergent real random variable by a sequence converging in probability to a constant (Slutsky's theorem for real random variables).
If two sequences on a common metric space differ by a quantity tending to zero in probability, they have the same weak limit (Converging together lemma).
Under AC, pointwise convergence of characteristic functions to a specified characteristic function implies weak convergence of the corresponding real laws (Characteristic function criterion for weak convergence).
Under AC, a positive semidefinite covariance matrix, including a singular one, defines (Multivariate normal law, including singular covariance); convergence of all one-dimensional linear projections to the corresponding projections of a specified law implies vector weak convergence (Cramer wold device).
A square-integrable real random variable satisfies Chebyshev's inequality, so a sequence whose second moments tend to zero converges in probability to zero (Chebyshev's inequality for random variables).
Dominated convergence removes the tails of a square-integrable random variable when it is clipped at levels (Dominated convergence).
Cauchy--Schwarz for square-integrable real random variables bounds expectations of products by the product of their norms (Cauchy-Schwarz for random variables).
Proof
Given: The objects and assumptions in the Statement.
For put . These covariance terms are finite by [F8]. Strict stationarity gives , and -dependence gives when . Expanding the finite variance of the sum yields Thus is symmetric, and for every , is the limit of nonnegative variances divided by , so it is nonnegative. Hence exists by [F5].
Fix and let and . If , step 1.1 gives ; [F6] and then [F3] give convergence in distribution to zero. Suppose . For define . This is centered, stationary, -dependent and bounded by ; [F7] gives . Write . Finite summation and [F8] give , so for all sufficiently large .
Fix such a , put , and retain blocks of length , with omitted indices between successive blocks. Write for the last index in a retained block. The next block starts at , so -dependence makes its sigma-algebra independent of the sigma-algebra generated by all earlier blocks; induction gives row-wise independence of the block sums . If , stationarity gives Here and . Also and . Thus and for all sufficiently large ; on this tail, for each every block is eventually bounded by , so the Lindeberg sum is zero. Applying [F1] to this tail of rows, , and [F2] gives .
The omitted gaps and terminal remainder contain indices. For a centered -dependent sequence bounded by , at most ordered pairs of omitted terms can have nonzero covariance, each covariance having absolute value at most . Therefore the omitted sum divided by tends to zero in , hence in probability by [F6]. By [F3], .
The centered -dependent truncation errors satisfy by expanding the variance and bounding each of its at most nonzero lag terms with [F8]. For fixed real , ; thus the characteristic function of differs from that of its -truncation by at most . First taking using step 4.1 and then using proves convergence to . By [F4], . This also covers every projection with positive variance; the zero-variance case was handled in step 2.1.
Steps 2.1 and 5.1 show for every that . These are precisely the projections of the law established in step 1.1, so [F5] gives the asserted vector convergence, including singular and zero covariance.
Depends on
- Cauchy-Schwarz for random variables
- Characteristic function criterion for weak convergence
- Chebyshev's inequality for random variables
- The Axiom of Choice
- Independent sigma-algebras and independent events
- Moments, variance, and covariance on a probability space
- Multivariate normal law, including singular covariance
- Row-wise independent centered triangular array
- Total row variance and the Lindeberg condition
- Converging together lemma
- Cramer wold device
- Dominated convergence
- Lindeberg-Feller central limit theorem: sufficiency
- Slutsky's theorem for real random variables
Used by
Dependency tree · two levels
67 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- L. Horváth, P. Kokoszka, and R. Reeder, Estimation of the Mean of Functional Time Series and a Two-Sample Problem, JRSS B 75 (2013), Appendix A.1, printed pp.117–119 (the finite-dimensional m-dependent CLT is cited there, not proved) (standard reference, not scraped)
- S. Hörmann and P. Kokoszka, Functional Time Series, in Time Series Analysis: Methods and Applications, Handbook of Statistics 30 (2012), pp.157–186; bibliographic context, DOI 10.1016/B978-0-444-53858-1.00007-7 (standard reference, not scraped)