Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 Zt take values in a standard-Borel space (Zt,Zt) and let Ut∈Rdt for a finite horizon 0≤t≤T, where each dt is a positive integer. For 1≤t≤T, let Yt∈Rpt with each pt a positive integer; observations begin at time 1. The nonlinear component has initial probability μ0 and transition probability kernels Mt(zt−1,dzt); its transition does not depend on Ut−1. Given the entire nonlinear path z0:T, write Z0:t=∏s=0tZs with its finite-product sigma-algebra and specify Borel maps m0:Z0→Rd0,P0:Z0→Rd0×d0, and, for 1≤t≤T, At:Z0:t→Rdt×dt−1,Qt:Z0:t→Rdt×dt,Ct:Z0:t→Rpt×dt,Rt:Z0:t→Rpt×pt. Require P0(z0) and Qt(z0:t) to be symmetric positive semidefinite, meaning vTPv≥0 for every matching vector v, and Rt(z0:t) to be symmetric positive definite, meaning vTRtv>0 for every nonzero v. Conditional on Z0:T=z0:T, the linear component and observations have the finite linear-Gaussian model, with the transition and observation equations for 1≤t≤T: U0∼N(m0(z0),P0(z0)),Ut=At(z0:t)Ut−1+ξt,Yt=Ct(z0:t)Ut+εt, where the centered Gaussian noises ξt∼N(0,Qt(z0:t)) and εt∼N(0,Rt(z0:t)) are mutually independent over time and independent of U0, under that conditional law. For every fixed path z0:T 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 Ut analytically. It does not include a nonlinear transition whose law depends on Ut−1, 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