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.
Finite-horizon SMC error, CLTs, and degeneracy — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- 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
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Estimators and Randomized Procedures
- Feynman–Kac targets and sequential particle filters
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Finite-horizon SMC error, CLTs, and degeneracy
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- 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
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- 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
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- 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
- Ordinary and self-normalized importance sampling
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- 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
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- 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
- Sine, Cosine, and the Definition of Pi
- 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
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- 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 Maximal Function and Lebesgue Differentiation
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
Objective
Use finite models to show ancestry collapse, dominant weights and low weight-based ESS, the target-moment gap in the source test class, instability of residual offspring floors at positive integers, and the failure of proposal-density ratio bounds to control time-uniform SMC variance when proposals vary. Contrast the fixed-horizon variance growth with a bounded-weight filter contracting the closed last-state test subspace, with exact variance . This does not assert contraction of arbitrary stored-path tests. These examples state the limits of the accompanying CLT and variance claims.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Ancestry collapse under repeated multinomial resampling
Example
Track particles with equal weights through repeated multinomial resampling steps and identity mutation. Use fresh independent randomness at each call: the pairs of child indices are mutually independent, each uniform on . Each child records the original ancestor from which its state descends. The normalized particle weights remain at each step.
Facts & Assumptions
Given: Two distinct initial ancestors, , equal normalized weights , multinomial resampling with independent index pairs across calls, and the identity mutation that leaves each selected state unchanged.
Multinomial and residual offspring resampling: Under multinomial resampling, the two child indices are conditionally IID with probabilities equal to the normalized parent weights.
Multinomial and residual resampling have unbiased offspring counts: Each parent has conditional expected offspring count .
Verification
Given: The finite two-particle system in the Example.
The two child indices are independent fair draws by [F1]. They choose the same parent with probability . The expected number of distinct parents represented is , since each parent is selected at least once with probability .
If both children select one parent, identity mutation leaves two copies of that same original ancestor. Every later resampling copies represented ancestors, so it cannot restore the lost ancestor. If both lineages remain, their survival through the next call requires different parent indices. By the stipulated independence across calls and step 1.1, this has conditional probability given the full preceding index history.
Starting from two lineages, the probability that no collapse occurs in successive resampling steps is by induction on using step 2.1. Hence the probability of a single represented ancestor is , even though the expected offspring counts at each step remain by [F2].
The source function class need not give finite SMC CLT variances
Statement refuted
The source class in Finite-horizon SMC CLT classes and variance recursions, together with , guarantees that every displayed finite-horizon weighted and post-resampling CLT covariance is finite, including for a separately weighted initial proposal.
Facts & Assumptions
Given: The recursive class , target/proposal laws, and variance notation in the cited definition.
Finite-horizon SMC CLT classes and variance recursions: requires a finite proposal second moment; requires and ; the post-multinomial covariance adds .
Finite-horizon SMC CLT classes and variance recursions: For an initially weighted proposal, ; finiteness requires its displayed second moment to exist.
Counterexample
Given: Let with its power-set sigma-algebra and proposal , for . At time zero set and . Put for , , and . Let , , , and . Define and for .
The geometric proposal masses sum to one. Since , is finite and positive, and by construction; hence is a probability law with density relative to . The identity kernel gives .
For a separate initial-proposal witness, let , , , and . Put and . Then , so is a probability law and . Both and are bounded, hence belong to .
Choose . For , , so and . Thus and . Also and , so .
The target mean is , but since the summands do not tend to zero. Therefore .
The weighted covariance is finite: the identity mutation has zero conditional variance, by step 2.1 and the finite mean in step 2.2, and the initial multinomial covariance at time zero is finite because and . Yet the post-multinomial formula in [F1] adds the infinite target variance from step 2.2. Thus the source class and do not suffice for the claimed finite post-resampling covariance.
Let . Positive proposal and target mass occur on both parities, so . For every even , , so the sum over even diverges. Thus and [F2] gives , despite . This independently refutes the claimed initial weighted-estimator covariance finiteness.
Residual resampling is discontinuous at positive integer weights
Statement refuted
Under the recursive weighted-moment class and normalization hypotheses in Finite-horizon SMC CLT classes and variance recursions, the residual offspring covariance is always the displayed computed from the limiting fractional parts , including when the importance-weight law has an atom at a positive integer.
Facts & Assumptions
Given: The CLT classes and residual covariance formula in the cited definition, and the standard normalized-weight residual procedure.
Finite-horizon SMC CLT classes and variance recursions: has -mean one; the formal source candidate is computed from .
Multinomial and residual offspring resampling: With normalized input weights , residual resampling uses floors and distributes the remaining children according to normalized fractional remainders.
Lindeberg-Levy iid central limit theorem: IID real variables with finite positive variance have the usual normalized Gaussian sample-mean limit.
Slutsky's theorem for real random variables: Multiplying a distributionally convergent variable by a factor converging in probability to a constant gives the corresponding scaled limit.
Continuous mapping theorem: A measurable map continuous outside a null set of the limiting law preserves weak convergence.
Counterexample
Given: At time , let the proposal law on be , . Let the target be , with Radon–Nikodym weights , . Use . Both weights are positive and finite, is bounded, and .
For IID proposal particles, let be the number at and . The weighted empirical estimate is Since is binomial with parameters , [F3] gives . The identity and [F4] yield . Moreover, exactly when .
The limiting-weight candidate in [F1] gives and . Because , both and are zero, so . If used as a universal residual CLT variance, it predicts a post-resampling Gaussian limit with variance .
Put and , . On , the normalized residual sizes are and ; hence each particle receives one deterministic child, each particle receives none, and children are sampled from the remainders. If is the number of residual children at , then conditionally on the proposal sample, with . As , and .
On that event, the post-resampling mean is and its conditional mean is . A Taylor expansion of the binomial characteristic function, uniform for and , gives Thus, on the positive branch , the extra resampling fluctuation has limiting variance .
On the negative branch with and , one has and . The floor for each particle is two, and its total fractional remainder is , because . Conditional variance of the residual count is at most this total remainder. Consequently the variance of times the post-resampling proportion about its weighted conditional mean is , so the extra resampling fluctuation tends to zero in probability on the negative branch. The events have probability tending to zero by [F3].
Put , the post-resampling fluctuation centered at the weighted mean, and condition on the proposal count . For any real , steps 2.1, 2.2 and the negligible exceptional event show that converges in probability to when and to when . Since and , [F5] gives This is the joint characteristic function of for an independent , so the post-resampling limit is . Its mean is zero and its third moment is , so it is not Gaussian. This contradicts the variance- Gaussian predicted in step 1.2.
Zero limiting remainder does not make finite residual offspring deterministic
Statement refuted
If , then standard residual resampling has deterministic offspring counts for every finite particle sample, so its residual covariance may always be set to zero.
Facts & Assumptions
Given: The residual-weight notation in Finite-horizon SMC CLT classes and variance recursions and the standard normalized-weight residual algorithm.
Finite-horizon SMC CLT classes and variance recursions: and a normalized Radon–Nikodym weight satisfies .
Multinomial and residual offspring resampling: Residual counts are plus multinomial draws from the fractional remainders of the normalized weights .
Counterexample
Given: Let the proposal law on assign probabilities , and let the importance weights be . Their proposal expectation is one, the target law is , and .
For , the event that the proposal sample contains one , one , and one has probability . On this event the total weight is four and the normalized weights are .
The scaled normalized weights are , so their floor counts are and their fractional remainders are . By [F2] one residual child is drawn, with equal probability from and ; hence the offspring-count vector is random although the limiting proposal remainder integral is zero. This contradicts the Statement.
A dominant particle weight and the effective sample size
Example
Use proposal probabilities , and target probabilities , . Compute the weight-based effective sample size for four proposal draws containing one and three values.
Facts & Assumptions
Given: The proposal, target, and observed finite draw described in the Example.
Finite-horizon SMC CLT classes and variance recursions: Importance weights are Radon–Nikodym derivatives of target law with respect to proposal law and have proposal mean one.
Weight-based effective sample size: For nonnegative weights with positive sum, ; it depends only on observed weights.
Verification
Given: , , , and one observed with three observed values.
The proposal-to-target ratios are and , and . The event of exactly one in four IID proposal draws has probability .
The four unnormalized weights sum to , so their normalized values are . By [F2], The first particle carries of the observed weight, which explains the low ESS; the calculation concerns weight concentration only.
Proposal mixing ratios alone do not bound SMC asymptotic variance over time
Statement refuted
Uniform bounds on the true transition density ratios and proposal density ratios , together with a likelihood bounded above and away from zero and a bounded test oscillation, suffice by themselves to keep the SIR asymptotic variance bounded uniformly in time.
Facts & Assumptions
Given: The finite-horizon SMC variance recursion, density-ratio conventions, and SIR target/proposal setup in the cited definition.
Finite-horizon SMC CLT classes and variance recursions: and is the weighted-estimator asymptotic covariance.
Multinomial SMC variance unrolls into local contributions: For multinomial SIR, is the sum of the proposal expectations of over .
Counterexample
Given: Let with counting measure, an initial state , and a one-point observation space with likelihood density . Let the true transition density be for both and all . For , let the proposal be independent of the preceding state, with and . Use .
For every pair of preceding states, both and equal . The likelihood satisfies , and . The filtering target at every has last-state law , while the proposal last-state law is . Its normalized incremental Radon–Nikodym weight is and .
For every preceding path, the forward image of the centered test is Consequently for every , so all earlier-time terms in [F2] vanish.
The remaining term in [F2] is Since , despite all the stated ratio, likelihood, and oscillation bounds. Thus those conditions alone do not imply the claimed time-uniform variance bound.
A bounded-weight mixing filter has bounded asymptotic variance
Example
Let , set the initial target and proposal to the uniform law, and use at every step the true transition and proposal kernel , with constant likelihood one. Thus all incremental weights equal one. For , compute the asymptotic variance and verify the time-uniform bound.
Facts & Assumptions
Given: The two-state model, its uniform transition/proposal kernel, unit likelihood and test in the Example.
Finite-horizon SMC CLT classes and variance recursions: If target and proposal transitions agree and likelihood is one, then , and for last-state tests the restricted operator is .
Dobrushin contraction coefficient for a probability kernel: is the supremum total-variation distance between two transition rows.
Uniform density ratios bound the Dobrushin coefficient: A common density ratio bound implies .
Centered filtering Feynman–Kac operators contract terminal tests: the stated filtering density row bound gives a centered last-state image estimate with and .
Time-uniform SMC asymptotic variance under uniform weight and operator bounds: bounded weights and the multistep centered-image bound give .
Verification
Given: The finite two-state filtering model in the Example.
Every transition row is , so the target and proposal transitions coincide and the likelihood contributes no correction. By [F1], , hence , and is uniform for every . Since the row does not depend on its predecessor, [F2] gives ; its density rows are identical, so [F3] also applies with .
On the closed last-state subspace the forward operator is , which maps a last-state test to its uniform average. The true transition and proposal density versions relative to counting measure are all , so [F4] applies with , , and . No contraction of arbitrary path-history functions is asserted. The test has and is centered by . Every earlier backward image is zero; the final term in the variance expansion is . Hence for every .
Applying [F5] with , and gives , uniformly in ; the exact variance from step 1.2 satisfies the bound. This verifies a time-uniform asymptotic-variance result under explicit mixing and weight conditions.
Fixed-horizon asymptotic variance can grow without mixing
Example
Let have the uniform target and proposal at time zero. Use identity mutation, unit incremental weights, and multinomial resampling at every time. For each fixed horizon , take . Compute the fixed-horizon asymptotic variance and compare its dependence on with a time-uniform bound.
Facts & Assumptions
Given: The uniform initial law, identity mutation, unit weights, multinomial selection, and terminal indicator in the Example.
Finite-horizon SMC CLT classes and variance recursions: With identity mutation and unit weights, and .
Multinomial SMC variance unrolls into local contributions: is the sum of the proposal expectations of squared backward images of over .
Fixed-horizon SMC central limit theorem with multinomial resampling: For each fixed horizon and the stated class, the weighted estimate has CLT variance and the post-resampling estimate has variance .
Verification
Given: The finite-state identity-mutation filter in the Example and any fixed integer .
The identity kernel leaves the uniform law invariant and has incremental weight one. Thus [F1] gives for every . Since everywhere, each of the summands in [F2] equals . Therefore .
By [F3], at every fixed the weighted estimate has a valid CLT with variance , and the post-resampling estimate has variance . Both variance sequences are unbounded as ranges over the integers. The fixed-horizon theorem therefore supplies no uniform-in-time variance bound or finite-particle accuracy guarantee.
Sources
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Theorem 1 and Appendix A.3
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Theorem 2 and Appendix A.4
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., §§11.2, 11.4–11.5
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Theorem 5 and Appendix A.4