Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 Xt−μ=∑j≥0ψjϵt−j,t∈Z, be a causal linear process with real coefficients satisfying ∑j≥0j+1 ∣ψj∣<∞. Suppose the two-sided innovation sequence (ϵt)t∈Z is iid, centered, and has 0<σ2=E[ϵ02]<∞. Put Ψ:=∑j≥0ψj and Xˉn:=n−1∑t=1nXt. Then n(Xˉn−μ)⇒N(0,σ2Ψ2). For a causal ARMA model with no zero of ϕ in ∣z∣≤1, the root criterion theorem implies that its coefficients satisfy the weighted summability condition. The limiting variance may be zero when Ψ=0. If τ2:=σ2Ψ2>0 and a nonnegative variance estimate τ^n2 separately satisfies τ^n2⟶Pτ2, then Tn:=n(Xˉn−μ)/τ^n, with τ^n=τ^n2 and any finite convention when τ^n=0, converges to N(0,1). For each fixed c>0, the symmetric interval [Xˉn−cτ^nn,Xˉn+cτ^nn] therefore has limiting coverage P(∣N(0,1)∣≤c). 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 τ2.

[A1]

The Axiom of Choice: AC is assumed only through the iid CLT and standard-normal-law suppliers below.

[F1]

Linear processes, white noise, and ARMA models defines a causal linear process as an absolutely summable one-sided filter of centered white noise.

[F2]

Absolutely summable linear filters preserve weak stationarity establishes almost-sure and L2 existence and weak stationarity of the filtered white-noise series by Tonelli and the finite-filter L2 tail bound.

[F3]

Identical distribution and IID families: the innovations are mutually independent with a common law; their means and variance are as stated in the hypothesis.

[F4]

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.

[F5]

Lindeberg-Levy iid central limit theorem: under AC, iid centered real variables with finite positive variance have their normalized sample sum converging to N(0,1).

[F6]

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.

[F7]

Continuous maps preserve convergence in probability: continuous real maps preserve convergence in probability at finite limits.

[F8]

Standard normal and normal laws: N(0,1) has a continuous density; therefore fixed interval endpoints have probability zero.

[F9]

Portmanteau theorem: probabilities of Borel continuity sets converge under convergence in distribution.

[F10]

Cauchy-Schwarz for random variables gives the L2 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.

[F11]

Markov's inequality for random variables bounds a nonnegative random variable's probability tail by its expectation divided by a positive threshold.

Verification

1.1F1F2F4givenalgebra

The weighted summability implies ∑j∣ψj∣<∞. By [F2], the series defining Xt−μ is well-defined almost surely and in L2, and the filtered process is weakly stationary. Thus for a causal ARMA the weak-stationarity premise of [F4] is met, and [F4] gives ∣ψj∣≤Cr−j for some C<∞ and r>1. The ratio of consecutive terms j+2 r−(j+1)/(j+1 r−j) tends to 1/r<1, so ∑jj+1∣ψj∣<∞ as required. Absolute summability also makes Ψ finite.

1.2F1F2givenalgebra

For j≥0 let Dn,j:=∑t=1nϵt−j−∑t=1nϵt, so Dn,0=0. For finite J, summing the first J filter coefficients over t=1,…,n gives ∑t=1n∑j=0Jψjϵt−j=(∑j=0Jψj)∑t=1nϵt+∑j=0JψjDn,j. As J→∞, the left side converges in L2 to ∑t=1n(Xt−μ) by [F2], and the first term on the right converges in L2 because ∑j∣ψj∣<∞. We pass the finite identity to its limit once the remainder convergence has been established.

1.3F1F3F10givenalgebra

For 1≤j≤n, the two sums defining Dn,j cancel on their overlap and leave j distinct positive-sign and j distinct negative-sign innovations. For j>n, they leave n of each. These innovations are centered, mutually independent, and have variance σ2, so ∥Dn,j∥2=σ2min⁡(j,n)≤σ2j. 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 L2 triangle bound. Therefore ∑jE∣ψjDn,j∣≤σ2∑j∣ψj∣j<∞; Tonelli [F10] defines an almost-surely absolutely convergent remainder Rn:=∑j≥0ψjDn,j. Applying the finite-sum L2 bound to each tail and Fatou [F10] gives ∥Rn∥2≤σ∑j≥0∣ψj∣2j<∞, uniformly in n, and the same bound for tails tends to zero. Thus the partial remainders converge to Rn in L2. The uniform bound follows from the given weighted summability.

2.1F11step 1.2step 1.3algebra

Passing to the L2 limit in step 1.2 yields ∑t=1n(Xt−μ)=Ψ∑t=1nϵt+Rn. Step 1.3 gives E[Rn2]/n→0. For every δ>0, [F11] applied to Rn2 gives P(∣Rn∣/n≥δ)≤E[Rn2]/(nδ2)→0. Thus Rn/n→P0.

3.1A1F5F6step 2.1givenalgebra

By [F5], (σn)−1∑t=1nϵt⇒N(0,1); multiplying by σ gives n−1/2∑t=1nϵt⇒N(0,σ2). Multiplying by Ψ (also when Ψ=0) and adjoining the remainder Rn/n→P0 from step 2.1, [F6] gives n(Xˉn−μ)⇒N(0,σ2Ψ2). This also covers Ψ=0, where the limit is the point mass N(0,0).

4.1F6F7step 3.1given

Now assume τ=σ∣Ψ∣>0 and τ^n2→Pτ2. By [F7], τ^n=τ^n2→Pτ. The map g(x,s):=x/max⁡(s,τ/2) is continuous everywhere; by [F6] and step 3.1, g(n(Xˉn−μ),τ^n)⇒N(0,1). The event τ^n<τ/2 has probability tending to zero by convergence in probability to τ. On its complement this transformed variable equals Tn, so Tn⇒N(0,1).

5.1A1F8F9step 4.1given∎

For fixed c>0, on {τ^n>0} membership of μ in the stated interval is equivalent to ∣Tn∣≤c. The complementary event has probability tending to zero by step 4.1. The boundary {−c,c} has N(0,1) probability zero by [F8], so [F9] gives limiting coverage P(∣N(0,1)∣≤c). The conclusion is conditional on the separately proved consistency of τ^n2; it does not assert that naming an estimator makes it consistent.

Depends on

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