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.

Finite-dimensional data assimilation, forecasts, analyses, filtering, and smoothing

Definition

Fix a finite horizon T≥0, state dimensions dt≥1, observation dimensions pt≥1 for 1≤t≤T, and forecast maps Ψt−1:Rdt−1→Rdt and observation maps Gt:Rdt→Rpt that are measurable for the Borel sigma-algebras: inverse images of Borel sets are Borel (A measurable function between measurable spaces, The Borel sigma-algebra of a topological space). A deterministic model trajectory satisfies xt=Ψt−1(xt−1); an additive-error model instead has Xt=Ψt−1(Xt−1)+qt. Observations have the form Yt=Gt(Xt)+rt. A forecast at time t is information about Xt formed from the model and observations through time t−1, before using Yt; an analysis at time t is information after using Yt. In the state-space terminology of Filtering, predictive, and smoothing laws in a finite-horizon state-space model, a filtering law is the conditional law of Xt given Y1:t and a predictive law is the conditional law of Xt given Y1:t−1. A fixed-interval smoothing law conditions a state, or the full state path, on observations through the terminal time, as in Fixed-interval smoothing law in a linear-Gaussian model. Under that page's standard-Borel hypotheses, the filtering, predictive, and full-path smoothing conditional kernels exist by Filtering and finite-horizon smoothing laws exist; conditional versions may differ on null observation histories.

For a symmetric positive-definite matrix M, write ∥v∥M−12:=vTM−1v. In a finite-dimensional Gaussian 3DVAR update, the forecast mean is mf, its fixed background covariance is B≻0, the linear observation map is H, the datum is y, and the observation-error covariance is Γ≻0. The objective is J3D(u)=12∥u−mf∥B−12+12∥y−Hu∥Γ−12. It returns one analysis point; the fixed background covariance is not an analysis posterior covariance.

Depends on

Used by

Dependency tree · two levels

22 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