Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

VectorSpaceOpt.coneLE

Definition
VectorSpaceOpt_coneLE

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

cone-orderconvex-conedefinitionordered-vector-space

Let ZZZ be a real vector space and let P⊆ZP\subseteq ZP⊆Z be a convex cone. The cone-induced relation is defined by

z1≤Pz2⟺z2−z1∈P.z_1\le_P z_2\quad\Longleftrightarrow\quad z_2-z_1\in P.z1​≤P​z2​⟺z2​−z1​∈P.

Thus the primal constraint G(x)≤PzG(x)\le_P zG(x)≤P​z is represented by membership of z−G(x)z-G(x)z−G(x) in PPP, and G(x)≤P0G(x)\le_P0G(x)≤P​0 by −G(x)∈P-G(x)\in P−G(x)∈P. No antisymmetry or closedness is built into the relation; those properties would require additional assumptions on PPP not present in the main theorem. This definition fixes the sign convention used by cone convexity, feasibility, perturbation monotonicity, saddle points, and the strong-duality goal. Subsequent statements therefore need no ambient order typeclass on ZZZ.

Definition code
import Mathlib

namespace VectorSpaceOpt

/-- The preorder induced by a convex cone: `z₁ ≤_P z₂` means `z₂ - z₁ ∈ P`. -/
def coneLE
    {Z : Type*} [AddCommGroup Z] [Module ℝ Z]
    (P : ConvexCone ℝ Z) (z₁ z₂ : Z) : Prop :=
  z₂ - z₁ ∈ P

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, cone ordering definition, printed p. 214; physical PDF p. 234.
Read-back

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

For every additive commutative group ZZZ with a real vector-space structure, real convex cone PPP in ZZZ, and vectors z1,z2∈Zz₁,z₂∈Zz1​,z2​∈Z, this defines z1≤Pz2z₁≤_P z₂z1​≤P​z2​ to mean exactly that z2−z1∈Pz₂-z₁∈Pz2​−z1​∈P. The declaration is a proposition-valued relation on all pairs of vectors and adds no topology, norm, closedness, pointedness, or other hypothesis beyond the supplied convex-cone structure.

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