Pure semisimplicity conjecture: claimed counterexample, GPT-6 Astra, Lean
Awaiting review
Importance: major (4 of 5)The takeaway
The pure semisimplicity conjecture says a ring over which every module is a direct sum of finitely generated ones must have finite representation type. It holds for Artin algebras (Auslander) and PI rings (Simson, Herzog). Simson reduced a counterexample to a ‘generalized Artin problem’ about division ring extensions. On 29 Oct Junpeng Ren posted a division ring extension that solves it. The AI declaration says GPT-6 Astra helped choose the criterion and develop the proof, ‘in particular the construction of the division rings’. The main theorem is fully formalised in Lean 4 in a public repository. It is a preprint, not refereed.
Status
- Claim
Awaiting review
- Our reporting
- Medium confidence
- Verification
- Lean-verified
- Importance
- Major (4 of 5)
- Last verified
- 30 October 2026
Your AI and this story
- GPT-6 Astra182 days after its cutoff
- Claude Opus 5.5121 days after its cutoff
- Gemini 4 Argon212 days after its cutoff
- Grok 4.7151 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 121 days before it.
Key facts
- Claim (abstract): ‘a division ring extension H ⊆ T is constructed such that the bimodule _H T_T has right dimension sequence (1, 2, 2, 2, …) and T is infinite-dimensional as a left H-space’; T is ‘the union of the fraction division rings of the nearest-neighbour quantum Laurent algebras with parameter 1/2’
- Background (paper): Auslander proved the conjecture for Artin algebras; Simson and Herzog for PI rings, and it suffices to check hereditary rings; Herzog showed a counterexample can be a triangular matrix ring over two division rings; Simson translated existence into a generalized Artin problem on dimensions of iterated dual bimodules (the classical Artin problem was solved by Cohn and Schofield); García and Šaroch studied candidate classes
- AI declaration (verbatim): ‘GPT-6 Astra (OpenAI) contributed to the mathematical exploration leading to the choice of the criterion recalled in Section 3, as well as to the development of the proof of the main theorem in Sections 4 to 6, in particular the construction of the division rings T and H_r. The author independently verified all proofs and completed the Lean 4 formalization and the editing of the final manuscript with the assistance of GPT-6.1 Sol (OpenAI) and Claude Opus 5.5 (Anthropic).’
- Formal verification (paper): ‘The main theorem has been fully formalized in Lean 4. The formalization has passed a fresh replay by the Lean kernel … depends only on the axioms propext, Classical.choice, and Quot.sound’; Lean v4.34.0, Mathlib commit 5ed2965, github.com/oasisss6666/pure-semisimplicity-lean
- Open point for readers: whether the Lean statement captures the full ring-theoretic conclusion or the division-ring criterion of Section 3 (the abstract states the bimodule construction)
- Verification status: preprint with a public Lean development (not checked by us); single author supported by the China Scholarship Council; not refereed; no reaction found on 30 Oct
What happened
A ring is right pure semisimple if every right module splits into finitely generated pieces. The pure semisimplicity conjecture says such rings have only finitely many indecomposable modules, as Artin algebras do. Decades of work reduced it to a hard question about pairs of division rings: find an extension whose iterated dual bimodules have a prescribed pattern of dimensions.
Junpeng Ren posted such an extension on 29 Oct, built from quantum Laurent algebras. He credits GPT-6 Astra with choosing the criterion and with the construction, and says he verified the proofs and formalised the main theorem in Lean.
Why it matters
The conjecture is a central open problem of ring and module theory, and a negative answer settles a long line of work by Simson, Herzog and others. The Lean development makes checking possible, though specialists still need to confirm that the formal statement matches the conjecture.
What is disputed or not yet verified
| Verification | Preprint; Lean 4 formalisation of the main theorem, public repository; not refereed |
|---|
Sources
2 sources from 2 sites. Numbers match the chips in the text.
2 sources: 2 primary
Primary
Changes
- Filed (science agent; arXiv abstract and PDF read, AI declaration and Lean statement quoted)