Alphabeta Math
Pipeline-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.

ARMA roots, spectra and inference

1 · Prerequisites

2 · Summary

This page fixes the lag-polynomial convention, defines white noise by uncorrelatedness rather than independence, and uses coprime normalized polynomial pairs. Cancelling common factors defines an associated reduced model; its root classification applies to solutions of the reduced equation. Closed-unit-disk root tests characterize absolutely summable causal and inverse filters. A separate two-sided filter argument derives, under Countable Choice, the stationary ARMA spectral density whenever the autoregressive polynomial has no unit-circle zero; this does not require the displayed equation to be causal or invertible. The inference results apply only under their explicit assumptions: a stable linear-process sample-mean CLT for iid innovations under AC, with studentization conditional on separately proved variance consistency; its corollary supplies a fitted long-run variance for AR(p) models with no zero of ϕ in ∣z∣≤1, under the fixed-order OLS conditions below. Fixed-order OLS is under AC and strict stationarity and ergodicity, with iid innovations independent of the past filtration, predictable regressors, a finite positive-definite augmented Gram matrix, a singular-design fallback, residual variance consistency, and fixed-dimensional Wald calibration. No generic white-noise CLT, data-selected order guarantee, HAC result, or empirical adequacy claim is supplied.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Linear processes, white noise, and ARMA models

Definition

Let X=(Xt)t∈Z be a real process on one probability space. The backshift is (BX)t:=Xt−1, and for a polynomial a(z)=∑j=0majzj set a(B)Xt:=∑j=0majXt−j. Weak stationarity and the covariance convention are those of Strict and weak stationarity for integer-indexed time series and Moments, variance, and covariance on a probability space.

A real process ϵ=(ϵt)t∈Z is white noise with variance σ2 when E[ϵt]=0, 0<σ2=E[ϵt2]<∞, and Cov⁡(ϵt,ϵs)=0 for all s≠t. This definition requires only zero covariance at distinct times; it does not require independence, identical distributions, or Gaussian laws.

For a real sequence ψ=(ψj)j≥0 with ∑j≥0∣ψj∣<∞, a causal linear process driven by white noise is Xt−μ:=∑j=0∞ψjϵt−j,t∈Z, where the series is its almost-sure and L2 limit, established by Absolutely summable linear filters preserve weak stationarity ↗.

An ARMA(p,q) model, for nonnegative integers p,q, is an equation ϕ(B)(Xt−μ)=θ(B)ϵt,t∈Z, where ϕ(z)=1−∑j=1pϕjzj,θ(z)=1+∑j=1qθjzj have real coefficients and constant term one. If p=0 or q=0, the corresponding polynomial is 1. The displayed equation is imposed with a coprime normalized pair, meaning that the two polynomials have no common complex root and both have constant term one. Given an unreduced pair, cancel every common nonconstant factor in C[z] and normalize both remaining polynomials to have constant term one to define its associated reduced model. This is a model convention: a solution of the unreduced equation need not satisfy the reduced equation. Root criteria for the reduced pair apply only to solutions of that reduced equation.

For an AR(p) model (q=0), expansion gives the regression form Xt=c+∑j=1pϕjXt−j+ϵt with c=μ(1−∑j=1pϕj). Thus a fixed intercept in the AR regression is the original mean parameter written in observation coordinates.

A causal representation of this model is a representation Xt−μ=∑j≥0ψjϵt−j with ∑j∣ψj∣<∞. An invertible representation is ϵt=∑j≥0πj(Xt−j−μ) with ∑j∣πj∣<∞. These are properties of the displayed relation between X and ϵ, not claims that white noise is iid.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Absolutely summable linear filters preserve weak stationarity

Statement

Let Z=(Zt)t∈Z be a centered real weakly stationary process with autocovariance γ. For a real two-sided sequence c=(cj)j∈Z∈ℓ1(Z) define c(B)Zt:=∑j∈ZcjZt−j. Then this filter is well-defined almost surely and in L2, is centered and weakly stationary, and has autocovariance γY(h)=∑j,k∈Zcjckγ(h−j+k),h∈Z. For c,d∈ℓ1(Z) their filter composition is the convolution filter (c∗d)m:=∑j∈Zcjdm−j,c(B)(d(B)Z)=(c∗d)(B)Z. All sums are absolutely convergent in the senses justified below. This argument uses no choice axiom.

