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 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.
Depends on
- Dominated convergence
- The Axiom of Choice
- Finite-horizon SMC CLT classes and variance recursions
- Sequential importance resampling for Feynman–Kac path targets
- Finite-horizon SMC empirical laws converge for integrable tests
- Lindeberg-Feller central limit theorem: sufficiency
- Slutsky's theorem for real random variables
- Chebyshev's inequality for random variables
Used by
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, Appendix A.1, Lemma A.1–A.2 (standard reference, not scraped)
- Hans R. Künsch, Recursive Monte Carlo Filters: Algorithms and Theoretical Analysis, §4, Theorem 4 (standard reference, not scraped)