Alphabeta Math
PropositionStatement: AI-adaptedProof: 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.

Long-run central limit theorem for a dependent velocity sensor

Statement

Assume the Axiom of Choice. Let H and the centered sensor observable fψ:H→R be as in the Definition. The sequences in either branch below are defined on a probability space (Ω,F,P). General stationary sensor branch. Let (Vk)k≥0 be H-valued random variables with marginal law μ and put Yk=fψ(Vk). More generally, let g:H→R be Borel measurable and satisfy ∫Hg dμ=0; under V0∼μ, this is equivalent to EY0=0 for Y0=g(V0). Put Yk=g(Vk) and assume EY02<∞. Assume (Yk) is strictly stationary: all its finite-dimensional laws are unchanged by common nonnegative integer shifts. For n≥1, define αY(n):=sup⁡j≥0 sup⁡A∈σ(Y0,…,Yj)B∈σ(Yj+n,Yj+n+1,…)∣P(A∩B)−P(A)P(B)∣. Any one of the following is sufficient: Y0 is essentially bounded and ∑nαY(n)<∞; for some δ>0, E∣Y0∣2+δ<∞ and ∑nαY(n)δ/(2+δ)<∞; or αY(n)=O(rn) for some 0<r<1 and E[Y02log⁡+∣Y0∣]<∞. In each case ∑k≥1∣Cov⁡(Y0,Yk)∣<∞ and n−1/2∑k=0n−1Yk⇒N(0,σY2),σY2=Var⁡(Y0)+2∑k≥1Cov⁡(Y0,Yk)≥0. Zero variance is included. No Markov, Harris, reversibility or state-space countable-generation assumption is needed for this branch. For a Reynolds product sensor, apply this clause to the centered product itself; its (2+δ) moment is an additional hypothesis. For two bounded linear sensors on H, a finite (4+2δ) moment of ∥V0∥H is a sufficient product-moment condition. No mixing property or rate is inferred from a fluid equation or the sampling interval.

Additional Markov-chain sufficient regimes. Let B(H) be countably generated, let P be a probability kernel on (H,B(H)) with invariant probability μ, and let (Vk)k≥0 be a stationary time-homogeneous P-chain whose canonical left shift preserves its path law and whose shift-invariant measurable events have probability zero or one. Assume P is ϕ-irreducible, aperiodic, and Harris recurrent for a nonzero sigma-finite measure ϕ. Here ϕ-irreducibility means each ϕ-positive measurable set is reached with positive probability after some finite positive number of steps from every state; Harris recurrence means each such set is hit almost surely from every starting state; aperiodicity means there is no integer q≥2 and pairwise disjoint measurable sets H1,…,Hq with μ(H1)>0 and P(v,Hi+1)=1 for every v∈Hi and 1≤i<q, and P(v,H1)=1 for every v∈Hq. Invariant means μP=μ.

For k≥0, put γk:=Cov⁡μ(fψ(V0),fψ(Vk)). Suppose at least one of the following six regimes holds:

  1. For some m>1 there is a measurable M≥0 with ∫HM dμ<∞ and ∥Pn(v,⋅)−μ∥TV≤M(v)n−m for every v and n≥1;f_\psiisessentiallyboundedunder\mu$.
  2. For some m>0 there is a measurable M≥0 with ∫HM dμ<∞ and ∥Pn(v,⋅)−μ∥TV≤M(v)n−m for every v and n≥1;forsome\delta>0,f_\psi\in L^{2+\delta}(\mu)andm\delta>2+\delta$.
  3. P is geometrically ergodic, meaning ∥Pn(v,⋅)−μ∥TV≤M(v)rn for a finite measurable M and some 0<r<1, and fψ∈L2+δ(μ) for some δ>0.
  4. P is geometrically ergodic in the same total-variation sense and ∫Hfψ2log⁡+∣fψ∣ dμ<∞, with 0log⁡+0:=0.
  5. P is geometrically ergodic in the same total-variation sense, is reversible in the symmetric-flow sense μ(dv)P(v,dw)=μ(dw)P(w,dv), and fψ∈L2(μ).
  6. P is uniformly ergodic, meaning the geometric total-variation bound holds with M bounded on H, and fψ∈L2(μ).

