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 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 .
Depends on
- The Axiom of Choice
- Finite-horizon SMC CLT classes and variance recursions
- Sequential importance resampling for Feynman–Kac path targets
- Multinomial and residual resampling have unbiased offspring counts
- Khinchin weak law for integrable IID variables
- Chebyshev's inequality for random variables
- Markov's inequality for random variables
- Ionescu-Tulcea construction of a Markov chain
- Measurability of integration against a kernel
Used by
- Conditional multinomial resampling central limit theorem Lemma
- Conditional mutation and weighted correction CLT Lemma
- Conditional residual resampling central limit theorem away from integer weights Lemma
- Fixed-horizon SMC central limit theorem with multinomial resampling Theorem
- Fixed-horizon SMC central limit theorem with residual resampling away from integer weights Theorem
Dependency tree · two levels
36 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, §2.1 (standard reference, not scraped)
- Hans R. Künsch, Recursive Monte Carlo Filters: Algorithms and Theoretical Analysis, §§3–4 (standard reference, not scraped)
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §§3.3–3.5 (standard reference, not scraped)