Facts & Assumptions

Given: A centered weakly stationary real process Z on one probability space, its autocovariance γ, and a real sequence c∈ℓ1(Z).

[F1]

Autocovariance and sample autocovariance gives γ(h)=Cov⁡(Zt+h,Zt), independent of t.

[F2]

Moments, variance, and covariance on a probability space defines the second moment, variance, and covariance used here.

[F3]

Cauchy-Schwarz for random variables gives E∣UV∣≤(EU2)1/2(EV2)1/2 for square-integrable real variables.

[F4]

Variance and covariance identities for random variables expands covariance bilinearly for finite linear combinations.

[F5]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product interchanges a nonnegative sum and expectation by applying Tonelli to counting measure times the probability measure.

[F6]

Tonelli's theorem for double series of nonnegative extended real numbers permits interchanging the order of summation for nonnegative double series.

[F7]

Fatou's lemma bounds the integral of an almost-sure limit by the liminf of the nonnegative integrals.

Proof

technique · establish almost-sure sums by Tonelli, control finite filter tails in $L^2$, and pass finite covariance identities to the limit
1.1F1F2F3F5given

Weak stationarity makes E[Zt2]=γ(0) for every t. Applying [F3] to Zt and the constant one gives E∣Zt∣≤γ(0), while applying it to the centered variables Zt+h,Zt gives ∣γ(h)∣≤γ(0). Consequently ∑j∈ZE[∣cjZt−j∣]≤γ(0)∑j∈Z∣cj∣<∞. Tonelli [F5] on counting measure over Z times the probability measure shows that the random series of absolute values has finite expectation, hence is finite almost surely. Thus Yt is defined by an absolutely convergent sum.

2.1F1F2F4step 1.1

For any finite J⊂Z, the finite filter YtJ=∑j∈JcjZt−j satisfies, by [F4], E[(YtJ)2]=∑j,k∈Jcjckγ(k−j)≤γ(0)(∑j∈J∣cj∣)2. The equality is a finite covariance expansion; the inequality follows from ∣γ(k−j)∣≤γ(0) from step 1.1. Applying the same bound to a finite tail J gives ∥∑j∈JcjZt−j∥2≤γ(0)∑j∈J∣cj∣.

3.1F7step 1.1step 2.1algebra

Enumerate Z as 0,1,−1,2,−2,… and let YtN be the partial sum through the first N terms. The absolute almost-sure convergence from step 1.1 gives Yt−YtN=lim⁡M→∞(YtM−YtN) almost surely. Fatou [F7] and the finite-tail bound of step 2.1 therefore give E∣Yt−YtN∣2≤γ(0)(∑j omitted after N∣cj∣)2⟶0. Thus YtN→Yt in L2 and Yt is square-integrable.

4.1F1F2F3F4F6step 3.1algebra

Each finite filter is centered. The L2 convergence in step 3.1 implies L1 convergence by [F3] applied to the difference and the constant one; hence E[Yt]=0. For finite J, covariance bilinearity [F4] gives Cov⁡(Yt+hJ,YtJ)=∑j,k∈Jcjckγ(h−j+k). As J increases through the enumeration, the left side converges to Cov⁡(Yt+h,Yt) by L2 convergence and [F3]. The right side converges absolutely because ∑j,k∈Z∣cjckγ(h−j+k)∣≤γ(0)(∑j∣cj∣)2<∞, with order of summation justified by [F6]. Its limit is independent of t, so Y is weakly stationary with the stated autocovariance.

5.1F5F6step 1.1step 2.1step 3.1algebra∎

