Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

VectorSpaceOpt.restrictedConvexConjugate

Definition
VectorSpaceOpt_restrictedConvexConjugate

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

convex-analysisdefinitionfenchel-conjugatefunctional-analysis

Let XXX be a real normed space, C⊆XC\subseteq XC⊆X, f:X→Rf:X\to\mathbb Rf:X→R, and ℓ∈X∗\ell\in X^*ℓ∈X∗ a continuous linear functional. The restricted convex conjugate is the real supremum

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

The definition itself uses sSup; theorem statements separately require CCC to be nonempty and the displayed set to be bounded above whenever the value is used as a finite conjugate. This separation matches Luenberger's domain C∗C^*C∗ and prevents the default behavior of an unbounded real supremum from becoming an implicit mathematical assertion. The definition is reusable for closed-epigraph and duality statements on independent convex domains.

Definition code
import Mathlib

namespace VectorSpaceOpt

/-- The convex conjugate of a finite-valued function restricted to a set. -/
noncomputable def restrictedConvexConjugate
    {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    (C : Set X) (f : X → ℝ) (ℓ : X →L[ℝ] ℝ) : ℝ :=
  sSup ((fun x : X ↦ ℓ x - f x) '' C)

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, definition of C* and f*, printed pp. 195–196; physical PDF pp. 215–216.
Read-back

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

For every real normed vector space XXX, set C⊆XC⊆XC⊆X, real-valued function fff on XXX, and continuous real-linear functional ℓℓℓ on XXX, this defines the restricted convex conjugate to be the real supremum sup⁡{ℓ(x)−f(x):x∈C}\sup\{ℓ(x)-f(x):x∈C\}sup{ℓ(x)−f(x):x∈C}. This uses the total real-valued sSupsSupsSup, not an extended-real supremum: when the displayed image is nonempty and bounded above it is the usual supremum, while if CCC is empty or the image is unbounded above Mathlib's totalized real sSupsSupsSup has value 000. No nonemptiness or boundedness hypothesis is built into the definition, and fff remains finite-valued.

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