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 particle proposal can miss positive target mass
Statement refuted
False claim: The transition support condition may be dropped while the same proposal-weighted particle measure still represents the Feynman–Kac target.
Facts & Assumptions
Given: The finite model and proposal in the Counterexample.
Feynman–Kac path targets and normalizers: The unnormalized path law is the initial/transition path law weighted by the product of the specified potentials.
Sequential importance resampling for Feynman–Kac path targets: Particle paths are proposed using and then weighted using the target-to-proposal kernel derivative; the procedure requires the support and derivative hypotheses in its definition.
Counterexample
Let and . Take , , , , and . By [F1], is the transition law itself, , and the normalized target assigns mass to .
The support premise fails because while . A proposal path drawn from equals with probability one, so every empirical measure formed from such paths assigns mass zero to the event .
If a kernel derivative represented with respect to , then , contradicting the value . Thus the required importance weight does not exist on this target-positive, proposal-null set, and the false claim fails.
Remarks
The example refutes target coverage after support failure; it does not assert that every numerical normalizer estimate must be biased when support fails.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §3.2 (standard reference, not scraped)
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., §11.2 (standard reference, not scraped)