Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6 — when pk→p∗p^k \to p^*pk→p∗, Axk→bAx^k \to bAxk→b and every limit point of {xk}\{x^k\}{xk} solves (7)

Proved
BregmanPPA.EqMult.theorem6_limit_points

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

lagrangian-dualitymethod-of-multipliersp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume the setting of Theorem 6: problem (7) with XXX closed convex, f:Rn→(−∞,+∞]f : \mathbb R^n \to (-\infty,+\infty]f:Rn→(−∞,+∞] convex and lower semicontinuous, inf⁡Xf<∞\inf_X f < \inftyinfX​f<∞, the dual functional ddd not identically −∞-\infty−∞; hhh a Bregman function with zone Rm\mathbb R^mRm and im⁡∇h=Rm\operatorname{im}\nabla h = \mathbb R^mim∇h=Rm; scalars ck>0c_k > 0ck​>0 with inf⁡kck>0\inf_k c_k > 0infk​ck​>0; and {(xk,pk)}\{(x^k,p^k)\}{(xk,pk)} conforming to recursion (9). Suppose that pk→p∗p^k \to p^*pk→p∗, where p∗p^*p∗ is an optimal multiplier (a maximizer of ddd), and let x∞x^\inftyx∞ be a limit point of {xk}\{x^k\}{xk}, i.e. the limit of some subsequence {xk(j)}\{x^{k(j)}\}{xk(j)}. Then

  1. Axk→bAx^k \to bAxk→b;
  2. Ax∞=bAx^\infty = bAx∞=b;
  3. −ATp∗∈∂fX(x∞)-A^{\mathsf T}p^* \in \partial f_X(x^\infty)−ATp∗∈∂fX​(x∞), where fX=f+δXf_X = f + \delta_XfX​=f+δX​;
  4. x∞x^\inftyx∞ solves (7): x∞∈Xx^\infty \in Xx∞∈X, Ax∞=bAx^\infty = bAx∞=b, and f(x∞)≤f(y)f(x^\infty) \le f(y)f(x∞)≤f(y) for every y∈Xy \in Xy∈X with Ay=bAy = bAy=b.

This is the primal half of Theorem 6: once the multipliers converge to a Lagrange multiplier, the primal iterates are asymptotically feasible and all their limit points are optimal, even though {xk}\{x^k\}{xk} itself need not converge.

Formalization Note A limit point is a subsequential limit: a strictly increasing φ:N→N\varphi : \mathbb N \to \mathbb Nφ:N→N with xφ(j)→x∞x^{\varphi(j)} \to x^\inftyxφ(j)→x∞. ATA^{\mathsf T}AT is the adjoint of the linear map AAA. The subdifferential is that of the EReal function f+δXf + \delta_Xf+δX​. The hypotheses are the standing assumptions of Theorem 6 together with the convergent case pk→p∗p^k \to p^*pk→p∗ considered in its proof.

Preamble
import Mathlib
import Definitions.Def_InertialFB_IFB_ConvexAnalysis
import Definitions.Def_fenchelConjugate
import Definitions.Def_BregmanPPA_Convergence_Model
import Definitions.Def_BregmanPPA_EqMult_EqConstrainedProgram

open InertialFB.IFB ConvexOptimization Filter Topology
Formal statement
namespace BregmanPPA.EqMult
theorem theorem6_limit_points {n m : ℕ}
    (A : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin m))
    (b : EuclideanSpace ℝ (Fin m)) (X : Set (EuclideanSpace ℝ (Fin n)))
    (f : EuclideanSpace ℝ (Fin n) → EReal)
    (hP : IsEqProgram X f) (hd : ∃ p, dualEq A b X f p ≠ ⊥)
    (h : EuclideanSpace ℝ (Fin m) → ℝ) (hh : BregmanPPA.Convergence.IsBregmanFunction Set.univ h)
    (him : Function.Surjective (gradient h))
    (c : ℕ → ℝ) (hc : ∀ k, 0 < c k) (hcinf : ∃ ε > 0, ∀ k, ε ≤ c k)
    (x : ℕ → EuclideanSpace ℝ (Fin n)) (p : ℕ → EuclideanSpace ℝ (Fin m))
    (hrun : IsEqMultRun A b X f h c x p)
    (pstar : EuclideanSpace ℝ (Fin m)) (hpstar : IsOptimalMultiplier A b X f pstar)
    (hp : Tendsto p atTop (𝓝 pstar))
    (φ : ℕ → ℕ) (hφ : StrictMono φ) (x' : EuclideanSpace ℝ (Fin n))
    (hx' : Tendsto (x ∘ φ) atTop (𝓝 x')) :
    Tendsto (fun k => A (x k)) atTop (𝓝 b) ∧ A x' = b ∧
    -(ContinuousLinearMap.adjoint A pstar) ∈ BregmanPPA.Convergence.subdiffOp (fX X f) x' ∧
    IsSolution7 A b X f x' := by sorry
end BregmanPPA.EqMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), p. 214, proof of Theorem 6 (from "Now consider the convergent case" to "So, x^∞ solves (7).")
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