Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-23 (gpt-6.1-sol)
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.

Finite coefficient observation and innovation interface

Definition

Fix a nonnegative integer horizon T∈Z≥0. For each integer k with 0≤k≤T, let Vk be a finite-dimensional real vector space with an ordered basis Φk=(ϕk,1,…,ϕk,mk), where mk≥1. An ordered basis is a linearly independent spanning list. A coefficient vector ak=(ak,1,…,ak,mk)T∈Rmk represents the trial field uk=∑j=1mkak,jϕk,j∈Vk. This is a finite-dimensional representation; it does not assert that a fluid field in an untruncated model belongs to Vk.

For each 1≤k≤T, choose a real linear observation map Lk:Vk→Rpk, with pk≥1, and a real matrix Fk∈Rmk×mk−1 for the coefficient transition. The observation matrix Hk∈Rpk×mk is defined by [Hk]ij=[Lk(ϕk,j)]i; hence Lk(uk)=Hkak. A symmetric matrix C is positive semidefinite, written C⪰0, when vTCv≥0 for every vector v of matching dimension, and is positive definite, written C≻0, when this inequality is strict for every nonzero v.

For stochastic assimilation, assume the Axiom of Choice (AC), meaning every family of nonempty sets has a choice function, for the Gaussian-law construction. Choose an instance of the finite linear-Gaussian state-space model with independent noises: a0∼Nm0(μ0,P0), qk∼Nmk(0,Qk), and rk∼Npk(0,Rk) are mutually independent, with P0,Qk,Rk⪰0, and ak=Fkak−1+qk,yk=Hkak+rk. Here Nd(μ,C) denotes the d-dimensional Gaussian law with mean μ and symmetric positive-semidefinite covariance C, including singular C. For a Kalman-filter run, write mk−1a and Pk−1a for its previous analysis mean and covariance, and define its forecast mean and covariance, innovation, and innovation covariance by mkf=Fkmk−1a,Pkf=FkPk−1aFkT+Qk,dk=yk−Hkmkf,Sk=HkPkfHkT+Rk. The admissible filter inputs are those for which each innovation covariance to be solved is positive definite. The gain is the solution Kk=PkfHkTSk−1, computed by the supplied Cholesky solves, and the analysis outputs are mka=mkf+Kkdk and Pka=Pkf−KkSkKkT. The formula describes the exact target of the supplied recursion; it is not an instruction to form a matrix inverse numerically.

For a one-step perturbed-observation ensemble Kalman update, choose dimensions m,p≥1, a linear observation matrix H∈Rp×m, a datum y∈Rp, an integer ensemble size N≥2, and a positive-definite observation covariance Γ∈Rp×p. Given forecast coefficients a^1,…,a^N∈Rm, take perturbations ηi∼Np(0,Γ) independent across members and independent of the forecast ensemble. Define aˉ=N−1∑ia^i and the divisor-N covariance CN=N−1∑i(a^i−aˉ)(a^i−aˉ)T. The gain and perturbed-data update are KN=CNHT(HCNHT+Γ)−1 and aa,i=a^i+KN(y+ηi−Ha^i). Since CN⪰0, HCNHT+Γ≻0. This is the specified finite-ensemble procedure; the definition alone gives no finite-ensemble posterior-exactness claim.

In a single-window finite inverse view, a real matrix G∈Rp×m maps coefficients a∈Rm to predicted observations Ga. A datum has the form y=Ga+e, where e∈Rp is its realized error and a symmetric positive-definite matrix R∈Rp×p is the declared error covariance and weighting matrix. This deterministic inverse interface does not assume a probability distribution for the realized vector e.

Choosing a finite trial space, a linearization, or process-noise covariances is part of adopting the finite model. These choices do not show that a nonlinear fluid equation or an actual sensor is described exactly by that model.

Depends on

Dependency tree · 2 levels

Sources