A nonzero dual vector is strictly positive on the interior of the cone
ProvedConvexOptimization.dualCone_inner_pos_of_mem_interiorMembership in the dual cone only guarantees a nonstrict inequality against points of . On the interior of the inequality is automatically strict, provided the dual vector is nonzero: if with and , then
The reason is that an interior point can be moved a little against and stay inside . Suppose . Since is interior, some ball is contained in , so with the point still lies in ; its distance to is . But then
contradicting .
Both hypotheses are needed. For the pairing vanishes. And on the boundary of a nonzero element of may well pair to zero — that is exactly what a hyperplane supporting at that point does.
This is the strict form underlying the recorded property that is pointed whenever has nonempty interior. In conic duality it is the step that rules out a degenerate multiplier: a Slater point lies in , so pairing it against a nonzero dual vector cannot vanish.
import Mathlib import Definitions.Def_dualCone open scoped RealInnerProductSpace ENNReal open MeasureTheory
theorem ConvexOptimization.dualCone_inner_pos_of_mem_interior {d : ℕ}
(K : Set (EuclideanSpace ℝ (Fin d))) (z w : EuclideanSpace ℝ (Fin d))
(hz : z ∈ dualCone K) (hzne : z ≠ 0) (hw : w ∈ interior K) :
0 < ⟪w, z⟫ := by sorry