VibeMathedMath problems solved with AI

Conway's Refinement Conjecture for Omnific Integers

If a,b,c,dOza,b,c,d\in\mathbf{Oz} are omnific integers andab=cd, ab=cd, then there exist omnific integers e,f,g,hOze,f,g,h\in\mathbf{Oz} such thata=ef,b=gh,c=eg,d=fh. a=ef,\qquad b=gh,\qquad c=eg,\qquad d=fh. Equivalently, every equality of two products in the omnific integers admits a common four-factor refinement.

Result
Proved(see note)
Status
Candidate (review pending)
AI contribution
AI co-developed
Method
Argument
Field
Surreal numbers
Posed by
John H. Conway
Year posed
1976
Years open
50y
Solved
2026-09-03
Model
ChatGPT; Claude
Vendor
OpenAI; Anthropic
Collaborators
Dan Abramov
Verification
Site-confirmed
Publication
Announced
Significance
28 / 100
Disclosed cost
Wikipedia
No dedicated article

What was actually shown

The repository gives a Lean proof of Conway's 1976 refinement conjecture for omnific integers: wheneverab=cd ab=cd with a,b,c,dOza,b,c,d\in\mathbf{Oz}, there exist e,f,g,hOze,f,g,h\in\mathbf{Oz} satisfyinga=ef,b=gh,c=eg,d=fh. a=ef,\quad b=gh,\quad c=eg,\quad d=fh. The proof is formalized twice: once using CombinatorialGames' surreal-number implementation and once with the required surreal definitions inlined over Mathlib. The development also proves stronger structural results about factorization in Hahn-series integer parts and related generalized power-series rings.

What the AI did

Dan Abramov describes the project as an AI-proof experiment. Claude first selected Conway's refinement conjecture as a promising open problem after noting recent progress by L'Innocente and Mantova. Over roughly a month, Abramov repeatedly used ChatGPT and Claude to generate mathematical ideas and then steered the systems into producing Lean proofs, using compilation and formal checking to reject invalid directions. The repository therefore attributes the mathematical proof search and much of the formal proof construction to interactive AI exploration under human steering.

VerificationAI

Site-confirmed: rebuilt here on 4 September 2026, not taken from the repository's CI. This site's verify-lean workflow checked out gaearon/conway-refinement at commit 264445c9, the commit the entry cites, installed the toolchain it pins (leanprover/lean4:v4.31.0) with its CombinatorialGames dependency, ran lake build\texttt{lake build} over every module (3145 jobs), then the project's own scripts/Axioms.lean, then lake env leanchecker\texttt{lake env leanchecker} replaying the whole ConwayRefinement environment. 37 minutes, every step green.

Both formulations of the conjecture - the one over the CombinatorialGames Surreal\texttt{Surreal} type and the Mathlib-only one with the surreal definitions inlined - report propext\texttt{propext}, Classical.choice\texttt{Classical.choice} and Quot.sound\texttt{Quot.sound} and nothing else. No sorryAx\texttt{sorryAx}, no project axiom.

Still Candidate rather than Resolved, and the reason is the one the author gives himself: a kernel checks the proof against the statement as written, and whether that statement is Conway's conjecture is a reading a surreal-number specialist has to do. The definition used is Conway's own cut x={x1x+1}x = \{x - 1 \mid x + 1\} and the statement is a few lines, so it is an afternoon's work for the right reader. Nobody without a stake has done it yet.

Sources

Submitted by VibeGene on

Changelog3 changes

Discussion