Theorem 5 — exact SDP performance estimation
ProvedTaylorHG.PEP.theorem_5Fix , a fixed-step method taking steps, a radius , and a criterion with coefficients and symmetric . In every dimension , the worst performance over functions in equals the optimal value of the semidefinite program:
The result makes the finite SDP an exact value computation for this class of methods and criteria.
Formalization Note Both values are extended-real suprema. The function-level criterion is translated around an explicit minimizer. The paper's display allows , but its coefficients are undefined there; Remark 4 restricts the subsequent SDP analysis to finite . A nonnegative radius is implicit in a norm bound and is required for the squared-radius SDP constraint.
Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.
import Mathlib import Definitions.Def_TaylorHG_PEP_SDP
namespace TaylorHG.PEP
theorem theorem_5 {N : ℕ} (μ L : NNReal) (hμL : μ < L)
(R : ℝ) (hR : 0 ≤ R) (H : Matrix (Fin N) (Fin N) ℝ)
(b : Fin (N + 1) → ℝ)
(C : Matrix (Fin (N + 2)) (Fin (N + 2)) ℝ) (hC : C.IsSymm)
(d : ℕ) (hd : N + 2 ≤ d) :
worstCase d μ L R H b C = sdpValue μ L R H b C := by sorry
end TaylorHG.PEP
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.