Alphabeta Math
CorollaryStatement: 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.

Plug-in long-run variance for a stable AR mean

Statement

Assume AC and fix p≥1. Let X be a stable AR(p), meaning that its autoregressive polynomial ϕ(z)=1−∑j=1pϕjzj has no zero in ∣z∣≤1, with unknown mean μ, Xt−μ=∑j=1pϕj(Xt−j−μ)+ϵt, with iid centered innovations of variance 0<σ2<∞. Assume the strict stationarity, ergodicity, past independence, and positive-definite augmented Gram hypotheses of Fixed-order autoregressive OLS martingale limit, using its fixed-intercept regressor Zt=(1,Xt−1,…,Xt−p)T and coefficient vector (c,ϕ1,…,ϕp)T with c=μ(1−∑j=1pϕj). Write ϕ^n for the OLS slope vector and σ^n2 for its residual mean square. Define τ^n2:={σ^n2/(1−∑j=1pϕ^n,j)2,1−∑jϕ^n,j≠0,0,1−∑jϕ^n,j=0. Then τ^n2⟶Pσ2(1−∑j=1pϕj)2=σ2Ψ2>0, where Ψ is the coefficient sum of the causal AR(p) representation. Consequently τ^n2 supplies the consistent positive variance scale required by Sample-mean CLT for stable linear processes for the sample-mean interval.

Facts & Assumptions

Given: A stable AR(p) with unknown mean, iid centered innovations of finite positive variance, the strict stationarity, ergodicity, past independence, and augmented Gram assumptions in the OLS theorem, and the coefficient and variance estimators defined in the Statement.

[A1]

The Axiom of Choice: AC is inherited through the OLS and linear-process CLT suppliers cited below.

[F1]

ARMA causality and invertibility root criteria: if ϕ has no zero in ∣z∣≤1, its causal transfer series is 1/ϕ(z) and its coefficients decay exponentially.

[F5]

Strict and weak stationarity for integer-indexed time series defines weak stationarity by finite second moments, constant mean, and lag-only covariance.

[F2]

Fixed-order autoregressive OLS martingale limit: for fixed order under the stated hypotheses, the OLS slope vector has a root-n normal limit and the residual mean-square estimate converges in probability to σ2.

[F3]

Continuous maps preserve convergence in probability: finite coordinate pairing and continuous maps preserve convergence in probability.

[F6]

Finite-dimensional stochastic-order calculus and tightness: convergence in distribution in a fixed finite-dimensional Euclidean space implies boundedness in probability: for every η>0 there is M>0 with lim sup⁡nP(∥Un∥2>M)≤η.

[F4]

Sample-mean CLT for stable linear processes: if the linear-process coefficient sum has positive variance and a nonnegative scale estimate converges to that variance, studentization gives a standard-normal limit and the corresponding symmetric interval coverage.

Proof

1.1F1F5givenalgebra

Stability means that ϕ has no zero in ∣z∣≤1. In particular ϕ(1)=1−∑jϕj≠0. The finite augmented Gram matrix gives a finite second moment for each lagged coordinate, and strict stationarity gives the same finite second moment and mean at every time. Strict stationarity also makes the bivariate laws shift-invariant, so the covariance depends only on lag. Thus [F5] gives weak stationarity and verifies the solution premise of [F1]. The causal AR coefficients are then the Taylor coefficients of 1/ϕ(z) and decay exponentially. Their sum converges absolutely; evaluating the power-series identity ϕ(z)Ψ(z)=1 at z=1 gives Ψ=1/ϕ(1)=1/(1−∑jϕj). Since σ2>0 and ϕ(1) is finite and nonzero, σ2Ψ2>0.

1.2F2F6givenchoosealgebra

By [F2], Un:=n(β^n−β) converges in distribution to a finite-dimensional normal law, so [F6] makes Un bounded in probability. Fix δ,η>0 and choose M>0 with lim sup⁡nP(∥Un∥2>M)≤η. For all sufficiently large n, nδ>M, so P(∥β^n−β∥2>δ)≤P(∥Un∥2>M). Its limiting upper probability is at most η; letting η↓0 proves β^n→Pβ, and hence ϕ^n→Pϕ because the slope subvector norm is at most the full-vector norm. Supplier [F2] also gives σ^n2→Pσ2.

2.1F3step 1.1step 1.2algebra

Put d0:=1−∑jϕj≠0 and dn:=1−∑jϕ^n,j. Step 1.2 and finite coordinate pairing in [F3] give (σ^n2,ϕ^n)→P(σ2,ϕ) and dn→Pd0. The everywhere-continuous map g(s,v):=s/max⁡{(1−∑jvj)2,d02/4} therefore satisfies g(σ^n2,ϕ^n)→Pσ2/d02 by [F3]. On {∣dn∣≥∣d0∣/2} this map equals the displayed estimator τ^n2. The complement has probability at most P(∣dn−d0∣≥∣d0∣/2)→0. For every ε>0, the estimator's deviation probability is bounded by that complement probability plus P(∣g(σ^n2,ϕ^n)−σ2/d02∣>ε), so it tends to zero. This proves consistency including the zero-denominator fallback.

3.1A1F4step 1.1step 2.1given∎

By step 1.1, the limiting long-run variance is σ2Ψ2>0; step 2.1 proves that τ^n2 is a nonnegative consistent estimate of it. The exponential coefficient bound in step 1.1 gives ∑jj+1∣ψj∣<∞, so all additional hypotheses of [F4] hold; its AC branch is supplied by [A1]. The stable linear-process CLT gives the stated standardized mean limit and interval coverage. This uses the fitted OLS innovation variance and fixed-order slope estimate; it makes no claim for a data-selected order or an unspecified HAC estimator.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

50 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