A closed convex cone is determined by dual-positive functionals
DisprovedVectorSpaceOpt.closed_cone_dual_bipolarLet be a closed convex cone in a real normed space , and let . Suppose every continuous linear functional that is nonnegative on is also nonnegative at :
Then . Closedness is explicit here even though it is not assumed by the mission's strong-duality goal. This is Luenberger's cone separation proposition and supplies the exact recovery principle needed to infer vector feasibility from all scalar multiplier inequalities. It is reusable as a continuous-dual bipolar characterization of closed convex cones.
import Definitions.Def_VectorSpaceOpt_dualPositive
namespace VectorSpaceOpt
/-- Luenberger, Chapter 8, §8.2, Proposition 1. -/
theorem closed_cone_dual_bipolar
{Z : Type*} [NormedAddCommGroup Z] [NormedSpace ℝ Z]
(P : ConvexCone ℝ Z) (z : Z)
(hP : IsClosed (P : Set Z))
(hz : ∀ zstar : Z →L[ℝ] ℝ, dualPositive P zstar → 0 ≤ zstar z) :
z ∈ P := by sorry
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 vector , if the carrier set of is closed and every continuous real-linear functional that is nonnegative on every also satisfies , then . The quantification is over all continuous real-linear functionals; no completeness, finite-dimensionality, strict positivity, or normalization assumption is present.
Confirmed by the mission captain (proposal self-audit).