A counterexample to the small Cohen–Macaulay module conjecture
OpenAI groups related papers into a “family”. OpenAI’s catalogue describes this one:
Constructs a three-dimensional complete Noetherian normal local domain over ℂ with no nonzero finitely generated maximal Cohen–Macaulay module. A three-dimensional local domain essentially of finite type over ℂ has the same property, disproving the domain form of the small Cohen–Macaulay module conjecture. (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.
The independent assessments find that the Lean statements express a supporting step or a different result.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 exists a three-dimensional complete Noetherian normal local domain R containing \C, with residue field \C, such that no nonzero finitely generated R-module has depth three.
Possible match to OpenAI’s description, selected from shared wording. No review confirming the selection is recorded.
Let X be a smooth integral projective surface over \C, and let H be an ample globally generated divisor. If R(X,H) admits a small Cohen–Macaulay module, then
K_X^2-2c_2(X)\leq 6H^2.
No Lean statement in the release is paired with this theorem.
The release does not say which paper theorem its catalogue describes. Both statements above are shown whole: the paper’s main theorem first, then the statement that shares the most wording with the description. The atlas has not reviewed either choice.
Reported proof verification
One Lean statement in the release; three independent groups report that Comparator accepted runs for this file at the version shown here.
We construct a three-dimensional complete Noetherian normal local domain containing ℂ, with residue field ℂ, that has no nonzero finitely generated maximal Cohen–Macaulay module. This disproves the domain form of the small Cohen–Macaulay module conjecture.
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. The outside readers find that the release’s Lean states a supporting or different result, so the theorem it is paired with is shown under its own heading.
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 exists a three-dimensional complete Noetherian normal local domain R containing \C, with residue field \C, such that no nonzero finitely generated R-module has depth three.
The words they share: complete, residue, field, noetherian, domain, local, dimensional, three.
Possible Lean counterpart
Selected from shared wording. No review of whether the statements mean the same thing is recorded.
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.
three independent groups report that Comparator accepted runs for this Lean statement file: cert-machine; MathVet; Neal McBurnett, openai-math-lean-tooling. Who ran the proof-verification program
cert-machine records it as “CERTIFIED”.
MathVet records it as “comparator-sandboxed-pass”.
Neal McBurnett, openai-math-lean-tooling records it as “accepted”.
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 a supporting result (their term: “supporting-only”).
Their note:Lean states only that some C-algebra R is a three-dimensional, m-adically complete, Noetherian, integrally closed local domain with residue field C; it never mentions modules, depth or Cohen-Macaulayness, so the defining property of the headline (no nonzero finitely generated module of depth 3) and the essentially-finite-type corollary are not stated. As typed the existential is also satisfied by C[[x,y,z]] and does not name the surface cone, so it records only the ring-theoretic half of the construction.
Definitions the group asks readers to compare with the paper:candidate_ring_properties (the statement itself): a bare existence claim over an unconstrained R; it is not tied to the paper’s completed section ring R(X,H) (the proof uses ExplicitCone.completedRing, the statement does not mention it) and is satisfied by the regular ring C[[x,y,z]]; the key property (no nonzero finitely generated module of depth three) is absent.; IsIntegrallyClosed R: R is integrally closed in its fraction field (normal domain); standard.; IsAdicComplete (IsLocalRing.maximalIdeal R) R: R is Hausdorff and complete for the maximal-ideal-adic topology; standard.; ringKrullDim R = 3: Krull dimension 3 (value in WithBot N-infinity); standard.; Function.Bijective (algebraMap C (IsLocalRing.ResidueField R)): the structure map C -> R/m is bijective, i.e. residue field C; standard.; Algebra C R: the paper’s ‘containing C’ is encoded as an algebra structure over C; standard.
“supporting-only”, in their words: The challenge statements state a lemma or auxiliary result, not the headline.
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.
cert-machine finds that the Lean statements express a supporting result (their term: “SUPPORT-ONLY”).
The gap they name:The counterexample itself (no nonzero finitely generated MCM module) and the essentially-of-finite-type example are not stated; only properties of the candidate ring are, and those properties are existential.
“SUPPORT-ONLY”, in their words: The challenge statements state only supporting results.
Their method: Every Comparator challenge re-run on Linux with nanoda switched on, decided by a preregistered rule.
The small Cohen–Macaulay module conjecture asks whether every complete local domain has a nonzero finitely generated maximal Cohen–Macaulay module. The linked formalization verifies only the ring-theoretic candidate: there exists a three-dimensional complete Noetherian integrally closed local domain over $\mathbb C$ whose residue field is $\mathbb C$.
It does not prove that this ring lacks a nonzero finitely generated maximal Cohen–Macaulay module, or the paper’s counterexample essentially of finite type.
AI-drafted comparisons, with no recorded human review
Ring-theoretic properties of the completed surface-cone candidateSurfaceConeCandidateSupport
Unreviewed AI draft: states a supporting result. States only that the candidate ring is a three-dimensional complete Noetherian normal local domain over C with residue field C, one of the five supporting comparisons named in the Comparator README. The absence of a small Cohen–Macaulay module, the paper’s claim, is outside this statement.
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.
Ring-theoretic properties of the completed surface-cone candidateSurfaceConeCandidateSupport
Three reports, all at the release’s recorded version.
Reported by
Their word
Their account
Date
Original report
cert-machine
“CERTIFIED”
Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.
Explanations of this family written elsewhere, by the people named. Each is their own reading of the mathematics.
mo271, Wikipedia/SmallCohenMacaulayModules: exists_isSmallCohenMacaulay is false (issue 6912), 7 October 2026. Source
The release constructs a three-dimensional complete local domain with no nonzero finitely generated maximal Cohen-Macaulay module, refuting the statement.
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.
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 195The 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
Address a question raised in an independent assessment
The challenge statements state a lemma or auxiliary result, not the headline.
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 only supporting results.
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
10 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.
Re-run through Comparator with Lean’s kernel: accepted (the check took 282 s; peak memory 6.4 GiB).
Date
10 October 2026
Version
at the release’s recorded version
Their method
Each challenge’s solution is built and checked by Comparator at the pinned release, on Lean leanprover/lean4:v4.34.1, recording the verdict, the check time and the peak memory.
Ring-theoretic properties of the completed surface-cone candidate
Role
the release lists it as a main result
Paired with
Theorem 1.1 (candidate pairing)
Who ran the proof-verification program
three independent groups report that Comparator accepted runs for this Lean statement file: cert-machine; MathVet; Neal McBurnett, openai-math-lean-tooling.