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 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 .
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, Theorem 2 and Appendix A.1, Lemma A.4 (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)