Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pass
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.

Poisson equation and long-run variance for a stationary AR(1) chain

Example

Take a∈(−1,1) and innovation variance vϵ>0. Let Xk+1=aXk+ϵk+1, where the innovations are independent N(0,vϵ) variables and X0∼N(0,vϵ/(1−a2)) is independent of them. For f(x)=x, the Poisson solution is g(x)=x/(1−a) and the long-run variance is vϵ/(1−a)2.

Facts & Assumptions

Given: The Gaussian AR(1) chain and observable in the Example.

[A1]

AC supplies the Markov-chain and conditional-expectation conventions used by the stationary-chain theorem. (The Axiom of Choice)

[F1]

An invariant initial law makes all finite-dimensional laws stationary. (Invariant initial law makes a Markov chain stationary)

[F2]

Dominated convergence passes a pointwise-convergent sequence of densities through the Lebesgue integral under one integrable majorant. (Dominated convergence)

[F3]

For a stationary chain on a countably generated state space, pointwise total-variation convergence for π-almost every start implies strong mixing. (Stationary Markov-chain total-variation convergence implies strong mixing)

[F4]

Strong mixing means αX(n)→0, and its coefficient bounds event dependence between separated past and future sigma-algebras. (Strong, uniform, and maximal-correlation mixing coefficients)

[F5]

The local Poisson theorem proves the martingale decomposition and identifies its variance with the covariance long-run variance under absolute covariance summability. (Poisson-equation martingale decomposition and MCMC CLT)

[F6]

The covariance long-run variance is γ0+2∑k≥1γk when the covariance series is absolutely convergent and the CLT holds. (Long-run variance for a stationary Markov chain)

[F7]

A stationary real process has a measure-preserving canonical left shift, and ergodicity means every shift-invariant event has probability zero or one. (Stationary process and canonical path shift)

Verification

1.1A1F1givenalgebra

Put v=vϵ/(1−a2). If Xk∼N(0,v) independently of ϵk+1, then aXk+ϵk+1 is normal with mean zero and variance a2v+vϵ=v. Thus π=N(0,v) is invariant, and initializing with π gives a stationary chain by [F1].

1.2F2givenalgebra

Iterating the recursion gives Xn=anx+∑j=1nan−jϵj when X0=x, so Pn(x,⋅)=N(anx,vn) with vn=v(1−a2n). For each fixed x, anx→0 and vn→v, so the Gaussian densities pnx(y) converge pointwise to the density p(y) of N(0,v). For sufficiently large n, v/2≤vn≤v and ∣anx∣≤1. On ∣y∣≤2, pnx(y)≤(πv)−1/2; on ∣y∣>2, ∣y−anx∣≥∣y∣/2, hence pnx(y)≤(πv)−1/2e−y2/(8v). This gives one integrable majorant for pnx; with p added it also dominates ∣pnx−p∣. By [F2], ∫∣pnx−p∣ dy→0. Therefore ∥Pn(x,⋅)−π∥TV≤∫∣pnx−p∣ dy→0 for every x.

2.1F3step 1.2given

The Borel sigma-algebra of R has the countable generating algebra of finite unions of rational half-open intervals and rational rays. Applying [F3] to step 1.2 gives αX(n)→0.

3.1F4F7step 2.1given

Let E be an event invariant under every power of the canonical left shift and put p=P(E). Finite-coordinate cylinders form a generating pi-system. The events approximable in probability by such cylinders form a sigma-algebra: complements preserve symmetric-difference probability, and for a countable union one first truncates by continuity from below and then approximates the finitely many sets. Hence for every η>0 there are j and A∈σ(X0,…,Xj) with P(E△A)<η. For m>j, B=θ−mE is measurable with respect to σ(Xm,Xm+1,…), stationarity gives P(B)=p, and shift invariance gives E=B. Thus ∣p−p2∣=∣P(E∩B)−pP(B)∣≤2η+αX(m−j). Let m→∞ using step 2.1 and then η↓0; we obtain p(1−p)=0. By [F7], every invariant event having probability zero or one is precisely ergodicity of the canonical shift.

4.1F5step 1.1step 3.1givenalgebra

Set f(x)=x and g(x)=x/(1−a). Both are in L2(π) and π(f)=0. The kernel action is Pg(x)=E[(ax+ϵ1)/(1−a)]=ax/(1−a), so g−Pg=f. Also Dk+1=(aXk+ϵk+1)/(1−a)−aXk/(1−a)=ϵk+1/(1−a), whence E[Dk+12]=vϵ/(1−a)2. Steps 1.1 and 3.1 verify the stationary and ergodic hypotheses of [F5], so this is the Poisson CLT variance.

5.1F6step 1.1step 4.1givenalgebra∎

Iterating the recursion gives Xk=akX0+∑j=1kak−jϵj. Independence implies γk=Cov⁡(X0,Xk)=vak. Since ∣a∣<1, the covariance series is absolutely summable, and [F6] gives σf2=v+2v∑k≥1ak=v+2va/(1−a)=vϵ/(1−a)2. This agrees with step 4.1, including a=0 and negative a.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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.