VectorSpaceOpt.dualPositive
DefinitionVectorSpaceOpt_dualPositiveLet be a real normed space, a convex cone, and a continuous linear functional. The functional is dual-positive when
This is membership in the positive dual cone described by Luenberger, but the predicate avoids imposing a separate cone structure on the continuous dual. It applies to cones that are not closed or pointed and therefore matches the hypotheses of the main Lagrange-duality theorem. The definition is the common multiplier-feasibility interface for cone separation, saddle-point sufficiency, sensitivity bounds, weak duality, and dual attainment.
import Mathlib
namespace VectorSpaceOpt
/-- A continuous linear functional that is nonnegative on a convex cone. -/
def dualPositive
{Z : Type*} [NormedAddCommGroup Z] [NormedSpace ℝ Z]
(P : ConvexCone ℝ Z) (zstar : Z →L[ℝ] ℝ) : Prop :=
∀ p ∈ P, 0 ≤ zstar p
end VectorSpaceOptRead-back
What the Lean code literally says, in plain math · gpt-5
For every real normed vector space , real convex cone in , and continuous real-linear functional on , this defines to be dual-positive on when for every vector . It imposes only pointwise nonnegativity on the entire cone; no strict positivity or normalization is required.
Confirmed by the mission captain (proposal self-audit).