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 targets and sequential particle filters — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Feynman–Kac targets and sequential particle filters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Markov Kernels and Markov Chains
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinary and self-normalized importance sampling
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- State-space model laws
- State-space models and exact Bayesian filtering
- Stationary means and sample autocovariance
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
Objective
Finite calculations compare bootstrap and informed proposals, show how missing proposal support loses positive target mass, and compute multinomial versus residual offspring counts for one weight vector. The examples illustrate the scope of the general identities without claiming general finite-particle accuracy or a uniform variance ordering for the resampling schemes.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Multinomial and residual resampling on three weights
Example
Resample particles from normalized weights . The last two particles have zero weight, so compare the three nonzero-weight coordinates; both zero-weight offspring counts remain zero. Compare the expected offspring counts and marginal count variances for the multinomial and residual schemes.
Facts & Assumptions
Given: The normalized weights and the two procedures in the Example.
Multinomial and residual offspring resampling: Multinomial counts are sums of conditionally independent categorical indicators; residual counts add integer floors to categorical draws from normalized fractional remainders.
Multinomial and residual resampling have unbiased offspring counts: Both schemes have conditional expected count for each particle.
Verification
Given: and .
The vector is a probability vector, and . By [F2], both schemes therefore have those expected counts.
In multinomial resampling each count is a sum of five independent Bernoulli indicators with success probability , so its variance is . The first three marginal variances are , , and ; the last two are zero.
Residual resampling has deterministic floors and fractional remainders , whose sum is . It draws one extra index with these probabilities, so the marginal count variances are , , and on the first three coordinates, with variance zero on the last two.
The expected counts agree componentwise, while for these weights each of the first three residual marginal variances is smaller than its multinomial counterpart, while the last two variances are zero in both schemes. This is a calculation for this input vector, not a general variance-ordering claim.
Remarks
The comparison concerns offspring counts only. It does not compare posterior accuracy or claim that residual resampling uniformly improves every statistic.
Bootstrap and informed proposals on a two-state particle filter
Example
Let and with counting sigma-algebras. Set , , , , and . Compare the bootstrap proposal with the informed proposal , . With one particle, the bootstrap normalizer estimate is random, while the informed proposal gives the exact normalizer at this horizon.
Facts & Assumptions
Given: The finite model in the Example and the one-particle algorithm.
Feynman–Kac path targets and normalizers: The path target weights the initial/transition path law by the product of the nonnegative potentials, and normalizes only for a finite positive normalizer.
Sequential importance resampling for Feynman–Kac path targets: The initial and incremental particle weights are and , and the normalizer estimate is the product of their sample averages.
Ordinary importance sampling: For a target density and proposal density , the ordinary importance weight is proportional to .
Ordinary importance sampling is unbiased: Under positive proposal support on the target integrand and integrability, the ordinary importance-sampling estimator has expectation equal to the target expectation.
Verification
Given: Counting measure on , one particle, and the model specified above.
The unnormalized path masses are and . Thus and the normalized target masses are .
For the bootstrap proposal, and . The one-particle incremental weight is therefore with probability and with probability , so its expectation is but it is not constant.
For the informed proposal, and . Multiplication by gives , so the one-particle normalizer estimate equals for either sampled state.
Against counting measure, the unnormalized target density is , , and both proposal densities are strictly positive, so the support and finite-integrability hypotheses of [F4] hold. Setting in [F4] gives after multiplying the unbiased normalized estimate by ; the explicit bootstrap and informed weights above are exactly these ordinary importance-sampling ratios.
Remarks
The informed proposal is tailored to this single fixed potential and horizon. This finite example makes no claim that such a proposal is generally available or computationally cheaper.
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.
Sources
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §3.4
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., §11.4
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §2.1
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §§3.3–3.5
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., §§11.2–11.5
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §2.2
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §3.2
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., §11.2