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.
ABC-MCMC and ABC-sequential Monte Carlo
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximate Bayesian computation and summary-based inference
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- 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
- Countability Axioms and Cardinal Functions
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Estimators and Randomized Procedures
- Feynman–Kac targets and sequential particle filters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- General-state Markov kernels, invariance, and reversibility
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Markov Kernels and Markov Chains
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Metropolis–Hastings kernels
- 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
- Polynomial Rings, the Division Algorithm and Roots
- 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
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- 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
- Standard-Borel Real Codings and Determining Classes
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- 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: Definition and Integrability
- The Topology of Euclidean Space
- 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
2 · Summary
Objective
This page makes the simulator-based approximate target explicit on the augmented parameter-data space whenever the tolerance-event probability is positive. Under AC, with standard-Borel state spaces and a probability proposal kernel, the general Metropolis–Hastings construction preserves this target. The sequential population procedure uses a finite nonincreasing schedule of positive tolerances with positive normalizers, and reweights proposals when each reached proposal mixture dominates the prior almost surely. Summary reduction and positive tolerance can bias the target, while acceptance rates, finite-particle error, and MCMC mixing remain separate questions.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Augmented ABC tolerance target
Definition
Use the prior and simulator setup of Approximate Bayesian computation and the tolerance-conditioned target: standard-Borel parameter and data spaces and , a prior probability , a probability kernel , a measurable summary map with , an observed summary , and tolerance . Let The prior-simulator joint law on the product sigma-algebra is which is a probability measure by A prior and model kernel define a joint law. The finite product is standard Borel by Finite products of standard Borel spaces are standard Borel. Put Thus , and is the prior-predictive probability in Approximate Bayesian computation and the tolerance-conditioned target. Only when define the augmented ABC tolerance target It is the prior-simulator joint law conditioned on the summary-tolerance event. Its parameter marginal is identified in The augmented ABC target has the tolerance posterior as its parameter marginal. The definition does not assert that summary reduction or a positive tolerance preserves the full-data posterior.
The augmented ABC target has the tolerance posterior as its parameter marginal
Statement
Under the hypotheses of Augmented ABC tolerance target with , the -marginal of is the tolerance-conditioned law defined in Approximate Bayesian computation and the tolerance-conditioned target.
Facts & Assumptions
Given: A prior probability , simulator probability kernel , measurable summary , observed summary , and with .
Augmented ABC tolerance target: , , and .
Approximate Bayesian computation and the tolerance-conditioned target: with the law of under the prior-simulator joint law, , , and .
A prior and model kernel define a joint law: for measurable and , .
Proof
Given: The hypotheses in the Statement.
For each , [F1] and the rectangle formula [F3] give .
Since , [F2] gives and ; substitution into [F2] makes step 1.1 exactly for every measurable , so the parameter marginal is the tolerance posterior.
ABC Metropolis–Hastings on simulator-augmented states
Definition
Fix with and let be the target in Augmented ABC tolerance target. The state is , a standard-Borel product by Finite products of standard Borel spaces are standard Borel, and admissible initial states satisfy . As proposal inputs take a parameter probability kernel and the simulator kernel from Augmented ABC tolerance target, such that is a probability kernel on the augmented state space. Construct the transition kernel by applying Metropolis–Hastings kernel with target and proposal . Each iteration proposes a new parameter from , simulates new data from , applies the general Metropolis–Hastings accepted-flow rule, and retains the current augmented state after rejection.
This definition uses one fixed tolerance and the augmented state . It does not claim irreducibility, uniqueness of a stationary law, convergence, a mixing rate, or recovery of the full-data posterior.
Sequential ABC importance-resampling with tolerance populations
Definition
Fix a finite horizon , , a positive nonincreasing tolerance schedule , and assume for every . Let be the normalized augmented target from Augmented ABC tolerance target. The parameter proposal at stage is a probability kernel on .
For each , write the previous weighted population as in the standard-Borel space where has its Borel sigma-algebra and is standard Borel because the closed interval with the Euclidean metric is Polish. Thus is standard Borel by Finite products of standard Borel spaces are standard Borel. Let be the law of conditional on the algorithm reaching stage , when that event has positive probability. For , define the probability kernel by For each fixed measurable , and are measurable. For nonnegative measurable on , the superlevel sets satisfy so each product is measurable. Finite sums and scalar multiples are measurable by Closure properties of measurable functions used by the integral, making the branch condition and both branch evaluations measurable. Each branch is a convex combination of probability measures, so Measure kernel and probability kernel gives a probability kernel. The second branch only extends the kernel to ambient states outside the algorithm; every actual previous population has normalized weights and uses the proposal mixture in the first branch. Require for -almost every at every stage that is reached with positive probability. Apply Jointly measurable Radon–Nikodym derivatives for probability kernels to the constant kernel and the kernel to obtain a product-measurable derivative on . Set its value to zero where it is infinite; since its integral is one for -almost every , this gives a finite-valued product-measurable version for almost every previous population.
At stage , draw independently from the prior-simulator law , and set . If , stop and report finite-particle degeneracy; otherwise normalize these weights to obtain and report the weighted empirical measure
For each , form the proposal mixture Draw ancestor indices from the previous weights using the multinomial branch of Multinomial and residual offspring resampling. Conditional on those ancestors, independently draw one perturbed parameter from its kernel and one datum from for each child. For a candidate set If , stop and report finite-particle degeneracy; do not report a normalized target estimate. If the sum is positive, set and report the weighted empirical measure .
If a stage degenerates, return that status and no normalized estimate for the stage or any later target. If every stage through succeeds, return ; in particular, when the returned estimate is .
The mixture support condition is stage-specific and must hold almost surely under the law of the actual previous population. The algorithm makes no finite- accuracy, mixing, or posterior-recovery claim.
ABC Metropolis–Hastings preserves its augmented tolerance target
Statement
Assume AC and the hypotheses of ABC Metropolis–Hastings on simulator-augmented states with . Its output is reversible with respect to and leaves invariant the augmented ABC tolerance target on . This is invariance for the fixed tolerance target only; it gives no convergence or full-data posterior conclusion.
Facts & Assumptions
Given: AC, a standard-Borel augmented state space, with , the target , the simulator proposal kernel , and the ABC-MH procedure.
The Axiom of Choice: AC states that every family of nonempty sets has a choice function.
Augmented ABC tolerance target: when , is a probability measure on the product of the standard-Borel parameter and data spaces.
ABC Metropolis–Hastings on simulator-augmented states: the algorithm applies Metropolis–Hastings kernel with target and proposal probability kernel , retaining rejected proposals as self-transitions.
Metropolis–Hastings flow is reversible and invariant: under AC, for a standard-Borel space, probability target, and probability proposal kernel, the general Metropolis–Hastings output is reversible with respect to and leaves invariant its target.
Proof
Given: The hypotheses in the Statement.
By [F1], is a probability target on the product state space; by [F2], the proposal is a probability kernel and the returned kernel is exactly the general Metropolis–Hastings output for this target and proposal.
The state space is standard Borel and [A1] supplies AC, so [F3] applies to the target and proposal identified in step 1.1; it gives reversibility and invariance of with respect to , with no irreducibility or convergence assertion.
Sequential ABC Radon–Nikodym weights target each tolerance law
Statement
Assume the setup of Sequential ABC importance-resampling with tolerance populations and put For a measure , write for bounded nonnegative measurable . For every bounded nonnegative product-measurable , let , , be the initial independent prior-simulator draws with law and weights satisfy For each reached with positive probability, let be the previous population and let be its law conditional on reaching stage . Use the standard-Borel population space and probability kernel from Sequential ABC importance-resampling with tolerance populations, and assume for -almost every . The kernel Radon–Nikodym lemma Jointly measurable Radon–Nikodym derivatives for probability kernels then supplies a product-measurable derivative; use the finite-valued version specified in Sequential ABC importance-resampling with tolerance populations after changing infinite values to zero. Write this version as for almost every . Put for the candidates produced by multinomial ancestor resampling, perturbation, and simulation. For every bounded nonnegative product-measurable , In particular, the average weight is conditionally unbiased for . If candidates with positive total weight are resampled by the multinomial or residual scheme from normalized weights, then for every bounded measurable their conditional empirical mean equals the weighted candidate empirical mean in expectation. No unbiasedness is asserted for the self-normalized finite- estimate, and a finite sample may have zero total weight or fail to represent positive target mass.
Facts & Assumptions
Given: AC, a prior , simulator probability kernel , tolerance event , a previous weighted population, mixture , , and .
The Axiom of Choice: AC states that every family of nonempty sets has a choice function.
Augmented ABC tolerance target: the unnormalized augmented target is with normalizer and normalized target .
Sequential ABC importance-resampling with tolerance populations: the initial draws use with indicator weights; later stages use multinomial ancestor-resampling, perturbation, simulation, the tolerance indicator, and a product-measurable prior-to-mixture derivative evaluated at the previous population and candidate parameter. Its stage-specific support condition holds almost surely under the population law.
Jointly measurable Radon–Nikodym derivatives for probability kernels: for probability kernels on standard-Borel spaces, if for -almost every , there is a product-measurable density that represents for almost every .
For this joint density , the section identity at gives for almost every . Thus the set where is -null there, and setting to zero on its product-measurable infinite-value set gives a finite-valued product-measurable density version.
Integrating against a Radon-Nikodym derivative recovers integration against the measure: if , then for every measurable ; finite simple-function integration follows by finite addition.
Every nonnegative measurable function is the increasing limit of simple measurable functions and Monotone convergence for the integral: every nonnegative measurable function is an increasing limit of simple functions, and integrals pass to that limit.
Multinomial and residual offspring resampling: the resampling procedure returns a length- ancestor list encoded by its offspring counts.
Multinomial and residual resampling have unbiased offspring counts: conditional on input weights, each offspring count has expectation times its normalized input weight.
A prior and model kernel define a joint law: the prior and simulator kernel define a probability measure on and integrate nonnegative product-measurable functions by iterated integration.
Measurability of integration against a kernel: integrating a nonnegative product-measurable function against a probability kernel gives a measurable section integral.
Closure properties of measurable functions used by the integral: finite sums, scalar multiples, and products of measurable functions with measurable indicators remain measurable.
Proof
Given: The hypotheses in the Statement.
Each initial draw has law and weight , so definition of gives ; linearity of the finite average proves the identity.
Fix with positive probability of reaching stage , and let be the conditional law of the previous population. By [F3], the constant kernel and the proposal-mixture kernel have a product-measurable density ; by [F4], its finite version is a derivative for -almost every . By [F10], is measurable and bounded. Choose simple functions by [F6]; each is a finite sum of measurable indicators, so is measurable by [F11]. For almost every , applying the setwise RN identity [F5] to the level sets of gives Since is finite and nonnegative, [F6] and monotone convergence give The right side is by the iterated-integral formula [F9] and target definition [F1]. Thus the one-candidate conditional proposal expectation equals for -almost every previous population.
Given parent , each child has law ; the multinomial expected count is by [F8]. Conditional on the previous population , summing contributions over parents and dividing by gives the one-candidate expectation under with weight . Step 1.2 makes this for -almost every , proving the conditional identity.
For candidate weights with , [F8] gives conditional offspring-count means ; hence for bounded measurable , , the weighted empirical mean. If the total weight is zero, [F2] reports degeneracy and makes no normalized-target claim.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Jarno Lintusaari, Michael U. Gutmann, Ritabrata Dutta, Samuel Kaski, and Jukka Corander, Fundamentals and Recent Developments in Approximate Bayesian Computation, §4
- Osvaldo A. Martin, Ravin Kumar, and Junpeng Lao, Bayesian Modeling and Computation in Python, Chapter 8
- Paul Fearnhead and Dennis Prangle, Constructing Summary Statistics for Approximate Bayesian Computation: Semi-automatic ABC, §§2–3
- Jarno Lintusaari, Michael U. Gutmann, Ritabrata Dutta, Samuel Kaski, and Jukka Corander, Fundamentals and Recent Developments in Approximate Bayesian Computation, §5 and Appendix, Algorithms 3
- Benjamin M. Turner and Thomas Van Zandt, A tutorial on approximate Bayesian computation, §3.1
- Jarno Lintusaari, Michael U. Gutmann, Ritabrata Dutta, Samuel Kaski, and Jukka Corander, Fundamentals and Recent Developments in Approximate Bayesian Computation, §5.2 and Appendix, Algorithm 4
- Benjamin M. Turner and Thomas Van Zandt, A tutorial on approximate Bayesian computation, §3.2
- Jarno Lintusaari, Michael U. Gutmann, Ritabrata Dutta, Samuel Kaski, and Jukka Corander, Fundamentals and Recent Developments in Approximate Bayesian Computation, §5 and Appendix, Algorithm 3