A counterexample to finitistic-dimension finiteness
OpenAI groups related papers into a “family”. OpenAI’s catalogue describes this one:
Constructs a finite-dimensional complex algebra whose finite-dimensional modules have unbounded finite projective dimensions. This disproves the little finitistic-dimension 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.
Both independent assessments find that the Lean statements express or imply the whole result described above.Read the assessments
All four dimensions here use left modules. Thus the little and big finitistic dimensions of \Lambda are infinite on the left and zero on the right. Injective left \Lambda-modules do not generate the unbounded derived category of all left \Lambda-modules, whereas injective right \Lambda-modules generate the unbounded derived category of all right \Lambda-modules.
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
Two Lean statements in the release; independent groups report that Comparator accepted runs for all these files at the version shown here.
We construct a finite-dimensional complex algebra whose finite-dimensional modules have unbounded finite projective dimensions. This disproves the little finitistic-dimension conjecture.
Two Lean statements in this family
Choose one to see it beside the paper theorem it is paired with.
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.
All four dimensions here use left modules. Thus the little and big finitistic dimensions of \Lambda are infinite on the left and zero on the right. Injective left \Lambda-modules do not generate the unbounded derived category of all left \Lambda-modules, whereas injective right \Lambda-modules generate the unbounded derived category of all right \Lambda-modules.
The words they share: injective, asymmetry, extreme, finitistic, generate, little, derived, category, dimensions, complex, algebra, dimensional, modules, finite, unbounded, zero, infinite.
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.
All four dimensions here use left modules. Thus the little and big finitistic dimensions of \Lambda are infinite on the left and zero on the right. Injective left \Lambda-modules do not generate the unbounded derived category of all left \Lambda-modules, whereas injective right \Lambda-modules generate the unbounded derived category of all right \Lambda-modules.
The words they share: algebra, category, complex, derived, dimensional, dimensions, finite, finitistic, generate, infinite, left, little, modules, right, unbounded, zero.
Possible Lean counterpart
Selected from shared wording. No review of whether the statements mean the same thing is recorded.
LittleFinitistic.lean, the release lists it as a main result.
theoremexists_counterexample : ∃ (A : Type) (_ : Ring A) (_ : Algebra ℂ A), FiniteDimensional ℂ A ∧ littleFinitisticDimension A = ⊤ ∧ ∀ m : ℕ, 0 < m → ∃ N : ModuleCat.{0} A, Module.Finite A N ∧ ((2*m-2 : ℕ) : WithBot ℕ∞) ≤ projectiveDimension N ∧ projectiveDimension N < ⊤ := 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.
Other mathematical statements in OpenAI’s Lean library
Atlas found these propositions by scanning the text of the project’s Model.lean file. Each name links to its definition, with any associated statement file beside it. This list does not record running Lean to interpret or verify those definitions.
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:exists_counterexample : ∃ A (_ : Ring A) (_ : Algebra ℂ A), FiniteDimensional ℂ A ∧ littleFinitisticDimension A = ⊤ ∧ ∀ m > 0, ∃ N, Module.Finite A N ∧ (2m-2 : WithBot ℕ∞) ≤ projectiveDimension N ∧ projectiveDimension N < ⊤, where littleFinitisticDimension A := ⨆ (M) (_ : Module.Finite A M) (_ : projectiveDimension M < ⊤), projectiveDimension M (Mathlib projectiveDimension): unbounded finite projective dimensions over a finite-dimensional complex algebra, as in the summary. FinitisticAsymmetry is an extra secondary result.
“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.
The little finitistic-dimension conjecture predicts that finitely generated modules of finite projective dimension over a fixed finite-dimensional algebra have bounded projective dimensions. The formalized counterexample is a finite-dimensional complex algebra with a finitely generated module of projective dimension at least $2m-2$ and still finite for every $m\ge1$.
A separate formalized result gives a finite-dimensional complex algebra whose little and big finitistic dimensions are infinite on the left and zero on the right. Injectives fail to generate its unbounded derived category on the left and generate it on the right.
AI-drafted comparisons, with no recorded human review
Unreviewed AI draft: states a consequence of a paper’s theorem. States the paper’s corollary: an algebra whose finitistic dimensions are infinite on the left and zero on the right, with the corresponding behaviour of injective generation.
Infinite little finitistic dimensionLittleFinitistic
Unreviewed AI draft: states a paper’s theorem as the paper does. States the main theorem: a finite-dimensional complex algebra with finitely generated modules of finite projective dimension at least 2m − 2 for every m.
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.
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
Hexagon, Hexagon: a repository for research in the mathematical sciences and theoretical computer science, 7 October 2026. Source
hexagon:2610.00140v4 (琪越 唐) simplifies OpenAI’s algebra of infinite little finitistic dimension and extends it to every field, with a Lean formalisation added on 10 October.
References outside the release
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
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 198The 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 198Atlas records no review of whether each linked Lean statement and paper theorem mean the same thing.Open the form
Why this passage is shown
Theorem 1.1
In An algebra of infinite little finitistic dimension, 23 September 2026
How it was found
Its words were compared with the words of OpenAI’s catalogue description.
Words they share
algebra, complex, dimensional, finite
Review
Atlas records no review confirming that this is the theorem OpenAI’s description refers to.
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.
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.