Polynomial diameter of common faces of dimension at least four
OpenHirsch.common_face_diameter_of_dim_ge_fourconvex-geometrygraph-diameterhirsch-conjecturepolytopes
A common face of dimension at least four has a polynomial combinatorial diameter in the number of inequalities and ambient dimension.
There exist constants such that the following holds. Let be a bounded -row H-polytope, and let be a nonempty common face whose common-direction space has dimension . Then
This is the remaining geometric content of high-carrier circuit-to-edge refinement: Klee already supplies a linear bound when . The present statement does not follow from Kalai--Kleitman or Larman, which are the wrong growth rate.
Formalization Note Walks are padded. Natural-number exponentiation is used.
Preamble
import Definitions.Def_Hirsch_common_face_geometry set_option autoImplicit false open scoped RealInnerProductSpace open Hirsch
Formal statement
namespace Hirsch
theorem common_face_diameter_of_dim_ge_four :
∃ C k : ℕ, ∀ (d n : ℕ)
(a : Fin n → EuclideanSpace ℝ (Fin d)) (b : Fin n → ℝ)
(u x : EuclideanSpace ℝ (Fin d)),
Bornology.IsBounded (Hpoly a b) →
4 ≤ HirschCommonFace.commonFaceDim a b u x →
(HirschCommonFace.commonFace a b u x).Nonempty →
DiamLE (HirschCommonFace.commonFace a b u x) (C * (n + d) ^ k) := by sorry
end Hirsch
Source
Remaining geometric core of Hirsch.polynomial_edge_refinement_of_circuit_walks_of_high_carrier after Klee handles common faces of dimension at most three. No literature-priority claim; Kalai--Kleitman and Larman are the wrong growth.