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
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
- 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
- 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
Give the finite-horizon empirical-law and particle-count CLTs for sequential importance resampling, with multinomial selection and the residual-selection branch where finite-sample floor counts have a stable limit. State the source weighted-moment class and the recursive target-second-moment conditions needed for the post-resampling CLTs. The page records the exact variance recursions and separate time-uniform asymptotic-variance bounds under actual uniform incremental weights and multistep centered-image control. A proved last-state filtering branch uses positive finite density versions, true-transition mixing, bounded likelihood, target/proposal domination and an initial-weight bound. Weighted-only initialization needs only an L2 centered numerator and a normalized L1 denominator; recursively selected outputs retain the stated stronger target-moment conditions. It makes no finite-particle accuracy claim uniform in time.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Dobrushin contraction coefficient for a probability kernel
Definition
Let and be measurable spaces with , and let be a probability kernel as in Measure kernel and probability kernel. Its Dobrushin contraction coefficient is where is the event-supremum distance between probability laws in Total variation distance for probability laws. Thus . The coefficient measures the largest total-variation separation between two one-step output laws.
Uniform density ratios bound the Dobrushin coefficient
Statement
Let be a probability kernel on a nonempty measurable source space. Suppose a sigma-finite measure on and probability densities satisfy for every and measurable . If and, for every , for -almost every , then the Dobrushin coefficient from Dobrushin contraction coefficient for a probability kernel obeys
Facts & Assumptions
Given: The probability kernel, common dominating measure, normalized densities, and pairwise density-ratio bound in the Statement.
Dobrushin contraction coefficient for a probability kernel: is the supremum over of the event-supremum total-variation distance between and .
Total variation distance for probability laws: For probability measures , .
Proof
Given: The hypotheses in the Statement.
Fix and write , . The assumed ordered-pair bound gives almost everywhere, so . Where , ; where , the same inequality gives . Hence .
Let . For every measurable , . Since , the positive and negative parts have equal integral, and ; equality is attained at . Thus [F2] gives by step 1.1.
The bound in step 2.1 holds for every pair , so taking their supremum in [F1] proves .
Finite-horizon SMC CLT classes and variance recursions
Definition
Fix a finite horizon . At each , let be a probability law on a measurable particle space . Let be an initial proposal with , and fix . For , let be a probability kernel from to , and put Assume and fix a nonnegative Radon–Nikodym version , so . The BCS-41 sequential importance-resampling algorithm Sequential importance resampling for Feynman–Kac path targets is this scheme on path spaces when appends a proposal transition. Under the support and measurable versions of Feynman–Kac path Radon–Nikodym weight, its normalized incremental weight is for , and initially. The previous normalized target is already part of ; one does not multiply by the full earlier path-weight product again.
For a measurable vector function , write and when the second moment is finite. Also write and
The source recursive test classes are and, for , Assume for every . This is the source theorem's explicit normalizing-weight condition. For the recursive post-resampling CLTs proved on this page, use the stronger classes . At , let consist of the for which and . The initial normalizing denominator needs only its finite first moment . For , let consist of the for which and . Here is the operator defined below. Only target second moments are required: fixed-tail truncation supplies the conditional selection Lindeberg condition without a target higher-moment assumption. The recursive target moments supply the offspring variance at every earlier selection used in the induction. The source conditions alone need not imply them. The source condition and these recursive target moments are the stated hypotheses for the CLT induction; no higher initial normalizer moment is required.
Define the mutation covariance operators recursively. At time zero, For , The weighted-estimator covariance is For a measurable vector function on , define the forward operator from by For , write ; set to the identity operator. For multinomial offspring resampling set For residual offspring resampling, let . When , define the formal source candidate Set and only when ; then and the finite-sample floor discontinuities are avoided. If -almost everywhere, put . Residual offspring are deterministic whenever all sampled weights equal one. In SIR this holds almost surely outside earlier zero-weight fallback events, whose probability tends to zero at a fixed horizon; the almost-everywhere condition alone does not prescribe weights on proposal-null states reached after a fallback. No residual covariance is assigned when but is not almost everywhere one: the finite-sample normalization can move positive integer weights across floor boundaries. The B-page counterexamples show why the general positive-integer-atom branch remains unassigned.
Remarks
The classes and recursions are definitions. The fixed-horizon CLT proofs below establish finiteness where their stated hypotheses apply. In particular, the source class alone does not ensure ; the recursive target-moment class is used for the stated post-resampling conclusions. The residual formula requires a separate continuity condition at positive integer weights; the B-page records finite-state failures without it. For an arbitrary weighted initial proposal, the source class is not by itself enough: the displayed initial weighted-numerator and target moments in are imposed explicitly.
The stronger hypotheses retain both locally proved fixed-horizon outputs, not the false claim that every source- test has finite post-selection covariance. Separately, a weighted-only initial ratio CLT needs only a target-integrable test and its centered weighted numerator in ; its denominator still needs only .
Uniform SMC backward-operator contraction controls oscillation
Statement
Let be the forward operators of Finite-horizon SMC CLT classes and variance recursions, and for bounded real put . Suppose there is one such that for every and every bounded real with , with bounded measurable versions of . The stronger condition on every bounded is sufficient but is not necessary here. For bounded , put and . Then for every , with and the identity. This condition concerns the actual SMC backward operators; it is not implied merely by mixing ratios of the proposal densities.
Facts & Assumptions
Given: The SMC flow and operators in the Statement, bounded real , and the uniform operator contraction hypothesis.
The Axiom of Choice: AC is inherited through the finite-horizon path and Radon–Nikodym construction.
Proof
Given: The hypotheses in the Statement.
For any bounded measurable and , [F1] gives Iterating this identity yields for every ; for the identity operator also gives mean zero.
Repeated application of the assumed oscillation contraction gives . By step 1.1 its -mean is zero, so its infimum is at most zero and its supremum at least zero; hence its sup norm is at most its oscillation. For this is .
Finite-horizon SMC empirical laws converge for integrable tests
Statement
Use the finite-horizon target, proposal and mutation sequence of Finite-horizon SMC CLT classes and variance recursions, and run the SIR procedure of Sequential importance resampling for Feynman–Kac path targets with either multinomial or residual resampling at every selection. Let be the proposal particles after mutation and before correction, let , and let when the denominator is positive, using the algorithm's uniform fallback otherwise. Let be the empirical probability measure of one offspring selection from ; for nonterminal times this is the population carried into the next mutation. For each fixed , as . The terminal selection in is an auxiliary resampling output; it is not an extra finite-particle accuracy claim.
Facts & Assumptions
Given: AC, the finite-horizon target/proposal flow, the sequential SIR mutation/correction/selection procedure, and one of the two stated offspring laws.
The Axiom of Choice: AC is the choice principle assumed by the finite-horizon path-law and particle-law construction.
Sequential importance resampling for Feynman–Kac path targets: Particles are initially sampled from the proposal; each later mutation is conditionally independent given the selected parents; correction uses the incremental Radon–Nikodym weights; either named resampling scheme may be selected.
Multinomial and residual resampling have unbiased offspring counts: Conditional expected offspring counts equal times the normalized input weights.
Khinchin weak law for integrable IID variables: IID integrable real variables have sample means converging in probability to their expectation.
Chebyshev's inequality for random variables: For any square-integrable real random variable on a probability space, the probability of an absolute centered deviation at least is at most its variance divided by .
Markov's inequality for random variables: For any nonnegative random variable on a probability space and , .
Ionescu-Tulcea construction of a Markov chain: The finite sequence of probability kernels defining the particle procedure determines its ordered joint law and conditional kernel factors under AC.
Measurability of integration against a kernel: Integrating a measurable nonnegative function against a probability kernel gives a measurable section integral.
Proof
Given: The hypotheses in the Statement.
At time , [F2] and the finite particle law [F7] give IID proposal particles with law . For , [F4] gives . If , then is integrable under and its integral is by [F1]; also . Applying [F4] to numerator and denominator and dividing on the event that the denominator is positive gives . That event has probability tending to one because the denominator average converges to .
Fix and suppose the three convergences hold at . First let be bounded. By [F2] and [F7], conditional on the selected parents, the are independent with laws ; measurability of follows from [F8]. Thus has conditional mean zero and conditional variance at most . By [F5] this difference tends to zero in probability. Since is bounded and by [F1], the induction hypothesis proves .
The selected-law base at time zero follows as well. For bounded , [F3] makes the conditional selected mean equal to . Under multinomial selection its conditional variance is at most ; under residual selection the deterministic floor counts have no variance and the at most remaining categorical draws give the same bound. By [F5] and step 1.1, in probability. For integrable , truncate at . The conditional expected selected average of is its weighted empirical average by [F3], which converges to the target tail integral by step 1.1. Conditional Markov [F6], using and bounded continuity of , makes the limiting tail probability vanish as . Combining with the bounded truncations proves the selected convergence for all -integrable tests.
For general , let . The conditional mean of is , measurable by [F8]. The function inside this last empirical average is integrable under and its integral is . The induction hypothesis gives in probability. Conditional Markov [F6] bounds by . For fixed , bounded continuity of and convergence in probability to the constant imply that this expectation tends to : for any , split on and its complement, use continuity on the first event and convergence in probability on the second. Since by integrability, the limiting tail probability vanishes. Applying the same truncation to the target integral and combining with step 1.2 proves the proposal empirical convergence for every integrable .
Apply step 2.2 to and , where . Their limiting integrals are and by [F1]. The ratio consequently converges to whenever its denominator is positive; the denominator-zero event has probability tending to zero because its normalized sum converges to . The uniform fallback in [F2] on that event cannot change convergence in probability.
For bounded , the conditional expectation of is by [F3]. In multinomial resampling the conditional variance is at most . In residual resampling the deterministic floor counts contribute no variance, and the remaining categorical draws give conditional variance at most as well. Chebyshev [F5] and step 3.1 prove for bounded .
For , truncate to . By [F3], the conditional expected selected average of is exactly . Step 3.1 applied to this integrable tail and conditional Markov [F6] make the limiting probability of a tail deviation at most , which tends to zero as . Combining with step 4.1 proves the selected empirical convergence for all integrable .
Steps 1.2, 2.2, 3.1, 4.1, and 5.1 establish the induction step from to . Steps 1.1 and 2.1 give the base case, so the assertions hold for every fixed finite time. No conclusion is uniform in .
Multinomial SMC variance unrolls into local contributions
Statement
Use the operators and multinomial variance recursion of Finite-horizon SMC CLT classes and variance recursions at every selection time. For , put . Then where the term uses . Each summand is a finite positive-semidefinite matrix under the stated class conditions.
Facts & Assumptions
Given: The finite-horizon target/proposal flow, Radon–Nikodym weights, forward operators, and multinomial covariance recursion in the cited definition.
The Axiom of Choice: AC is inherited through the finite-horizon path and Radon–Nikodym construction.
Finite-horizon SMC CLT classes and variance recursions: , , , and ; recursively supplies the target moments of the centered backward images.
Proof
Given: The hypotheses in the Statement.
For every integrable on , the Radon–Nikodym identity [F1] gives . Hence if , then has mean zero under .
For a square-integrable vector function on , expand The cross-covariance terms vanish after integrating the first factor conditionally against , because . Therefore For with , its mean is zero by step 1.1. Substituting the multinomial recursion from [F1] thus yields
Starting with at time , apply step 1.1 to see that each backward iterate has -mean zero. The recursive condition also gives its finite target second moment at each such time. Repeated substitution of the one-step identity in step 2.1 gives one new term at each , and the remaining initial term is . Its mean is zero by step 1.1, so it equals the summand. The same base calculation gives the formula when . Each summand is finite: for , the recursive condition gives a proposal moment of ; for , the initial moment gives square integrability of .
Centered filtering Feynman–Kac operators contract terminal tests
Statement
Let be a nonempty standard-Borel space with a sigma-finite reference measure , and let be a probability on it. For , supply jointly measurable, strictly positive finite densities of probability transition kernels relative to , and measurable likelihood factors with . These specified versions satisfy, for one and every , Define , , and . They are the operators of Finite-horizon SMC CLT classes and variance recursions restricted to last-state tests in the corresponding filtering model. Put . For every bounded measurable real terminal test and , For the identity image is bounded by ; use for when . This is a closed last-state-test assertion, not a contraction of arbitrary functions of the full stored path. Positivity, finiteness and the ratio bounds refer to the supplied pointwise density versions, not to unspecified unrelated null-set versions.
Facts & Assumptions
Given: The specified positive finite density versions, probability transitions, initial probability, uniform row ratio and likelihood bounds, and bounded terminal test in the Statement.
Measurability of integration against a kernel: a nonnegative measurable function integrated against a probability kernel has a measurable section integral.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative measurable product integrals equal their iterated integrals.
Uniform density ratios bound the Dobrushin coefficient: normalized probability-kernel density rows with ratio at most have Dobrushin coefficient at most .
Dobrushin contraction coefficient for a probability kernel: the coefficient is the supremum event-supremum total-variation distance between two output laws.
Layer-cake formulas for random variables: for a nonnegative bounded random variable , .
Proof
Fix . Define by iterating the kernels , multiplying by , and evaluating at the final state. Put and . Measurability follows from [F1], while probability normalization and the bounds on give . Comparing the first transition row gives for . Consequently is positive, at most , and has -mean one.
For , set . The recursion for shows that these are probability kernels, with strictly positive finite denominators. The ratio of two of their density rows is by step 1.1. Thus [F3] gives . Telescoping the factors in the product kernel gives .
For any probability kernel and bounded real of positive oscillation, put . Then , and [F5] under each output law gives . By [F4], its absolute value is at most . If the oscillation is zero, preserves the constant and the same oscillation bound is immediate. Hence . Iterating this inequality along the kernels in step 2.1 gives .
The filtering recursion and iterated integration [F2] yield and . Thus . Take . Then , and is a probability by step 1.1. Therefore the global infimum of is at most zero and its supremum is at least zero, so its sup norm is at most its oscillation. Step 3.1 bounds this by ; multiplying by proves the claim. For , the mean lies between and , giving the identity-case bound.
Source notes
The local proof supplies the normalized future-kernel argument explicitly. The density-ratio hypothesis alone does not compare a target transition to its proposal; the separate variance theorem imposes that additional domination and an initial weight bound. No finite-particle or arbitrary-path time-uniform claim is imported from the source.
Conditional multinomial resampling central limit theorem
Statement
Fix a time in the finite-horizon SIR system of Finite-horizon SMC CLT classes and variance recursions. Let be its corrected weighted empirical law and let be the empirical law after multinomial offspring resampling. Suppose , the empirical-law conclusions of Finite-horizon SMC empirical laws converge for integrable tests hold, and for a finite . Then asymptotically independently of the weighted-estimator fluctuation, and
Facts & Assumptions
Given: The corrected weighted empirical law, the multinomial selection rule, the target second-moment condition , and the weighted-estimator CLT in the Statement.
The Axiom of Choice: AC is inherited through the finite-horizon particle-law construction and the cited probability limit theorem.
Finite-horizon SMC CLT classes and variance recursions: the target variance is for a target-square-integrable test. The Statement assumes this second-moment domain.
Multinomial and residual offspring resampling: Conditional on the corrected particles, multinomial offspring are IID draws from .
Finite-horizon SMC empirical laws converge for integrable tests: For every -integrable test , in probability.
Lindeberg-Feller central limit theorem: sufficiency: A centered independent triangular array with positive total variance and the Lindeberg condition, divided by its row standard deviation, converges to .
Chebyshev's inequality for random variables: For a square-integrable variable on any probability space, the probability of an absolute centered deviation at least is at most its variance divided by .
Slutsky's theorem for real random variables: Multiplying a distributionally convergent real variable by one converging in probability to a constant gives the scaled limit.
Proof
Given: The hypotheses in the Statement.
Let contain the corrected particles and their weights. By [F2], conditionally on the selected values are IID with law . Their centered conditional variance is , which converges in probability to by [F1] and [F3].
Put and . By [F3], in probability, hence . For a fixed threshold , choose fixed and then . On and for all sufficiently large with , the event implies , and there. Thus the conditional Lindeberg sum is at most on that event. For fixed , [F3] makes this upper bound converge to , which tends to zero as by the finite target second moment. Given any error probability, first choose so that the probability of is small, then choose with this tail integral small, and finally let . This proves that the conditional Lindeberg sum tends to zero in probability using only target .
Along any subsequence, choose a further subsequence on which almost surely. If , then eventually ; the normalized Lindeberg sum for draws divided by is bounded by step 2.1 at threshold , divided by . It therefore tends to zero in probability, and a further subsequence makes that convergence almost sure. Apply [F4] to obtain a standard-normal limit for the normalized row. Slutsky [F6] with gives convergence of the conditional characteristic function of to . If , conditional [F5] gives , giving the degenerate characteristic-function limit. The subsequence criterion therefore gives convergence in probability of these conditional characteristic functions along the full sequence.
The conditional characteristic functions are bounded by one, so their differences from converge to zero in . For arbitrary real , multiply the conditional resampling characteristic function at by the bounded factor and take expectations. The resulting joint characteristic function tends to . Thus the resampling fluctuation is asymptotically independent of the weighted fluctuation, and their sum has variance .
Conditional mutation and weighted correction CLT
Statement
Fix . Suppose the selected empirical array at time has the CLT with covariance for . Let satisfy for some and . Then the proposal empirical mean after mutation satisfies For weighted correction, take and explicitly require the preceding selected-population CLT for . In particular, if , for , and this preceding selected CLT holds, the weighted corrected estimate satisfies At , a separate weighted-only conclusion holds whenever and : the weighted estimate has the ratio CLT with variance . No target second moment, proposal second moment of , or denominator second moment is required for this weighted-only conclusion. The stronger assumptions imply it and support subsequent selected-population conclusions.
Facts & Assumptions
Given: The finite-horizon particle scheme, the previous selected-population CLT, and the function-class hypotheses in the Statement.
The Axiom of Choice: AC is inherited through the finite-horizon particle-law construction and the Lindeberg–Feller supplier.
Finite-horizon SMC CLT classes and variance recursions: , , and supplies a target second moment and recursive membership of in .
Sequential importance resampling for Feynman–Kac path targets: Conditional on the selected parents, the next proposal particles are drawn independently through and are then corrected by the incremental RN weights.
Finite-horizon SMC empirical laws converge for integrable tests: Integrable proposal and selected empirical averages converge in probability to their target-law integrals at each fixed time.
Lindeberg-Feller central limit theorem: sufficiency: A centered independent triangular array with positive total variance and the Lindeberg condition, divided by its row standard deviation, converges to .
Slutsky's theorem for real random variables: If and in probability, then ; for , the corresponding ratio converges to .
Chebyshev's inequality for random variables: For a square-integrable variable on any probability space, the probability of an absolute centered deviation at least is at most its variance divided by .
Dominated convergence: integrable domination permits passage to limits under the integral.
Proof
Given: The hypotheses in the Statement.
At , the centered weighted numerator has mean zero and finite second moment under the weighted-only assumptions; the assumptions are sufficient for them. If its variance is positive, its IID row satisfies Lindeberg because by [F7] for each . Thus [F4] gives the IID CLT; if its variance is zero, [F6] gives convergence of its centered sample mean to zero. The denominator converges to one by [F3], since . Slutsky [F5] gives the ratio CLT with variance . For , ; choosing the smaller available positive therefore proves closure of under finite linear combinations, by induction from . Kernel integration is linear on these integrable functions. The same inequality gives closure of the target and centered weighted conditions in , and its centered images combine linearly; induction proves closure of . If , then has a finite proposal moment because , and by the recursive condition.
For the mutation part, is -integrable, with integral . By [F3], converges in probability to this finite value, so with probability tending to one. On this event condition on the selected parent paths and set . Each parent has a finite conditional moment; under the product kernel in [F2], are independent and centered. Their row variance is which converges in probability to by [F3], since is integrable by Jensen's inequality. The event removed has probability tending to zero and does not affect the distributional limits below. When , normalize the array by , where is the displayed variance. For every , the resulting conditional Lindeberg sum is at most where is a finite constant from and Jensen's inequality. Since and converges in probability to a finite value, this conditional Lindeberg sum tends to zero.
Along any subsequence, choose a further subsequence on which almost surely. If , a further subsequence makes the normalized Lindeberg sums converge almost surely; [F4] gives a standard-normal limit for the normalized row, and Slutsky [F5] with gives the conditional characteristic-function limit . If , conditional [F6] gives for every , yielding the same characteristic-function limit with variance zero. The subsequence criterion therefore gives convergence in probability of the conditional characteristic functions along the full sequence. They are bounded by one, so their differences from that limit also tend to zero.
The conditional mean part is and has the previous selected-population CLT by the hypothesis of the Statement. The total proposal error is . Multiplying the conditional characteristic function from step 2.1 by the bounded factor and integrating shows that its limit is the product of the previous Gaussian characteristic function and . Hence the two covariance contributions add, giving .
For , apply the mutation result to using step 1.1 and the preceding selected CLT for . By [F3], in probability, and the event of a zero denominator has probability tending to zero. On its complement, Slutsky [F5] gives the stated limit with covariance . The fallback on a zero empirical weight sum changes the ratio only on an event whose probability tends to zero.
Conditional residual resampling central limit theorem away from integer weights
Statement
Fix a time in the finite-horizon SIR system of Finite-horizon SMC CLT classes and variance recursions. Let have proposal empirical law , corrected law , and residual-resampled law . Assume the proposal empirical law converges in probability for every integrable test as in Finite-horizon SMC empirical laws converge for integrable tests, the weighted estimate has a finite-variance CLT and . Write and assume either -almost everywhere, or In the second case . Then, with where in the constant-weight case, asymptotically independently of the weighted-estimator fluctuation, and
Facts & Assumptions
Given: The proposal empirical-law convergence, the weighted-estimator CLT, the target second-moment condition, and the residual offspring algorithm in the Statement.
The Axiom of Choice: AC is inherited through the finite-horizon particle-law construction and the cited probability limit theorem.
Finite-horizon SMC CLT classes and variance recursions: , , , and the formal residual candidate is assigned as only in the no-positive-integer-atom branch or the constant-weight branch.
Multinomial and residual offspring resampling: For normalized weights , residual resampling gives each particle deterministic copies and fills the remaining count with IID draws proportional to .
Finite-horizon SMC empirical laws converge for integrable tests: The proposal and corrected empirical laws converge in probability for integrable tests.
Lindeberg-Feller central limit theorem: sufficiency: A centered independent triangular array with positive total variance and the Lindeberg condition, divided by its row standard deviation, converges to .
Chebyshev's inequality for random variables: For a square-integrable variable on any probability space, the probability of an absolute centered deviation at least is at most its variance divided by .
Slutsky's theorem for real random variables: Multiplying a distributionally convergent real variable by one converging in probability to a constant gives the scaled limit.
Proof
Given: The hypotheses in the Statement.
Put and on the event , whose probability tends to one by [F3]. If almost everywhere, exclude all earlier zero-weight fallback events; their union has probability tending to zero by [F3] and the fixed horizon. On the remaining event every proposal particle avoids proposal-null sets almost surely: initially particles have the proposal law, and inductively positive-weight selection avoids target-null sets, after which mutation avoids -null sets since . Thus all sampled values equal one almost surely there, so residual selection is deterministic. The resampling fluctuation is zero outside an event of probability tending to zero, proving the constant-weight branch. In the other case, for the three tests , where , one has To verify this triangular empirical limit, fix and first restrict to and . The compact interval meets only finitely many positive-integer discontinuities of . Delete open -neighborhoods of those integers. On the remaining compact set, uniformly as , and , so [F3] gives convergence of the restricted averages. Each deleted neighborhood has proposal integral of tending to zero as : it lies where , and ; the no-atom condition gives the limit zero. [F3] controls its empirical average for each fixed . For the tails, when , ; hence the contribution is bounded by , whose limit tends to zero by target integrability. On , use and , with [F3] again controlling the empirical average. The corresponding target tails obey the same bounds because and . Taking first , then and , proves the claim.
Taking in step 1.1 gives . Here : if , then is integer-valued almost surely; the no-positive-integer-atom assumption would force almost surely, contradicting . Thus the number of residual draws diverges and . Their conditional sampling probabilities are .
Let . Given the particles, the residual offspring contribution to the centered, -scaled empirical mean is , with IID conditional draws from probabilities . By step 1.1 its conditional variance converges in probability to The residual draw mean is bounded in probability by the limit in step 1.1 and . Fix a threshold and fixed , then . On , for sufficiently large with , the conditional Lindeberg sum for is at most . Since on this event, it is at most . For fixed , [F3] makes this converge to , which tends to zero as . Choosing , then , then controls the exceptional mean event and the integrable fixed tail; handles the normalization event. Thus conditional Lindeberg holds under target , with no target higher moment.
Along any subsequence, choose a further subsequence on which the conditional residual variance converges almost surely. If , the conditional standard deviation is eventually greater than . Apply the bound in step 3.1 at threshold and divide by the conditional variance; this gives the Lindeberg condition after normalizing the residual sum by its conditional standard deviation. Conditional [F4] gives a standard-normal limit, and Slutsky [F6] with the conditional standard deviation converging to gives the characteristic-function limit . If , conditional [F5] bounds the deviation probability by the conditional variance divided by the squared threshold, giving the same degenerate limit. AC is inherited only through the particle law and conditional CLT supplier [F4]; the finite residual calculation adds no choice. The subsequence criterion gives convergence in probability along the full sequence. These conditional characteristic functions are bounded by one. For arbitrary real , multiply this conditional characteristic function at by and integrate. The limit is , proving joint asymptotic independence and adding to . The deterministic-floor part is centered at its conditional expectation, so the conditional mean of the selected empirical law is exactly .
Time-uniform SMC asymptotic variance under uniform weight and operator bounds
Statement
Use multinomial offspring resampling and the covariance of Finite-horizon SMC CLT classes and variance recursions. Suppose all normalized incremental weights satisfy almost everywhere under their proposals, including . For a chosen bounded real terminal test and every , assume the bounded versions of its centered backward images satisfy with fixed and , uniformly over the horizons considered; use . Then The one-step centered oscillation condition of Uniform SMC backward-operator contraction controls oscillation gives the original specialization , and bound .
There is a separate filtering-density sufficient branch. Use the strictly positive finite density versions, true-transition row-ratio bound , likelihood bounds and normalized filtering operators in Centered filtering Feynman–Kac operators contract terminal tests. Additionally require strictly positive finite proposal densities with uniformly for a finite , and an initial normalized weight under its proposal. Put and . For bounded last-state tests , the bound holds with : This branch concerns the closed last-state test subspace and its backward images, not all path observables. Both bounds concern fixed-horizon CLT variances, uniform in the time index; neither is a finite-particle time-uniform error bound.
Facts & Assumptions
Given: The multinomial SMC flow, the uniform incremental-weight bound , and the stated multistep centered-image constants ; for the filtering branch, the explicit density, domination and initial-weight hypotheses.
The Axiom of Choice: AC is inherited through the finite-horizon SMC path-law and Radon–Nikodym construction.
Finite-horizon SMC CLT classes and variance recursions: is the weighted-estimator covariance, is the normalized incremental Radon–Nikodym weight, and are the recursive moment classes.
Multinomial SMC variance unrolls into local contributions: is the sum over of .
Uniform SMC backward-operator contraction controls oscillation: the stated one-step centered contraction gives the multistep image bound with and .
Centered filtering Feynman–Kac operators contract terminal tests: for the stated filtering density model and bounded last-state tests, the multistep image bound holds with and .
Proof
Given: The hypotheses in the Statement.
Put and for , with itself at . The multistep hypothesis supplies bounded versions of these centered images. By [F1], and for . At , boundedness and almost everywhere give . If , then boundedness of and almost everywhere give and , so . Also and , hence . Induction gives , so [F2] applies to . Its summands are nonnegative and finite because almost everywhere and each has a bounded version.
The multistep bound in the Statement makes the th summand at most . Summing the geometric series gives . Applying [F3] yields the original one-step specialization.
In the filtering branch, the actual increment is , with . Hence for ; the initial bound gives at every time. The last-state subspace is preserved by the filtering operators, and [F4] supplies its centered-image estimate with , . Step 2.1 proves the displayed filtering bound; when , all earlier images vanish and the same formula applies.
Remarks
Uniform predecessor ratios for and alone do not bound or the incremental weights when proposals vary with time. The B-page finite-state counterexample refutes that displayed source/design implication. The additional domination and initial-weight assumptions above are explicit corrections, not consequences ascribed to those predecessor ratios. The abstract branch remains available under its own actual operator assumptions.
Fixed-horizon SMC central limit theorem with multinomial resampling
Statement
Fix a finite horizon and use the target/proposal flow and classes of Finite-horizon SMC CLT classes and variance recursions, with for every . Run the SIR procedure with multinomial resampling at each time. For , let be the corrected weighted empirical law and the post-resampling empirical law. Then where . The horizon is fixed as ; the theorem asserts no time-uniform finite-particle accuracy.
Facts & Assumptions
Given: A fixed finite SIR horizon with multinomial selection, the recursive target-moment class , and the source normalizer condition at every time through .
The Axiom of Choice: AC is inherited through the finite-horizon path-law and particle-law construction.
Finite-horizon SMC CLT classes and variance recursions: includes the terminal target moment and recursively places each centered forward image in ; the source requires ; and are the stated covariance recursions.
Conditional mutation and weighted correction CLT: Given the preceding selected-population CLT, the mutation and correction steps give the weighted-estimator CLT with covariance ; the initial weighted proposal has the ratio CLT under .
Conditional multinomial resampling central limit theorem: Given the weighted-estimator CLT, a finite target second moment, and the empirical-law conclusions of [F5], multinomial selection adds and gives the selected-population CLT.
Cramer wold device: Convergence of all scalar linear projections to the corresponding centered Gaussian projections implies vector weak convergence to the multivariate Gaussian with that covariance matrix.
Finite-horizon SMC empirical laws converge for integrable tests: In the stated finite-horizon SIR flow with multinomial or residual selection, proposal empirical averages converge in probability for every proposal-integrable test, and corrected and selected empirical averages do so for every target-integrable test, at each fixed time.
Proof
Given: The hypotheses in the Statement.
The finite-horizon SIR flow and multinomial selection satisfy [F5], so all its integrable-test empirical-law conclusions hold at every , as required by [F2] and [F3]. Fix and put . The bound and linearity of each show from [F1] that . We prove by induction on the scalar assertion for every test in ; at this includes .
Let , assume the assertion holds for every test in , and take arbitrary . By [F1], , so the induction hypothesis gives the selected CLT needed by [F2] for the centered weighted test. The source condition makes the correction ratio well defined in the same class. Thus [F2] yields the weighted CLT at time with covariance .
At time zero, let . By [F2], the initial weighted ratio has CLT variance . The target moment in and the weighted CLT meet [F3], which gives the post-resampling CLT with variance .
The target moment , the weighted CLT just obtained, and the empirical laws from step 1.1 satisfy [F3]. Multinomial resampling therefore gives the selected CLT with covariance . This proves the induction assertion for every .
The base step 2.1 and induction steps 1.2, 2.2 prove both scalar limits at time for every . For each , by step 1.1 and has covariance projections and . Since was arbitrary, [F4] gives the two vector limits. No bound uniform over the horizon follows from this fixed- argument.
Fixed-horizon SMC central limit theorem with residual resampling away from integer weights
Statement
Fix a finite horizon and use the target/proposal flow and classes of Finite-horizon SMC CLT classes and variance recursions, with for every . Run SIR with residual resampling at each time. At every , assume either -almost everywhere, or . For , let be the corrected weighted empirical law and the post-resampling empirical law. Then where is defined by Finite-horizon SMC CLT classes and variance recursions in the stated branches. No conclusion is asserted for a nonconstant weight law with positive mass at a positive integer. The horizon is fixed as .
Facts & Assumptions
Given: A fixed finite SIR horizon with residual selection, the recursive target-moment class , the source condition at every time, and the no-positive-integer-atom or constant-weight condition at every time.
The Axiom of Choice: AC is inherited through the finite-horizon path-law and particle-law construction.
Finite-horizon SMC CLT classes and variance recursions: includes the terminal target moment and recursively places centered forward images in ; the source condition is ; the displayed residual covariance is assigned only in the stated branches.
Conditional mutation and weighted correction CLT: Given the preceding selected-population CLT, mutation and correction give the weighted-estimator CLT with covariance , with the initial ratio CLT at .
Conditional residual resampling central limit theorem away from integer weights: Under proposal empirical-law convergence and the stated residual-weight condition, residual selection adds to the weighted-estimator variance and gives the selected-population CLT.
Cramer wold device: Convergence of all scalar linear projections to the corresponding centered Gaussian projections implies vector weak convergence to the multivariate Gaussian with that covariance matrix.
Finite-horizon SMC empirical laws converge for integrable tests: In the stated finite-horizon SIR flow with multinomial or residual selection, proposal empirical averages converge in probability for every proposal-integrable test, and corrected and selected empirical averages do so for every target-integrable test, at each fixed time.
Proof
Given: The hypotheses in the Statement.
The finite-horizon SIR flow and residual selection satisfy [F5], so all its integrable-test empirical-law conclusions hold at every , as required by [F2] and [F3]. Fix and put . The bound and linearity of each show from [F1] that . We prove by induction on the scalar assertion for every test in ; at this includes .
Let , assume the assertion holds for every test in , and take arbitrary . By [F1], , so the induction hypothesis gives the selected CLT needed by [F2] for the centered weighted test. The source condition makes the correction ratio well defined in the stated class. Thus [F2] yields the weighted CLT at time with covariance .
At time zero, let . By [F2], the initial weighted ratio has CLT variance . The assumed residual-weight branch either has constant weight one, in which case selection is deterministic and , or has no positive-integer atom; in the latter case the target moment and weighted CLT meet [F3], which gives the selected CLT with its stated .
The target moment , the weighted CLT just obtained, the empirical laws from step 1.1, and the residual-weight condition satisfy [F3]. Residual selection gives the selected CLT with covariance . This proves the induction assertion for every while retaining the stated weight condition at each time.
The base step 2.1 and induction steps 1.2, 2.2 prove both scalar limits at time for every . For each , by step 1.1 and has covariance projections and . Since was arbitrary, [F4] yields the two vector limits. The integer-boundary branch is excluded by hypothesis and receives no conclusion here.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §3.3
- Hans R. Künsch, Recursive Monte Carlo Filters: Algorithms and Theoretical Analysis, §4.3.1
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §3.3 and Appendix A.4
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §§2.1–2.3
- Hans R. Künsch, Recursive Monte Carlo Filters: Algorithms and Theoretical Analysis, §4
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §3.6
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., Chapter 11
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §2.1
- Hans R. Künsch, Recursive Monte Carlo Filters: Algorithms and Theoretical Analysis, §§3–4
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §§3.3–3.5
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §2.3, equation (9)
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Appendix A.4
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Appendix A.1, Lemma A.3
- Hans R. Künsch, Recursive Monte Carlo Filters: Algorithms and Theoretical Analysis, §4, Theorem 4
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Appendix A.1, Lemma A.1–A.2
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Theorem 2 and Appendix A.1, Lemma A.4
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Theorem 1 and Appendix A.1
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Theorem 2 and Appendix A.1