Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Dependency tree · two levels

114 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