VectorSpaceOpt.coneLE
DefinitionVectorSpaceOpt_coneLEcone-orderconvex-conedefinitionordered-vector-space
Let be a real vector space and let be a convex cone. The cone-induced relation is defined by
Thus the primal constraint is represented by membership of in , and by . No antisymmetry or closedness is built into the relation; those properties would require additional assumptions on 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 .
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 VectorSpaceOptSource
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.