Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6, p. 11 — the primal-dual gap at z is zero iff ρ_r(z) = 0

Proved
RestartPD.Fixed.prop_6

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

normalized-duality-gapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1primal-dual-gap

Let XXX, YYY be convex, let LLL be convex in xxx on XXX and concave in yyy on YYY, and let ∥⋅∥\|\cdot\|∥⋅∥ be any semi-norm. For every z∈Zz \in Zz∈Z and every r∈[0,∞)r \in [0, \infty)r∈[0,∞),

sup⁡z^∈Z{L(x,y^)−L(x^,y)}=0  ⟺  ρr(z)=0.\sup_{\hat z \in Z} \{L(x, \hat y) - L(\hat x, y)\} = 0 \iff \rho_r(z) = 0.z^∈Zsup​{L(x,y^​)−L(x^,y)}=0⟺ρr​(z)=0.

Since a point has zero primal-dual gap exactly when it solves (1), the normalized duality gap at any radius detects solutions.

Formalization Note Both sides are extended reals. Only the convexity hypotheses of (1) are assumed; z∈Zz \in Zz∈Z is assumed, as on the page, where ρr\rho_rρr​ is evaluated at feasible points.

Preamble
import Mathlib
import Definitions.Def_RestartPD_Fixed_Problem
Formal statement
namespace RestartPD.Fixed

/-- Proposition 6, p. 11: for `z ∈ Z` and `r ∈ [0, ∞)`, the primal-dual gap (3) at `z` is zero
if and only if `ρ_r(z) = 0`. -/
theorem prop_6 {n m : ℕ} (L : Primal n → Dual m → ℝ) (X : Set (Primal n)) (Y : Set (Dual m))
    (hX : Convex ℝ X) (hY : Convex ℝ Y)
    (hLx : ∀ y ∈ Y, ConvexOn ℝ X (fun x => L x y))
    (hLy : ∀ x ∈ X, ConcaveOn ℝ Y (fun y => L x y))
    (p : Seminorm ℝ (E n m)) (z : E n m) (hz : z ∈ X ×ˢ Y) (r : ℝ) (hr : 0 ≤ r) :
    pdGap L X Y z = 0 ↔ rho L X Y p r z = 0 := by sorry

end RestartPD.Fixed
Source
Applegate, Hinder, Lu & Lubin, Faster First-Order Primal-Dual Methods for Linear Programming using Restarts and Sharpness, arXiv:2105.12715v4, p. 11, Proposition 6
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me