A short simple proof of closedness of convex cones and Farkas' lemma
Wouter Kager

TL;DR
This paper presents a concise and straightforward proof demonstrating the closedness of finitely generated convex cones, simplifying the geometric proof of Farkas' lemma and deriving it from this result.
Contribution
It introduces a simple proof of the closedness of finitely generated convex cones and derives Farkas' lemma from this, streamlining existing geometric proofs.
Findings
Short proof of convex cone closedness
Simplified derivation of Farkas' lemma
Clarification of geometric proof techniques
Abstract
Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using well-known arguments.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Advanced Topology and Set Theory
