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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Character Groups and Elementary LCA Duals
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Consistency and Limiting Distributions
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian Orthogonal Decomposition and Quadratic Forms
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Martingale Inequalities and Convergence
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measure-Preserving Systems and Mixing Criteria
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Spectral measures and periodogram bias
- Splitting Fields
- Stationary Markov Chains and Ergodic Limits
- Stationary means and sample autocovariance
- Strong Laws of Large Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Ergodic Theorems of von Neumann and Birkhoff
- The Exponential Function
- The Fundamental Group of the Circle
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Uniform Spaces: the Three Definitions
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
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 models with no zero of in , 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
Linear processes, white noise, and ARMA models
Definition
Let be a real process on one probability space. The backshift is , and for a polynomial set . 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 is white noise with variance when , , and for all . This definition requires only zero covariance at distinct times; it does not require independence, identical distributions, or Gaussian laws.
For a real sequence with , a causal linear process driven by white noise is where the series is its almost-sure and limit, established by Absolutely summable linear filters preserve weak stationarity ↗.
An ARMA model, for nonnegative integers , is an equation where have real coefficients and constant term one. If or , the corresponding polynomial is . 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 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 model (), expansion gives the regression form with . 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 with . An invertible representation is with . These are properties of the displayed relation between and , not claims that white noise is iid.
Absolutely summable linear filters preserve weak stationarity
Statement
Let be a centered real weakly stationary process with autocovariance . For a real two-sided sequence define . Then this filter is well-defined almost surely and in , is centered and weakly stationary, and has autocovariance For their filter composition is the convolution filter 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 on one probability space, its autocovariance , and a real sequence .
Autocovariance and sample autocovariance gives , independent of .
Moments, variance, and covariance on a probability space defines the second moment, variance, and covariance used here.
Cauchy-Schwarz for random variables gives for square-integrable real variables.
Variance and covariance identities for random variables expands covariance bilinearly for finite linear combinations.
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.
Tonelli's theorem for double series of nonnegative extended real numbers permits interchanging the order of summation for nonnegative double series.
Fatou's lemma bounds the integral of an almost-sure limit by the liminf of the nonnegative integrals.
Proof
Weak stationarity makes for every . Applying [F3] to and the constant one gives , while applying it to the centered variables gives . Consequently Tonelli [F5] on counting measure over times the probability measure shows that the random series of absolute values has finite expectation, hence is finite almost surely. Thus is defined by an absolutely convergent sum.
For any finite , the finite filter satisfies, by [F4], The equality is a finite covariance expansion; the inequality follows from from step 1.1. Applying the same bound to a finite tail gives .
Enumerate as and let be the partial sum through the first terms. The absolute almost-sure convergence from step 1.1 gives almost surely. Fatou [F7] and the finite-tail bound of step 2.1 therefore give Thus in and is square-integrable.
Each finite filter is centered. The convergence in step 3.1 implies convergence by [F3] applied to the difference and the constant one; hence . For finite , covariance bilinearity [F4] gives As increases through the enumeration, the left side converges to by convergence and [F3]. The right side converges absolutely because with order of summation justified by [F6]. Its limit is independent of , so is weakly stationary with the stated autocovariance.
Let . The triangle inequality and [F6] give so . Tonelli [F5] and the uniform bound from step 1.1 give Hence this double random series is absolutely convergent almost surely. Reindexing the absolutely convergent terms by gives Both sides are the filter limits defined in the Statement, and the equality holds almost surely and in by the bounds of steps 2.1 and 3.1. This proves the composition formula.
ARMA causality and invertibility root criteria
Statement
Let be weakly stationary and let satisfy the normalized coprime ARMA equation of Linear processes, white noise, and ARMA models, with centered white noise of variance . A causal representation with absolutely summable one-sided coefficients exists if and only if for every . In that case its coefficients are uniquely determined by and there are constants and with .
An invertible representation with absolutely summable one-sided coefficients exists if and only if for every . Its coefficients are uniquely determined by The two criteria are separate: neither condition assumes the other.
Facts & Assumptions
Given: A weakly stationary real solution of the normalized coprime ARMA equation , real polynomials , and centered white noise with .
Linear processes, white noise, and ARMA models: a causal representation is an one-sided filter with ; invertibility is an representation with . The polynomials are normalized and have no common complex root.
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.
Absolutely summable linear filters preserve weak stationarity: absolutely summable filters are well-defined in and compose by convolution. Applied to white noise, a filter with coefficients has variance .
Every nonconstant polynomial in splits into linear factors: every nonconstant complex polynomial factors into linear terms over .
Proof
Proof technique: compare filter coefficients against nondegenerate white noise for necessity; expand reciprocal polynomials into geometric series for sufficiency.
Suppose a causal representation exists, with and . Applying the finite polynomial and using the ARMA equation gives The coefficient sequence of is in because are finite polynomials and . By [F3], the variance of this zero random variable is . Since , every , so on the closed unit disk; the series for converges uniformly there because .
Suppose has degree and roots counted with multiplicity. None is zero because . By [F4] and normalization, If every , then for each factor has the geometric expansion The coefficient of in has absolute value at most , where , since there are nonnegative -tuples summing to . Choose . The polynomial factor is bounded in , so these coefficients are bounded by . Multiplication by the finite polynomial preserves an exponential bound. If , and is finite, which also has an exponential bound after enlarging . Thus and have absolutely summable one-sided coefficients, and those of have the stated exponential decay.
Suppose an invertible representation exists, with . Apply the finite filter and commute the absolutely summable and polynomial filters by [F3] on the weakly stationary process [F2]: The coefficient sequence of is in . Its filter of white noise is zero, so [F3] and imply every coefficient is zero. The absolutely summable series converges uniformly on the closed unit disk, so the coefficient identity yields for .
If for some , step 1.1 gives . This is a common root, contrary to the coprime condition in [F1]. Therefore causality implies that has no zero in the closed unit disk.
Let be the absolutely summable causal series from step 1.2. Apply the filter to the given equation. Since is weakly stationary, [F2] and [F3] justify composition and is the constant coefficient sequence . Therefore This is the required causal representation of the given solution.
If for some , step 1.3 gives , contradicting coprimality. Hence invertibility implies that has no zero in the closed unit disk.
If has no zero in , the same geometric-series argument as in step 1.2 applied to its roots gives an absolutely summable causal series . Set ; its coefficients are absolutely summable. Applying to the ARMA equation and using filter composition [F3] on the weakly stationary process [F2] gives Thus the model is invertible.
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.
Spectral density of a stationary ARMA solution
Statement
Assume Countable Choice (The Axiom of Countable Choice ()).
Let be a real weakly stationary solution of the normalized coprime ARMA equation where is centered white noise with variance . If for every , then has a spectral density, under the convention and angular Lebesgue measure of total mass , given by 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 , and no zero of on the unit circle.
The Axiom of Countable Choice () is assumed for the angular Lebesgue measure and Polish-space regularity steps below.
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.
Spectral measures and the known-mean periodogram: with , a spectral measure represents by ; a spectral density means , where angular Lebesgue measure has total mass .
Absolutely summable linear filters preserve weak stationarity: two-sided filters are well-defined in , compose by convolution, and transform covariance through their coefficients.
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.
Tonelli's theorem for double series of nonnegative extended real numbers permits interchanging the order of summation for absolutely summable coefficient products.
Every nonconstant polynomial in splits into linear factors: every nonconstant complex polynomial factors into linear terms over .
The unit circle with its inherited metric is compact by The multiplicative unit circle is a compact metrizable topological abelian group and For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide. A compact metric space is complete by A compact metric space is complete and totally bounded, and neither implication uses any choice principle, and under Countable Choice it is separable by A compact metric space has a countable dense subset, by countable choice. Thus is Polish by Polish spaces are separable completely metrizable spaces.
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).
If is nonnegative and Borel measurable, then is a Borel measure (The indefinite integral of a nonnegative measurable function is a measure).
The nonnegative integral is monotone and homogeneous (Monotonicity and nonnegative homogeneity of the nonnegative integral).
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.
By [F6], factor over as , with multiplicities and ; if , take the empty product . None of the roots satisfies . For a root with use on the unit circle. For a root with use there. Each coefficient sequence is in , so their finite convolution and multiplication by give a two-sided sequence with 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.
The angular measure is a finite Borel measure of total mass by [F2]. Normalize it to , a Borel probability by [F11]. By [F7], is Polish, so [F8] gives compact inner approximations for every Borel set under ; scaling by gives the same property for . For any Borel , apply this inner approximation to : for every there is compact with . Then is open, contains , and . Thus 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 is Radon by [F4].
Write for the two-sided absolutely convergent series constructed in step 1.1. Its product with is the constant series . Applying filter composition [F3] to the ARMA equation gives Thus every weakly stationary solution under the stated root condition is the same two-sided filtered white-noise process.
Define The series is uniformly convergent because , so is continuous, periodic, and nonnegative. It is bounded on the compact circle; therefore is a finite positive Borel measure by [F9] and [F10]. For any Borel and , outer regularity of gives an open with . Since and , this proves outer regularity of . For any open , inner regularity of gives a compact with ; the same bound on proves inner regularity of on open sets. Thus is Radon by [F4].
Applying the covariance formula in [F3] to the representation in step 2.1 and using when and otherwise gives The sum is absolutely convergent because .
Put . Since , converges uniformly to . The sequence is uniformly bounded, so converges uniformly to . Expanding each finite square gives , and [F5] gives . Hence the finite squares also converge uniformly to the full double series. Integration against preserves this uniform limit because the circle has finite measure. For each integer , where the middle integral is when and otherwise, and the last equality is step 3.1. Hence represents the autocovariance and is a spectral density under [F2].
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.
Fixed-order autoregressive OLS martingale limit
Statement
Assume the Axiom of Choice. Fix , put , and let . Either take and with and , or take and with to include a fixed intercept. Let be a strictly stationary process whose canonical one-sided shift is ergodic, and suppose the displayed AR() equation holds. Assume the innovations are iid, centered, have , and are independent of the past: for the filtration is -measurable and is independent of for each . Assume is finite and positive definite, meaning for every .
For observations at , set Define the measurable OLS fallback by when is invertible and otherwise, and define Then If is the fixed-order Wald statistic when is invertible and , and is set to otherwise, then . These statements use fixed ; they do not assert validity after data-selected order.
Facts & Assumptions
Given: The Axiom of Choice; a fixed-order AR() equation and regressor choice from the Statement; a strictly stationary ergodic process; the iid innovation and past-independence assumptions; ; and a finite positive-definite matrix .
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.
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.
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.
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 ; finite rows are padded by zeros.
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.
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.
Moments, variance, and covariance on a probability space and Cauchy-Schwarz for random variables: finite second moments give integrable products and .
Martingale central limit theorem: under AC, a square-integrable martingale-difference array whose terminal predictable variance tends in probability to and whose unconditional Lindeberg sums tend to zero has terminal sum converging to .
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.
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.
Kolmogorov iid l1 strong law: sample averages of iid integrable variables converge almost surely to their common mean.
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 is the law of the squared norm of .
Dominated convergence permits limits through expectations under an integrable dominating function.
Identical distribution and IID families: iid means mutual independence together with a common marginal law.
Convergence in distribution of random elements and Convergence in probability give the meanings of and .
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
Fix and . For any , the variables and are -measurable. Past-independence, [F5], and give ; past-independence, [F5], and give . By [F4] these event-integral identities say Factorization also gives , so each score increment is square-integrable.
For each coordinate pair , the sequence , , is an integrable measurable function of the finite block . Cauchy–Schwarz gives . The one-sided process , , has the same canonical path law as the one-sided restriction of , by strict stationarity. Each lag block is a fixed finite-block function of . A shift-invariant event for this factor pulls back to a shift-invariant event for , so the block process is ergodic. Applying [F2] componentwise gives almost surely, since there are finitely many entries.
By [F15], the positive eigenvalues of have positive product, so . The determinant and cofactors are polynomials in the matrix entries, hence almost surely. Therefore . On the invertible event, the adjugate formula gives inverse convergence on the invertible event. Define there and otherwise; then in probability. The OLS fallback is measurable because and are measurable, and inversion is continuous on the invertible matrices.
Fix and put . For each , define with filtration . By step 1.1 the nonzero terms are square-integrable martingale differences; the padded terms preserve that property.
By step 1.1, the terminal predictable variance of this row is 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 .
Let . The AR equation makes the same finite-block measurable function of the strictly stationary process at each time, so the are identically distributed; step 1.1 gives . For every , the unconditional Lindeberg sum is by dominated convergence [F12], since the indicators decrease pointwise to zero and is integrable.
Steps 2.2, 2.3, and 2.4 verify the square-integrable array, variance-clock, and unconditional Lindeberg hypotheses of [F7]. Thus for . This holds for every nonzero ; is immediate. Applying [F8] to the specified normal law gives .
On the event that is invertible, the normal equations give By step 2.1, ; by step 3.1 the score converges in distribution. The bilinear map is continuous, so [F9] gives the limit . The OLS fallback differs from only on an event whose probability tends to zero by step 2.1, so bounded-continuous test expectations have the same limit.
By [F9] and step 3.1, ; step 2.1 also gives . Consequently . On the invertible event, expanding the residual square and using the normal equations gives The second term is . By [F10], the first term converges almost surely to , because are iid and integrable. The singular-event probability tends to zero by step 2.1, so .
The event that is singular or has probability tending to zero by steps 2.1 and 4.2. The map 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 is with . [F9] gives the limit . By [F15], let be the positive square root. The definition of the multivariate normal law in [F11] gives , so [F11] identifies . The statistic's arbitrary zero convention on the vanishing-probability exceptional event does not change this limit.
Plug-in long-run variance for a stable AR mean
Statement
Assume AC and fix . Let be a stable AR, meaning that its autoregressive polynomial has no zero in , with unknown mean , with iid centered innovations of variance . 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 and coefficient vector with . Write for the OLS slope vector and for its residual mean square. Define Then where is the coefficient sum of the causal AR representation. Consequently 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 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.
The Axiom of Choice: AC is inherited through the OLS and linear-process CLT suppliers cited below.
ARMA causality and invertibility root criteria: if has no zero in , its causal transfer series is and its coefficients decay exponentially.
Strict and weak stationarity for integer-indexed time series defines weak stationarity by finite second moments, constant mean, and lag-only covariance.
Fixed-order autoregressive OLS martingale limit: for fixed order under the stated hypotheses, the OLS slope vector has a root- normal limit and the residual mean-square estimate converges in probability to .
Continuous maps preserve convergence in probability: finite coordinate pairing and continuous maps preserve convergence in probability.
Finite-dimensional stochastic-order calculus and tightness: convergence in distribution in a fixed finite-dimensional Euclidean space implies boundedness in probability: for every there is with .
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
Stability means that has no zero in . In particular . 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 and decay exponentially. Their sum converges absolutely; evaluating the power-series identity at gives . Since and is finite and nonzero, .
By [F2], converges in distribution to a finite-dimensional normal law, so [F6] makes bounded in probability. Fix and choose with . For all sufficiently large , , so . Its limiting upper probability is at most ; letting proves , and hence because the slope subvector norm is at most the full-vector norm. Supplier [F2] also gives .
Put and . Step 1.2 and finite coordinate pairing in [F3] give and . The everywhere-continuous map therefore satisfies by [F3]. On this map equals the displayed estimator . The complement has probability at most . For every , the estimator's deviation probability is bounded by that complement probability plus , so it tends to zero. This proves consistency including the zero-denominator fallback.
By step 1.1, the limiting long-run variance is ; step 2.1 proves that is a nonnegative consistent estimate of it. The exponential coefficient bound in step 1.1 gives , 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
- Dewei Wang, STAT 720 Time Series Analysis, Section 3.1 and Theorems 3.1–3.2
- Nicolai Meinshausen, Time Series Analysis: Notes for the course HS 2022, Sections 2.1–2.5
- Dewei Wang, STAT 720 Time Series Analysis, Sections 4.3–4.4
- Nicolai Meinshausen, Time Series Analysis: Notes for the course HS 2022, Section 2.6
- Dewei Wang, STAT 720 Time Series Analysis, Theorems 3.1–3.2
- Dewei Wang, STAT 720 Time Series Analysis, Theorem 4.4
- Nicolai Meinshausen, Time Series Analysis: Notes for the course HS 2022, spectral representation sections
- Dewei Wang, STAT 720 Time Series Analysis, Sections 2.2 and 3.1–3.2
- Dewei Wang, STAT 720 Time Series Analysis, Sections 2.3 and 6.1
- Nicolai Meinshausen, Time Series Analysis: Notes for the course HS 2022, Sections 2.1–2.3
- Dewei Wang, STAT 720 Time Series Analysis, Theorems 3.1 and Section 6.1