(Bremner–Schewe 2011)
OpenHirschDim4.h11_4_bounddiscrete-geometryhirsch-conjecturelinear-optimizationpolytopes
Every -dimensional polytope with facets has combinatorial diameter at most . This is the upper-bound half of , proved by Bremner and Schewe (2011) by computer-assisted enumeration. Since , it confirms the Hirsch bound for .
Formalization Note. Bounded facet presentation hypotheses; conclusion DiamLE (Hpoly a b) 6.
Preamble
import Mathlib import Definitions.Def_Hirsch_model import Definitions.Def_SantosHirsch_Counter_Setting open scoped RealInnerProductSpace
Formal statement
namespace HirschDim4
theorem h11_4_bound (a : Fin 11 → EuclideanSpace ℝ (Fin 4)) (b : Fin 11 → ℝ)
(hfp : SantosHirsch.Counter.IsFacetPresentation a b)
(hbd : Bornology.IsBounded (Hirsch.Hpoly a b)) :
Hirsch.DiamLE (Hirsch.Hpoly a b) 6 := by sorry
end HirschDim4Source
D. Bremner & L. Schewe, Edge-graph diameter bounds for convex polytopes with few facets, Experimental Mathematics 20(3) (2011), 229-237, https://doi.org/10.1080/10586458.2011.564965 (Delta(4,11)=6); Kim & Santos survey arXiv:0907.1186, Theorem 2.2 (bullet 4). Upper-bound half.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.