Let c,d∈ℓ1(Z). The triangle inequality and [F6] give ∑m∈Z∣(c∗d)m∣≤∑j,k∈Z∣cj∣∣dk∣=(∑j∣cj∣)(∑k∣dk∣)<∞, so c∗d∈ℓ1(Z). Tonelli [F5] and the uniform bound from step 1.1 give E ⁣[∑j,k∈Z∣cjdkZt−j−k∣]=∑j,k∈Z∣cjdk∣E∣Zt−j−k∣≤γ(0)(∑j∣cj∣)(∑k∣dk∣)<∞. Hence this double random series is absolutely convergent almost surely. Reindexing the absolutely convergent terms by m=j+k gives ∑jcj(∑kdkZt−j−k)=∑m(∑jcjdm−j)Zt−m=∑m(c∗d)mZt−m. Both sides are the filter limits defined in the Statement, and the equality holds almost surely and in L2 by the bounds of steps 2.1 and 3.1. This proves the composition formula.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

ARMA causality and invertibility root criteria

Statement

Let X be weakly stationary and let (Xt,ϵt) satisfy the normalized coprime ARMA(p,q) equation of Linear processes, white noise, and ARMA models, with centered white noise of variance σ2>0. A causal representation with absolutely summable one-sided coefficients exists if and only if ϕ(z)≠0 for every ∣z∣≤1. In that case its coefficients are uniquely determined by Ψ(z):=∑j≥0ψjzj=θ(z)ϕ(z),∣z∣≤1, and there are constants C<∞ and r>1 with ∣ψj∣≤Cr−j.

An invertible representation with absolutely summable one-sided coefficients exists if and only if θ(z)≠0 for every ∣z∣≤1. Its coefficients are uniquely determined by Π(z):=∑j≥0πjzj=ϕ(z)θ(z),∣z∣≤1. The two criteria are separate: neither condition assumes the other.

Facts & Assumptions

Given: A weakly stationary real solution of the normalized coprime ARMA equation ϕ(B)(Xt−μ)=θ(B)ϵt, real polynomials ϕ(0)=θ(0)=1, and centered white noise with 0<σ2=E[ϵt2]<∞.

[F1]

Linear processes, white noise, and ARMA models: a causal representation is an L2 one-sided filter Xt−μ=∑j≥0ψjϵt−j with ∑j∣ψj∣<∞; invertibility is an L2 representation ϵt=∑j≥0πj(Xt−j−μ) with ∑j∣πj∣<∞. The polynomials are normalized and have no common complex root.

[F2]

Strict and weak stationarity for integer-indexed time series: weak stationarity supplies finite second moments, constant mean, and lag-only autocovariance; these hypotheses make the absolutely summable filter operations applicable to the given solution.

[F3]

Absolutely summable linear filters preserve weak stationarity: absolutely summable filters are well-defined in L2 and compose by convolution. Applied to white noise, a filter with coefficients a∈ℓ1(N0) has variance σ2∑j≥0aj2.

[F4]

Every nonconstant polynomial in C[x] splits into linear factors: every nonconstant complex polynomial factors into linear terms over C.

Proof

Proof technique: compare filter coefficients against nondegenerate white noise for necessity; expand reciprocal polynomials into geometric series for sufficiency.

1.1F1F3givenalgebra

Suppose a causal representation exists, with Ψ(z)=∑j≥0ψjzj and ∑j∣ψj∣<∞. Applying the finite polynomial ϕ(B) and using the ARMA equation gives (ϕ(B)Ψ(B)−θ(B))ϵt=0. The coefficient sequence a of ϕΨ−θ is in ℓ1 because ϕ,θ are finite polynomials and ψ∈ℓ1. By [F3], the variance of this zero random variable is σ2∑j≥0aj2. Since σ2>0, every aj=0, so ϕ(z)Ψ(z)=θ(z) on the closed unit disk; the series for Ψ converges uniformly there because ∑j∣ψj∣<∞.

1.2F4givenalgebra

Suppose ϕ has degree m≥1 and roots r1,…,rm counted with multiplicity. None is zero because ϕ(0)=1. By [F4] and normalization, ϕ(z)=∏ℓ=1m(1−z/rℓ). If every ∣rℓ∣>1, then for ∣z∣≤1 each factor has the geometric expansion (1−z/rℓ)−1=∑k≥0rℓ−kzk. The coefficient of zj in 1/ϕ(z) has absolute value at most (j+m−1m−1)r∗−j, where r∗=min⁡ℓ∣rℓ∣>1, since there are (j+m−1m−1) nonnegative m-tuples summing to j. Choose 1<r<r∗. The polynomial factor (j+m−1m−1)(r/r∗)j is bounded in j, so these coefficients are bounded by Cr−j. Multiplication by the finite polynomial θ preserves an exponential bound. If m=0, ϕ=1 and θ/ϕ is finite, which also has an exponential bound after enlarging C. Thus η(z):=1/ϕ(z) and Ψ(z):=η(z)θ(z)=θ(z)/ϕ(z) have absolutely summable one-sided coefficients, and those of Ψ have the stated exponential decay.

