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.
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 .
Depends on
- The Axiom of Choice
- Finite-horizon SMC CLT classes and variance recursions
- Multinomial and residual offspring resampling
- Finite-horizon SMC empirical laws converge for integrable tests
- Lindeberg-Feller central limit theorem: sufficiency
- Chebyshev's inequality for random variables
- Slutsky's theorem for real random variables
Used by
Dependency tree · two levels
29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, Appendix A.1, Lemma A.3 (standard reference, not scraped)
- Hans R. Künsch, Recursive Monte Carlo Filters: Algorithms and Theoretical Analysis, §4, Theorem 4 (standard reference, not scraped)
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §3.6 (standard reference, not scraped)