Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 4, p. 14 — ‖(h − Kz)⁺‖ ≤ ρ_r(z)√(1 + R²) for z ∈ W_R(0), r ∈ (0, R]

Proved
RestartPD.LPSharp.lemma_4

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

kkt-systemlinear-programmingnormalized-duality-gapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A∈Rm×nA\in\mathbb R^{m\times n}A∈Rm×n, b∈Rmb\in\mathbb R^mb∈Rm, c∈Rnc\in\mathbb R^nc∈Rn, let L(x,y)=c⊤x+y⊤b−y⊤AxL(x,y)=c^\top x+y^\top b-y^\top AxL(x,y)=c⊤x+y⊤b−y⊤Ax be the Lagrangian (19) on Z={x≥0}×RmZ=\{x\ge0\}\times\mathbb R^mZ={x≥0}×Rm, equipped with the Euclidean norm, and let K,hK,hK,h be the KKT data (20). Suppose (19) has a saddle point. Then for all R∈(0,∞)R\in(0,\infty)R∈(0,∞), r∈(0,R]r\in(0,R]r∈(0,R] and z∈WR(0)z\in W_R(0)z∈WR​(0),

∥(h−Kz)+∥ ≤ ρr(z) 1+R2.\|(h-Kz)^+\|\ \le\ \rho_r(z)\,\sqrt{1+R^2}.∥(h−Kz)+∥ ≤ ρr​(z)1+R2​.

The KKT residual, a standard stopping criterion for LP, is thus bounded by the normalized duality gap; combined with Hoffman's bound this gives sharpness of LP (Lemma 5).

Formalization Note The inequality is stated in the extended reals, with 1+R2>0\sqrt{1+R^2}>01+R2​>0 coerced. The hypothesis that a solution exists is kept as on the page, although it is not needed for the inequality.

Preamble
import Mathlib
import Definitions.Def_RestartPD_LPSharp_PrimalDual
import Definitions.Def_RestartPD_LPSharp_LP
open scoped InnerProductSpace Matrix
Formal statement
namespace RestartPD.LPSharp

theorem lemma_4 {n m : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : EuclideanSpace ℝ (Fin m))
    (c : EuclideanSpace ℝ (Fin n)) (hsol : (Zstar (lpL A b c) lpX Set.univ).Nonempty)
    (R r : ℝ) (hR : 0 < R) (hr : 0 < r) (hrR : r ≤ R) (z : PDSpace n m)
    (hz : z ∈ Wball lpX Set.univ R 0) :
    ((kktRes A b c z : ℝ) : EReal) ≤
      rho (lpL A b c) lpX Set.univ r z * ((Real.sqrt (1 + R ^ 2) : ℝ) : EReal) := by sorry

end RestartPD.LPSharp
Source
Applegate, Hinder, Lu & Lubin, Faster First-Order Primal-Dual Methods for Linear Programming using Restarts and Sharpness, arXiv:2105.12715v4, p. 14, Lemma 4
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me