1.3F1F2F3givenalgebra

Suppose an invertible representation exists, ϵt=π(B)(Xt−μ) with π∈ℓ1(N0). Apply the finite filter ϕ(B) and commute the absolutely summable and polynomial filters by [F3] on the weakly stationary process [F2]: ϕ(B)ϵt=ϕ(B)π(B)(Xt−μ)=π(B)ϕ(B)(Xt−μ)=π(B)θ(B)ϵt. The coefficient sequence of ϕ−πθ is in ℓ1. Its filter of white noise is zero, so [F3] and σ2>0 imply every coefficient is zero. The absolutely summable series Π converges uniformly on the closed unit disk, so the coefficient identity yields ϕ(z)=Π(z)θ(z) for ∣z∣≤1.

2.1F1step 1.1algebra

If ϕ(z0)=0 for some ∣z0∣≤1, step 1.1 gives θ(z0)=ϕ(z0)Ψ(z0)=0. This is a common root, contrary to the coprime condition in [F1]. Therefore causality implies that ϕ has no zero in the closed unit disk.

2.2F1F2F3step 1.2algebra

Let η(z)=1/ϕ(z) be the absolutely summable causal series from step 1.2. Apply the filter η(B) to the given equation. Since X−μ is weakly stationary, [F2] and [F3] justify composition and η∗ϕ is the constant coefficient sequence 1. Therefore Xt−μ=η(B)ϕ(B)(Xt−μ)=η(B)θ(B)ϵt=Ψ(B)ϵt. This is the required causal representation of the given solution.

2.3F1step 1.3algebra

If θ(z0)=0 for some ∣z0∣≤1, step 1.3 gives ϕ(z0)=Π(z0)θ(z0)=0, contradicting coprimality. Hence invertibility implies that θ has no zero in the closed unit disk.

2.4F1F2F3F4givenstep 1.2algebra

If θ has no zero in ∣z∣≤1, the same geometric-series argument as in step 1.2 applied to its roots gives an absolutely summable causal series η(z)=1/θ(z). Set Π(z)=η(z)ϕ(z); its coefficients are absolutely summable. Applying η(B) to the ARMA equation and using filter composition [F3] on the weakly stationary process [F2] gives Π(B)(Xt−μ)=η(B)ϕ(B)(Xt−μ)=η(B)θ(B)ϵt=ϵt. Thus the model is invertible.

3.1step 1.1step 1.2step 2.1step 2.2step 1.3step 2.3step 2.4∎

Steps 1.1, 1.2, 2.1, and 2.2 prove both directions of the causal criterion and identify its coefficients; steps 1.3, 2.3, and 2.4 prove both directions of the invertibility criterion and identify its coefficients. The proof uses no choice axiom.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Spectral density of a stationary ARMA solution

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)).

Let Xt−μ be a real weakly stationary solution of the normalized coprime ARMA(p,q) equation ϕ(B)(Xt−μ)=θ(B)ϵt, where ϵ is centered white noise with variance σ2>0. If ϕ(z)≠0 for every ∣z∣=1, then X has a spectral density, under the convention γ(h)=∫TeihλF(dλ) and angular Lebesgue measure dλ of total mass 2π, given by f(λ)=σ22π∣θ(e−iλ)∣2∣ϕ(e−iλ)∣2,−π≤λ≤π. No causal or invertible root condition is required; zeros of θ on the unit circle are permitted.

Facts & Assumptions

Given: Countable Choice; the normalized ARMA equation, a real weakly stationary solution, centered white noise with variance σ2>0, and no zero of ϕ on the unit circle.

[A1]

The Axiom of Countable Choice (ACω) is assumed for the angular Lebesgue measure and Polish-space regularity steps below.

