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.
Sample-mean CLT for stable linear processes
Statement
Assume AC. Let be a causal linear process with real coefficients satisfying . Suppose the two-sided innovation sequence is iid, centered, and has . Put and . Then For a causal ARMA model with no zero of in , the root criterion theorem implies that its coefficients satisfy the weighted summability condition. The limiting variance may be zero when . If and a nonnegative variance estimate separately satisfies , then , with and any finite convention when , converges to . For each fixed , the symmetric interval therefore has limiting coverage . No consistency is attributed to a variance estimator unless it is separately proved.
Facts & Assumptions
Given: AC; the causal linear-process representation and weighted coefficient summability; a two-sided iid centered innovation sequence with finite positive variance; and, for the standardized conclusions, a nonnegative variance estimate consistent for the strictly positive limit .
The Axiom of Choice: AC is assumed only through the iid CLT and standard-normal-law suppliers below.
Linear processes, white noise, and ARMA models defines a causal linear process as an absolutely summable one-sided filter of centered white noise.
Absolutely summable linear filters preserve weak stationarity establishes almost-sure and existence and weak stationarity of the filtered white-noise series by Tonelli and the finite-filter tail bound.
Identical distribution and IID families: the innovations are mutually independent with a common law; their means and variance are as stated in the hypothesis.
ARMA causality and invertibility root criteria: for a causal ARMA with no autoregressive zero in the closed unit disk, the causal filter coefficients decay exponentially.
Lindeberg-Levy iid central limit theorem: under AC, iid centered real variables with finite positive variance have their normalized sample sum converging to .
Vector Slutsky theorem: a vector converging in distribution jointly with a vector converging in probability to a constant has the corresponding joint limit, and continuous transformations preserve it.
Continuous maps preserve convergence in probability: continuous real maps preserve convergence in probability at finite limits.
Standard normal and normal laws: has a continuous density; therefore fixed interval endpoints have probability zero.
Portmanteau theorem: probabilities of Borel continuity sets converge under convergence in distribution.
Cauchy-Schwarz for random variables gives the triangle bound through finite-sum expansion; Tonelli's theorem for nonnegative measurable functions on a sigma-finite product and Fatou's lemma justify the endpoint remainder's random-series and integrable-limit bounds.
Markov's inequality for random variables bounds a nonnegative random variable's probability tail by its expectation divided by a positive threshold.
Verification
The weighted summability implies . By [F2], the series defining is well-defined almost surely and in , and the filtered process is weakly stationary. Thus for a causal ARMA the weak-stationarity premise of [F4] is met, and [F4] gives for some and . The ratio of consecutive terms tends to , so as required. Absolute summability also makes finite.
For let , so . For finite , summing the first filter coefficients over gives As , the left side converges in to by [F2], and the first term on the right converges in because . We pass the finite identity to its limit once the remainder convergence has been established.
For , the two sums defining cancel on their overlap and leave distinct positive-sign and distinct negative-sign innovations. For , they leave of each. These innovations are centered, mutually independent, and have variance , so The variance calculation uses the zero covariance of distinct innovations from the white-noise condition in [F1] (also implied by iid in [F3]). For finite sums, expanding the square and using Cauchy–Schwarz [F10] gives the triangle bound. Therefore ; Tonelli [F10] defines an almost-surely absolutely convergent remainder . Applying the finite-sum bound to each tail and Fatou [F10] gives uniformly in , and the same bound for tails tends to zero. Thus the partial remainders converge to in . The uniform bound follows from the given weighted summability.
Passing to the limit in step 1.2 yields Step 1.3 gives . For every , [F11] applied to gives . Thus .
By [F5], ; multiplying by gives . Multiplying by (also when ) and adjoining the remainder from step 2.1, [F6] gives This also covers , where the limit is the point mass .
Now assume and . By [F7], . The map is continuous everywhere; by [F6] and step 3.1, . The event has probability tending to zero by convergence in probability to . On its complement this transformed variable equals , so .
For fixed , on membership of in the stated interval is equivalent to . The complementary event has probability tending to zero by step 4.1. The boundary has probability zero by [F8], so [F9] gives limiting coverage . The conclusion is conditional on the separately proved consistency of ; it does not assert that naming an estimator makes it consistent.
Depends on
- Linear processes, white noise, and ARMA models
- Absolutely summable linear filters preserve weak stationarity
- ARMA causality and invertibility root criteria
- Identical distribution and IID families
- The Axiom of Choice
- Lindeberg-Levy iid central limit theorem
- Vector Slutsky theorem
- Continuous maps preserve convergence in probability
- Portmanteau theorem
- Cauchy-Schwarz for random variables
- Markov's inequality for random variables
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Fatou's lemma
- Standard normal and normal laws
Used by
Dependency tree · two levels
66 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
- Dewei Wang, STAT 720 Time Series Analysis, Sections 2.2 and 3.1–3.2 (standard reference, not scraped)
- Nicolai Meinshausen, Time Series Analysis: Notes for the course HS 2022, Sections 2.1–2.5 (standard reference, not scraped)