Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1.2 — fractional chromatic counterexamples

Open
OAI.HadwigerCounterexample.corollary_1_2

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

counterexamplefractional-coloringgraph-theoryhadwiger

Corollary 1.2 of the source preprint (p. 3). There are finite nonempty simple graphs GGG of arbitrarily large order mmm for which

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

where h(G)h(G)h(G) is the Hadwiger number, χf(G)\chi_f(G)χf​(G) the fractional chromatic number, and χ(G)\chi(G)χ(G) the chromatic number. Thus Hadwiger's conjecture and its fractional-coloring weakening χf(G)≤h(G)\chi_f(G)\le h(G)χf​(G)≤h(G) (discussed by Reed and Seymour) are both false.

The lower bound χf(G)≥m/2\chi_f(G)\ge m/2χf​(G)≥m/2 follows by summing the vertex constraints of any fractional coloring and using α(G)≤2\alpha(G)\le2α(G)≤2; the upper bound on h(G)h(G)h(G) is the matching–minor bound applied to the graphs of Theorem 1.1. The chain is stated for m≥5m\ge5m≥5, where 26m/75+2/3<m/226m/75+2/3<m/226m/75+2/3<m/2.

Formalization Note. Newly transcribed from the paper's Corollary 1.2 (the authors' bundled Lean theorem exists_counterexamples records the ordinary-chromatic chain but not the fractional term). Stated over ℝ; χf\chi_fχf​ is fractionalChromaticNumber and χ\chiχ is represented by the finite value chromaticNumber.toNat. This item should be compile-checked at submission.

Preamble
import Mathlib
import Definitions.Def_HadwigerMatching_Defs
import Definitions.Def_ListHadwiger
import Definitions.Def_HadwigerCounterexample_Fractional

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

theorem corollary_1_2 (M : ℕ) : ∃ m : ℕ, max M 5 ≤ m ∧
    ∃ G : SimpleGraph (Fin m),
      (hadwigerNumber G : ℝ) < 26 * (m : ℝ) / 75 + 2 / 3 ∧
      26 * (m : ℝ) / 75 + 2 / 3 < (m : ℝ) / 2 ∧
      (m : ℝ) / 2 ≤ fractionalChromaticNumber G ∧
      fractionalChromaticNumber G ≤ (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, Corollary 1.2
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