Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convexity of the perturbation value

Proved
VectorSpaceOpt.perturbationValue_convex

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

cone-convexityconvex-analysisepigraphperturbation

Let fff be convex on Ω\OmegaΩ and let GGG be cone-convex there with respect to PPP. For the extended-real perturbation value ω\omegaω, the finite-height epigraph

{(z,r)∈Z×R:ω(z)≤r}\{(z,r)\in Z\times\mathbb R:\omega(z)\le r\}{(z,r)∈Z×R:ω(z)≤r}

is convex. This epigraph formulation expresses convexity without performing ambiguous arithmetic between +∞+\infty+∞ and −∞-\infty−∞ and includes infeasible and unbounded perturbations. It is the source-faithful extended-value version of Luenberger's assertion that ω\omegaω is convex. The milestone makes the geometry of right-hand-side perturbations available to later supporting-functional and multiplier arguments and can be reused for general conic value functions. No finite-value hypothesis is hidden in the statement.

Preamble
import Definitions.Def_VectorSpaceOpt_coneConvexOn
import Definitions.Def_VectorSpaceOpt_perturbationValue
Formal statement
namespace VectorSpaceOpt

/-- Luenberger, Chapter 8, §8.3, Proposition 1, expressed by convexity of the
finite-height epigraph of the extended-real perturbation value. -/
theorem perturbationValue_convex
    {X Z : Type*}
    [AddCommGroup X] [Module ℝ X]
    [NormedAddCommGroup Z] [NormedSpace ℝ Z]
    (P : ConvexCone ℝ Z) (Ω : Set X) (f : X → ℝ) (G : X → Z)
    (hf : ConvexOn ℝ Ω f) (hG : ConeConvexOn P Ω G) :
    Convex ℝ {p : Z × ℝ |
      perturbationValue P Ω f G p.1 ≤ (p.2 : EReal)} := 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 8, §8.3, Proposition 1, printed p. 216; physical PDF p. 236. Lean expresses the proposition by convexity of the finite-height epigraph of the EReal-valued ω.
Read-back

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

For a real vector space XXX, a real normed vector space ZZZ, a real convex cone PPP in ZZZ, a set Ω⊆XΩ⊆XΩ⊆X, and functions f:X→Rf : X → ℝf:X→R and G:X→ZG : X → ZG:X→Z, assume fff is convex on ΩΩΩ and assume ΩΩΩ is convex with (aG(x0)+bG(x1))−G(ax0+bx1)∈P(aG(x₀)+bG(x₁))-G(ax₀+bx₁)∈P(aG(x0​)+bG(x1​))−G(ax0​+bx1​)∈P for all x0,x1∈Ωx₀,x₁∈Ωx0​,x1​∈Ω and all a,b≥0a,b≥0a,b≥0 with a+b=1a+b=1a+b=1. Define v(z)v(z)v(z) as the EReal\mathrm{EReal}EReal infimum of f(x)f(x)f(x) over x∈Ωx∈Ωx∈Ω satisfying z−G(x)∈Pz-G(x)∈Pz−G(x)∈P. Then the finite-height epigraph {(z,r)∈Z×R:v(z)≤r}\{(z,r)∈Z×ℝ:v(z)≤r\}{(z,r)∈Z×R:v(z)≤r}, where rrr is embedded into EReal\mathrm{EReal}EReal, is a convex subset of Z×RZ×ℝZ×R. If v(z)=+∞v(z)=+∞v(z)=+∞ no finite rrr contributes a pair above zzz, while if v(z)=−∞v(z)=-∞v(z)=−∞ every real rrr does; if ΩΩΩ is empty then vvv is identically +∞+∞+∞ and the displayed epigraph is empty. No nonemptiness or closedness hypothesis is present.

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

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