What was already known
Mao, Ozeki, Robertson and Wang defined the thresholds. Quantavane’s earlier quadratic-residue colourings gave lower bounds of 53 for four and five colours.
AI involvement
Canli directed the project. He credits Claude agents with the search, the certificate checker and its soundness proof, and the Lean development.
- Quantavane’s exact Gallai–van der Waerden thresholdsAuthorship and AI work
Importance
The matching upper bound determines three cases of the four-term monochromatic threshold and adds the three-colour case.
Technical verification
The submitted Lean proof checks the unsatisfiability certificate for 53 and the three explicit colourings for 52. The certificate checker is proved sound in Lean, so the SAT solver’s output need not be trusted.
Formal checking
The submitted Lean proof checks the unsatisfiability certificate for 53 and the three explicit colourings for 52. The certificate checker is proved sound in Lean, so the SAT solver’s output need not be trusted.
- Checker
- Lean 4 kernel and Comparator, as reported by Quantavane
- Scope
- Checked the upper bound via a certified LRAT checker, the three explicit witnesses and the resulting exact thresholds.
- Basis
- Reported by the linked checker
- Exact theorem statements and provenanceNamed checks and exact scope
- Lean challenge statements
Human understanding
The account describes the SAT encoding but gives no named human explanation of the central certificate construction or proof.
Correction and publication history
Published a distinct research contribution with primary evidence of central AI work.
Read this published revision