: the bounded -step case (Klee 1966)
OpenHirschDim4.h8_4_bounddiscrete-geometryhirsch-conjecturelinear-optimizationpolytopes
Every -dimensional polytope with facets has combinatorial diameter at most . This is the upper-bound half of , the bounded -step case, proved by Klee (1966). Together with the Klee–Walkup reduction it anchors the verified range in dimension ; the matching lower bound is the -cube.
Formalization Note. The hypotheses are a bounded facet presentation (IsFacetPresentation + IsBounded); the conclusion is Hirsch.DiamLE (Hpoly a b) 4.
Preamble
import Mathlib import Definitions.Def_Hirsch_model import Definitions.Def_SantosHirsch_Counter_Setting open scoped RealInnerProductSpace
Formal statement
namespace HirschDim4
theorem h8_4_bound (a : Fin 8 → EuclideanSpace ℝ (Fin 4)) (b : Fin 8 → ℝ)
(hfp : SantosHirsch.Counter.IsFacetPresentation a b)
(hbd : Bornology.IsBounded (Hirsch.Hpoly a b)) :
Hirsch.DiamLE (Hirsch.Hpoly a b) 4 := by sorry
end HirschDim4Source
Kim & Santos, An update on the Hirsch conjecture, arXiv:0907.1186, Theorem 2.2 (bullet 1), attributing H(8,4)=4 to V. Klee, Paths on polyhedra II, Pacific J. Math. 17 (1966), 249-262, https://doi.org/10.2140/pjm.1966.17.249. Upper-bound half.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.