Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

VectorSpaceOpt.ConeConvexOn

Definition
VectorSpaceOpt_coneConvexOn

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

cone-convexityconvex-analysisdefinitionvector-valued-function

Let Ω\OmegaΩ be a subset of a real vector space XXX, let PPP be a convex cone in ZZZ, and let G:X→ZG:X\to ZG:X→Z. The predicate ConeConvexOn P Ω G requires Ω\OmegaΩ to be convex and, for all x0,x1∈Ωx_0,x_1\in\Omegax0​,x1​∈Ω and nonnegative a,ba,ba,b with a+b=1a+b=1a+b=1, requires

G(ax0+bx1)≤PaG(x0)+bG(x1).G(ax_0+bx_1)\le_P aG(x_0)+bG(x_1).G(ax0​+bx1​)≤P​aG(x0​)+bG(x1​).

This is Luenberger's vector-valued convexity with respect to the cone order, not componentwise convexity in a chosen basis. The definition packages exactly the condition needed to make feasible sets under convex combinations and the perturbation value convex, and it remains reusable for conic programs in non-lattice spaces.

Definition code
import Definitions.Def_VectorSpaceOpt_coneLE

namespace VectorSpaceOpt

/-- Convexity of a vector-valued map with respect to a cone order. -/
def ConeConvexOn
    {X Z : Type*}
    [AddCommGroup X] [Module ℝ X]
    [AddCommGroup Z] [Module ℝ Z]
    (P : ConvexCone ℝ Z) (Ω : Set X) (G : X → Z) : Prop :=
  Convex ℝ Ω ∧
    ∀ ⦃x₀⦄, x₀ ∈ Ω → ∀ ⦃x₁⦄, x₁ ∈ Ω →
      ∀ ⦃a b : ℝ⦄, 0 ≤ a → 0 ≤ b → a + b = 1 →
      coneLE P (G (a • x₀ + b • x₁)) (a • G x₀ + b • G x₁)

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.2, definition of convexity for a map with respect to P, printed p. 215; physical PDF p. 235.
Read-back

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

For additive commutative groups XXX and ZZZ equipped with real vector-space structures, a real convex cone PPP in ZZZ, a set Ω⊆XΩ⊆XΩ⊆X, and a map G:X→ZG : X → ZG:X→Z, this defines GGG to be cone-convex on ΩΩΩ when ΩΩΩ is convex and, for every x0,x1∈Ωx₀,x₁∈Ωx0​,x1​∈Ω and all real a,b≥0a,b≥0a,b≥0 with a+b=1a+b=1a+b=1, the vector (aG(x0)+bG(x1))−G(ax0+bx1)(aG(x₀)+bG(x₁))-G(ax₀+bx₁)(aG(x0​)+bG(x1​))−G(ax0​+bx1​) belongs to PPP. Equivalently, the definition applies the custom cone relation u≤Pvu≤_P vu≤P​v exactly when v−u∈Pv-u∈Pv−u∈P to compare G(ax0+bx1)G(ax₀+bx₁)G(ax0​+bx1​) with aG(x0)+bG(x1)aG(x₀)+bG(x₁)aG(x0​)+bG(x1​). There is no topology or norm requirement; if ΩΩΩ is empty, its convexity and the quantified comparison are both vacuous.

Human review
  • Endorsed by Shuze Chen · Aug 25, 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