Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, display (7), p. 364 — the optimal MSE equals the kriging MSE plus a positive definite form in Σ_M(x₀,·)

Proved
StochKriging.OptimalMSE.display_7

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

krigingmean-squared-errorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1positive-definite

Fix the number kkk of design points. There is a rule Ξ\XiΞ that assigns to every pair (A,B)(A,B)(A,B) of positive definite k×kk\times kk×k matrices a positive definite matrix Ξ(A,B)\Xi(A,B)Ξ(A,B), such that the following holds in every second-order stochastic kriging model.

Let Yj(x)=β0+M(x)+εj(x)\mathcal Y_j(\mathbf x)=\beta_0+\mathsf M(\mathbf x)+\varepsilon_j(\mathbf x)Yj​(x)=β0​+M(x)+εj​(x) with square-integrable, mean-zero field M\mathsf MM and noise ε\varepsilonε, field and noise uncorrelated, and noise correlation across design points allowed (CRN). Let (xi,ni)i=1k(\mathbf x_i,n_i)_{i=1}^k(xi​,ni​)i=1k​ be a design with every ni≥1n_i\ge1ni​≥1, let Yˉ\bar{\mathcal Y}Yˉ​ be the vector of sample means, and assume the covariance matrices ΣM\Sigma_{\mathsf M}ΣM​ and Σε\Sigma_\varepsilonΣε​ of §2 are both positive definite. Then for every prediction point x0\mathbf x_0x0​ the optimal MSE over the linear predictors (5),

MSE⋆=inf⁡(λ0,λ)∈R×RkE[(λ0+λ⊤Yˉ−β0−M(x0))2],\mathrm{MSE}^\star=\inf_{(\lambda_0,\lambda)\in\mathbb R\times\mathbb R^k}\mathrm E\big[(\lambda_0+\lambda^\top\bar{\mathcal Y}-\beta_0-\mathsf M(\mathbf x_0))^2\big],MSE⋆=(λ0​,λ)∈R×Rkinf​E[(λ0​+λ⊤Yˉ​−β0​−M(x0​))2],

satisfies

MSE⋆=ΣM(x0,x0)−ΣM(x0,⋅)⊤[ΣM+Σε]−1ΣM(x0,⋅)=[ΣM(x0,x0)−ΣM(x0,⋅)⊤ΣM−1ΣM(x0,⋅)]+ΣM(x0,⋅)⊤ Ξ(ΣM,Σε) ΣM(x0,⋅),\begin{aligned}\mathrm{MSE}^\star&=\Sigma_{\mathsf M}(\mathbf x_0,\mathbf x_0)-\Sigma_{\mathsf M}(\mathbf x_0,\cdot)^\top[\Sigma_{\mathsf M}+\Sigma_\varepsilon]^{-1}\Sigma_{\mathsf M}(\mathbf x_0,\cdot)\\&=\Big[\Sigma_{\mathsf M}(\mathbf x_0,\mathbf x_0)-\Sigma_{\mathsf M}(\mathbf x_0,\cdot)^\top\Sigma_{\mathsf M}^{-1}\Sigma_{\mathsf M}(\mathbf x_0,\cdot)\Big]+\Sigma_{\mathsf M}(\mathbf x_0,\cdot)^\top\,\Xi(\Sigma_{\mathsf M},\Sigma_\varepsilon)\,\Sigma_{\mathsf M}(\mathbf x_0,\cdot),\end{aligned}MSE⋆​=ΣM​(x0​,x0​)−ΣM​(x0​,⋅)⊤[ΣM​+Σε​]−1ΣM​(x0​,⋅)=[ΣM​(x0​,x0​)−ΣM​(x0​,⋅)⊤ΣM−1​ΣM​(x0​,⋅)]+ΣM​(x0​,⋅)⊤Ξ(ΣM​,Σε​)ΣM​(x0​,⋅),​

and, whenever ΣM(x0,⋅)≠0\Sigma_{\mathsf M}(\mathbf x_0,\cdot)\neq0ΣM​(x0​,⋅)=0, MSE⋆\mathrm{MSE}^\starMSE⋆ is strictly larger than the bracketed term.

The bracketed term is the usual kriging MSE, the error of predicting Y(x0)\mathsf Y(\mathbf x_0)Y(x0​) from noise-free observations of the field. The result says that intrinsic simulation noise inflates the optimal MSE by a positive definite quadratic form in ΣM(x0,⋅)\Sigma_{\mathsf M}(\mathbf x_0,\cdot)ΣM​(x0​,⋅), whose matrix depends only on ΣM\Sigma_{\mathsf M}ΣM​ and Σε\Sigma_\varepsilonΣε​, not on x0\mathbf x_0x0​ or on the model beyond these matrices.

