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.
Residual resampling is discontinuous at positive integer weights
Statement refuted
Under the recursive weighted-moment class and normalization hypotheses in Finite-horizon SMC CLT classes and variance recursions, the residual offspring covariance is always the displayed computed from the limiting fractional parts , including when the importance-weight law has an atom at a positive integer.
Facts & Assumptions
Given: The CLT classes and residual covariance formula in the cited definition, and the standard normalized-weight residual procedure.
Finite-horizon SMC CLT classes and variance recursions: has -mean one; the formal source candidate is computed from .
Multinomial and residual offspring resampling: With normalized input weights , residual resampling uses floors and distributes the remaining children according to normalized fractional remainders.
Lindeberg-Levy iid central limit theorem: IID real variables with finite positive variance have the usual normalized Gaussian sample-mean limit.
Slutsky's theorem for real random variables: Multiplying a distributionally convergent variable by a factor converging in probability to a constant gives the corresponding scaled limit.
Continuous mapping theorem: A measurable map continuous outside a null set of the limiting law preserves weak convergence.
Counterexample
Given: At time , let the proposal law on be , . Let the target be , with Radon–Nikodym weights , . Use . Both weights are positive and finite, is bounded, and .
For IID proposal particles, let be the number at and . The weighted empirical estimate is Since is binomial with parameters , [F3] gives . The identity and [F4] yield . Moreover, exactly when .
The limiting-weight candidate in [F1] gives and . Because , both and are zero, so . If used as a universal residual CLT variance, it predicts a post-resampling Gaussian limit with variance .
Put and , . On , the normalized residual sizes are and ; hence each particle receives one deterministic child, each particle receives none, and children are sampled from the remainders. If is the number of residual children at , then conditionally on the proposal sample, with . As , and .
On that event, the post-resampling mean is and its conditional mean is . A Taylor expansion of the binomial characteristic function, uniform for and , gives Thus, on the positive branch , the extra resampling fluctuation has limiting variance .
On the negative branch with and , one has and . The floor for each particle is two, and its total fractional remainder is , because . Conditional variance of the residual count is at most this total remainder. Consequently the variance of times the post-resampling proportion about its weighted conditional mean is , so the extra resampling fluctuation tends to zero in probability on the negative branch. The events have probability tending to zero by [F3].
Put , the post-resampling fluctuation centered at the weighted mean, and condition on the proposal count . For any real , steps 2.1, 2.2 and the negligible exceptional event show that converges in probability to when and to when . Since and , [F5] gives This is the joint characteristic function of for an independent , so the post-resampling limit is . Its mean is zero and its third moment is , so it is not Gaussian. This contradicts the variance- Gaussian predicted in step 1.2.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
24 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.