Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

H(11,4)≤6H(11,4)\le 6H(11,4)≤6 (Bremner–Schewe 2011)

Open
HirschDim4.h11_4_bound

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

discrete-geometryhirsch-conjecturelinear-optimizationpolytopes

Every 444-dimensional polytope with 111111 facets has combinatorial diameter at most 666. This is the upper-bound half of H(11,4)=6H(11,4)=6H(11,4)=6, proved by Bremner and Schewe (2011) by computer-assisted enumeration. Since 6<11−4=76<11-4=76<11−4=7, it confirms the Hirsch bound for (n,d)=(11,4)(n,d)=(11,4)(n,d)=(11,4).

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 HirschDim4
Source
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
  • 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