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.

Linear-Gaussian state-space models with independent noises

Definition

Assume AC (The Axiom of Choice) and fix a finite horizon T≥0. Let the state dimension at time t be a positive integer dt for 0≤t≤T, and the observation dimension at time t be a positive integer pt for 1≤t≤T. Choose deterministic matrices Ft∈Rdt×dt−1 and Ht∈Rpt×dt, a mean m0∈Rd0, and symmetric positive-semidefinite matrices, meaning vTPv≥0 for every real vector v of matching dimension, P0∈Rd0×d0, Qt∈Rdt×dt, and Rt∈Rpt×pt. A linear-Gaussian state-space model with independent noises is the general finite-horizon kernel model (General finite-horizon state-space models by kernels) with initial law μ0=Nd0(m0,P0) and transition and observation kernels Kt(x,⋅)=Ndt(Ftx,Qt),Gt(x,⋅)=Npt(Htx,Rt). All Gaussian laws use the convention of Multivariate normal law, including singular covariance, which allows singular covariance matrices.

Its independent-noise representation consists of random vectors x0,q1,r1,…,qT,rT on a common probability space, with x0∼Nd0(m0,P0), qt∼Ndt(0,Qt), rt∼Npt(0,Rt), all mutually independent in the sense of Independent random elements (their generated sigma-algebras are independent), and equations xt=Ftxt−1+qt,yt=Htxt+rt(1≤t≤T). The local path-law theorem proves that every allowed parameter tuple has such a finite representation, that its induced kernels are the displayed Kt,Gt, and that its path law is the general kernel-product law.

This definition imposes the stated noise law and independence assumptions; it does not establish their empirical adequacy. It supplies no filtering algorithm, posterior recursion, or convergence claim. Any separate formula that inverts an observed innovation covariance must assume that covariance is positive definite at the point of inversion.

Depends on

Used by

Dependency tree · two levels

27 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