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.
Particle MCMC: PMMH and particle Gibbs — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- 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
- Lebesgue-Stieltjes Measures and Distribution Functions
- 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
- Particle MCMC: PMMH and particle Gibbs
- Pointwise Extended-Real Function Products
- 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
- Scientific model contracts and applicability
- SCM, DAGs, adjustment
- 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
- State-space model laws
- State-space models and exact Bayesian filtering
- Stationary Markov Chains and Ergodic Limits
- Stationary means and sample autocovariance
- 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
Finite examples verify the pseudo-marginal size bias and retained-estimate rejection rule, then contrast MCWM's unequal transition flows. A two-state, two-particle particle Gibbs update has the correct posterior as its invariant law but leaves the dominant state with probability below . A final support counterexample shows why a proposal missing a positive-mass path does not provide the Radon–Nikodym weights required by the exactness theorem.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Pseudo-marginal rejection retains the current likelihood estimate
Example
Let with uniform prior, exact likelihoods , and a symmetric proposal that flips the parameter. At let the unbiased likelihood estimator be surely. At let or , each with probability . The pseudo-marginal target on parameter and estimate has masses The parameter marginal is uniform, although the estimate conditional on is size-biased. A rejection at retains for the next ratio calculation.
Facts & Assumptions
Given: The PMMH target and update in Particle marginal Metropolis–Hastings.
Particle marginal Metropolis–Hastings: the extended target is proportional to prior times auxiliary-law density times the nonnegative unbiased likelihood estimate, and a rejected proposal retains the full current auxiliary state.
PMMH preserves the exact parameter posterior: under unbiasedness and finite positive evidence, the parameter marginal of the extended target is the exact posterior.
Verification
Given: The finite two-point example above.
The prior mass is at each parameter. Multiplying by the estimator law and its value gives masses at , at , and at . These sum to one, and the two masses over sum to .
From the proposal occurs with probability and is accepted with probability one, so the stationary flow is . In reverse, from the proposal is accepted with probability , so its flow is . The extended ratio uses the retained value until that move is accepted or rejected.
Refreshing the current estimate can destroy exactness
Statement refuted
Replacing an exact likelihood by an unbiased estimate freshly drawn at both the current and proposed parameter in every Metropolis step necessarily leaves the exact parameter posterior invariant.
Facts & Assumptions
Given: The MCWM procedure in Monte Carlo within Metropolis.
Monte Carlo within Metropolis: MCWM refreshes the current estimate at every iteration instead of retaining it after rejection.
Counterexample
Take , uniform prior, exact likelihoods , and a proposal that always flips the parameter. At use estimator surely; at use with equal probabilities. Both estimators are strictly positive and unbiased.
Under MCWM, a move accepts with conditional probabilities and for the two proposed estimates. Thus .
For a move , the fresh current estimate is or with equal probability and the proposed estimate is . The acceptance probabilities are and , so .
Starting from the claimed uniform posterior, the next mass at state is . Hence the exact posterior is not invariant. The unequal cross-flows also violate detailed balance.
An invariant particle Gibbs chain can be sticky
Example
Take the one-time model with state space , target , , and proposal , . Both target states are in proposal support. Use particles: one is the retained reference state, the other is sampled from , and the next state is drawn from the two importance weights . This is the one-time conditional particle Gibbs update.
Facts & Assumptions
Given: The conditional particle filter and invariance results in Conditional particle filter for particle Gibbs, The particle Gibbs extended target has the exact smoothing marginal, and The conditional particle Gibbs sweep is a Gibbs update.
Conditional particle filter for particle Gibbs: with one free particle at , draw it from and select between it and the fixed reference particle in proportion to their target-to-proposal weights.
The conditional particle Gibbs sweep is a Gibbs update: the finite particle Gibbs update preserves the extended target and has the exact posterior marginal.
Verification
Given: The finite two-state model in the Example.
The importance weights are and . From reference state , the free particle is with probability and is selected with probability . Therefore .
From reference state , the free particle is with probability and is selected with probability . Therefore .
The detailed-balance flows agree: , consistent with the exact invariance in [F2]. Yet the probability of leaving state is only , so exact invariance alone gives no useful lower bound on movement.
A particle Gibbs proposal that misses posterior path support
Statement refuted
A particle Gibbs exactness construction remains well-defined with its usual finite importance weights even if its proposal assigns zero probability to a positive-mass posterior path.
Facts & Assumptions
Given: The support requirements in Conditional particle filter for particle Gibbs and Feynman–Kac path Radon–Nikodym weight.
Conditional particle filter for particle Gibbs: its reference path and proposal weights must be defined under the full target-path support condition.
Feynman–Kac path Radon–Nikodym weight: the target path measure is absolutely continuous with respect to the proposal path measure and the displayed importance weight is its Radon–Nikodym density.
Counterexample
Use the one-time path space with posterior and proposal . The posterior assigns positive mass to state , but the proposal assigns it zero mass.
Since while , . Therefore the Radon–Nikodym weight required by [F2] does not exist on the full target support, so the stated conditional particle filter hypotheses fail.
Starting from reference state , every free particle is also because it is drawn from . The particle filter therefore cannot represent the positive posterior mass at state by a weighted proposal path. The exact conditional particle filter in [F1] is not defined with the required target-to-proposal weight on the full posterior support. Thus the support-free exactness claim is false as stated.
Sources
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §4.4
- Särkkä and Svensson, Bayesian Filtering and Smoothing, 2nd ed., §16.3.5
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §4.5 and discussion of path degeneracy
- Lindsten and Schön, On the use of backward simulation in particle Markov chain Monte Carlo methods (arXiv 1110.2873v2), §§1 and 4
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, Assumption 5 and Theorem 5
- Lindsten and Schön, On the use of backward simulation in particle Markov chain Monte Carlo methods (arXiv 1110.2873v2), Assumption 1 and §4.1