Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fenchel duality with attained dual functional

Proved
VectorSpaceOpt.fenchel_duality

by wenxinzhang · Aug 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-analysisdualityfenchel-dualityfunctional-analysis

Let fff be convex on nonempty CCC and ggg concave on nonempty DDD in a real normed space. Assume the intrinsic interiors of CCC and DDD meet, and that either the restricted epigraph of fff or restricted hypograph of ggg has nonempty ordinary interior. If the finite number μ\muμ is the infimum of f−gf-gf−g on C∩DC\cap DC∩D, then some ℓ0∈C∗∩D∗\ell_0\in C^*\cap D^*ℓ0​∈C∗∩D∗ satisfies

μ=gD∗(ℓ0)−fC∗(ℓ0)=max⁡ℓ∈C∗∩D∗(gD∗(ℓ)−fC∗(ℓ)).\mu=g_D^*(\ell_0)-f_C^*(\ell_0)=\max_{\ell\in C^*\cap D^*}\bigl(g_D^*(\ell)-f_C^*(\ell)\bigr).μ=gD∗​(ℓ0​)−fC∗​(ℓ0​)=ℓ∈C∗∩D∗max​(gD∗​(ℓ)−fC∗​(ℓ)).

If x0x_0x0​ attains the primal infimum, it also attains both conjugate extrema at ℓ0\ell_0ℓ0​. This is the mission goal and retains both qualification conditions and dual attainment.

Preamble
import Definitions.Def_VectorSpaceOpt_restrictedConvexConjugate
import Definitions.Def_VectorSpaceOpt_restrictedConcaveConjugate

open Set
Formal statement
namespace VectorSpaceOpt

/-- Luenberger, Chapter 7, §7.12, Theorem 1 (Fenchel Duality). -/
theorem fenchel_duality
    {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    (C D : Set X) (f g : X → ℝ) (μ : ℝ)
    (hC : C.Nonempty) (hD : D.Nonempty)
    (hf : ConvexOn ℝ C f) (hg : ConcaveOn ℝ D g)
    (hri : (intrinsicInterior ℝ C ∩ intrinsicInterior ℝ D).Nonempty)
    (hsolid :
      (interior {p : X × ℝ | p.1 ∈ C ∧ f p.1 ≤ p.2}).Nonempty ∨
      (interior {p : X × ℝ | p.1 ∈ D ∧ p.2 ≤ g p.1}).Nonempty)
    (hμ : IsGLB ((fun x : X ↦ f x - g x) '' (C ∩ D)) μ) :
    ∃ ℓ₀ : X →L[ℝ] ℝ,
      BddAbove ((fun x : X ↦ ℓ₀ x - f x) '' C) ∧
      BddBelow ((fun x : X ↦ ℓ₀ x - g x) '' D) ∧
      μ = restrictedConcaveConjugate D g ℓ₀ -
        restrictedConvexConjugate C f ℓ₀ ∧
      (∀ ℓ : X →L[ℝ] ℝ,
        BddAbove ((fun x : X ↦ ℓ x - f x) '' C) →
        BddBelow ((fun x : X ↦ ℓ x - g x) '' D) →
        restrictedConcaveConjugate D g ℓ -
          restrictedConvexConjugate C f ℓ ≤ μ) ∧
      (∀ x₀ ∈ C ∩ D, f x₀ - g x₀ = μ →
        restrictedConvexConjugate C f ℓ₀ = ℓ₀ x₀ - f x₀ ∧
        restrictedConcaveConjugate D g ℓ₀ = ℓ₀ x₀ - g x₀) := 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.12, Theorem 1 (Fenchel Duality), printed pp. 201–202; physical PDF pp. 221–222.

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