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.
A bounded-weight mixing filter has bounded asymptotic variance
Example
Let , set the initial target and proposal to the uniform law, and use at every step the true transition and proposal kernel , with constant likelihood one. Thus all incremental weights equal one. For , compute the asymptotic variance and verify the time-uniform bound.
Facts & Assumptions
Given: The two-state model, its uniform transition/proposal kernel, unit likelihood and test in the Example.
Finite-horizon SMC CLT classes and variance recursions: If target and proposal transitions agree and likelihood is one, then , and for last-state tests the restricted operator is .
Dobrushin contraction coefficient for a probability kernel: is the supremum total-variation distance between two transition rows.
Uniform density ratios bound the Dobrushin coefficient: A common density ratio bound implies .
Centered filtering Feynman–Kac operators contract terminal tests: the stated filtering density row bound gives a centered last-state image estimate with and .
Time-uniform SMC asymptotic variance under uniform weight and operator bounds: bounded weights and the multistep centered-image bound give .
Verification
Given: The finite two-state filtering model in the Example.
Every transition row is , so the target and proposal transitions coincide and the likelihood contributes no correction. By [F1], , hence , and is uniform for every . Since the row does not depend on its predecessor, [F2] gives ; its density rows are identical, so [F3] also applies with .
On the closed last-state subspace the forward operator is , which maps a last-state test to its uniform average. The true transition and proposal density versions relative to counting measure are all , so [F4] applies with , , and . No contraction of arbitrary path-history functions is asserted. The test has and is centered by . Every earlier backward image is zero; the final term in the variance expansion is . Hence for every .
Applying [F5] with , and gives , uniformly in ; the exact variance from step 1.2 satisfies the bound. This verifies a time-uniform asymptotic-variance result under explicit mixing and weight conditions.
Depends on
- Finite-horizon SMC CLT classes and variance recursions
- Dobrushin contraction coefficient for a probability kernel
- Uniform density ratios bound the Dobrushin coefficient
- Centered filtering Feynman–Kac operators contract terminal tests
- Time-uniform SMC asymptotic variance under uniform weight and operator bounds
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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.