Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A1 — no nonnegative recession direction of the conjugate

Proved
BregmanPPA.IneqMult.lemmaA1

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

convex-conjugatep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1recession-direction

Let FFF be a closed proper convex extended-valued function that is finite and subdifferentiable at some point of the strictly positive orthant. Then its ordinary conjugate F∗F^*F∗ has no nonzero recession direction in the nonnegative orthant:

y≥0,y≠0⟹y is not a recession direction of F∗.y\ge0,\quad y\ne0\quad\Longrightarrow\quad y\text{ is not a recession direction of }F^*.y≥0,y=0⟹y is not a recession direction of F∗.

This exclusion supplies the attainment condition used in Lemma A2.

Formalization Note A recession direction is defined exactly by the paper's limit inferior criterion at every point of the effective domain. Closedness is lower semicontinuity of FFF.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_IneqMult_Program

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

/-- Lemma A1, p. 223: no nonzero nonnegative recession direction of the conjugate. -/
theorem lemmaA1 {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) :
    ∀ y : E m, y ∈ nonnegOrthant m → y ≠ 0 →
      ¬ IsRecessionDirection (conjE F) y := 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 A1, 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