Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.5.4 — every primitive cone is closed

Proved
MatousekLP.Duality.primitive_cone_closed

by mikedeng1 · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

conesconvex-geometryp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1

A primitive cone in Rm\mathbb{R}^mRm is the convex cone {t1v1+⋯+tkvk:t1,…,tk≥0}\{t_1v_1+\dots+t_kv_k : t_1,\dots,t_k\ge 0\}{t1​v1​+⋯+tk​vk​:t1​,…,tk​≥0} generated by some k≤mk\le mk≤m linearly independent vectors v1,…,vk∈Rmv_1,\dots,v_k\in\mathbb{R}^mv1​,…,vk​∈Rm.

Lemma. Every primitive cone P⊆RmP\subseteq\mathbb{R}^mP⊆Rm is a closed subset of Rm\mathbb{R}^mRm.

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 Rm\mathbb{R}^mRm 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
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me