Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convexity is equivalent to convexity of the restricted epigraph

Proved
VectorSpaceOpt.convexOn_iff_convex_restrictedEpigraph

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

convex-analysisconvex-functionepigraphgeometry

Let XXX be a real vector space, let C⊆XC\subseteq XC⊆X, and let f:X→Rf:X\to\mathbb Rf:X→R. Then fff is convex on CCC if and only if its restricted epigraph is convex:

ConvexOn⁡(f,C)⟺Convex⁡{(x,r):x∈C, f(x)≤r}.\operatorname{ConvexOn}(f,C)\quad\Longleftrightarrow\quad \operatorname{Convex}\{(x,r):x\in C,\ f(x)\le r\}.ConvexOn(f,C)⟺Convex{(x,r):x∈C, f(x)≤r}.

Here ConvexOn includes convexity of CCC, and the pair order is (x,r)(x,r)(x,r) rather than the scalar-first order printed in the book. This theorem makes the geometric object used by separation arguments explicit and reusable. It is the exact epigraph criterion that connects the elementary convexity section to conjugate and biconjugate constructions. Closedness can later be imposed on this same geometric set.

Preamble
import Mathlib
Formal statement
namespace VectorSpaceOpt

/-- Luenberger, Chapter 7, §7.8, Proposition 2. -/
theorem convexOn_iff_convex_restrictedEpigraph
    {X : Type*} [AddCommGroup X] [Module ℝ X]
    (C : Set X) (f : X → ℝ) :
    ConvexOn ℝ C f ↔
      Convex ℝ {p : X × ℝ | p.1 ∈ C ∧ f p.1 ≤ p.2} := 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.8, Proposition 2, printed p. 192; physical PDF p. 212.
Read-back

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

For every additive commutative group XXX equipped with a real vector-space structure, every set C⊆XC⊆XC⊆X, and every function f:X→Rf : X → ℝf:X→R, fff is convex on CCC if and only if the subset {(x,r)∈X×R:x∈C and f(x)≤r}\{(x,r)∈X×ℝ:x∈C\text{ and }f(x)≤r\}{(x,r)∈X×R:x∈C and f(x)≤r} is convex over RℝR. There is no norm, topology, nonemptiness, or separate closedness hypothesis; CCC may be empty, and values of fff outside CCC do not enter the displayed set.

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