[F1]

Linear processes, white noise, and ARMA models: the equation uses the backshift and normalized real polynomials; white noise is centered, finite-variance, and uncorrelated at distinct times.

[F2]

Spectral measures and the known-mean periodogram: with T=R/(2πZ), a spectral measure represents γ(h) by ∫eihλF(dλ); a spectral density f means F(dλ)=f(λ)dλ, where angular Lebesgue measure has total mass 2π.

[F3]

Absolutely summable linear filters preserve weak stationarity: two-sided ℓ1 filters are well-defined in L2, compose by convolution, and transform covariance through their coefficients.

[F4]

Radon measure on an LCH space: a finite Borel measure on the compact circle is Radon when it is outer regular on Borel sets and inner regular on open sets.

[F5]

Tonelli's theorem for double series of nonnegative extended real numbers permits interchanging the order of summation for absolutely summable coefficient products.

[F6]

Every nonconstant polynomial in C[x] splits into linear factors: every nonconstant complex polynomial factors into linear terms over C.

[F8]

Under Countable Choice, every Borel probability measure on a Polish space is inner regular on all Borel sets (Assuming countable choice, Borel probability measures on Polish spaces are inner regular).

[F9]

If f is nonnegative and Borel measurable, then E↦∫Ef dλ is a Borel measure (The indefinite integral of a nonnegative measurable function is a measure).

[F10]

The nonnegative integral is monotone and homogeneous (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F11]

A probability measure is a measure of total mass one (Probability measures and probability spaces).

Proof

Proof technique: invert ϕ by a two-sided absolutely summable Laurent filter, compute the filtered white-noise covariance, and identify its Fourier density directly.

1.1F1F3F6givenconstruct

By [F6], factor ϕ over C as ϕ(z)=∏ℓ=1m(1−z/rℓ), with multiplicities and ϕ(0)=1; if m=0, take the empty product 1. None of the roots satisfies ∣rℓ∣=1. For a root with ∣rℓ∣>1 use (1−z/rℓ)−1=∑j≥0rℓ−jzj on the unit circle. For a root with ∣rℓ∣<1 use (1−z/rℓ)−1=−∑j≥1rℓjz−j there. Each coefficient sequence is in ℓ1(Z), so their finite convolution and multiplication by θ give a two-sided sequence h∈ℓ1(Z) with ∑k∈Zhkzk=θ(z)ϕ(z),∣z∣=1. Conjugate roots occur in pairs for real ϕ,θ. For each conjugate pair the finite convolution coefficient is unchanged by complex conjugation after reversing its summation index; real roots have real coefficients. Multiplication by real θ preserves reality.

1.2A1F2F4F7F8F11algebra

The angular measure dλ is a finite Borel measure of total mass 2π by [F2]. Normalize it to P=dλ/(2π), a Borel probability by [F11]. By [F7], T is Polish, so [F8] gives compact inner approximations for every Borel set under P; scaling by 2π gives the same property for dλ. For any Borel E, apply this inner approximation to T∖E: for every η>0 there is compact K⊆T∖E with dλ((T∖E)∖K)<η. Then U=T∖K is open, contains E, and dλ(U∖E)<η. Thus dλ is outer regular on Borel sets and inner regular on open sets; it is finite on compact sets because its total mass is finite. Hence dλ is Radon by [F4].

2.1F1F3step 1.1algebra

Write a(z)=1/ϕ(z) for the two-sided absolutely convergent series constructed in step 1.1. Its product with ϕ is the constant series 1. Applying filter composition [F3] to the ARMA equation gives Xt−μ=a(B)ϕ(B)(Xt−μ)=a(B)θ(B)ϵt=∑k∈Zhkϵt−k. Thus every weakly stationary solution under the stated root condition is the same two-sided filtered white-noise process.

2.2F2F4F9F10step 1.1step 1.2algebra

