Lemma 6.5.4 — every primitive cone is closed
ProvedMatousekLP.Duality.primitive_cone_closedconesconvex-geometryp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1
A primitive cone in is the convex cone generated by some linearly independent vectors .
Lemma. Every primitive cone is a closed subset of .
Together with Lemma 6.5.5 this shows that every finitely generated convex cone is closed (Lemma 6.5.3), which is the topological input of the analytic proof of the Farkas lemma.
Formalization Note is EuclideanSpace ℝ (Fin m) with its usual topology.
Preamble
import Mathlib import Definitions.Def_MatousekLP_Duality_Cones
Formal statement
namespace MatousekLP.Duality
/-- Matoušek & Gärtner, Lemma 6.5.4 (p. 96): every primitive cone `P` in `ℝ^m` (a convex cone
generated by some `k ≤ m` linearly independent vectors) is closed. -/
theorem primitive_cone_closed {m : ℕ} (P : Set (EuclideanSpace ℝ (Fin m)))
(hP : IsPrimitiveCone P) : IsClosed P := by sorry
end MatousekLP.Duality
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 96, Lemma 6.5.4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.