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.
Particle smoothing, backward simulation, and Rao–Blackwellized filters — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate families and Gaussian conditioning
- 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
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Exact linear-Gaussian Kalman filtering
- Feynman–Kac targets and sequential particle filters
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Markov Kernels and Markov Chains
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed effects and longitudinal models
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- 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
- Outer Measure and the Caratheodory Extension Theorem
- Particle smoothing, backward simulation, and Rao–Blackwellized filters
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- 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
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- 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
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
These examples compute a two-mode Gaussian mixture by conditioning on each nonlinear mode, show why an incompatible terminal particle can make the backward density denominator vanish, and give a finite-state case where a later observation changes the full smoothing law by total variation . They separate exact conditional Gaussian calculations from finite-particle approximation and fixed-lag truncation bias.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A two-mode linear-Gaussian Rao–Blackwellized filter
Example
Let be uniform on and let . Conditional on , take and where , , and are independent variables, independent of . Observe . The exact conditional posterior is the two-component mixture These are the component moments and mode weights that the Rao–Blackwellized filter represents analytically; a finite particle cloud still approximates the mode mixture.
Facts & Assumptions
Given: The finite model and observation in the Example.
A conditionally linear-Gaussian state-space model has a Markov nonlinear component and a linear-Gaussian component conditional on its nonlinear path. Conditionally linear-Gaussian state-space model
AC is inherited from the Gaussian-law and finite-horizon conditional-kernel conventions. The Axiom of Choice
Conditional on a nonlinear path, the Kalman filter gives the exact Gaussian state filter and the marginal observation density. The Kalman filter is exact conditional on a nonlinear path
The Rao–Blackwellized particle filter retains those conditional Gaussian components and weights nonlinear paths by their conditional observation densities. Rao–Blackwellized particle filter
A positive-definite one-dimensional Gaussian covariance gives density . A positive-definite multivariate normal law has its Gaussian density
Verification
Given: , , the conditional Gaussian model stated in the Example, and .
The state and observation noises are independent centered Gaussians, the conditional initial covariance is , the process covariance is , and the observation covariance is . Thus the model satisfies [F1] and the exact conditional Kalman interface [F2].
Conditional on , prediction gives and . Hence for and for . The innovation is zero and the innovation variances are and .
By [F4], the two conditional observation densities at zero are and . Multiplying by the equal prior masses and normalizing gives and .
The Kalman covariance update is here, so the two conditional posterior variances are and ; both conditional means remain zero. Mixing these exact conditional Gaussians with the mode probabilities from step 2.1 gives the displayed posterior. The filter in [F3] uses these same per-mode likelihoods and Gaussian components; only its finite particle approximation to the mode weights is random.
A zero backward-simulation denominator is inadmissible
Example
Take with counting measure, initial law , and deterministic transition . Its transition density is when and otherwise. A supplied pair of particle clouds with time-zero particle and terminal particle has backward denominator This terminal cloud is inconsistent with the transition and filtering law; the particle backward algorithm must report its density-mode input as inadmissible rather than inventing uniform backward weights.
Facts & Assumptions
Given: The two-state deterministic model and the supplied particle clouds in the Example.
AC is inherited through the finite-horizon conditional-law convention used for the impossible conditioning fiber. The Axiom of Choice
Conditional kernels and smoothing laws are versions on standard-Borel spaces; values on impossible conditioning fibers are not fixed by the conditional identities. Filtering, predictive, and smoothing laws in a finite-horizon state-space model
A density-based backward kernel is normalized only when its predictive denominator is finite and positive. Bayes factorization of the smoothing backward kernel
The particle backward algorithm requires finite positive denominators and declares other particle-mode inputs inadmissible. Particle backward simulator
Verification
Given: , , and the particle weights and states in the Example.
Substitution gives and , so the unique backward score is zero and its normalizing denominator is zero. No division by this quantity defines a probability vector.
The exact predictive law is , hence the terminal state has predictive probability zero. By [A1] and [F1] a conditional version on this null fiber is not determined by the model's conditional identities, and the supplied cloud at is not a possible output of the stated filter.
Because [F3] restricts the density-based backward draw to a finite positive denominator, the procedure rejects this input; a uniform choice would be an unsupported choice of conditional version, not a consequence of Bayes' formula.
Delayed information creates fixed-lag smoothing bias
Example
Let and set and . Let deterministically and . For target time and lag , the fixed-lag procedure conditions only on , whereas the full smoother also uses . In the exact-kernel mode of Fixed-lag particle smoother, the lagged law is while, for either observed value , the full smoothing marginal at time is . Their total-variation distance under the convention is . Increasing the number of particles does not remove this truncation bias at fixed lag.
Facts & Assumptions
Given: The finite model, , and in the Example.
AC is inherited through the finite-horizon conditional-law convention for the supplied smoothing kernels. The Axiom of Choice
A smoothing law is a conditional law of the full state path given the specified observation history. Filtering, predictive, and smoothing laws in a finite-horizon state-space model
The backward conditional-kernel mode returns the exact smoother for the observations it is given, and fixed lag uses only . Fixed-lag particle smoother
Exact backward conditional kernels factor the finite-horizon smoother. Bayes factorization of the smoothing backward kernel
The exact-kernel fixed-lag branch targets the smoothing marginal with the truncated observation history. Exact-kernel fixed-lag smoothing targets the truncated conditional law
Verification
Given: , , , and .
Since is constant, conditioning on leaves the prior law of unchanged. The time- target for lag uses , so [F2] and [F4] give the lagged law .
For each , the event has probability . On this event, surely. Thus the full smoothing path law is , and its time- marginal is .
For , the probabilities under the lagged law and the full smoothing marginal at time are and , respectively; for any subset their probability difference has absolute value at most . Hence . This difference is between the truncated and full targets at time , so particle-count growth alone cannot remove it.
Sources
- Simo Särkkä, Bayesian Filtering and Smoothing, Chapter 7, §7.5
- Fredrik Lindsten, Pete Bunch, Simo Särkkä, Thomas B. Schön, and Simon J. Godsill, Rao-Blackwellized particle smoothers for conditionally linear Gaussian models, §3.2
- Simo Särkkä, Bayesian Filtering and Smoothing, Chapter 11, §11.2
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §5.2
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §5.1