VectorSpaceOpt.coneLE
DefinitionVectorSpaceOpt_coneLELet 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 .
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 VectorSpaceOptRead-back
What the Lean code literally says, in plain math · gpt-5
For every additive commutative group with a real vector-space structure, real convex cone in , and vectors , this defines to mean exactly that . 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.
Confirmed by the mission captain (proposal self-audit).