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 , state dimensions , observation dimensions for , and forecast maps and observation maps 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 ; an additive-error model instead has . Observations have the form . A forecast at time is information about formed from the model and observations through time , before using ; an analysis at time is information after using . 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 given and a predictive law is the conditional law of given . 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 , write . In a finite-dimensional Gaussian 3DVAR update, the forecast mean is , its fixed background covariance is , the linear observation map is , the datum is , and the observation-error covariance is . The objective is It returns one analysis point; the fixed background covariance is not an analysis posterior covariance.
Depends on
Used by
- Finite-dimensional 3DVAR analysis Algorithm
- Perturbed-observation ensemble Kalman filter Algorithm
- Strong- and weak-constraint 4DVAR with a finite gradient run Algorithm
- A strong-constraint 4DVAR objective can have two local minima Example
- Scalar Gaussian 3DVAR returns the exact analysis mean Example
- 3DVAR tracking error under a global contraction and bounded observation error Theorem
- The 3DVAR quadratic has the Gaussian MAP and Kalman analysis update Theorem
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
- K. J. H. Law, A. M. Stuart, and K. C. Zygalakis, Data Assimilation: A Mathematical Introduction, Chapter 2 §§2.1–2.7 (standard reference, not scraped)
- Geir Evensen, Femke C. Vossepoel, and Peter Jan van Leeuwen, Data Assimilation Fundamentals, Chapters 2–6 (standard reference, not scraped)