Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A dimension-independent Larman bound at fixed row excess

Proved
Hirsch.hpoly_diameter_le_fixed_excess_larman

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

diameter-boundhirsch-conjecturepolytopes

Let E,d,nE,d,nE,d,n be nonnegative integers and let PPP be a bounded polyhedron in Rd\mathbb R^dRd described by nnn linear inequalities. If n≤d+En\le d+En≤d+E, then every pair of vertices can be joined by an ordinary edge walk of length at most

2E 2max⁡(E−3,0).2E\,2^{\max(E-3,0)}.2E2max(E−3,0).

Empty and lower-dimensional polyhedra, redundant inequalities, and zero row normals are included. Thus a fixed bound on row excess gives a diameter bound independent of ambient dimension. This classical coarse bound remains exponential in excess and does not establish the Polynomial Hirsch conjecture.

Formalization Note The exponent uses truncated natural subtraction. The predicate permits stationary steps, expressing an upper bound on edge distance.

Preamble
import Mathlib
import Definitions.Def_Hirsch_model
open scoped RealInnerProductSpace
open Set Hirsch
Formal statement
namespace Hirsch
theorem hpoly_diameter_le_fixed_excess_larman
    (E d n : ℕ)
    (a : Fin n → EuclideanSpace ℝ (Fin d)) (b : Fin n → ℝ)
    (hrows : n ≤ d + E) (hbd : Bornology.IsBounded (Hpoly a b)) :
    DiamLE (Hpoly a b) (2 * E * 2 ^ (E - 3)) := by sorry
end Hirsch
Source
Exact H-polyhedron statement and proof: https://github.com/jjoshua2/prove2me-work/blob/117709458ec4b071dc846cd8443feea19ca2669b/Solutions/PolynomialFixedExcessLarman.lean#L21 ; classical shared-facet descent: Santos, A counterexample to the Hirsch conjecture (2012), Lemma 1.1 and its proof, printed pp. 385 and 391; https://annals.math.princeton.edu/wp-content/uploads/annals-v176-n1-p07-p.pdf . The explicit coarse constant here is derived from the platform Larman bound, not claimed to be a verbatim theorem of Santos.

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