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.
Fixed-interval smoothing law in a linear-Gaussian model
Definition
Assume AC and fix a finite-horizon linear-Gaussian state-space model (Linear-Gaussian state-space models with independent noises) with states , observations , and Borel observation space , with the empty product a singleton when . For , a fixed-interval smoothing kernel for is an everywhere-defined probability kernel whose composition with the full observation vector is a regular conditional distribution of given . Thus it is the single-time marginal smoothing law after all observations through time are supplied. The full-path smoothing kernel and its version convention are defined in Filtering, predictive, and smoothing laws in a finite-horizon state-space model.
This definition does not assert that such a kernel exists or is unique at observation values in a null set. The theorem on this page constructs a Gaussian version under its explicit forecast and innovation assumptions.
Depends on
Used by
- Finite-dimensional data assimilation, forecasts, analyses, filtering, and smoothing Definition
- Exact two-time scalar Rauch–Tung–Striebel smoothing calculation Example
- Singular forecast covariance lies outside the ordinary RTS inverse domain Example
- The Rauch–Tung–Striebel recursion gives fixed-interval Gaussian smoothing laws Theorem
Dependency tree · two levels
15 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ä, Bayesian Filtering and Smoothing, Chapter 8, §§8.1–8.2 (standard reference, not scraped)
- Kody Law, Andrew M. Stuart, and Konstantinos Zygalakis, Data Assimilation: A Mathematical Introduction, Chapter 3, §3.1 (standard reference, not scraped)