Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Main consequence — full rational bounds and h<χh<\chih<χ

Proved
OAI.HadwigerCounterexample.exists_counterexamples

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

counterexamplegraph-theoryhadwiger

The bundled headline consequence of the source preprint, combining Theorem 1.1 and Corollary 1.2. For every bound MMM there is an m≥max⁡(M,5)m\ge\max(M,5)m≥max(M,5) and a graph GGG on mmm vertices with α(G)≤2\alpha(G)\le2α(G)≤2, cm(G)<m/100\mathrm{cm}(G)<m/100cm(G)<m/100, and the full chain of rational bounds

h(G)<26m75+23<m2≤χ(G),h(G)<\frac{26m}{75}+\frac23<\frac m2\le\chi(G),h(G)<7526m​+32​<2m​≤χ(G),

together with the strict separation h(G)<χ(G)h(G)<\chi(G)h(G)<χ(G) and the fact that χ(G)\chi(G)χ(G) is finite (equal to its natural value chromaticNumber.toNat, not ⊤\top⊤).

This is the authors' own combined formal statement; it records the ordinary-chromatic consequences explicitly, including finiteness of the chromatic number, and directly yields the failure of Hadwiger's inequality.

Formalization Note. Transcribed verbatim from the authors' Lean theorem OAI.HadwigerCounterexample.exists_counterexamples (Main.lean). Inequalities are over ℚ; G.chromaticNumber ≠ ⊤ and G.chromaticNumber = ↑(G.chromaticNumber.toNat) assert finiteness of the chromatic number.

Preamble
import Mathlib
import Definitions.Def_HadwigerMatching_Defs
import Definitions.Def_ListHadwiger

open OAI.HadwigerMatching OAI.LinearListHadwiger
Formal statement
namespace OAI.HadwigerCounterexample

theorem exists_counterexamples (M : ℕ) : ∃ m : ℕ, max M 5 ≤ m ∧
    ∃ G : SimpleGraph (Fin m), G.indepNum ≤ 2 ∧ (connectedMatchingNumber G : ℚ) < (m : ℚ) / 100 ∧
      (hadwigerNumber G : ℚ) < 26 * (m : ℚ) / 75 + 2 / 3 ∧
      26 * (m : ℚ) / 75 + 2 / 3 < (m : ℚ) / 2 ∧ (m : ℚ) / 2 ≤ (G.chromaticNumber.toNat : ℚ) ∧
      hadwigerNumber G < G.chromaticNumber.toNat ∧
      G.chromaticNumber ≠ ⊤ ∧ G.chromaticNumber = ↑(G.chromaticNumber.toNat) := by sorry

end OAI.HadwigerCounterexample
Source
https://github.com/openai/math/blob/main/preprints/A-counterexample-to-Hadwigers-conjecture-September-23-2026/paper.pdf , p. 3, Theorem 1.1 and Corollary 1.2; authors' Lean: https://github.com/openai/math/blob/main/lean/OAI/Combinatorics/HadwigerCounterexample/Main.lean
Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 21, 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