TOPICS
Search

Conway's Refinement Conjecture


Conway's refinement conjecture (Conway 1976) asserts that every equality ab=cd of omnific integers admits a multiplicative refinement. More precisely, there should exist omnific integers e, f, g, and h such that a=ef, b=gh, c=eg, and d=fh.

The four factors can be viewed as the entries of a two-by-two array whose row products are a and b and whose column products are c and d. The analogous statement for ordinary integers follows from greatest common divisors. Omnific integers form a much larger ordered ring inside the surreal numbers, so this integer argument does not automatically extend.

Abramov (2026) reported a proof developed through interactive work with ChatGPT and Claude. VibeMathed (2026) rebuilt the complete Lean formalization using only standard logical axioms. As of Sep. 7, 2026, independent specialist review of the formal definitions and their agreement with Conway's intended statement had not been reported.


See also

Greatest Common Divisor, Omnific Integer, Surreal Number

Explore with Wolfram|Alpha

References

Abramov, D. "Conway's Refinement Conjecture." 2026. https://github.com/gaearon/conway-refinement.Conway, J. H. On Numbers and Games. London, England: Academic Press, 1976.VibeMathed. "Conway's Refinement Conjecture for Omnific Integers." 2026. https://vibemathed.com/problem/conway-s-refinement-conjecture-for-omnific-integers.

Cite this as:

Weisstein, Eric W. "Conway's Refinement Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ConwaysRefinementConjecture.html

Subject classifications