Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Sufficient MCMC CLT regimes

Statement

Assume AC. Let (X,X) be countably generated, let P be a ϕ-irreducible probability kernel (Phi-irreducibility for a general-state Markov kernel, Measure kernel and probability kernel), aperiodic (Aperiodicity for a general-state Markov kernel), and Harris recurrent relative to ϕ (Harris recurrence relative to an irreducibility measure) with invariant probability π, and let (Xk)k≥0 be a stationary P-chain whose canonical left shift preserves its path law and whose shift-invariant measurable events have probability zero or one. We take the initial law to be π, which implies stationarity by Invariant initial law makes a Markov chain stationary. Let f:X→R be Borel with π(f)=0. Define σf2=π(f2)+2∑k≥1Cov⁡π(f(X0),f(Xk)) only when the covariance series is absolutely convergent and the CLT is established, as in Long-run variance for a stationary Markov chain.

Each of the following six conditions is sufficient for absolute convergence of the covariance series and 1n∑k=0n−1f(Xk)⇒N(0,σf2):

  1. P has polynomial total-variation rate of order m>1 with an integrable envelope (Polynomial ergodicity with an integrable rate envelope), and f is essentially bounded under π (there is B<∞ with ∣f∣≤B π-almost everywhere).
  2. P has polynomial total-variation rate of order m>0 with an integrable envelope (Polynomial ergodicity with an integrable rate envelope), f∈L2+δ(π) for some δ>0 (The space Lp(μ) as the quotient by null functions), and mδ>2+δ.
  3. P is geometrically ergodic (Geometric and uniform ergodicity for MCMC CLTs) and f∈L2+δ(π) for some δ>0 (The space Lp(μ) as the quotient by null functions).
  4. P is geometrically ergodic (Geometric and uniform ergodicity for MCMC CLTs) and π(f2log⁡+∣f∣)<∞, with 0log⁡+0:=0.
  5. P is geometrically ergodic (Geometric and uniform ergodicity for MCMC CLTs), reversible with respect to π in the symmetric-flow sense (General-state reversibility by symmetric flow measure), and f∈L2(π) (The space Lp(μ) as the quotient by null functions).
  6. P is uniformly ergodic (Geometric and uniform ergodicity for MCMC CLTs) and f∈L2(π) (The space Lp(μ) as the quotient by null functions).

In case 4, the displayed logarithmic moment implies f∈L2(π): on {∣f∣≤e} one has f2≤e2, and on {∣f∣>e} one has f2≤f2log⁡∣f∣.

When σf2=0, the zero-variance lemma Zero covariance long-run variance gives a degenerate CLT under absolute summability gives the degenerate normal limit from absolute covariance summability. Finite variance of f alone is not one of the sufficient conditions.

Facts & Assumptions

Given: AC, the stationary Harris-ergodic chain and centered real function in the Statement, and any one of its six sufficient regimes.

[A1]

The Axiom of Choice is assumed by the local probability, conditional-expectation and sequence-CLT suppliers. The Statement already includes this hypothesis.

[F1]

A measurable observation does not increase stationary mixing coefficients makes Yk=f(Xk) stationary and bounds each of its mixing coefficients by the corresponding chain coefficient.

[F2]

Polynomial ergodicity with an integrable rate envelope gives the pointwise polynomial total-variation bound with π(M)<∞. Geometric and uniform ergodicity for MCMC CLTs gives the geometric bound with finite measurable envelope, or with bounded envelope in the uniform case.

[F3]

The bounded-future Markov property and iterated-kernel identity are Markov property for bounded future path functionals and Chapman-Kolmogorov equations. The event-supremum convention is Total variation distance for probability laws, and known factors can be taken out using Taking out what is known.

[F4]

Strong-mixing CLTs under bounded, moment, and logarithmic-moment conditions proves absolute covariance summability and the normal limit for bounded observations with summable alpha, for the stated L2+δ alpha-summability condition, or for exponential alpha with the logarithmic moment.

[F5]

Harris geometric ergodicity admits an integrable total-variation envelope supplies an integrable geometric envelope under the stated Harris, irreducibility and aperiodicity hypotheses. A total-variation rate bounds strong-mixing coefficients then bounds alpha by that geometric rate.

[F6]

Geometric ergodicity and reversibility give exponential rho-mixing gives exponential rho for a stationary reversible geometrically ergodic chain under the stated recurrence hypotheses. A rho-mixing CLT for square-integrable stationary sequences proves the covariance-summable L2 CLT when rho is summable.

[F7]

