Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

The 3DVAR quadratic has the Gaussian MAP and Kalman analysis update

Statement

Let d,p≥1, mf∈Rd, y∈Rp, H∈Rp×d, and symmetric positive-definite B∈Rd×d and Γ∈Rp×p. Put S=HBHT+Γ, K=BHTS−1, and J(u)=12(u−mf)TB−1(u−mf)+12(y−Hu)TΓ−1(y−Hu). The 3DVAR analysis ma=mf+K(y−Hmf) from Finite-dimensional 3DVAR analysis is the unique global minimizer of J. If mf,B are the mean and covariance of a Gaussian forecast and the observation model is Y=HX+r with independent r∼Np(0,Γ), then ma is the unique maximum-a-posteriori point of the posterior density. It is also the mean update of the exact one-step Kalman filter with identity state transition, zero process covariance, and datum y.

Facts & Assumptions

Given: AC and the finite-dimensional objects and positive-definite hypotheses in the Statement.

[A1]

AC is assumed for the multivariate-normal laws and exact conditional-law results. The Axiom of Choice

[F1]

Finite-dimensional 3DVAR analysis defines J, S, K, and returns ma=mf+K(y−Hmf).

[F4]

A positive-definite multivariate normal law has Lebesgue density proportional to exp⁡[−12(x−m)TΣ−1(x−m)]. A positive-definite multivariate normal law has its Gaussian density

[F5]

For a dominated observation kernel with positive finite marginal density, Bayes' formula gives the posterior density proportional to prior density times likelihood. Bayes formula for dominated kernels

[F6]

The one-step Kalman procedure uses the innovation S=HBHT+Γ and updates the mean by mf+K(y−Hmf). Exact linear-Gaussian Kalman filter

[F7]

Under AC and an admissible linear-Gaussian model, that recursion is an exact conditional Gaussian law. The finite-horizon linear-Gaussian Kalman filter is exact

Proof

Given: AC, B≻0, Γ≻0, the matrix H, and the vectors mf,y.

1.1F1F3givenconstructalgebra

For z≠0, zTSz=(HTz)TB(HTz)+zTΓz>0, so S≻0 and K is defined. The inverses B−1 and Γ−1 are positive definite: for nonzero v, vTB−1v=(B−1v)TB(B−1v)>0, and the same argument applies to Γ. By [F3], choose Cholesky factors B−1=LBLBT and Γ−1=LΓLΓT. Define Tu=(LBTu,LΓTHu) and b=(LBTmf,LΓTy). Then 2J(u)=∥Tu−b∥2. The first block LBT is invertible, hence ker⁡T={0}.

2.1F1F2step 1.1algebra

The normal equation in [F2] is B−1(u−mf)+HTΓ−1(Hu−y)=0. Let δ=y−Hmf and u=mf+BHTS−1δ=ma. Then B−1(u−mf)=HTS−1δ, while y−Hu=(I−HBHTS−1)δ=ΓS−1δ. Substitution gives the normal equation. By [F2] this u minimizes J, and because ker⁡T={0} it is the unique minimizer.

3.1A1F4F5givenstep 2.1algebra

Under the Gaussian prior and independent Gaussian observation-error model, [F4] gives a prior density proportional to exp⁡[−12(u−mf)TB−1(u−mf)] and a jointly continuous likelihood density proportional to exp⁡[−12(y−Hu)TΓ−1(y−Hu)]. The likelihood is strictly positive and bounded above by its finite Gaussian normalizing constant; hence its prior integral is finite and positive. Bayes' formula [F5] makes the posterior density proportional to e−J(u); its unique maximum is therefore the unique minimizer from step 2.1.

4.1A1F6F7step 1.1givenstep 2.1∎

Apply [F6] to the one-step model with forecast covariance B, identity transition, zero process covariance, and observation covariance Γ. Its innovation covariance is S≻0 by step 1.1, so the output mean is mf+K(y−Hmf)=ma. By [F7] this is the mean of the exact conditional Gaussian law.

Depends on

Used by

Cited to discharge well-definedness by Finite-dimensional 3DVAR analysis.

Dependency tree · two levels

61 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