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.
State-space models and exact Bayesian filtering
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
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue-Stieltjes Measures and Distribution Functions
- 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
- Outer Measure and the Caratheodory Extension Theorem
- 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
- 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
2 · Summary
Overview
For a finite-horizon state-space model on standard-Borel state and observation spaces, this page defines filtering, predictive, and full-path smoothing laws as conditional kernels. AC supplies the finite-horizon model law and the regular conditional distributions. When each observation kernel has a jointly measurable density against a sigma-finite reference measure, the recursive procedure first propagates the previous state law through the transition kernel and then applies the dominated Bayes update. The theorem proves that its outputs are conditional-law kernels. Evidence is normalized only when it is finite and positive; zero or infinite fibers receive the predictive law as a conditional-version filler and carry no pointwise posterior interpretation. The results are finite-horizon conditional identities. They make no particle approximation, convergence, or long-time stability claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Filtering, predictive, and smoothing laws in a finite-horizon state-space model
Definition
Assume AC and fix a finite horizon with a state-space model by probability kernels as in General finite-horizon state-space models by kernels. If , put ; otherwise put . Let be the corresponding finite-product sigma-algebra and write for its finite-horizon probability space. The law is the unique law supplied by Finite-horizon state-space kernel law exists and is unique. Let and be the coordinate random elements taking values in and . For , write and with its finite-product sigma-algebra; let be a singleton and its constant map. The factors are standard Borel, meaning measurably isomorphic to Polish spaces (Standard Borel spaces), and their finite products are standard Borel (Finite products of standard Borel spaces are standard Borel).
The initial filtering kernel assigns to the unique empty history; it is the conditional law of given the trivial history. For , a filtering kernel at time is a probability kernel such that is a regular conditional distribution of given . For , a predictive kernel at time is a probability kernel whose composition with is a regular conditional distribution of given . A finite-horizon smoothing kernel is a probability kernel whose composition with is a regular conditional distribution of the full state path given . Here a regular conditional distribution is an everywhere probability kernel satisfying the conditional event identities in Regular conditional distribution, and a conditional law given a random element is its data-indexed kernel form in Conditional law given a random element.
These kernels are versions: their values can be changed on a measurable set of observation histories of probability zero without changing the conditional identities. No density is assumed in these definitions. The state-space model here is one fixed law. A parametric statistical model is instead a map from a parameter set to probability laws; its measurability is not asserted without a parameter sigma-algebra (Parametric statistical models).
Filtering and finite-horizon smoothing laws exist
Statement
Assume AC and a finite-horizon state-space model by standard-Borel state and observation spaces, an initial probability measure, and transition and observation probability kernels, as in General finite-horizon state-space models by kernels. Let be its finite-horizon path law. The initial filtering kernel is on the singleton empty-history space. For each , data-indexed filtering and predictive kernels from Filtering, predictive, and smoothing laws in a finite-horizon state-space model exist. A data-indexed finite-horizon smoothing kernel for the full state path also exists, including when . The claim is existence of conditional versions only; it asserts no density, filtering recursion, uniqueness on null observation histories, or numerical approximation.
Facts & Assumptions
Given: AC, a finite horizon , standard-Borel state spaces and observation spaces , an initial probability measure and probability kernels as in the Statement.
AC states that every family of nonempty sets has a choice function. The Axiom of Choice
A finite-horizon model supplies standard-Borel state and observation spaces, an initial law, transition kernels, and observation kernels. General finite-horizon state-space models by kernels
Under AC these data determine a unique probability law on the interleaved finite path space with the stated iterated-kernel formula. Finite-horizon state-space kernel law exists and is unique
Every finite product of standard-Borel spaces, with its finite-product sigma-algebra, is standard Borel. Finite products of standard Borel spaces are standard Borel
Under AC, a random element with standard-Borel target has a regular conditional distribution given any sub-sigma-algebra. Existence of regular conditional distributions for standard borel targets
Under AC, an RCD given factors through a standard-Borel random element as a probability kernel on its observation space. Regular conditional kernels factor through a standard borel conditioning variable
A data-indexed conditional law is a probability kernel whose composition with the conditioning random element is an RCD. Conditional law given a random element
An RCD is an everywhere probability kernel satisfying all conditional event identities. Regular conditional distribution
Filtering, predictive, and smoothing kernels have the definitions and conditioning sigma-algebras stated above. Filtering, predictive, and smoothing laws in a finite-horizon state-space model
Proof
Given: The hypotheses in the Statement.
If put ; otherwise put . Let be its finite-product sigma-algebra. By [F1] and [A1], [F2] supplies a probability measure on with the stated iterated-kernel law; the coordinate maps and history maps are measurable projections.
The initial probability makes nonempty; recursively, probability-kernel sections on each nonempty state space force the next state and observation spaces to be nonempty. By [F1] each factor is standard Borel, so [F3] makes , every , and each history target standard Borel, including the empty-history singleton.
For each , apply [F4] under [A1] to given and given ; their state targets and history targets are standard Borel by step 2.1. The path law [F2] has -marginal , so the constant kernel satisfies the conditional identities for the trivial empty history. Apply [F4] under [A1] to given ; its target is standard Borel by step 2.1.
Each nonempty observation-history target is standard Borel by step 2.1, so [F5] under [A1] factors the RCDs from step 3.1 through their history maps; [F6]–[F8] identify the resulting probability kernels as the required conditional laws. The initial kernel was checked directly in step 3.1. AC is used only through [F2], [F4], and [F5]. No density or pointwise uniqueness on null histories is inferred.
Recursive Bayesian filtering under dominated observations
Definition
Assume AC and a finite-horizon model as in General finite-horizon state-space models by kernels. For each , suppose the observation kernel has a supplied product-measurable density with respect to a sigma-finite measure on , normalized so that for every state and measurable .
The procedure takes the initial law , transition kernels , observation densities and measures as inputs. It defines data-indexed prediction, evidence, and filtering functions on every observation history as follows.
-
Initialize on the singleton empty-history space by .
-
For , each history and each measurable state set , form the predictive measure
-
For each , calculate the evidence density
-
Define the filtering measure at by Use as the input filtering function at the next time step.
The procedure returns the initialized filter and, for every , , , and . It is an exact measure-valued recursion; it makes no claim that the integrals have closed forms or can be evaluated with finite computational cost. Exact state-space filtering recursion under dominated observations ↗ proves that the returned time- functions are predictive and filtering kernels for the specified finite-horizon model.
Exact state-space filtering recursion under dominated observations
Statement
Assume AC and a finite-horizon model as in General finite-horizon state-space models by kernels. For each , let be a sigma-finite measure on and suppose the observation kernel has a specified product-measurable density with respect to : for every state and measurable . For , let be the filtering kernel at time from Filtering, predictive, and smoothing laws in a finite-horizon state-space model when , and for let be the initial kernel on the singleton empty-history space. For , define the predictive kernel the evidence density and for , , and define the update Then is a predictive kernel for given , and is a filtering kernel for given . For each fixed history , the observation marginal under the conditional version determined by has density with respect to and assigns zero mass to both and . Thus the formula never divides by zero or infinity; values on those fibers are conditional-law fillers. The statement is exact and finite-horizon and gives no numerical approximation or long-time stability claim.
Facts & Assumptions
Given: AC; the finite-horizon state-space model; for every , a sigma-finite and product-measurable satisfying the displayed kernel-density identity and pointwise normalization; and the stated time- filtering kernel.
AC states that every family of nonempty sets has a choice function. The Axiom of Choice
The model path law has the ordered factorization . Finite-horizon state-space kernel law exists and is unique
A filtering kernel composed with the observation history is an RCD of the current state given that history; the initial filtering kernel is on the singleton empty history. Filtering, predictive, and smoothing laws in a finite-horizon state-space model
Integrating a nonnegative measurable function through an RCD gives the conditional integral identities for every conditioning event. Conditional integration through a regular conditional law
Integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the source variable. Measurability of integration against a kernel
A probability kernel has pointwise probability-measure sections and measurable evaluations. Measure kernel and probability kernel
For a proper prior probability and a jointly measurable normalized kernel density, the dominated Bayes kernel has density-normalizer marginal; it uses the quotient only at finite positive evidence and fills both zero and infinite evidence fibers with the supplied prior probability. Bayes formula for dominated kernels
Measurable rectangles generate the finite product sigma-algebra. The product sigma-algebra and its finite iterates
A pi-system generating a sigma-algebra determines finite measures and extends equality of finite measures from the pi-system. Dynkin's pi-lambda theorem
Expectations of measurable functions of a random element equal their integrals against its law. Change of variables for expectation
Increasing limits pass through nonnegative integrals. Monotone convergence for the integral
Under AC, the required data-indexed filtering kernels and smoothing kernel exist on the standard-Borel state and observation spaces. Filtering and finite-horizon smoothing laws exist
The recursive filtering procedure defines prediction, evidence, and finite-positive updates with the predictive measure as the zero/infinite evidence filler. Recursive Bayesian filtering under dominated observations
Proof
Given: The hypotheses in the Statement.
For use ; for use the filtering kernel supplied by [F11] under [A1], and define by the displayed mixture. Each section has mass ; countable additivity follows by applying [F10] to increasing partial sums for disjoint target sets, and measurability in follows from [F4].
Regard as a probability kernel constant in . Product measurability of and [F4] make and each numerator measurable. On the numerator is a finite measure of total mass , so division gives a probability; off that set the predictive measure is a probability. Thus is an everywhere probability kernel with measurable evaluations, including zero and infinite fibers.
For a history rectangle and measurable , inserting at the transition factor of [F1] gives , since later kernels integrate to one; at this is the one-step transition integral. These are finite measures of , so [F7]–[F8] extend equality from history rectangles to all . Then [F3] for the filtering kernel from [F11] turns the right side into , proving that is predictive.
Fix . The prior is a probability and has the specified jointly measurable normalized density, so [F6] gives observation marginal and conditional kernel ; the zero and infinite evidence fibers have zero marginal. In particular, .
For a history rectangle and an observation set , the path law [F1], predictive identity from step 2.2, and conditional integration [F3] applied to give . By step 3.1 this is . Taking and using from step 2.1 identifies the law of on history-observation rectangles with ; [F7]–[F8] extend this to the product sigma-algebra.
Step 2.1 makes measurable and bounded. The joint-observation law just established and [F9] therefore give, on each history-observation rectangle , By step 4.1 this is . Such rectangles generate by [F7], and for fixed both sides are finite measures of the conditioning event, so [F8] extends the identity to every event in . Thus is a filtering kernel; step 2.2 already proves prediction, and the procedure [F12] returns the claimed kernels.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., Chapter 6
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §§2.1–2.3
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §§2.1–2.2