Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hadwiger's conjecture is false

Proved
OAI.HadwigerCounterexample.not_hadwiger_conjecture

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

counterexamplegraph-theoryhadwiger

The headline consequence announced in the abstract of the source preprint: Hadwiger's conjecture is false. Writing h(G)h(G)h(G) for the Hadwiger number and χ(G)\chi(G)χ(G) for the chromatic number, the conjecture asserts χ(G)≤h(G)\chi(G)\le h(G)χ(G)≤h(G) for every finite simple graph; this theorem negates that universal statement:

¬ ∀m  ∀G on m vertices,χ(G)≤h(G).\neg\,\forall m\;\forall G\text{ on }m\text{ vertices},\quad \chi(G)\le h(G).¬∀m∀G on m vertices,χ(G)≤h(G).

It follows from the counterexamples of Corollary 1.2, where h(G)<m/2≤χ(G)h(G)<m/2\le\chi(G)h(G)<m/2≤χ(G). The chromatic number is compared as an extended natural number (ℕ∞) against the natural Hadwiger number coerced to ℕ∞.

Formalization Note. Transcribed verbatim from the authors' Lean theorem OAI.HadwigerCounterexample.not_hadwiger_conjecture (Main.lean).

Preamble
import Mathlib
import Definitions.Def_ListHadwiger

open OAI.LinearListHadwiger
Formal statement
namespace OAI.HadwigerCounterexample

theorem not_hadwiger_conjecture :
    ¬ (∀ (m : ℕ) (G : SimpleGraph (Fin m)),
      G.chromaticNumber ≤ ↑(hadwigerNumber G)) := by sorry

end OAI.HadwigerCounterexample
Source
https://github.com/openai/math/blob/main/preprints/A-counterexample-to-Hadwigers-conjecture-September-23-2026/paper.pdf , abstract and p. 3, 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