Formalization Note "Ξ\XiΞ is a positive definite matrix that depends on Σε\Sigma_\varepsilonΣε​ and ΣM\Sigma_{\mathsf M}ΣM​" is rendered as a function of the two matrices, chosen before the model and the point x0\mathbf x_0x0​; it is not fixed by the statement. The optimal MSE is the infimum over all (λ0,λ)∈R×Rk(\lambda_0,\lambda)\in\mathbb R\times\mathbb R^k(λ0​,λ)∈R×Rk. The hypotheses ΣM≻0\Sigma_{\mathsf M}\succ0ΣM​≻0 and Σε≻0\Sigma_\varepsilon\succ0Σε​≻0 are not written on the page: the first makes ΣM−1\Sigma_{\mathsf M}^{-1}ΣM−1​ genuine (Lean's inverse of a singular matrix is 000), the second is necessary for Ξ\XiΞ to be positive definite (with Σε=0\Sigma_\varepsilon=0Σε​=0 the two lines coincide). The uncorrelatedness of field and noise and the finite second moments are added as in the model. The settings form an arbitrary type, design points are indexed by Fin k, and the statement is uniform over all probability spaces and setting types (in fixed universes).

Preamble
import Mathlib
import Definitions.Def_StochKriging_OptimalMSE_Model

open MeasureTheory ProbabilityTheory Matrix
Formal statement
namespace StochKriging.OptimalMSE

universe u v

/-- Display (7), p. 364. For `k` design points there is a rule `Ξ` assigning to every pair of
positive definite `k × k` matrices `(ΣM, Σε)` a positive definite matrix `Ξ(ΣM, Σε)` such that, in
every model (3) whose covariance matrices `ΣM` and `Σε` are positive definite, and at every
prediction point `x₀`, the optimal MSE over the linear predictors (5) is
`ΣM(x₀,x₀) − ΣM(x₀,·)ᵀ[ΣM + Σε]⁻¹ΣM(x₀,·)`, equals the kriging MSE
`ΣM(x₀,x₀) − ΣM(x₀,·)ᵀΣM⁻¹ΣM(x₀,·)` plus `ΣM(x₀,·)ᵀ Ξ(ΣM, Σε) ΣM(x₀,·)`, and exceeds the kriging
MSE whenever `ΣM(x₀,·) ≠ 0`. -/
theorem display_7 (k : ℕ) :
    ∃ Ξ : Matrix (Fin k) (Fin k) ℝ → Matrix (Fin k) (Fin k) ℝ → Matrix (Fin k) (Fin k) ℝ,
      (∀ A B : Matrix (Fin k) (Fin k) ℝ, A.PosDef → B.PosDef → (Ξ A B).PosDef) ∧
      ∀ (Ω : Type u) (X : Type v) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
        (β₀ : ℝ) (M : X → Ω → ℝ) (ε : ℕ → X → Ω → ℝ) (x : Fin k → X) (n : Fin k → ℕ),
        IsModel P M ε → (∀ i, 1 ≤ n i) →
        (SigmaM P M x).PosDef → (SigmaEps P ε x n).PosDef →
        ∀ x₀ : X,
          optimalMSE P β₀ M ε x n x₀ =
              SigmaMFun P M x₀ x₀ - SigmaMCross P M x x₀ ⬝ᵥ
                ((SigmaM P M x + SigmaEps P ε x n)⁻¹ *ᵥ SigmaMCross P M x x₀) ∧
          optimalMSE P β₀ M ε x n x₀ =
              (SigmaMFun P M x₀ x₀ - SigmaMCross P M x x₀ ⬝ᵥ
                ((SigmaM P M x)⁻¹ *ᵥ SigmaMCross P M x x₀)) +
              SigmaMCross P M x x₀ ⬝ᵥ
                (Ξ (SigmaM P M x) (SigmaEps P ε x n) *ᵥ SigmaMCross P M x x₀) ∧
          (SigmaMCross P M x x₀ ≠ 0 →
            SigmaMFun P M x₀ x₀ - SigmaMCross P M x x₀ ⬝ᵥ
                ((SigmaM P M x)⁻¹ *ᵥ SigmaMCross P M x x₀) <
              optimalMSE P β₀ M ε x n x₀) := by sorry

end StochKriging.OptimalMSE
Source
Ankenman, Nelson, Staum, Stochastic Kriging for Simulation Metamodeling, Proc. 2008 Winter Simulation Conference, p. 364, §2, display (7) and the sentence following it
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me