Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (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.

Bounded posterior functionals and stationary sample error

Statement

Let (E,E) be a measurable space, let μ,ν be probability measures on it, and let f:E→R be measurable with ∣f∣≤M for some 0≤M<∞. Use the library convention ∥μ−ν∥TV:=sup⁡A∈E∣μ(A)−ν(A)∣. Then ∣μ(f)−ν(f)∣≤2M∥μ−ν∥TV.

For the complete posterior computation error budget defined above, the pathwise total error satisfies ∣μ⋆(f)−fˉb,N∣≤Bf. This is a telescoping bound; it does not estimate any component.

Separately, let (Xn)n≥0 be a stationary time-homogeneous Markov chain with transition kernel K, invariant law πK, and initial law X0∼πK, and use the same bounded functional f. Put γk:=Cov⁡(f(X0),f(Xk))(k≥0). If ∑k=1∞∣γk∣<∞, then for every burn-in b≥0 and sample size N≥1, E[∣fˉb,N−πK(f)∣2]=1N2[Nγ0+2∑k=1N−1(N−k)γk]≤γ0+2∑k=1∞∣γk∣N. The sample bound assumes stationarity; for a nonstationary start, the budget keeps ∣πK(f)−Eλfˉb,N∣ as a separate burn-in term. This finite-N variance bound is not a central limit theorem or a confidence interval.

Remarks

An ESS is functional-specific and is not a substitute for a Monte Carlo standard error. The variance bound in this Proposition is a population statement under its chain assumptions; it does not validate a finite-chain empirical ESS estimate.

Facts & Assumptions

Given: The hypotheses in the Statement, the complete error budget when its pathwise bound is used, and a stationary Markov chain in the separate sample-error branch.

[F1]

Total variation is the event supremum sup⁡A∈E∣μ(A)−ν(A)∣; it has no half-factor. Total variation distance for probability laws

[F2]

If μ,ν are probability measures and ∣f∣≤M, then ∣μ(f)−ν(f)∣≤2M∥μ−ν∥TV. Total variation controls expectations of bounded functions

[F3]

The error budget consists of the six absolute adjacent differences from μ⋆(f) through fˉb,N, and its Monte Carlo component is pathwise. Posterior computation error budget

[F4]

A stationary chain has marginal law πK at every time, and the covariance of f(Xi),f(Xj) depends only on the lag ∣j−i∣. Invariant and stationary distribution for a Markov kernel Stationary process and canonical path shift

[F5]

For square-integrable real random variables, variance is the expected squared centered value and covariance is the expected product of centered values. Moments, variance, and covariance on a probability space

[F6]

For a finite scalar reference chain, the total signed error telescopes and its absolute value is bounded by the sum of absolute adjacent errors. Pathwise error decomposition along a reference chain

[A1]

AC is assumed only for the library time-homogeneous Markov-chain interface; this proposition assumes stationarity and makes no chain-existence claim. The Axiom of Choice Time-homogeneous Markov chain with transition kernel

Proof

Given: The hypotheses and notation in the Statement.

1.1givenF1F2

Since ∣f∣≤M, [F2] applies to μ and ν; [F1] fixes the event-supremum convention, so it yields the stated total-variation expectation bound.

1.2givenF3F6algebra

The successive scalar references in [F3] have signed adjacent differences whose sum is fˉb,N−μ⋆(f). Apply [F6] to this finite reference chain to obtain ∣μ⋆(f)−fˉb,N∣≤Bf.

1.3A1F4F5givenalgebra

For the stationary branch, set Yj=f(Xb+j)−πK(f). By [F4], each Yj has mean zero and E[YiYj]=γ∣i−j∣. Expanding the finite square gives E[(N−1∑j=1NYj)2]=N−2(Nγ0+2∑k=1N−1(N−k)γk): there are N diagonal terms, and for each lag k there are N−k off-diagonal pairs, each counted twice.

2.1step 1.3F5givenalgebra∎

Since 0≤N−k≤N and γ0=Var⁡(f(X0))≥0, the expression in step 1.3 is at most N−1(γ0+2∑k=1N−1∣γk∣), which is bounded by the claimed infinite-series expression. Absolute summability makes the bound finite.

Depends on

Used by

Dependency tree · two levels

34 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