Closedness of polyhedra
ProvedLinearOptimization.polyhedron_closedconvexitylinear-programmingpolyhedra
(Theorem 4.9) Every polyhedron is closed.
(A set is called closed if it has the following property: if is a sequence of elements of that converges to some , then . Book proof: for and with , taking the limit gives .)
Preamble
import Mathlib.Topology.MetricSpace.Basic
import Definitions.Def_Polyhedron
/-- **Bertsimas & Tsitsiklis, Theorem 4.9 (p. 169).** Every polyhedron `{x | Ax ≥ b}` is a
closed subset of `ℝⁿ`. -/
Formal statement
theorem LinearOptimization.polyhedron_closed {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ)
(b : Fin m → ℝ) :
IsClosed (polyhedron A b) := by
sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 4.9, p. 169