Main consequence — full rational bounds and
ProvedOAI.HadwigerCounterexample.exists_counterexamplesThe bundled headline consequence of the source preprint, combining Theorem 1.1 and Corollary 1.2. For every bound there is an and a graph on vertices with , , and the full chain of rational bounds
together with the strict separation and the fact that is finite (equal to its natural value chromaticNumber.toNat, not ).
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.
import Mathlib import Definitions.Def_HadwigerMatching_Defs import Definitions.Def_ListHadwiger open OAI.HadwigerMatching OAI.LinearListHadwiger
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.HadwigerCounterexampleConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.