`ComparatorChallenges/HadwigerCounterexample.lean`

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL: Lean4 Domain Explanation Language

Annotation provenance. This overlay contains 120 curated AI-written annotations and 1273 mechanical source-derived annotations. They have not been human-reviewed as explanations; treat them as unverified and not mathematical authority. Retained generation history: The 9 original curated annotations were produced in a Claude Sonnet 5.5 session at medium effort; Claude Opus 5.5 is recorded in that session as the advisor model, not the direct author. Those 9 annotations were revised on 2026-10-14 to bind all of them to exact page-one quotations from 6 pinned OpenAI manuscripts, the matching pinned formalization notes, and named historical primary sources; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. The 3 manuscript-grounded matrix-multiplication annotations were composed from pinned OpenAI manuscripts and named historical sources in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Six additional target-specific annotations for Catalan's constant, the irrationality exponent of pi, dyadic Erdos similarity, Unique Games, quintic Lienard systems, and Yau nodal growth were composed from pinned OpenAI manuscripts, exact page-one quotations, exact Lean statements, and named historical sources in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Four additional target-specific annotations for Seymour's second-neighborhood conjecture, Cannon's conjecture, Koebe circle-domain uniformization, and circle-domain rigidity were composed from 4 pinned OpenAI manuscripts, exact page-one quotations, exact Lean statements, and named historical primary sources in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Four additional target-specific annotations for simple Lebesgue spectrum on the three-torus, Rokhlin multiple mixing, the nine-dimensional Borsuk counterexample, and Tingley's sphere-isometry problem were composed from 4 pinned OpenAI manuscripts, exact page-one quotations, exact Lean statements, and named historical primary sources in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Four additional target-specific annotations for the Abhyankar-Sathaye counterexample, the circulant Hadamard conjecture, the Eilenberg-Ganea counterexample, and short Egyptian fractions were composed from 4 pinned OpenAI manuscripts, exact page-one quotations, exact Lean statements, and quotations from Sathaye, Turyn with Storer, Eilenberg with Ganea, and Erdos in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Four additional target-specific annotations for the complete Crouzeix inequality, unrestricted Euclidean five-coloring, the general Mahler conjecture, and Thompson F nonamenability were composed on 2026-10-14 from exact Lean statements, 4 pinned OpenAI manuscripts, the matching formalization notes, and linked historical sources by Crouzeix, de Grey, Mahler, Cannon, Floyd, and Parry; no human review is claimed. Four additional target-specific annotations for algorithmic strong thin trees, Barnette's Hamiltonian-cycle conjecture, the explicit Artin CAT(0) counterexample, and generalized amplitude-damping capacity were composed on 2026-10-14 from exact Lean statements, 4 pinned OpenAI manuscripts, matching formalization notes, and linked historical sources by Anari with Goddyn, Arts with Hopman and Timmermans, Charney, and Khatri with Sharma and Wilde; no human review is claimed. Fourteen solution-level annotations for Seymour's second-neighborhood theorem were added on 2026-10-14 from the pinned 15-page manuscript, covering the exact-neighborhood model, minimal-counterexample reduction, subset deficit, transitive blowup, pruning, extremal contradiction, and proof-bearing final theorem. The subset and blowup annotations also bind exact quotations from Tyler Seacrest (2019) and Brantner, Brockman, Kay, and Snively (2009); no human review is claimed. Thirty-seven declaration-level annotations were added on 2026-10-14 for the rest of ComparatorChallenges/AlgorithmicThinTrees.lean, covering its multigraph semantics, stack-machine cost model, explicit and binary-multiplicity encodings, output certificate, and complete algorithmic proposition. They are bound to the pinned OpenAI manuscript and linked earlier thin-tree sources by Luis Goddyn, Nima Anari, and Shayan Oveis Gharan; the annotation explicitly preserves that the concluding comparator theorem still has body by sorry, and no human review is claimed. Thirty-one supporting declarations in ComparatorChallenges/UniqueGamesTheorem.lean were upgraded or added on 2026-10-14, completing curated coverage of all thirty-two declarations in that file. The annotations cover the finite game model, Boolean formula and parser, binary-vector translations, explicit output serialization, finite-alphabet machine contract, and gap theorem; they distinguish manuscript-backed mathematics from Lean-specific canonical parsing and unary game output encoding, bind exact OpenAI manuscript quotations, and credit Subhash Khot through his 2010 survey. The comparator theorem remains explicitly labeled as having body by sorry; no human review is claimed. The source-derived generator was hardened on 2026-10-14 so a formalization note covering multiple comparator results no longer copies its combined Scope prose onto each declaration; those targets now use declaration-specific source comments when available and otherwise remain explicitly bounded to the exact Lean statement. The remaining source-derived annotations were generated mechanically from pinned formalization notes and source comments by tooling developed in a GPT-5.6 Sol session at ultra reasoning; GPT-5.6 Sol did not originate the source prose.

