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 be a measurable space, let be probability measures on it, and let be measurable with for some . Use the library convention Then
For the complete posterior computation error budget defined above, the pathwise total error satisfies This is a telescoping bound; it does not estimate any component.
Separately, let be a stationary time-homogeneous Markov chain with transition kernel , invariant law , and initial law , and use the same bounded functional . Put If , then for every burn-in and sample size , The sample bound assumes stationarity; for a nonstationary start, the budget keeps as a separate burn-in term. This finite- variance bound is not a central limit theorem or a confidence interval.
Statement references
The six adjacent posterior, solver, discretization, kernel, burn-in, and Monte Carlo error terms.
Total variation is the event supremum and has no factor in that convention.
The one-step conditional law is given by the transition kernel.
Strict stationarity means all finite-dimensional laws are unchanged by time shifts.
Variance and covariance are expectations of centered products.
A finite scalar reference chain telescopes into its adjacent signed errors.
Gibbs and Su, §2, total-variation dual form
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.
Remarks references
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.
Total variation is the event supremum ; it has no half-factor. Total variation distance for probability laws
If are probability measures and , then . Total variation controls expectations of bounded functions
The error budget consists of the six absolute adjacent differences from through , and its Monte Carlo component is pathwise. Posterior computation error budget
A stationary chain has marginal law at every time, and the covariance of depends only on the lag . Invariant and stationary distribution for a Markov kernel Stationary process and canonical path shift
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
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
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.
Since , [F2] applies to and ; [F1] fixes the event-supremum convention, so it yields the stated total-variation expectation bound.
The successive scalar references in [F3] have signed adjacent differences whose sum is . Apply [F6] to this finite reference chain to obtain .
For the stationary branch, set . By [F4], each has mean zero and . Expanding the finite square gives : there are diagonal terms, and for each lag there are off-diagonal pairs, each counted twice.
Since and , the expression in step 1.3 is at most , which is bounded by the claimed infinite-series expression. Absolute summability makes the bound finite.
Depends on
- The Axiom of Choice
- Expectation of a nonnegative or integrable random variable
- Invariant and stationary distribution for a Markov kernel
- Posterior computation error budget
- Moments, variance, and covariance on a probability space
- Probability measures and probability spaces
- Stationary process and canonical path shift
- Time-homogeneous Markov chain with transition kernel
- Total variation distance for probability laws
- Pathwise error decomposition along a reference chain
- Total variation controls expectations of bounded functions
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
- Alison L. Gibbs and Francis Edward Su, On Choosing and Bounding Probability Metrics, International Statistical Review 70(3) (2002) (standard reference, not scraped)
- David A. Levin, Yuval Peres, and Elizabeth L. Wilmer, Markov Chains and Mixing Times, second edition (standard reference, not scraped)
- Charles J. Geyer, Markov Chain Monte Carlo Lecture Notes (standard reference, not scraped)
- Aki Vehtari et al., Rank-normalization, folding, and localization: An improved R-hat for assessing convergence of MCMC (standard reference, not scraped)