Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Closed restricted convex functions equal their biconjugates

Proved
VectorSpaceOpt.fenchel_biconjugate_on

by wenxinzhang · Aug 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

biconjugateclosed-epigraphconvex-analysishahn-banach

Let CCC be nonempty, let fff be convex on CCC, and suppose the restricted epigraph {(x,r):x∈C, f(x)≤r}\{(x,r):x\in C,\ f(x)\le r\}{(x,r):x∈C, f(x)≤r} is closed in X×RX\times\mathbb RX×R. Then, at every x∈Cx\in Cx∈C,

f(x)=sup⁡ℓ∈C∗(ℓ(x)−fC∗(ℓ)).f(x)=\sup_{\ell\in C^*}\bigl(\ell(x)-f_C^*(\ell)\bigr).f(x)=ℓ∈C∗sup​(ℓ(x)−fC∗​(ℓ)).

The supremum ranges only over continuous linear functionals whose restricted conjugate is finite. This is the pointwise-on-CCC content of Luenberger's equality between a closed epigraph and its biconjugate epigraph; it avoids assigning an arbitrary real value outside CCC. The theorem is a reusable representation of a closed convex function by continuous affine minorants and a central separation milestone for the mission.

Preamble
import Definitions.Def_VectorSpaceOpt_restrictedConvexConjugate
Formal statement
namespace VectorSpaceOpt

/-- Luenberger, Chapter 7, §7.10, Proposition 2, restricted to points of `C`. -/
theorem fenchel_biconjugate_on
    {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    (C : Set X) (f : X → ℝ)
    (hC : C.Nonempty) (hf : ConvexOn ℝ C f)
    (hclosed : IsClosed {p : X × ℝ | p.1 ∈ C ∧ f p.1 ≤ p.2}) :
    ∀ x ∈ C,
      f x = sSup
        ((fun ℓ : X →L[ℝ] ℝ ↦
          ℓ x - restrictedConvexConjugate C f ℓ) ''
          {ℓ : X →L[ℝ] ℝ |
            BddAbove ((fun y : X ↦ ℓ y - f y) '' C)}) := by sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods, Wiley, 1969, public scan https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf, Chapter 7, §7.10, Proposition 2, printed pp. 198–199; physical PDF pp. 218–219. The Lean item states its pointwise consequence on C.
Read-back

What the Lean code literally says, in plain math · gpt-5

For every real normed vector space XXX, nonempty set C⊆XC⊆XC⊆X, and function f:X→Rf : X → ℝf:X→R, assume fff is convex on CCC and the restricted epigraph {(y,r)∈X×R:y∈C and f(y)≤r}\{(y,r)∈X×ℝ:y∈C\text{ and }f(y)≤r\}{(y,r)∈X×R:y∈C and f(y)≤r} is closed. Then for every x∈Cx∈Cx∈C, f(x)f(x)f(x) equals the real supremum, over all continuous real-linear functionals ℓℓℓ for which {ℓ(y)−f(y):y∈C}\{ℓ(y)-f(y):y∈C\}{ℓ(y)−f(y):y∈C} is bounded above, of ℓ(x)−sup⁡{ℓ(y)−f(y):y∈C}ℓ(x)-\sup\{ℓ(y)-f(y):y∈C\}ℓ(x)−sup{ℓ(y)−f(y):y∈C}. Each inner supremum is the usual finite real supremum because CCC is nonempty and the indexing condition supplies boundedness. The outer operation is nevertheless the total real sSupsSupsSup: the statement gives no separate nonemptiness or bounded-above hypothesis for its set of displayed values, so an empty or unbounded outer value set would receive the totalized value 000, rather than an extended-real infinity. The equality is asserted only for x∈Cx∈Cx∈C.

Human review
  • Endorsed by Shuze Chen · Aug 25, 2026

  • Endorsed by wenxinzhang · Aug 25, 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