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.
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).
Depends on
- The Axiom of Choice
- Parametric statistical models
- Standard Borel spaces
- The product sigma-algebra and its finite iterates
- Measure kernel and probability kernel
- Regular conditional distribution
- Conditional law given a random element
- General finite-horizon state-space models by kernels
- Finite-horizon state-space kernel law exists and is unique
- Finite products of standard Borel spaces are standard Borel
Used by
- Exact linear-Gaussian Kalman filter Algorithm
- Fixed-lag particle smoother Algorithm
- Particle backward simulator Algorithm
- Recursive Bayesian filtering under dominated observations Algorithm
- Conditionally linear-Gaussian state-space model Definition
- Feynman–Kac path targets and normalizers Definition
- Finite-dimensional data assimilation, forecasts, analyses, filtering, and smoothing Definition
- Fixed-interval smoothing law in a linear-Gaussian model Definition
- A scalar Gaussian state-space update by completing the square Example
- A two-state hidden Markov filter and smoother Example
- A zero backward-simulation denominator is inadmissible Example
- An impossible observation has zero evidence and only a filler filter value Example
- Delayed information creates fixed-lag smoothing bias Example
- Bayes factorization of the smoothing backward kernel Lemma
- The backward Gaussian kernel remains valid after future observations Lemma
- Exact state-space filtering recursion under dominated observations Theorem
- Filtering and finite-horizon smoothing laws exist Theorem
- The finite-horizon linear-Gaussian Kalman filter is exact Theorem
Dependency tree · two levels
44 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
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., Chapter 6 (standard reference, not scraped)
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §§2.1–2.3 (standard reference, not scraped)