Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8, p. 17 — under Property 3, ‖z̄ᵗ − z⁰‖ = 0 forces z̄ᵗ ∈ Z⋆

Proved
RestartPD.Fixed.prop_8

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

normalized-duality-gapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1restarts

Assume the standing assumptions of (1) and let the base algorithm satisfy Property 3 with constants q,Cq, Cq,C. Let z0∈Zz^0 \in Zz0∈Z, let {zˉt}\{\bar z^t\}{zˉt} be an output sequence of the algorithm started at z0z^0z0, and let t≥1t \ge 1t≥1. If

∥zˉt−z0∥=0,thenzˉt∈Z⋆.\|\bar z^t - z^0\| = 0, \quad\text{then}\quad \bar z^t \in Z^\star.∥zˉt−z0∥=0,thenzˉt∈Z⋆.

This removes the degenerate case r=0r = 0r=0, where sharpness (defined only for r>0r > 0r>0) says nothing, from the proofs of Theorems 1 and 2.

Formalization Note The page concludes "zˉn,t=zn,0∈Z⋆\bar z^{n,t} = z^{n,0} \in Z^\starzˉn,t=zn,0∈Z⋆". With a semi-norm, ∥zˉt−z0∥=0\|\bar z^t - z^0\| = 0∥zˉt−z0∥=0 does not give zˉt=z0\bar z^t = z^0zˉt=z0; what the proof establishes and what Theorem 1 uses is zˉt∈Z⋆\bar z^t \in Z^\starzˉt∈Z⋆, which is what is stated.

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

/-- Proposition 8, p. 17: under Property 3, if `‖z̄ᵗ − z⁰‖ = 0` for an output `z̄ᵗ` (`t ≥ 1`) of a
run from `z⁰ ∈ Z`, then `z̄ᵗ ∈ Z⋆`. (The page also writes `z̄ᵗ = z⁰`, which a semi-norm does not
give; only the membership is stated.) -/
theorem prop_8 {n m : ℕ} (L : Primal n → Dual m → ℝ) (X : Set (Primal n)) (Y : Set (Dual m))
    (hP : IsPDProblem L X Y) (p : Seminorm ℝ (E n m))
    (Runs : E n m → Set (ℕ → E n m)) (q C : ℝ) (h3 : Property3 L X Y p Runs q C)
    (z0 : E n m) (hz0 : z0 ∈ X ×ˢ Y) (zb : ℕ → E n m) (hzb : zb ∈ Runs z0)
    (t : ℕ) (ht : 1 ≤ t) (hzero : p (zb t - z0) = 0) :
    zb t ∈ Zstar L X Y := 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. 17, Proposition 8
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