Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Klee–Walkup polytope Q4Q_4Q4​ is Hirsch-sharp (999 facets, distance ≥5\ge 5≥5)

Open
HirschDim4.klee_walkup_Q4

by LG · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-geometryhirsch-conjecturelinear-optimizationpolytopes

There is a 444-dimensional polytope Q4Q_4Q4​ with 999 facets and two vertices at graph distance at least 555. Since 5=9−45=9-45=9−4, it meets the Hirsch bound with equality: it is Hirsch-sharp. This is the lower-bound half of H(9,4)=5H(9,4)=5H(9,4)=5 (Klee–Walkup 1967). Q4Q_4Q4​ is the smallest non-trivial Hirsch-sharp polytope (more facets than twice its dimension) and the starting block of every known Hirsch-sharp polytope with n>2dn>2dn>2d. Kim and Santos give small explicit integer coordinates for the dual Q4∗Q_4^*Q4∗​ (nine vectors a,b,c,d,e,f,g,h,wa,b,c,d,e,f,g,h,wa,b,c,d,e,f,g,h,w); the two tetrahedra abcdabcdabcd and efghefghefgh are at dual-graph distance 555.

Formalization Note. The conclusion ∀ k<5, ¬ Reach (Hpoly a b) k u v says the distance is at least 555; the matching upper bound H(9,4)≤5H(9,4)\le 5H(9,4)≤5 is separate. Simplicity of Q4Q_4Q4​ is not required here.

Preamble
import Mathlib
import Definitions.Def_Hirsch_model
import Definitions.Def_Hirsch_walk
import Definitions.Def_SantosHirsch_Counter_Setting

open scoped RealInnerProductSpace
Formal statement
namespace HirschDim4

theorem klee_walkup_Q4 :
    ∃ (a : Fin 9 → EuclideanSpace ℝ (Fin 4)) (b : Fin 9 → ℝ)
      (u v : EuclideanSpace ℝ (Fin 4)),
      Bornology.IsBounded (Hirsch.Hpoly a b) ∧
      SantosHirsch.Counter.IsFacetPresentation a b ∧
      u ∈ Set.extremePoints ℝ (Hirsch.Hpoly a b) ∧
      v ∈ Set.extremePoints ℝ (Hirsch.Hpoly a b) ∧
      ∀ k < 5, ¬ Hirsch.Reach (Hirsch.Hpoly a b) k u v := by sorry

end HirschDim4
Source
Kim & Santos, An update on the Hirsch conjecture, arXiv:0907.1186, Theorem 3.8 and Section 3.3 (explicit coordinates), attributing to V. Klee & D. W. Walkup, The d-step conjecture for polyhedra of dimension d<6, Acta Math. 117 (1967), 53-78, https://doi.org/10.1007/BF02395040. Lower-bound (sharpness) half of H(9,4)=5.
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me