Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fractional chromatic number

Definition
HadwigerCounterexample_Fractional

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

fractional-coloringgraph-theoryhadwiger

The fractional chromatic number χf(G)\chi_f(G)χf​(G) of a finite simple graph GGG is the minimum total weight of a fractional coloring. A fractional coloring assigns a nonnegative real weight wIw_IwI​ to each independent vertex set III so that every vertex is covered to total weight at least one:

χf(G)=inf⁡{∑IwI: wI≥0, ∑I∋vwI≥1 for every vertex v}.\chi_f(G)=\inf\Big\{\sum_I w_I:\ w_I\ge0,\ \sum_{I\ni v}w_I\ge1\text{ for every vertex }v\Big\}.χf​(G)=inf{I∑​wI​: wI​≥0, I∋v∑​wI​≥1 for every vertex v}.

An ordinary coloring gives a fractional coloring with unit weights on its color classes, so χf(G)≤χ(G)\chi_f(G)\le\chi(G)χf​(G)≤χ(G); summing the vertex constraints gives χf(G)≥∣V(G)∣/α(G)\chi_f(G)\ge|V(G)|/\alpha(G)χf​(G)≥∣V(G)∣/α(G). The source preprint (p. 3) uses this quantity to state its fractional-coloring counterexamples (Corollary 1.2).

Formalization Note. Weights are placed on all finite vertex sets (Finset V), with non-independent sets forced to weight zero; the infimum is a real-valued sInf. This matches the formalization already used on the platform for the Reed–Seymour theorem (OAI.LinearListHadwiger.Fractional.fractional_chromatic_le_two_hadwiger).

Definition code
import Mathlib

namespace OAI

namespace HadwigerCounterexample

variable {V : Type} [Fintype V] [DecidableEq V]

/-- The fractional chromatic number: the infimum of the total weight of a
fractional coloring, i.e. nonnegative weights on independent vertex sets covering
each vertex to total at least one. Weights are placed on all finite vertex sets,
with non-independent sets forced to weight zero. -/
noncomputable def fractionalChromaticNumber (G : SimpleGraph V) : ℝ :=
  sInf {c : ℝ | ∃ μ : Finset V → ℝ,
    ((∀ I, 0 ≤ μ I) ∧ (∀ I, ¬(∀ v ∈ I, ∀ u ∈ I, ¬G.Adj v u) → μ I = 0) ∧
      ∀ v, 1 ≤ ∑ I, if v ∈ I then μ I else 0) ∧ ∑ I, μ I = c}

end HadwigerCounterexample

end OAI
Source
https://github.com/openai/math/blob/main/preprints/A-counterexample-to-Hadwigers-conjecture-September-23-2026/paper.pdf , p. 3 (definition of fractional coloring and χf(G))
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