Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 T≥0 with a state-space model by probability kernels as in General finite-horizon state-space models by kernels. If T=0, put ΩT=E0; otherwise put ΩT=E0×E1×F1×⋯×ET×FT. Let ZT be the corresponding finite-product sigma-algebra and write (ΩT,ZT,PT) for its finite-horizon probability space. The law PT is the unique law supplied by Finite-horizon state-space kernel law exists and is unique. Let Xt and Yt be the coordinate random elements taking values in Et and Ft. For t≥1, write Y1:t:=(Y1,…,Yt) and F1:t:=F1×⋯×Ft with its finite-product sigma-algebra; let F1:0 be a singleton and Y1:0 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 π0:F1:0→E0 assigns μ0 to the unique empty history; it is the conditional law of X0 given the trivial history. For 1≤t≤T, a filtering kernel at time t is a probability kernel πt:F1:t→Et such that ω↦πt(Y1:t(ω),⋅) is a regular conditional distribution of Xt given σ(Y1:t). For 1≤t≤T, a predictive kernel at time t is a probability kernel πt∣t−1:F1:t−1→Et whose composition with Y1:t−1 is a regular conditional distribution of Xt given σ(Y1:t−1). A finite-horizon smoothing kernel is a probability kernel ψT:F1:T→E0×⋯×ET whose composition with Y1:T is a regular conditional distribution of the full state path (X0,…,XT) given σ(Y1:T). 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 θ↦Pθ from a parameter set to probability laws; its measurability is not asserted without a parameter sigma-algebra (Parametric statistical models).

Depends on

Used by

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