Define f(λ):=σ22π∣∑k∈Zhke−ikλ∣2=σ22π∣θ(e−iλ)∣2∣ϕ(e−iλ)∣2. The series is uniformly convergent because h∈ℓ1, so f is continuous, periodic, and nonnegative. It is bounded on the compact circle; therefore F(E):=∫Ef dλ is a finite positive Borel measure by [F9] and [F10]. For any Borel E and ε>0, outer regularity of dλ gives an open U⊃E with dλ(U∖E)<ε/(∥f∥∞+1). Since F(U)=F(E)+F(U∖E) and F(U∖E)≤∥f∥∞dλ(U∖E), this proves outer regularity of F. For any open O, inner regularity of dλ gives a compact K⊂O with dλ(O∖K)<ε/(∥f∥∞+1); the same bound on F(O∖K) proves inner regularity of F on open sets. Thus F is Radon by [F4].

3.1F1F3step 2.1

Applying the covariance formula in [F3] to the representation in step 2.1 and using Cov⁡(ϵs,ϵt)=σ2 when s=t and 0 otherwise gives γ(h)=σ2∑k∈Zhk+hhk. The sum is absolutely convergent because h∈ℓ1(Z).

4.1F2F5step 3.1step 2.2algebra∎

Put HN(λ):=∑∣k∣≤Nhke−ikλ. Since h∈ℓ1, HN converges uniformly to H(λ):=∑khke−ikλ. The sequence HN is uniformly bounded, so ∣HN∣2 converges uniformly to ∣H∣2. Expanding each finite square gives ∣HN(λ)∣2=∑∣j∣,∣k∣≤Nhjhke−i(j−k)λ, and [F5] gives ∑j,k∣hjhk∣=(∑k∣hk∣)2<∞. Hence the finite squares also converge uniformly to the full double series. Integration against eihλ preserves this uniform limit because the circle has finite measure. For each integer h, ∫Teihλf(λ) dλ=σ2∑j,khjhk12π∫−ππei(h−j+k)λ dλ=σ2∑khk+hhk=γ(h), where the middle integral is 1 when h−j+k=0 and 0 otherwise, and the last equality is step 3.1. Hence F represents the autocovariance and f is a spectral density under [F2].

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

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.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Fixed-order autoregressive OLS martingale limit

Statement

Assume the Axiom of Choice. Fix p≥1, put ϕ=(ϕ1,…,ϕp)T, and let Yt=(Xt−1,…,Xt−p)T. Either take Zt=Yt and Xt=βTZt+ϵt with d=p and β=ϕ, or take Zt=(1,YtT)T and Xt=βTZt+ϵt with d=p+1 to include a fixed intercept. Let X be a strictly stationary process whose canonical one-sided shift is ergodic, and suppose the displayed AR(p) equation holds. Assume the innovations (ϵt)t∈Z are iid, centered, have 0<σ2=E[ϵ02]<∞, and are independent of the past: for the filtration Ft:=σ(Xs,ϵs:s≤t),t∈N0, Zt is Ft−1-measurable and ϵt is independent of Ft−1 for each t≥1. Assume Γ:=E[ZtZtT] is finite and positive definite, meaning aTΓa>0 for every a≠0.

For observations at t=1,…,n, set Gn:=1n∑t=1nZtZtT,bn:=1n∑t=1nZtXt. Define the measurable OLS fallback by β^n=Gn−1bn when Gn is invertible and β^n=0 otherwise, and define σ^n2:=1n∑t=1n(Xt−β^nTZt)2. Then n(β^n−β)⇒Nd(0,σ2Γ−1),σ^n2⟶Pσ2. If Wn is the fixed-order Wald statistic Wn:=nσ^n2(β^n−β)TGn(β^n−β) when Gn is invertible and σ^n2>0, and is set to 0 otherwise, then Wn⇒χd2. These statements use fixed p; they do not assert validity after data-selected order.

Facts & Assumptions

Given: The Axiom of Choice; a fixed-order AR(p) equation and regressor choice from the Statement; a strictly stationary ergodic process; the iid innovation and past-independence assumptions; 0<σ2<∞; and a finite positive-definite matrix Γ=E[ZtZtT].

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function. It is inherited by the conditional-expectation, Birkhoff, martingale-CLT, Cramér–Wold, and multivariate-normal/chi-square suppliers.

[F1]

