Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

(22), proof of Lemma 4, p. 14 — ρ_r(z) ≥ ‖v‖ with v = ((−c + A⊤y)⁺, b − Ax)

Proved
RestartPD.LPSharp.eq_22

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

linear-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 and consider the LP Lagrangian 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 on Z={x≥0}×RmZ=\{x\ge0\}\times\mathbb R^mZ={x≥0}×Rm, with the Euclidean norm on Rn+m\mathbb R^{n+m}Rn+m. For z=(x,y)∈Zz=(x,y)\in Zz=(x,y)∈Z set

v=((−c+A⊤y)+, b−Ax).v=\big((-c+A^\top y)^+,\ b-Ax\big).v=((−c+A⊤y)+, b−Ax).

Then for every r>0r>0r>0 the normalized duality gap satisfies

ρr(z) ≥ ∥v∥.\rho_r(z)\ \ge\ \|v\|.ρr​(z) ≥ ∥v∥.

This is the half of Lemma 4 that controls primal infeasibility ∥b−Ax∥\|b-Ax\|∥b−Ax∥ and dual infeasibility ∥(A⊤y−c)+∥\|(A^\top y-c)^+\|∥(A⊤y−c)+∥ by the normalized duality gap, uniformly in the radius rrr.

Formalization Note The page's assumption that (19) has a solution and the radius RRR are not needed here and are omitted. When v=0v=0v=0 the claim reads ρr(z)≥0\rho_r(z)\ge0ρr​(z)≥0.

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 eq_22 {n m : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : EuclideanSpace ℝ (Fin m))
    (c : EuclideanSpace ℝ (Fin n)) (z : PDSpace n m) (hz : z ∈ (lpX : Set (EuclideanSpace ℝ (Fin n))) ×ˢ Set.univ)
    (r : ℝ) (hr : 0 < r) :
    ((eucl n m (vvec A b c z) : ℝ) : EReal) ≤ rho (lpL A b c) lpX Set.univ r z := 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, (22) in the proof of 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