Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Strong ddd-step theorem for spindles

Proved
Hirsch.strong_dstep_spindle

by jjosh · Sep 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

d-stephirsch-conjecturepolytopesspindle

(Santos, strong ddd-step theorem for spindles.) Let P⊆RdP\subseteq\mathbb R^dP⊆Rd be a nonempty bounded H-polytope described by nnn inequalities, with 0<d≤n0<d\le n0<d≤n. Suppose u,vu,vu,v are extreme points of PPP such that every describing inequality is tight at exactly one of uuu or vvv (a spindle with apices u,vu,vu,v), and there is no padded vertex-edge walk of length ddd from uuu to vvv (the spindle has length at least d+1d+1d+1).

Then there exist a dimension D=n−dD=n-dD=n−d and a nonempty bounded H-polytope P′⊆RDP'\subseteq\mathbb R^DP′⊆RD described by exactly 2D2D2D inequalities such that

¬DiamLE(P′,D).\lnot\mathrm{DiamLE}(P',D).¬DiamLE(P′,D).

In particular P′P'P′ has 2D2D2D facets in dimension DDD, so the Hirsch bound is DDD, and P′P'P′ is a counterexample to the ddd-step conjecture, hence also to the Hirsch conjecture.

The construction is Santos's one-point suspension / strong ddd-step map: from a ddd-spindle with nnn facets and length ℓ>d\ell>dℓ>d one obtains an (n−d)(n-d)(n−d)-spindle with 2n−2d2n-2d2n−2d facets and length at least ℓ+n−2d\ell+n-2dℓ+n−2d. Here ℓ≥d+1\ell\ge d+1ℓ≥d+1 yields length at least n−d+1n-d+1n−d+1, so the diameter exceeds D=n−dD=n-dD=n−d.

Formalization Note The output description has type Fin (2*D) → EuclideanSpace ℝ (Fin D) with D = n-d (truncated subtraction, legal by d≤nd\le nd≤n). The input length hypothesis is the nonexistence of a padded walk of length ddd, matching DiamLE style.

Preamble
import Mathlib
import Definitions.Def_Hirsch_model

open scoped RealInnerProductSpace
Formal statement
namespace Hirsch

theorem strong_dstep_spindle (d n : ℕ) (hd : 0 < d) (hdn : d ≤ n)
    (a : Fin n → EuclideanSpace ℝ (Fin d)) (b : Fin n → ℝ)
    (u v : EuclideanSpace ℝ (Fin d))
    (hne : (Hpoly a b).Nonempty) (hbd : Bornology.IsBounded (Hpoly a b))
    (hu : u ∈ Set.extremePoints ℝ (Hpoly a b))
    (hv : v ∈ Set.extremePoints ℝ (Hpoly a b))
    (hspindle : ∀ i, (⟪a i, u⟫ = b i) ↔ ⟪a i, v⟫ ≠ b i)
    (hlong : ∀ w : ℕ → EuclideanSpace ℝ (Fin d),
      ¬ (w 0 = u ∧ w d = v ∧
          ∀ j < d, w j = w (j + 1) ∨ Adj (Hpoly a b) (w j) (w (j + 1)))) :
    ∃ (D : ℕ) (a' : Fin (2 * D) → EuclideanSpace ℝ (Fin D)) (b' : Fin (2 * D) → ℝ),
      D = n - d ∧
      (Hpoly a' b').Nonempty ∧
      Bornology.IsBounded (Hpoly a' b') ∧
      ¬ DiamLE (Hpoly a' b') D := by sorry

end Hirsch
Source
F. Santos, A counterexample to the Hirsch conjecture, Annals of Mathematics 176 (2012) 383-412, https://arxiv.org/abs/1006.2814, Theorem 1.5 (Strong d-step Theorem for spindles), pp. 387-388 (arXiv v3); polar/prismatoid form: B. Matschke, F. Santos, C. Weibel, The width of five-dimensional prismatoids, Proc. London Math. Soc. 110 (2015), arXiv:1202.4701, Theorem 1.1.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me