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.
Conditionally linear-Gaussian state-space model
Definition
Assume AC. Let take values in a standard-Borel space and let for a finite horizon , where each is a positive integer. For , let with each a positive integer; observations begin at time . The nonlinear component has initial probability and transition probability kernels ; its transition does not depend on . Given the entire nonlinear path , write with its finite-product sigma-algebra and specify Borel maps and, for , Require and to be symmetric positive semidefinite, meaning for every matching vector , and to be symmetric positive definite, meaning for every nonzero . Conditional on , the linear component and observations have the finite linear-Gaussian model, with the transition and observation equations for : where the centered Gaussian noises and are mutually independent over time and independent of , under that conditional law. For every fixed path these are exactly the hypotheses of Linear-Gaussian state-space models with independent noises with deterministic matrices.
This hierarchical conditionally linear-Gaussian model is the input class for the Rao–Blackwellized filter below: it samples the nonlinear path and keeps the conditional Gaussian law of analytically. It does not include a nonlinear transition whose law depends on , nor does it assert that the marginal nonlinear process remains Markov after conditioning on all observations. Such models need their own marginal transition and backward kernels. A state-space filtering or smoothing law is a data-indexed regular conditional-distribution version as in Filtering, predictive, and smoothing laws in a finite-horizon state-space model; no pointwise uniqueness on null data histories is imposed.
Depends on
Used by
Dependency tree · two levels
23 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 7, §7.5 (standard reference, not scraped)
- Simo Särkkä, Bayesian Filtering and Smoothing, Chapter 11, §11.4 (standard reference, not scraped)
- 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 (standard reference, not scraped)