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.
A strong-constraint 4DVAR objective can have two local minima
Example
Take a one-step strong-constraint window with scalar model map , scalar observation map , prior mean , prior covariance , datum , and observation covariance . The objective in Strong- and weak-constraint 4DVAR with a finite gradient run has two distinct local minima.
Facts & Assumptions
Given: The scalar strong-constraint 4DVAR data in the Example.
Strong-constraint 4DVAR minimizes the prior penalty plus observation-misfit penalties along the model trajectory. Strong- and weak-constraint 4DVAR with a finite gradient run
Verification
Given: The objects and parameters in the Example.
Since , the one-variable objective from [F1] is
Differentiating gives . Its only stationary points are and . The derivative changes from negative to positive at each of , so both are strict local minima. The objective is even, , and as . Every global minimum is therefore attained at a stationary point, and these two distinct points are both global minimizers. Thus the minimizer is not unique, so an iterative routine's finite definition gives no guarantee that it returns a designated unique solution.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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 3 §3.3 (standard reference, not scraped)
- Geir Evensen, Femke C. Vossepoel, and Peter Jan van Leeuwen, Data Assimilation Fundamentals, Chapters 3–4 (standard reference, not scraped)