Uniform ergodicity bounds the uniform-mixing coefficient gives exponential phi under uniform ergodicity. A uniform-mixing CLT for square-integrable stationary sequences proves the covariance-summable L2 CLT when the square roots of phi are summable.

[F8]

Zero covariance long-run variance gives a degenerate CLT under absolute summability handles zero covariance long-run variance by a finite covariance expansion. Long-run variance for a stationary Markov chain identifies the covariance sum only after absolute convergence and the CLT have been established.

[F9]

Proof

Given: The hypotheses and any one of the six regimes in the Statement.

1.1A1F1givenalgebra

Put Yk=f(Xk). This is a centered stationary real sequence by [F1]. It is square-integrable in every case: boundedness suffices in case 1, the power moment suffices in cases 2 and 3 on the probability space, and cases 5 and 6 assume L2. In case 4, split at ∣f∣=e: on the bounded part f2≤e2, and on the other part f2≤f2log⁡∣f∣, so the stated logarithmic moment implies L2. All sequence suppliers below therefore have their centering, stationarity and second-moment premises.

1.2A1F1F2F3algebra

Suppose a pointwise rate ∥Pn(x,⋅)−π∥TV≤M(x)an is available with π(M)<∞. For any past event A∈σ(X0,…,Xj) and separated future event B∈σ(Xj+n,Xj+n+1,…), [F3] supplies 0≤h≤1 with E[1B∣σ(X0,…,Xj)]=Pnh(Xj) and P(B)=π(h). Approximating h uniformly by dyadic averages of its superlevel indicators gives ∣Pnh(x)−π(h)∣≤∥Pn(x,⋅)−π∥TV: each indicator discrepancy is bounded by the defining event supremum. Consequently ∣P(A∩B)−P(A)P(B)∣=∣E[1A(Pnh(Xj)−π(h))]∣≤π(M)an. Taking the suprema and then applying [F1] gives αY(n)≤αX(n)≤π(M)an. No measurability of an uncountable total-variation supremum is needed, because its measurable envelope bounds each event discrepancy pointwise.

2.1F2F4F9step 1.1step 1.2givenalgebra

In case 1, take an=n−m in step 1.2. Since m>1, grouping 2j≤n<2j+1 bounds each block of ∑nn−m by 2−j(m−1); [F9] makes the resulting geometric series finite. Thus ∑nαY(n)<∞. The bounded branch of [F4] gives absolute covariance summability and the asserted normal limit for the normalized sums of Y. This uses the whole approved range m>1.

2.2F2F4F9step 1.1step 1.2givenalgebra

In case 2, put θ=δ/(2+δ). Step 1.2 gives αY(n)θ≤π(M)θn−mθ. The exact assumption mδ>2+δ says mθ>1, so the same dyadic argument and [F9] make these bounds summable. The power-moment branch of [F4] proves the same covariance and distribution conclusions.

2.3F1F4F5F9step 1.1givenalgebra

In cases 3 and 4, [F5] replaces the possibly nonintegrable original envelope by a finite integrable geometric envelope with some rate a∈(0,1). Thus αY(n)≤Can by [F1] and [F5]. In case 3, every positive power of this bound is summable, so the L2+δ branch of [F4] applies. In case 4, its exponential/logarithmic-moment branch applies directly. Each yields absolute covariance summability and the normal limit without strengthening the given moment assumption.

2.4A1F1F6F9step 1.1givenalgebra

In case 5, reversibility and the geometric-rate assumptions allow [F6] to give ρX(n)≤Crn for some r<1. By [F1], ρY(n)≤ρX(n), so its series is summable. The L2 rho-mixing theorem in [F6] proves the required covariance-summable CLT.

2.5A1F1F7F9step 1.1givenalgebra

In case 6, [F7] gives ϕX(n)≤Crn for some r<1. By [F1], ∑nϕY(n)≤C∑nrn/2<∞. The uniform-mixing L2 theorem in [F7] therefore gives the same conclusions.

3.1F1F4F6F7F8step 2.1step 2.2step 2.3step 2.4step 2.5algebra∎

In all six cases the covariance series is absolutely convergent, its sum is finite and nonnegative, and the normalized sum converges to the centered normal with precisely that covariance sum. If the sum is zero, [F8] also proves the degenerate limit directly in L2, so no division by an asymptotic variance is made. Stationarity makes ∑k=0n−1Yk and ∑k=1nYk equal in law. The established limit is therefore exactly the displayed limit in the Statement, and only now does [F8] identify its variance as σf2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

92 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