Stationary process and canonical path shift and Ergodicity relative to an invariant measure: strict stationarity is invariance of finite-dimensional laws under shifts, and ergodicity is ergodicity of the canonical shift on path space.

[F2]

Birkhoff limit for a stationary integrable process: under AC, averages of a strictly stationary integrable process converge almost surely to the process mean when its canonical shift is ergodic.

[F3]

Filtration and filtered probability space and Square-integrable martingale-difference array and variance clock: a rowwise square-integrable martingale-difference array has predictable variance clock Γn,m=∑k≤mE[Zn,k2∣Fn,k−1]; finite rows are padded by zeros.

[F4]

Conditional expectation as an ae class: conditional expectation is the unique almost-sure class characterized by its integrals over every event in the conditioning sigma-algebra.

[F5]

Independent sigma-algebras and independent events, Measurable coordinatewise functions preserve independence, and Expectations factor over finite products of independent random variables: measurable functions of independent variables remain independent, and expectations of products of integrable independent variables factor.

[F6]

Moments, variance, and covariance on a probability space and Cauchy-Schwarz for random variables: finite second moments give integrable products and ∣E[UV]∣≤∥U∥2∥V∥2.

[F7]

Martingale central limit theorem: under AC, a square-integrable martingale-difference array whose terminal predictable variance tends in probability to 1 and whose unconditional Lindeberg sums tend to zero has terminal sum converging to N(0,1).

[F8]

Cramer wold device: under AC, convergence of every scalar projection to the corresponding projection of a specified finite-dimensional law implies vector convergence in distribution.

[F9]

Vector Slutsky theorem and Finite-dimensional stochastic-order calculus and tightness: a vector converging in distribution is bounded in probability; adjoining a vector converging in probability to a constant preserves joint convergence and permits continuous maps.

[F10]

Kolmogorov iid l1 strong law: sample averages of iid integrable variables converge almost surely to their common mean.

[F11]

Multivariate normal law, including singular covariance and Chi-square laws, including zero degrees: a finite-dimensional normal law is determined by its scalar normal projections, and χd2 is the law of the squared norm of Nd(0,Id).

[F12]

Dominated convergence permits limits through expectations under an integrable dominating function.

[F13]

Identical distribution and IID families: iid means mutual independence together with a common marginal law.

[F14]

Convergence in distribution of random elements and Convergence in probability give the meanings of ⇒ and ⟶P.

[F15]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a real symmetric positive-definite matrix has an orthonormal eigenbasis; taking positive square roots of its eigenvalues gives its positive-definite square root.

Verification

1.1A1F4F5F6given

Fix a∈Rd and t≥1. For any A∈Ft−1, the variables aTZt 1A and (aTZt)2 1A are Ft−1-measurable. Past-independence, [F5], and E[ϵt]=0 give E[aTZtϵt1A]=0; past-independence, [F5], and E[ϵt2]=σ2 give E[(aTZt)2ϵt21A]=σ2E[(aTZt)21A]. By [F4] these event-integral identities say E[aTZtϵt∣Ft−1]=0,E[(aTZtϵt)2∣Ft−1]=σ2(aTZt)2. Factorization also gives E[(aTZtϵt)2]=σ2aTΓa<∞, so each score increment is square-integrable.

1.2A1F1F2F6given

For each coordinate pair (i,j), the sequence Vkij:=Zk,iZk,j, k≥1, is an integrable measurable function of the finite block (Xk−p,…,Xk−1). Cauchy–Schwarz gives E∣Vkij∣≤(EZk,i2)1/2(EZk,j2)1/2<∞. The one-sided process Wm:=Xm+1−p, m≥0, has the same canonical path law as the one-sided restriction of X, by strict stationarity. Each lag block (Xk−p,…,Xk−1) is a fixed finite-block function of Wk−1,…,Wk+p−2. A shift-invariant event for this factor pulls back to a shift-invariant event for W, so the block process is ergodic. Applying [F2] componentwise gives Gn→Γ almost surely, since there are finitely many entries.

2.1F14F15step 1.2givenalgebra

