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.
Feynman–Kac path Radon–Nikodym weight
Statement
Assume AC and the setup of Feynman–Kac path targets and normalizers through a fixed horizon . Let be a proposal probability on , and for let be proposal probability kernels. Define . Suppose , and for each suppose for almost every under the last-coordinate marginal of . Choose a measurable version and, using Jointly measurable Radon–Nikodym derivatives for probability kernels, measurable versions for these preceding-state marginals.
Then for every , with product density That is, for every measurable . If , the normalized path target has density with respect to .
Facts & Assumptions
Given: AC, the finite-horizon Feynman–Kac setup, the proposal laws, the initial domination, and the transition domination hypotheses in the Statement.
The Axiom of Choice: AC is used through the path-law and Radon–Nikodym suppliers.
Feynman–Kac path targets and normalizers: is the state path law with density factor .
Jointly measurable Radon–Nikodym derivatives for probability kernels: For each transition, almost-everywhere kernel domination under the preceding proposal marginal supplies one jointly measurable kernel derivative version.
Ionescu-Tulcea construction of a Markov chain: The target and proposal kernels define finite-prefix path laws by ordered iterated integration.
A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: Under AC, supplies a measurable initial density .
Integrating against a Radon-Nikodym derivative recovers integration against the measure: A Radon–Nikodym representative satisfies the setwise identity for every measurable . It also proves the corresponding integration identity for simple functions whose level sets have finite total variation.
Measurability of integration against a kernel: Integrating a nonnegative product-measurable function against a probability kernel gives a measurable section integral.
Every nonnegative measurable function is the increasing limit of simple measurable functions: Every nonnegative measurable function is the pointwise increasing limit of nonnegative simple measurable functions.
Monotone convergence for the integral: Integrals of an increasing sequence of nonnegative measurable functions converge to the integral of its pointwise limit.
A nonnegative measurable function has integral exactly when it vanishes almost everywhere: A nonnegative measurable function with integral zero vanishes almost everywhere.
Composition with a Borel measurable outer map preserves measurability: Composing a measurable function with a Borel function preserves measurability.
Proof
Given: The hypotheses in the Statement.
For each , let and be the target and proposal finite-prefix path laws supplied by [F3]. Initially choose a real-valued Radon–Nikodym representative from [F4]. Since is positive, for its setwise identity gives . Thus , and [F9] implies -almost everywhere. Replace by the measurable nonnegative version ; [F10] gives measurability and the modification preserves the setwise density identity. Hence with base density ; after weighting by in [F1], has density .
First record the nonnegative extension used below. If finite measures satisfy for every measurable , with , choose by [F7] simple functions for any nonnegative measurable . The simple-function identity in [F5] gives for each ; [F8] and monotone convergence of give , with infinity allowed. All measures to which this fact is applied below are probabilities, so the finite-level-set condition in [F5] holds.
Fix and assume with density . For nonnegative product-measurable , define ; [F6] makes measurable. For -almost every history, the kernel Radon–Nikodym identity and step 1.2 give . Step 1.2 also extends the induction density identity from sets to , so ordered integration from [F3] gives Thus with density . The kernel identity is needed only on a -conull set; the same is true for by the induction density, and changes on the exceptional set do not affect these nonnegative integrals.
Induction in step 2.1 gives the proposal density of every finite-horizon state path. The target measure is obtained by integrating the nonnegative path potential against . For each measurable , apply step 1.2 to and the density to obtain Dividing by is valid exactly when .
Depends on
- The Axiom of Choice
- Feynman–Kac path targets and normalizers
- Jointly measurable Radon–Nikodym derivatives for probability kernels
- Ionescu-Tulcea construction of a Markov chain
- A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density
- Integrating against a Radon-Nikodym derivative recovers integration against the measure
- Measurability of integration against a kernel
- Every nonnegative measurable function is the increasing limit of simple measurable functions
- Monotone convergence for the integral
- A nonnegative measurable function has integral $0$ exactly when it vanishes almost everywhere
- Composition with a Borel measurable outer map preserves measurability
Used by
- Conditional particle filter for particle Gibbs Algorithm
- Particle marginal Metropolis–Hastings Algorithm
- Sequential importance resampling for Feynman–Kac path targets Algorithm
- A particle Gibbs proposal that misses posterior path support Counterexample
- Backward-simulation particle Gibbs extended target Definition
- Finite-horizon SMC CLT classes and variance recursions Definition
- Particle Gibbs extended target Definition
- Bootstrap and informed proposals on a two-state particle filter Example
- The backward-simulation sweep is a Gibbs update Theorem
- The conditional particle Gibbs sweep is a Gibbs update Theorem
- The particle Gibbs extended target has the exact smoothing marginal Theorem
- The sequential particle estimator is unbiased for Feynman–Kac path integrals Theorem
Dependency tree · two levels
50 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–3.3 (standard reference, not scraped)
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., §§11.2–11.3 (standard reference, not scraped)
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §§2.1–2.2 (standard reference, not scraped)