Then ∑k≥1∣γk∣<∞ and 1n∑k=0n−1fψ(Vk) ⇒ N(0,σLR2(fψ)), where σLR2(fψ):=γ0+2∑k=1∞γk is the covariance long-run variance. Here ∥α−β∥TV:=sup⁡A∈B(H)∣α(A)−β(A)∣, and f∈Lp(μ) for finite p means ∫H∣f∣p dμ<∞. Also set log⁡+t:=max⁡(0,log⁡t) for t>0 and 0log⁡+0:=0. The zero-variance case is included. This is an asymptotic model deduction; it does not make finite samples normally distributed or establish a physical sensor's stationarity, Markov property, or mixing assumptions. A central limit theorem alone is not a consistency result for an estimated Monte Carlo standard error.

Statement references

Facts & Assumptions

Given: The sensor law, centered observable, choice assumption, stationary Harris-ergodic Markov chain, invariant probability, and any one of the six sufficient regimes in the Statement.

[A1]

The Axiom of Choice is assumed explicitly; the MCMC supplier uses it through its probability, conditional-expectation, and sequence-CLT interfaces (The Axiom of Choice).

[F1]

The sensor pairing is a Borel, centered, square-integrable observable for every finite-second-moment law and weight (The L2 velocity sensor is well-defined).

[F2]

Under the stated base hypotheses and any one of the six listed regimes, the MCMC theorem proves absolute covariance summability and the normal limit with variance equal to the covariance sum (Sufficient MCMC CLT regimes).

[F3]

Once the CLT and absolute covariance summability hold, the covariance long-run variance is γ0+2∑k≥1γk (Long-run variance for a stationary Markov chain).

[F4]

Under AC, a centered strictly stationary square-integrable real sequence satisfies the covariance-sum CLT under each of the three strong-mixing/moment conditions stated in the general branch (Strong-mixing CLTs under bounded, moment, and logarithmic-moment conditions). The event-supremum coefficient is that of Strong, uniform, and maximal-correlation mixing coefficients.

Proof

Given: The hypotheses and notation of the selected general stationary or Markov branch of the Statement.

1.1A1F1F2given

In the Markov branch, [F1] makes fψ Borel, centered under μ, and square-integrable. The state-space, kernel, invariance, stationarity, path-shift, and recurrence assumptions are exactly those required by [F2]; the Statement spells out the rate, reversibility, and moment hypotheses for each of its six cases.

1.2A1F1F4given

In the general branch, the sensor lemma [F1] supplies centering and square-integrability for g=fψ; for the other g these are explicit hypotheses. Strict stationarity and the selected mixing/moment condition are also hypotheses, so [A1] and [F4] give absolute covariance summability, nonnegativity of its sum, and the normal limit for n−1/2∑k=1nYk. Strict stationarity makes this sum have the same law as n−1/2∑k=0n−1Yk, giving the stated convention.

2.1A1F2F3step 1.1given

In that Markov branch, apply [F2] to the chain (Vk) and observable fψ. It gives ∑k≥1∣γk∣<∞ and the stated centered normal limit with variance equal to the covariance sum; [F3] identifies that sum with σLR2(fψ). The supplier includes the zero-variance limit and assumes AC explicitly.

3.1F1step 2.1step 1.2givenalgebra∎

For sensor weights ψ,χ, [F1] bounds ∣Sψ(v)Sχ(v)∣≤∥ψ∥H∥χ∥H∥v∥H2. Raising this inequality to 2+δ proves the sufficient (4+2δ) state moment. Its finite expectation makes the product integrable; subtracting its finite mean preserves its (2+δ) moment by ∣a−b∣2+δ≤21+δ(∣a∣2+δ+∣b∣2+δ). The actual mixing condition must still be supplied for this centered product process. Thus both the original Markov regimes and the general stationary/product branches follow without a finite-sample or physical mixing claim.

Depends on

Dependency tree · 2 levels

Sources