Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7 proof — feasibility, complementarity and Lagrangian optimality at primal limits

Proved
BregmanPPA.IneqMult.primal_limit

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

complementary-slacknessmultiplier-methodp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume an inequality multiplier run has multipliers converging to an optimal multiplier p∗p^*p∗, every gig_igi​ is continuous on CCC, and the Bregman zone contains the closed nonnegative orthant. If x∗x^*x∗ is a subsequential limit of the primal iterates, then x∗∈Cx^*\in Cx∗∈C, every gi(x∗)≤0g_i(x^*)\le0gi​(x∗)≤0, complementary slackness holds, and x∗x^*x∗ minimizes the Lagrangian over CCC:

⟨p∗,g(x∗)⟩=0,f(x∗)+⟨p∗,g(x∗)⟩≤f(y)+⟨p∗,g(y)⟩(y∈C).\langle p^*,g(x^*)\rangle=0,\qquad f(x^*)+\langle p^*,g(x^*)\rangle\le f(y)+\langle p^*,g(y)\rangle\quad(y\in C).⟨p∗,g(x∗)⟩=0,f(x∗)+⟨p∗,g(x∗)⟩≤f(y)+⟨p∗,g(y)⟩(y∈C).

These are the limiting conditions from which the primal-solution clause of Theorem 7 follows.

Formalization Note A limit point means the limit of a strictly increasing subsequence. Constraint values are finite on CCC, so their real vector representation is valid there.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_IneqMult_Run

open Filter Topology
Formal statement
namespace BregmanPPA.IneqMult

/-- The limit point claim in the proof of Theorem 7, pp. 218–219. -/
theorem primal_limit {n m : ℕ} (C : Set (E n)) (f : E n → EReal)
    (g : Fin m → E n → EReal) (S : Set (E m)) (h : E m → ℝ)
    (c : ℕ → ℝ) (x : ℕ → E n) (p : ℕ → E m) (pstar : E m)
    (hP : IsConvexProgram C f g)
    (hd : ∃ q : E m, dualFn C f g q ≠ ⊥)
    (hh : BregmanPPA.Convergence.IsBregmanFunction S h)
    (hS : posOrthant m ⊆ S)
    (him : posOrthant m ⊆ gradient h '' S)
    (hc : ∀ k, 0 < c k)
    (hcinf : ∃ ε : ℝ, 0 < ε ∧ ∀ k, ε ≤ c k)
    (hrun : IsIneqMultiplierRun C f g S h c x p)
    (hcont : ∀ i, ContinuousOn (g i) C)
    (hSbar : nonnegOrthant m ⊆ S)
    (hoptimal : IsOptimalMultiplier C f g pstar)
    (hp : Tendsto p atTop (𝓝 pstar)) :
    ∀ (φ : ℕ → ℕ) (xstar : E n), StrictMono φ →
      Tendsto (x ∘ φ) atTop (𝓝 xstar) →
      xstar ∈ C ∧ (∀ i, g i xstar ≤ 0) ∧
      inner ℝ pstar (gvec g xstar) = 0 ∧
      (∀ y ∈ C,
        f xstar + ((inner ℝ pstar (gvec g xstar) : ℝ) : EReal) ≤
        f y + ((inner ℝ pstar (gvec g y) : ℝ) : EReal)) := by sorry

end BregmanPPA.IneqMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), pp. 218–219, proof of Theorem 7, https://doi.org/10.1287/moor.18.1.202
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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