Credit: OpenAI's pinned repository says an unreleased internal model produced the manuscripts and supporting proof artifacts. The collection builds on the mathematics community's accumulated problems, results, language, and formal libraries; each manuscript's BibTeX and bibliography are the authority for individual scholarly credit.

Project sources: Pinned openai/math documentation, Pinned formalization catalogue

6 declarations, 2 contain sorry, 0 declared as axioms

def OAI.HadwigerMatching.IsTouchingMatching line 10
Also declared: OAI/Combinatorics/HadwigerMatching/Definitions.lean:12 (same declaration text).
def OAI.HadwigerMatching.connectedMatchingNumber line 16
Also declared: OAI/Combinatorics/HadwigerMatching/Definitions.lean:20 (same declaration text).
def OAI.LinearListHadwiger.HasCliqueMinor line 23
Also declared: ComparatorChallenges/ListHadwiger.lean:17 (same declaration text), OAI/Combinatorics/ListHadwiger/Model.lean:17 (same declaration text).
def OAI.LinearListHadwiger.hadwigerNumber line 29
Also declared: ComparatorChallenges/ListHadwiger.lean:23 (same declaration text), OAI/Combinatorics/ListHadwiger/Model.lean:23 (same declaration text).
theorem OAI.HadwigerCounterexample.exists_counterexamples Challenge statement: Counterexamples of arbitrarily large order sorry line 38
L4DEL explanation
constructing arbitrarily large graphs whose chromatic number exceeds their Hadwiger number
— OpenAI Hadwiger-counterexample manuscript (abstract)
For every bound M there is a graph on m >= max(M, 5) vertices with independence number at most 2 whose chromatic number is above its Hadwiger number.
1. The graph G on Fin m has independence number at most 2.
2. Its connected matching number is below m/100 and its Hadwiger number is below 26m/75 + 2/3, which is itself below m/2.
3. The chromatic number is finite, is at least m/2, and exceeds the Hadwiger number; the challenge file leaves the proof as sorry.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f), OpenAI Hadwiger-counterexample manuscript (abstract), Pinned OpenAI formalization note 157, Hugo Hadwiger (1943), original-paper bibliographic record
Distinct definitions of this name: OAI/Combinatorics/HadwigerCounterexample/Main.lean:101 (same statement text; different proof or body). Qualify references as OAI.HadwigerCounterexample.exists_counterexamples@path.
```
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
…
```
theorem OAI.HadwigerCounterexample.not_hadwiger_conjecture Challenge statement: Hadwiger's conjecture fails sorry line 49
L4DEL explanation
We disprove Hadwiger’s conjecture
— OpenAI Hadwiger-counterexample manuscript (abstract)
The statement denies that every finite graph's chromatic number is at most its largest clique-minor size.
1. Graphs are simple graphs on Fin m, and hadwigerNumber is the supremum of t such that the graph has a clique minor of order t (connected disjoint branch sets, pairwise touching).
2. The statement is the negation of "for all m and all graphs G on Fin m, chromaticNumber G is at most hadwigerNumber G".
3. This challenge file leaves the proof as sorry.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f), OpenAI Hadwiger-counterexample manuscript (abstract), Pinned OpenAI formalization note 157, Hugo Hadwiger (1943), original-paper bibliographic record
Distinct definitions of this name: OAI/Combinatorics/HadwigerCounterexample/Main.lean:120 (different declaration text). Qualify references as OAI.HadwigerCounterexample.not_hadwiger_conjecture@path.

clique minor: a family of disjoint connected vertex sets in a graph, every two of which have an edge between them
```
theorem not_hadwiger_conjecture :
    ¬ (∀ (m : ℕ) (G : SimpleGraph (Fin m)),
      G.chromaticNumber ≤ ↑(hadwigerNumber G)) := by
…
```