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.
Multinomial SMC variance unrolls into local contributions
Statement
Use the operators and multinomial variance recursion of Finite-horizon SMC CLT classes and variance recursions at every selection time. For , put . Then where the term uses . Each summand is a finite positive-semidefinite matrix under the stated class conditions.
Facts & Assumptions
Given: The finite-horizon target/proposal flow, Radon–Nikodym weights, forward operators, and multinomial covariance recursion in the cited definition.
The Axiom of Choice: AC is inherited through the finite-horizon path and Radon–Nikodym construction.
Finite-horizon SMC CLT classes and variance recursions: , , , and ; recursively supplies the target moments of the centered backward images.
Proof
Given: The hypotheses in the Statement.
For every integrable on , the Radon–Nikodym identity [F1] gives . Hence if , then has mean zero under .
For a square-integrable vector function on , expand The cross-covariance terms vanish after integrating the first factor conditionally against , because . Therefore For with , its mean is zero by step 1.1. Substituting the multinomial recursion from [F1] thus yields
Starting with at time , apply step 1.1 to see that each backward iterate has -mean zero. The recursive condition also gives its finite target second moment at each such time. Repeated substitution of the one-step identity in step 2.1 gives one new term at each , and the remaining initial term is . Its mean is zero by step 1.1, so it equals the summand. The same base calculation gives the formula when . Each summand is finite: for , the recursive condition gives a proposal moment of ; for , the initial moment gives square integrability of .
Depends on
Used by
Dependency tree · two levels
7 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.3, equation (9) (standard reference, not scraped)
- Hans R. Künsch, Recursive Monte Carlo Filters: Algorithms and Theoretical Analysis, §4.3.1 (standard reference, not scraped)