{"schema":"postcutoff/event@1","as_of":"2026-10-30T13:42:00+01:00","url":"https://postcutoff.com/e/2026-10-29-pure-semisimplicity-conjecture-counterexample-gpt-6-astra-lean/","md":"https://postcutoff.com/e/2026-10-29-pure-semisimplicity-conjecture-counterexample-gpt-6-astra-lean/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-29-pure-semisimplicity-conjecture-counterexample-gpt-6-astra-lean","date":"2026-10-29","date_precision":"day","short_title":"Pure semisimplicity conjecture: claimed counterexample, GPT-6 Astra, Lean","deck":null,"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.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.39883: A counterexample to the pure semisimplicity conjecture (Ren)","url":"https://arxiv.org/abs/2610.39883","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"Lean formalization (oasisss6666/pure-semisimplicity-lean)","url":"https://github.com/oasisss6666/pure-semisimplicity-lean","type":"code","group":"primary","domain":"github.com"}],"official":2,"filed":"2026-10-30","updated":"2026-10-30","orgs":["OpenAI","Anthropic"],"title":"Junpeng Ren claims a counterexample to the pure semisimplicity conjecture of ring theory, built with GPT-6 Astra and fully formalised in Lean","summary":"arXiv 2610.39883 (29 Oct 2026), \"A counterexample to the pure semisimplicity conjecture\" by Junpeng Ren, constructs a division ring extension H ⊆ T whose bimodule _H T_T has right dimension sequence (1, 2, 2, 2, …) with T infinite-dimensional over H, which by Simson's reduction yields a right pure semisimple ring that is not of finite representation type. T is a union of fraction fields of quantum Laurent algebras with parameter 1/2. GPT-6 Astra contributed to finding the criterion and to the proof; the author verified it and completed a Lean 4 formalisation that depends only on the standard axioms.","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"],"key_numbers":[],"tags":["math","ring-theory","representation-theory","module-theory","counterexample","gpt-6-astra","gpt-6-1-sol","claude-opus-5-5","lean","preprint"],"science":{"field":"mathematics","subfield":"ring theory / representation theory","problem":"Pure semisimplicity conjecture: every right pure semisimple ring has finite representation type","result":"Claimed counterexample via a division ring extension with right dimension sequence (1, 2, 2, 2, …), through Simson's reduction","open_since":"","ai_system":["GPT-6 Astra","GPT-6.1 Sol","Claude Opus 5.5"],"human_role":"AI-assisted: GPT-6 Astra helped choose the criterion and construct the division rings; the author verified the proofs and completed the Lean formalisation with GPT-6.1 Sol and Claude Opus 5.5","verification":{"key":"lean","label":"Lean-verified","text":"Preprint; Lean 4 formalisation of the main theorem, public repository; not refereed"},"status":"pending","shock":""},"body_md":"## What happened\n\nA ring is right pure semisimple if every right module splits into finitely generated pieces. The pure semisimplicity conjecture says\nsuch rings have only finitely many indecomposable modules, as Artin algebras do. Decades of work reduced it to a hard question about pairs\nof division rings: find an extension whose iterated dual bimodules have a prescribed pattern of dimensions.\n\nJunpeng Ren posted such an extension on 29 Oct, built from quantum Laurent algebras. He credits GPT-6 Astra with choosing the criterion\nand with the construction, and says he verified the proofs and formalised the main theorem in Lean.\n\n## Why it matters\n\nThe conjecture is a central open problem of ring and module theory, and a negative answer settles a long line of work by Simson, Herzog\nand others. The Lean development makes checking possible, though specialists still need to confirm that the formal statement matches the\nconjecture.","disputed":[{"label":"Verification","text":"Preprint; Lean 4 formalisation of the main theorem, public repository; not refereed","sources":[]}],"related":[{"id":"2026-10-30-ai-assisted-results-october-30-listing","url":"https://postcutoff.com/e/2026-10-30-ai-assisted-results-october-30-listing/","date":"2026-10-30","date_precision":"day","short_title":"AI-assisted results, 30 Oct: arXiv announcement of 29–30 Oct","deck":null,"takeaway":"The 30 Oct sweep listed 374 arXiv papers that mention AI. We skimmed all their AI statements and read about 35 PDFs. Six results got their own entries: Das–Fox's Murty–Simon proof (GPT-5.6 Sol found the bound), Colbrook–Stepaniants's spectral isometry proof (found by GPT-6 Astra, Lean), the Θ(log k log log k) ratio of greedy for online Steiner forest (GPT Astra, Lean), Gáspár's Laczkovich solution (key proposition by ChatGPT), Ren's pure-semisimplicity counterexample (GPT-6 Astra, Lean) and Petty's conjecture in dimension 5 (Tencent's hyprover agent). PNNL's OpenConjecture study also has one. This listing has the rest, among them a single-author ChatGPT 6 Pro proof of the Alon–Seymour–Thomas separator conjecture, b₄ ≤ 7 for Borsuk's problem and Fiedorowicz's conjecture from a Claude idea.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":42,"official":42,"filed":"2026-10-30","updated":"2026-10-30","orgs":["OpenAI","Anthropic","Google","Tencent","various researchers"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-30","type":"filed","text":"Created (science agent; arXiv abstract and PDF read, AI declaration and Lean statement quoted)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-30","run":null,"sources_read":"Science agent; arXiv abstract and PDF read, AI declaration and Lean statement quoted","updated":"2026-10-30","human_review":null,"version":{"date":"2026-10-30"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":182,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":121,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":212,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":151,"in_training_data":false}],"short_url":"https://postcutoff.com/s/pure-semisimplicity-conjecture"}