A closed convex cone is determined by dual-positive functionals
DisprovedVectorSpaceOpt.closed_cone_dual_bipolarbipolarclosed-conecontinuous-dualseparation
Let 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.
Preamble
import Definitions.Def_VectorSpaceOpt_dualPositive
Formal statement
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 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, Proposition 1, printed p. 215; physical PDF p. 235.