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.
Finite-budget stopped-kernel measurability and event normalizer
Statement
Assume AC. Under the hypotheses of Finite-budget stopped-event kernel with a cemetery outcome, every is a measurable probability kernel from to . For an initial probability law , let Then . In the one-step Feynman–Kac model with initial law , transition , initial potential , and terminal potential , the normalizer is exactly . The limit is the exact-hitting normalizer; an exact simulator with finite expected work requires a separate termination-cost bound.
Facts & Assumptions
Given: A measurable state space, probability kernel , disjoint measurable target and return sets , and the finite-budget kernels from Finite-budget stopped-event kernel with a cemetery outcome.
The Axiom of Choice: AC is inherited through the path-law construction used by the finite-horizon supplier.
Finite-budget stopped-event kernel with a cemetery outcome: assigns hit, return, or cemetery according to the current state; fixes terminal states and otherwise integrates after one -transition.
Measurability of integration against a kernel: Integrating a nonnegative measurable section against a probability kernel gives a measurable function of the source state.
Ionescu-Tulcea construction of a Markov chain: Finite-prefix path laws have the prescribed iterated-kernel probabilities.
Feynman–Kac path targets and normalizers: A finite-horizon Feynman–Kac normalizer is the integral of the product of its potentials against the ordered path law.
Proof
For , the three status probabilities are the indicators of the disjoint partition ; they are measurable and sum to one. Thus is a probability kernel.
At the hit status occurs exactly when . For , points in or stop immediately, while from the first -transition is followed by the budget- rule. The finite-prefix law [F3] and induction therefore identify with ; integrating against gives .
Suppose is a probability kernel. For each , the function is measurable. By [F2], its -integral is measurable in . On and the next status is the corresponding point mass; on the three integrals sum to . Hence is a probability kernel, and induction proves the first claim.
In the one-step Feynman–Kac model, the product of potentials is ; [F4] therefore gives normalizer . The success events by budgets increase to ; countable additivity gives the limit identity.
Depends on
Used by
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.
Sources
- Adam M. Johansen, Pierre Del Moral, and Arnaud Doucet, Sequential Monte Carlo Samplers for Rare Events, `3 (standard reference, not scraped)
- Frédéric Cérou, Pierre Del Moral, and Arnaud Guyader, A nonasymptotic theorem for unnormalized Feynman–Kac particle models, `6 (standard reference, not scraped)