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.
Posterior computation and error accounting — Examples and Counterexamples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Identifiability and approximation bias in computational inference
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Markov Kernels and Markov Chains
- Matrices, the Matrix of a Linear Map, and Change of Basis
- MCMC diagnostics and finite-run limitations
- Measurable Functions and Simple Approximation
- Measure-Preserving Systems and Mixing Criteria
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Posterior computation and error accounting
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Recurrence Transience and Hitting Times for Markov Chains
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Stationary Markov Chains and Ergodic Limits
- Statistical, resampling, simulation, and numerical error ledger
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
An exact invariant kernel can be biased over a short run
Example
Assume AC. Let with the discrete sigma-algebra , and let the target posterior assign mass to each state. For , define Take . The Ionescu--Tulcea construction supplies a time-homogeneous Markov chain on canonical path space with initial law and transition kernel . Use this chain with its natural filtration, retain the next draws, and set the bounded functional . The target law is invariant for this exact kernel, but the expected reported average is For the error ledger take each deterministic posterior stage to be ; then the invariant-kernel error is zero while the finite-run burn-in error is positive.
Example references
The invariant-kernel, burn-in, and Monte Carlo error components.
A probability kernel has probability rows and measurable event evaluations.
Invariance means on every event.
The transition kernel gives the conditional one-step law.
Under AC, an initial law and a probability kernel give a canonical path-space Markov chain.
Conditional expectation is linear and preserves expectation.
Expectation is linear on integrable random variables.
The pathwise error budget is bounded by its adjacent-stage terms.
Facts & Assumptions
Given: The two-state target law, transition rule, deterministic initial state, and 100 retained draws in the Example.
A probability kernel has probability-measure rows and measurable event evaluations. Measure kernel and probability kernel
A probability law is invariant for when for every event . Invariant and stationary distribution for a Markov kernel
AC is assumed for conditional-expectation existence and the Ionescu--Tulcea chain construction. The Axiom of Choice
For a time-homogeneous Markov chain, almost surely. Time-homogeneous Markov chain with transition kernel
The burn-in component is ; when the invariant target is , this is the expected finite-run bias in the Example. Posterior computation error budget
The mean and conditional expectation of a bounded real random variable are finite. Moments, variance, and covariance on a probability space
Under AC, the Ionescu--Tulcea construction gives a canonical path-space chain with the specified initial law and homogeneous transition kernel. Ionescu-Tulcea construction of a Markov chain
Conditional expectation is linear and preserves expectation for integrable variables. Basic algebra and order properties of conditional expectation
The expectation of a finite sum of integrable random variables is the sum of their expectations. The Lebesgue integral is linear on
Verification
Since , each row assigns the nonnegative masses and to the two states, and every subset is measurable; thus is a probability kernel [F1]. Under AC [A1], apply [F6] to initial law and kernel ; this supplies the canonical chain used in the Example.
For either singleton , so additivity on the two-state space gives by [F2].
Put . Summing the two conditional probabilities in [F3] against the values and , conditional on , and using linearity [F7], Taking expectations by [F7] and using gives for every by induction.
By [F8], . Since and is invariant by step 2.1, the kernel discrepancy vanishes, while [F4] identifies this positive difference as the burn-in component.
Correct invariance can coexist with low effective sample size
Example
Assume AC. Let with the discrete sigma-algebra , and let the target posterior be uniform on . For , define and set . The Ionescu--Tulcea construction supplies a time-homogeneous Markov chain on canonical path space with initial law and transition kernel . Use this chain with its natural filtration and set . Define its lag- autocorrelation by For every , . Its integrated autocorrelation time is therefore , so the theoretical functional-specific effective sample size of draws is The invariant law is exactly the target posterior, while this functional has only about one percent of the nominal independent-sample size. This is the theoretical ESS from the stationary autocorrelation sequence, not an empirical finite-run ESS estimate, and it asserts no central limit theorem.
Example references
An invariant initial law makes the Markov chain strictly stationary under AC.
Under AC, an initial law and a probability kernel give a canonical path-space Markov chain.
Conditional expectation is linear and preserves expectation.
A bounded measurable factor can be taken outside conditional expectation.
The stationary sample-average variance bound requires its own covariance-summability assumption.
Facts & Assumptions
Given: The two-state probability kernel, its initial law , and the bounded functional in the Example.
A probability kernel has probability-measure rows and measurable event evaluations. Measure kernel and probability kernel
Invariance means for every measurable event . Invariant and stationary distribution for a Markov kernel
A time-homogeneous Markov chain has one-step conditional law given by its transition kernel. Time-homogeneous Markov chain with transition kernel
AC is assumed for conditional-expectation existence, the Ionescu--Tulcea chain construction, and the invariant-initial-law theorem. The Axiom of Choice
If the initial law is invariant, the chain is strictly stationary. Invariant initial law makes a Markov chain stationary
The theoretical functional ESS is when the process is strictly stationary, has positive finite variance, absolutely summable autocorrelations, and positive integrated autocorrelation time; this definition asserts no CLT. Functional-specific effective sample size
For a stationary chain with absolutely summable lag covariances, the finite-sample mean-square error is bounded by . Bounded posterior functionals and stationary sample error
Variance is the expected squared centered value, and covariance is the expected product of centered values. Moments, variance, and covariance on a probability space
Under AC, the Ionescu--Tulcea construction gives a canonical path-space chain with the specified initial law and homogeneous transition kernel. Ionescu-Tulcea construction of a Markov chain
Conditional expectation is linear and preserves expectation for integrable variables. Basic algebra and order properties of conditional expectation
A bounded measurable factor can be taken outside conditional expectation. Taking out what is known
Verification
Since , each row assigns the nonnegative masses and to the two states, and every subset is measurable; thus is a probability kernel [F1]. Under AC [A1], apply [F8] to initial law and kernel ; this supplies the canonical chain used in the Example.
For either singleton , ; additivity gives by [F2].
Put . On the two-point state space, summing the conditional probabilities in [F3] against the values and and using linearity [F9] gives . Since , ; expectation preservation [F9] gives for all . As is bounded and -measurable, [F10] and expectation preservation [F9] give , and . Induction yields and, since , .
Since and is invariant by step 2.1, [A1] permits the invariant-initial-law result [F4], which makes the chain strictly stationary. Its one-time law is symmetric, so and .
Since the chain is strictly stationary by step 3.1 and has variance one, [F5] applies. Step 2.2 gives ; these autocorrelations are absolutely summable because , with . Thus and gives . Since here, [F6] applies, but neither it nor the ESS definition supplies a CLT.
A biased forward solve shifts a Gaussian posterior
Example
Let the scalar parameter have prior density and observe with unit-variance Gaussian noise. The exact forward map is , while a deliberately biased numerical forward/PDE solver reports . At , use likelihoods and ; the common Gaussian density constant cancels when normalizing. Define each fixed-data posterior by normalizing the prior times its stated likelihood. The exact posterior is and the solver posterior is . For the bounded functional , their expectations are respectively where The discrepancy is in the forward-solver stage of the posterior error budget; this toy solver assumption makes no claim about the bias of any general PDE discretization.
Example references
Facts & Assumptions
Given: The prior density, the exact and solver forward maps, the unit-variance observation noise, and the normalized prior-times-likelihood posterior convention in the Example.
The error-budget solver term compares the exact-model posterior expectation with the posterior expectation obtained from the declared numerical forward solve. Posterior computation error budget
The standard normal density is , and is its affine image for . Standard normal and normal laws
AC is assumed by the library standard-normal law interface. The Axiom of Choice
For a bounded measurable functional, the expectation difference is at most times the event-supremum total variation distance. Bounded posterior functionals and stationary sample error
Verification
With the likelihoods stated in the Example, the exact prior-times-likelihood product is . The substitution and the normalized standard-normal integral in [F2] give , so this product has normalizing integral . Its normalized density is therefore , which is by [F2]. For the solver output, the prior-times-likelihood product is its normalizing integral is , and its normalized density is by [F2].
The exact density is symmetric about zero, so its mass on is . Under the solver density, is standard normal, and is equivalent to ; hence . The standard normal density is positive and symmetric, so .
In the error ledger set and ; then the solver-stage term is and the model and discretization terms vanish. Since , [F3] also gives .