A torsion-free hyperbolic group that is neither residually finite nor linear over any field
OpenAI groups related papers into a “family”. OpenAI’s catalogue describes this one:
Constructs a torsion-free word-hyperbolic group that is not residually finite, answering the residual-finiteness question negatively. One fixed nonidentity element is killed by every finite-dimensional linear representation over every commutative field, so the group is not linear over any such field. (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 two independent assessments disagree on how much of the result described above is expressed by the Lean statements.Read the assessments
Possible match to OpenAI’s description, selected because it shares the most wording. No review confirming the selection is recorded.
Let G be the finitely generated torsion-free word-hyperbolic group constructed in Theorem 1.1. For every commutative field K, every integer n\geq 1, and every homomorphism \rho:G\to\mathrm{GL}_n(K),
R_f(G)\subseteq\ker\rho.
Consequently, one fixed nonidentity element of G is killed by all these representations, simultaneously over all such fields and dimensions. In particular, G is not linear over any commutative field.
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 torsion-free word-hyperbolic group that is not residually finite, answering the residual-finiteness question for hyperbolic groups negatively.
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.
TorsionFreeHyperbolic
The paper states
Corollary 1.2(Finite-dimensional linear obstruction)
Let G be the finitely generated torsion-free word-hyperbolic group constructed in Theorem 1.1. For every commutative field K, every integer n\geq 1, and every homomorphism \rho:G\to\mathrm{GL}_n(K),
R_f(G)\subseteq\ker\rho.
Consequently, one fixed nonidentity element of G is killed by all these representations, simultaneously over all such fields and dimensions. In particular, G is not linear over any commutative field.
The words they share: element, field, finite, finitely, free, generated, group, hyperbolic, main, nonidentity, torsion, word.
Possible Lean counterpart
Selected from shared wording. No review of whether the statements mean the same thing is recorded.
TorsionFreeHyperbolic.lean, the release lists it as a main result.
theoremmain : ∃ (G : Type) (_ : Group G), TorsionFree G ∧ WordHyperbolic G ∧ ¬ Group.ResiduallyFinite G := 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.
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”.
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 disagree on how much of the advertised result the Lean statements express. MathVet finds that the Lean statements express or imply the whole advertised result (their term: “full”); cert-machine finds that the Lean statements express a narrower statement than the advertised result (their term: “NARROWER — DECLARED”).
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:main : ∃ (G : Type) (_ : Group G), TorsionFree G ∧ WordHyperbolic G ∧ ¬ Group.ResiduallyFinite G with WordHyperbolic = finite generating set whose Cayley graph has uniformly thin geodesic triangles (all three sides, SideThin). The summary’s nonlinearity claim (one fixed element killed by every finite-dimensional representation over every commutative field) is not separately stated; it follows from the stated non-residual-finiteness via Mal’cev’s theorem (docs: ‘Nonlinearity over every field is not a separate conclusion’).
Definitions the group asks readers to compare with the paper:Custom hyperbolicity: WordHyperbolic G := ∃ S finite, (mulCayley S).Connected ∧ ∃ δ, ∀ geodesic triangles, SideThin... (standard thin-triangles definition on the Cayley graph, hand-written, not a Mathlib notion).
“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.
cert-machine finds that the Lean statements express a narrower statement than the advertised result (their term: “NARROWER — DECLARED”).
The gap they name:The non-linearity clause (one fixed nonidentity element killed by every finite-dimensional representation over every field) is not stated; it is a classical consequence (Malcev) of the stated non-residual-finiteness of a finitely generated group, not a separate conclusion.
“NARROWER — DECLARED”, in their words: The challenge statements state less than the headline, and OpenAI’s Lean note says so.
Their method: Every Comparator challenge re-run on Linux with nanoda switched on, decided by a preregistered rule.
The residual-finiteness question for hyperbolic groups asks whether every nonidentity element survives in some finite quotient. The formalized result gives a negative answer by constructing a torsion-free word-hyperbolic group that is not residually finite.
Nonlinearity over every field is not a separate conclusion of the statement linked below.
AI-drafted comparisons, with no recorded human review
Torsion-free hyperbolic group that is not residually finiteTorsionFreeHyperbolic
Unreviewed AI draft: states a paper’s theorem as the paper does. States the main theorem: a torsion-free word-hyperbolic group that is not residually finite. The nonlinearity corollary is not a separate conclusion of the 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.
Torsion-free hyperbolic group that is not residually finiteTorsionFreeHyperbolic
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.
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
No paper elsewhere in the release cites this family’s papers.
Follow-up work by others
Apsiape, hyperbolic-group-not-sofic, 8 October 2026. Source
A repository claims that the torsion-free hyperbolic group of this family is not sofic, which would be an extraordinary extension; the claim was relayed by a topologist and has not been checked by anyone we have found.
homeowmorphism, feat(Other): mark residual finiteness of hyperbolic groups as solved (PR 6921), 7 October 2026. Source
Residual finiteness of hyperbolic groups marked solved with answer False; no formal proof link because of the hyperbolicity definition gap.
Apsiape, hyperbolic-group-not-sofic, 7 October 2026. Source
Non-soficity of OpenAI’s hyperbolic group with Lean.
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.
Mahan Mj reports that Astra produced a group-ring criterion for non-residual finiteness that could also certify non-soficity, building on the earlier AI non-sofic group.
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 252The 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 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 less than the headline, and OpenAI’s Lean note says so.
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 with Lean’s kernel: accepted (the check took 109 s; peak memory 6.3 GiB).
Date
11 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.
Torsion-free hyperbolic group that is not residually finite
Role
the release lists it as a main result
Paired with
Corollary 1.2 (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.