Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A2 — closed monotone conjugate and attained infimum

Proved
BregmanPPA.IneqMult.lemmaA2

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

convex-conjugatemonotone-conjugatep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let FFF be a closed proper convex function, finite and subdifferentiable at a point of the strictly positive orthant. Its monotone conjugate F∗+F^{*+}F∗+ is closed, proper, and convex. At every point zzz of its effective domain, the representation as an infimum over w≥zw\ge zw≥z is attained:

∀z∈dom⁡F∗+,∃w≥z:F∗+(z)=F∗(w).\forall z\in\operatorname{dom}F^{*+},\quad\exists w\ge z:\quad F^{*+}(z)=F^*(w).∀z∈domF∗+,∃w≥z:F∗+(z)=F∗(w).

The result guarantees a genuine minimizing conjugate argument rather than only an infimum value.

Formalization Note Both conjugates are extended-real functions, and closedness is lower semicontinuity. The effective domain excludes +∞+\infty+∞; properness excludes −∞-\infty−∞.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_IneqMult_Program

open Filter Topology InertialFB.IFB
Formal statement
namespace BregmanPPA.IneqMult

/-- Lemma A2, p. 223: closedness, convexity, properness and attainment of the
restricted conjugate's infimum representation. -/
theorem lemmaA2 {m : ℕ} (F : E m → EReal)
    (hproper : IsProperFn F) (hconvex : IsConvexFn F)
    (hclosed : LowerSemicontinuous F)
    (hu : ∃ u : E m, u ∈ posOrthant m ∧ F u ≠ ⊤ ∧
      ∃ v : E m, IsSubgradient F u v) :
    LowerSemicontinuous (monoConjE F) ∧
    IsProperFn (monoConjE F) ∧
    IsConvexFn (monoConjE F) ∧
    (∀ z : E m, monoConjE F z ≠ ⊤ →
      ∃ w : E m, (∀ i, z i ≤ w i) ∧ monoConjE F z = conjE F w) := 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), p. 223, Lemma A2, 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