Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pendingverified 2026-10-23 (gpt-6.1-sol)
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.

A Gaussian AR(1) sensor and its long-run variance

Example

Let (D,D,λ), d, and H be as in the Definition, with λ(D)>0. Let e1 be the first standard basis vector in Rd and set ψ:=e1/λ(D). For each x∈R, the spatially uniform field Vx(y):=xe1 belongs to H and has sensor reading Sψ(Vx)=x.

Assume AC. Let (Xn)n≥0 be a centered (that is, E[Xn]=0 for every n≥0), strictly stationary, jointly Gaussian time-homogeneous Markov chain on R with invariant probability ν=L(X0), where L(X0)(A):=P(X0∈A) for every Borel set A⊆R, and recursion Xn+1=ρXn+ϵn+1,∣ρ∣<1,η>0. Assume (ϵn)n≥1 is an independent sequence with common law N(0,η2), independent of X0; then the transition kernel is P(x,⋅)=N(ρx,η2). For m∈R and v≥0, N(m,v) denotes the normal law with mean m and variance v; for v=0 it is the point mass at m, and for v>0 it has density (2πv)−1/2exp⁡(−(x−m)2/(2v)). “Jointly Gaussian” means every finite real linear combination of chain coordinates has law N(m,v) for some m∈R and v≥0; “strictly stationary” means every finite-dimensional law is unchanged by nonnegative integer time shifts. The recursion is imposed for every n≥0. The associated velocity-field sensor output is Yn:=Sψ(VXn)=Xn. If Xn has velocity units m s−1, then ϵn and η have units m s−1, ρ is dimensionless, and the long-run variance has units m2 s−2. This is a mathematical model example, not a reported fluid measurement.

For k≥0, its covariance is γk:=Cov⁡(Y0,Yk)=η2ρk1−ρ2. The covariance series is absolutely summable, and the centered sensor sum satisfies 1n∑j=0n−1Yj⇒N ⁣(0,η2(1−ρ)2). Consequently its covariance long-run variance is σLR2=η2/(1−ρ)2.

Facts & Assumptions

Given: A finite-volume spatial measure space, the normalized weight ψ=e1/λ(D), a centered strictly stationary jointly Gaussian time-homogeneous Markov chain with the stated transition recursion and independent Gaussian innovations, ∣ρ∣<1, η>0, and AC.

[A1]

AC is an assumption required by the time-homogeneous Markov-chain definition and the long-run-variance supplier (The Axiom of Choice).

[A2]

The centered, stationary jointly Gaussian AR(1) chain and its independent innovations are the stipulated mathematical probability model in the Example; centering means E[Xn]=0 for every n≥0.

[F1]

The ideal sensor is Sψ(v)=∫Dv⋅ψ dλ on spatial L2 velocity fields (Finite-second-moment random velocity sensor law).

[F2]

The sensor pairing is well-defined on equivalence classes and its centering is finite (The L2 velocity sensor is well-defined).

[F3]

The Markov-chain transition kernel is the conditional law of the next state given the natural filtration (Time-homogeneous Markov chain with transition kernel).

[F4]

An invariant distribution ν satisfies νP=ν (Invariant and stationary distribution for a Markov kernel).

[F5]

Variance and covariance are the centered second moment and centered product expectation (Moments, variance, and covariance on a probability space).

[F6]

For ∣ρ∣<1, ∑k=0∞ρk=(1−ρ)−1 and ∑k=0∞∣ρ∣k<∞ (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges).

[F7]

Weak convergence is convergence of integrals against every bounded continuous real function (Weak convergence of borel probability measures).

[F8]

Dominated convergence passes limits through integrals under one integrable majorant (Dominated convergence).

[F9]

After the CLT and absolute covariance summability are proved, the covariance series defines the long-run variance (Long-run variance for a stationary Markov chain).

Proof

Given: The assumptions and notation of the Example.

1.1F1F2givenalgebra

For each scalar x, Sψ(Vx)=∫Dxe1⋅(e1/λ(D)) dλ=xλ(D)/λ(D)=x. Thus the random-field sensor output Yn equals Xn.

1.2A1A2F3F4given

Independence of ϵn+1 from the natural past and its stated law imply P(Xn+1∈A∣σ(X0,…,Xn))=P(Xn,A) for every Borel A, with P(x,⋅)=N(ρx,η2). The stipulated stationary law ν is invariant in the sense of [F4].

2.1A2F5step 1.2algebra

Stationarity and the recursion give E[Xn+12]=ρ2E[Xn2]+η2, because ϵn+1 is centered and independent of Xn. Thus γ0=E[Xn2]=η2/(1−ρ2). Iterating the recursion gives Xk=ρkX0+∑j=1kρk−jϵj; the innovation sum is centered and independent of X0, so [F5] yields γk=ρkγ0 for every k≥0.

3.1F6step 2.1algebra

Since ∣ρ∣<1, [F6] gives ∑k≥1∣γk∣=γ0∑k≥1∣ρ∣k<∞ and γ0+2∑k≥1γk=η21−ρ2(1+2ρ1−ρ)=η2(1−ρ)2. The last equality uses 1−ρ2=(1−ρ)(1+ρ) and ∣ρ∣<1, so 1+ρ>0.

3.2A2F5step 2.1algebra

The centered sum Sn:=n−1/2∑j=0n−1Yj is normally distributed because the finite vector (X0,…,Xn−1) is jointly Gaussian. Expanding its variance and counting the n−k pairs at lag k gives vn:=Var⁡(Sn)=γ0+2∑k=1n−1(1−kn)γk.

4.1F6F8step 3.1step 3.2algebra

On the counting-measure space N, the summands 1{k<n}(1−k/n)γk converge pointwise to γk and are dominated in absolute value by the summable sequence ∣γk∣. By [F8], vn→γ0+2∑k≥1γk=η2/(1−ρ)2=:v>0.

5.1F7F8F9step 3.1step 4.1given∎

Let G have law N(0,1). Since Sn is centered normal with variance vn, its law equals that of vnG. For every bounded continuous h:R→R, h(vnG)→h(vG) pointwise and is bounded by ∥h∥∞; [F8] gives convergence of expectations. By [F7], Sn⇒N(0,v). The chain is stationary Markov, the covariance series is absolutely summable by step 3.1, and the CLT has now been proved, so [F9] identifies v as its covariance long-run variance.

Depends on

Dependency tree · 2 levels

Sources