By [F15], the positive eigenvalues of Γ have positive product, so det⁡Γ>0. The determinant and cofactors are polynomials in the matrix entries, hence det⁡Gn→det⁡Γ almost surely. Therefore P(Gn is singular)→0. On the invertible event, the adjugate formula Gn−1=adj⁡(Gn)/det⁡Gn gives inverse convergence on the invertible event. Define Hn=Gn−1 there and Hn=Γ−1 otherwise; then Hn→Γ−1 in probability. The OLS fallback is measurable because Gn and det⁡Gn are measurable, and inversion is continuous on the invertible matrices.

2.2F3step 1.1given

Fix a≠0 and put λa:=σ2aTΓa>0. For each n, define Dn,k:=aTZkϵknλa(1≤k≤n),Dn,k:=0(k>n), with filtration Fk. By step 1.1 the nonzero terms are square-integrable martingale differences; the padded terms preserve that property.

2.3A1F2F3step 1.1step 1.2given

By step 1.1, the terminal predictable variance of this row is Γn,∞=1naTΓa∑k=1n(aTZk)2. The squared projection is integrable, stationary and ergodic as a measurable function of the lag block by step 1.2. Birkhoff [F2] makes this average converge almost surely to E[(aTZt)2]/(aTΓa)=1.

2.4F6F12step 1.1given

Let Wk:=aTZkϵk. The AR equation makes Wk the same finite-block measurable function of the strictly stationary process X at each time, so the Wk are identically distributed; step 1.1 gives E[W12]=λa<∞. For every δ>0, the unconditional Lindeberg sum is ∑k=1nE[Dn,k21{∣Dn,k∣>δ}]=1λaE ⁣[W121{∣W1∣>δnλa}]⟶0 by dominated convergence [F12], since the indicators decrease pointwise to zero and W12 is integrable.

3.1A1F7F8F14step 2.2step 2.3step 2.4

Steps 2.2, 2.3, and 2.4 verify the square-integrable array, variance-clock, and unconditional Lindeberg hypotheses of [F7]. Thus aTSn/λa⇒N(0,1) for Sn:=n−1/2∑k=1nZkϵk. This holds for every nonzero a; a=0 is immediate. Applying [F8] to the specified normal law gives Sn⇒Nd(0,σ2Γ).

4.1F9F14step 2.1step 3.1given

On the event that Gn is invertible, the normal equations give n(β^n−β)=Gn−1Sn=HnSn. By step 2.1, Hn→PΓ−1; by step 3.1 the score converges in distribution. The bilinear map (A,x)↦Ax is continuous, so [F9] gives the limit Γ−1Nd(0,σ2Γ)=Nd(0,σ2Γ−1). The OLS fallback differs from HnSn only on an event whose probability tends to zero by step 2.1, so bounded-continuous test expectations have the same limit.

4.2F9F10F13step 2.1step 3.1givenalgebra

By [F9] and step 3.1, Sn=OP(1); step 2.1 also gives Hn=OP(1). Consequently β^n−β=OP(n−1/2). On the invertible event, expanding the residual square and using the normal equations gives σ^n2=1n∑k=1nϵk2−1nSnTGn−1Sn. The second term is OP(n−1). By [F10], the first term converges almost surely to σ2, because ϵt2 are iid and integrable. The singular-event probability tends to zero by step 2.1, so σ^n2→Pσ2.

5.1A1F9F11F14F15step 1.2step 2.1step 4.1step 4.2algebra∎

The event that Gn is singular or σ^n2≤σ2/2 has probability tending to zero by steps 2.1 and 4.2. The map h(x,A,s):=xTAx/max⁡(s,σ2/2) is continuous everywhere and agrees with the Wald formula on the complement of that event. By steps 1.2, 4.1, and 4.2, the joint limit of the vector, matrix, and scalar arguments of h is (Z,Γ,σ2) with Z∼Nd(0,σ2Γ−1). [F9] gives the limit σ−2ZTΓZ. By [F15], let Γ1/2 be the positive square root. The definition of the multivariate normal law in [F11] gives U=Γ1/2Z/σ∼Nd(0,Id), so [F11] identifies σ−2ZTΓZ=∥U∥2∼χd2. The statistic's arbitrary zero convention on the vanishing-probability exceptional event does not change this limit.

CorollaryStatement: AI-adaptedProof: AI-adaptedOpen item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources