A counterexample to Kaplansky’s zero-divisor conjecture
OpenAI groups related papers into a “family”. OpenAI’s catalogue describes this one:
Constructs a finitely presented torsion-free group G whose group algebra \(\mathbb F_2[G]\) has nonzero zero divisors, disproving Kaplansky’s zero-divisor conjecture. The group has a finite two-dimensional classifying space. (OpenAI’s Lean note)
Lean is a language for mathematical statements and proofs that a computer can verify. The assessments below ask whether those statements express the result OpenAI describes here.
Both independent assessments find that the Lean statements express or imply the whole result described above.Read the assessments
Possible match to OpenAI’s description, selected from the papers’ main statements because it shares the most wording. No review confirming the selection is recorded.
There exist a finitely presented torsion-free group G and nonzero elements \alpha,\beta\in\mathbb F_2[G] such that \alpha\beta=0. Moreover, G admits a finite two-dimensional classifying space.
Reported proof verification
One Lean statement in the release; two independent groups report that Comparator accepted runs for this file at the version shown here.
We disprove Kaplansky’s zero-divisor conjecture by constructing a finitely presented torsion-free group G for which \(\mathbb F_2[G]\) has nonzero zero divisors. The group admits a finite two-dimensional classifying space.
One Lean statement in this family
Lean is a language for mathematical statements and proofs that a computer can verify. The Lean statement below is shown beside its possible paper counterpart, with the reason they were linked.
For a configured theorem, the Comparator program tests whether OpenAI’s separate proof proves the exact Lean statement using only the allowed axioms. Some statement files instead configure definitions for comparison by name and type. Acceptance does not establish that a formal statement means the same thing as the paper’s theorem.
There exist a finitely presented torsion-free group G and nonzero elements \alpha,\beta\in\mathbb F_2[G] such that \alpha\beta=0. Moreover, G admits a finite two-dimensional classifying space.
The words they share: finite, classifying, dimensional, presented, two, group, finitely, space, moreover, torsion, free, algebra, nonzero, elements, beta, alpha.
Possible Lean counterpart
Selected from shared wording. No review of whether the statements mean the same thing is recorded.
TorsionFreeZeroDivisors.lean, the release lists it as a main result.
defMainTheorem : Prop := ∃ (G : Type) (inst : Group G),letI : Group G := inst Group.IsFinitelyPresented G ∧ TorsionFree G ∧ HasFiniteTwoDimensionalClassifyingSpace G ∧ ∃ α β : MonoidAlgebra (ZMod 2) G, α ≠ 0 ∧ β ≠ 0 ∧ α * β = 0⋮theoremmain : MainTheorem := bysorry
This file states the theorem with sorry, a placeholder, in place of its proof. OpenAI supplies a separate proof file. Comparator tests whether that proof proves the statement here.
Independent comparisons and proof-verification reports
Does the Lean express the advertised result?
MathVet and cert-machine agree on how much of the advertised result the Lean statements express.
MathVet and Carlos Toledo’s cert-machine independently assessed whether this family’s Lean statements express the whole result OpenAI describes in its catalogue. These are assessments of the family as a whole, not of each paper theorem separately.
MathVet finds that the Lean statements express or imply the whole advertised result (their term: “full”).
Their note:MainTheorem : ∃ G, Group.IsFinitelyPresented G ∧ TorsionFree G ∧ HasFiniteTwoDimensionalClassifyingSpace G ∧ ∃ α β : MonoidAlgebra (ZMod 2) G, α ≠ 0 ∧ β ≠ 0 ∧ α * β = 0. TorsionFree is the usual g^n = 1 → g = 1; the K(G,1) clause asks for a finite 2-dimensional Hausdorff path-connected Mathlib CWComplex X with G ≃* FundamentalGroup X x and a contractible covering space, which is the standard meaning.
“full”, in their words: The challenge statements imply the headline claim after unpacking definitions or one routine step.
Their method: An independent, model-assisted, pre-referee reading of each family’s challenge statements against its headline claim under a published rubric (PROTOCOL.md), with its own Comparator runs per challenge.
Kaplansky’s zero-divisor conjecture asserts that the group algebra of a torsion-free group over a field has no zero divisors. The formalized result constructs a finitely presented torsion-free group $G$ and nonzero elements $\alpha,\beta\in\mathbb F_2[G]$ with $\alpha\beta=0$, giving a counterexample.
The same group admits a finite two-dimensional classifying space $K(G,1)$.
AI-drafted comparisons, with no recorded human review
Unreviewed AI draft: states a paper’s theorem as the paper does. States the main theorem including its second clause: a finitely presented torsion-free group with zero divisors in F₂[G] that admits a finite two-dimensional classifying space.
Who ran the proof-verification program?
These groups report running Comparator with the release’s Lean statement files. For a configured theorem, it verifies OpenAI’s separate proof against the exact statement; some files instead configure definitions for comparison by name and type. Each row is the named group’s report. Atlas has not repeated the runs.
These reports do not list the software versions, proof-verification programs, axioms, time or memory in separate fields. Any such details in a report’s prose are reproduced below.
These reports examine claims in the papers using HOL Light, a different proof assistant and exact calculations for finite claims, independently of the release’s Lean proofs. Read each report for the exact claim it covers.
The paper’s two exact rationals and both bounds < 149/150
HOL Light card 196
Reported by
Ben Knill, openai-math-hol-cards
Method
Proof of a selected step in HOL Light
Their verdict
“PASS” The report records a proof of a supporting fact.
What it covers
Cross-check of a Lean-covered result; on-screen value
What these papers cite in the release, and what cites them
These links come from the papers’ bibliographies. A citation records that one paper cites another; how each cited result is used has not been examined here.
Papers elsewhere in the release that this family’s papers cite
This family’s papers cite no paper elsewhere in the release.
Papers elsewhere in the release that cite this family’s papers
Each paper’s outside references are listed with it on its reading page, where each citation is placed. Every outside work cited in the release: References outside the release
Explain a result, compare statements or propose a correction
Atlas has no contributed explanation for this family yet. You can offer one with a GitHub account. You receive named credit and disclose any AI assistance.
Each button opens a GitHub form with this page and its source version filled in. Opening the form does not reserve the work.
Commentary on this family by others, dated and credited. It is commentary, not a finding.
An unsigned public tier list, the OpenAI Math Tier List, classes it as a counterexample and rates its significance, if it holds up, as “Career-defining publication”. The page says that nothing on it is verified.
Moritz Firsching, anxkhn, Paul Lezeau, Formal Conjectures: mark problems solved in the OpenAI math release and link formal proofs, 11 October 2026. Source
A Formal Conjectures maintainer, after source inspection, links the group algebra counterexample to Kaplansky’s zero-divisor conjecture, stated as a negation.
Pico, openai-math-counterexamples: do the counterexamples in openai/math hold when someone else computes them?, 9 October 2026. Source
The group is built from random matchings for sufficiently large parameters, so the two group-algebra elements are never written down.
Questions awaiting review
Each item identifies a statement, definition or report that needs further review. Its link opens a GitHub form with the source version already recorded.
Read the Lean statement against the paper
An AI agent drafted an assessment of which part of the paper this Lean statement expresses. No named human review is recorded.Open the form
Identify the theorem the catalogue describes
Family 196The theorem shown was selected from shared wording with OpenAI’s description. Atlas records no review confirming that it is the theorem the description means.Open the form
Compare the proposed paper and Lean matches
Family 196Atlas records no review of whether each linked Lean statement and paper theorem mean the same thing.Open the form
Investigate a calculation that did not decide the claim
Family 196An independent calculation did not decide the claim, or needs data absent from its source.Open the form
Why this passage is shown
Theorem 1.1
In A Torsion-Free Group Algebra with Zero Divisors, 23 September 2026
How it was found
Its words were compared with the words of OpenAI’s catalogue description.
The challenge statements imply the headline claim after unpacking definitions or one routine step.
Their method
An independent, model-assisted, pre-referee reading of each family’s challenge statements against its headline claim under a published rubric (PROTOCOL.md), with its own Comparator runs per challenge. Its protocol describes a planned error-rate study; this import does not establish that the study has been completed.
The challenge statements state the headline as OpenAI wrote it.
Their method
Every Comparator challenge re-run on Linux with nanoda switched on, decided by a preregistered rule; every family’s challenge statements read against OpenAI’s headline, clause by clause. Decider: Comparator (leanprover/comparator d03acab1 = tag v4.34.0, built with the release’s toolchain v4.34.1), lean4export 076e8e57, landrun 811cfff5, nanoda_lib 3a240721 — on GitHub’s Linux runners…
Re-run through Comparator in a sandboxed virtual machine: accepted.
Date
8 October 2026
Version
at the release’s recorded version
Their method
An independent, model-assisted, pre-referee reading of each family’s challenge statements against its headline claim under a published rubric (PROTOCOL.md), with its own Comparator runs per challenge.
Exact calculations for finite claims, cert-machine
Their verdict
“NEEDS DATA”
Claim tested or proved
Cannot be decided from the release: the specific object the argument relies on is not published.
Detail
NOT PUBLISHED. build/sections/factors.tex lines 31-35: 'The construction is probabilistic: it proves that suitable finite matchings exist, without specifying matchings from which a concrete presentation and zero-divisor factors can be read off.' The Lean solution (OAI.Algebra.GroupRing) is existential.