Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5 — exact SDP performance estimation

Proved
TaylorHG.PEP.theorem_5

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

first-order-methodsinterpolationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1performance-estimationsemidefinite-programmingsmooth-strongly-convex

Fix 0≤μ<L<∞0\leq\mu<L<\infty0≤μ<L<∞, a fixed-step method HHH taking NNN steps, a radius R≥0R\geq0R≥0, and a criterion with coefficients b∈RN+1b\in\mathbb R^{N+1}b∈RN+1 and symmetric C∈SN+2C\in\mathbb S^{N+2}C∈SN+2. In every dimension d≥N+2d\geq N+2d≥N+2, the worst performance over functions in Fμ,L(Rd)\mathcal F_{\mu,L}(\mathbb R^d)Fμ,L​(Rd) equals the optimal value of the semidefinite program:

wμ,L(d)(R,H,N,Pb,C)=wμ,Lsdp(R,H,N,b,C).w^{(d)}_{\mu,L}(R,H,N,P_{b,C})=w^{\mathrm{sdp}}_{\mu,L}(R,H,N,b,C).wμ,L(d)​(R,H,N,Pb,C​)=wμ,Lsdp​(R,H,N,b,C).

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 L=∞L=\inftyL=∞, but its AijA_{ij}Aij​ coefficients are undefined there; Remark 4 restricts the subsequent SDP analysis to finite LLL. 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.

Preamble
import Mathlib
import Definitions.Def_TaylorHG_PEP_SDP
Formal statement
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
Source
Taylor, Hendrickx & Glineur, arXiv:1502.05666v6, p. 14, Theorem 5 and (sdp-PEP)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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