{"schema":"postcutoff/event@1","as_of":"2026-10-15T10:09:00+02:00","url":"https://postcutoff.com/e/2026-10-13-ulam-problem-lie-groups-countably-representable-gpt-6-astra/","md":"https://postcutoff.com/e/2026-10-13-ulam-problem-lie-groups-countably-representable-gpt-6-astra/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-13-ulam-problem-lie-groups-countably-representable-gpt-6-astra","date":"2026-10-13","date_precision":"day","short_title":"Ulam's question answered","deck":"Every Lie group is a group of permutations of a countable set (Monod & Thom; key construction from GPT-6 Astra)","takeaway":"Nicolas Monod and Andreas Thom prove that every Lie group embeds in the permutation group of a countable set, answering a classical question of Ulam. They say the key deformation was first built by GPT-6 Astra over three weeks of discussions; Thom earlier criticised how OpenAI credited human work.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.18464: Lie groups are countably representable (Monod & Thom)","url":"https://arxiv.org/abs/2610.18464","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"Andreas Thom (guest post on Tao's blog, Sept 11): On the existence of non-sofic groups","url":"https://terrytao.wordpress.com/2026/09/11/on-the-existence-of-non-sofic-groups/","type":"discussion","group":"reactions","domain":"terrytao.wordpress.com"}],"official":1,"filed":"2026-10-14","updated":"2026-10-14","orgs":["EPFL","TU Dresden","OpenAI"],"title":"Ulam's question answered: every Lie group is a group of permutations of a countable set (Monod & Thom; key construction from GPT-6 Astra)","summary":"arXiv 2610.18464 (13 Oct 2026), \"Lie groups are countably representable\" by Nicolas Monod and Andreas Thom, proves that every Lie group can be realised by permutations of a countable set, answering a question Ulam asked in 1960 (and hence that every locally compact second countable group is countably representable). The abstract says \"the key deformation construction originated in an argument produced by OpenAI's GPT 6 Astra during extended mathematical discussions\"; the authors then developed, checked and substantially rewrote it, and found that parts were already in the literature. Thom had disputed OpenAI's attribution of an earlier Astra result in September.","key_facts":["Paper: arXiv 2610.18464 [math.GR], 13 Oct 2026, by Nicolas Monod and Andreas Thom","Theorem A: every Lie group (second countable) is countably representable, i.e. embeds in Sym(N). Corollary B: every locally compact second countable group is countably representable","History in the paper: Schreier and Ulam showed in 1935 that R is countably representable; Ulam asked whether all Lie groups are [Ula60, II.7; Ula64, V.2]. Linear Lie groups were known (Thomas 1999; Kallman 2000; Ershov–Churkin 2004), and Conversano–Monod (J. Algebra 2024) reduced the problem to connected simple Lie groups. The remaining obstacle was non-linear central extensions","Key new ingredient (Theorem C): a countable-index subalgebra A of R with a continuous one-parameter family of ring homomorphisms from the inclusion back to a countable real-closed field, which makes the cohomological obstruction from central extensions vanish","AI disclosure: 'The key countable-index deformation was first constructed by OpenAI's GPT 6 Astra during extended mathematical discussions. The argument was subsequently developed, checked and substantially rewritten by the authors'","Acknowledgments: 'The proof emerged from three weeks of discussions with OpenAI's GPT, initially aimed at exploring SL3(R) with ring deformations and K-theoretic arguments. GPT Astra eventually produced the countable-index deformation underlying Theorem C. We then suggested extending the argument to SLn(R) and other simple Lie groups'","Prior art the authors found while checking: 'substantial parts of the argument already appear, notably the algebraic-analytic construction of Parusiński–Rond [PR20]'; the simultaneous Puiseux embedding with prescribed residues (Lemma 2.4) and its combination with countable-index gluing 'appear to be new and creative'","Context: in September Thom argued that OpenAI's announced non-sofic group result relied on his 2019 work with Gábor Kun and that OpenAI's attribution was misleading; this paper credits Astra openly"],"key_numbers":[],"tags":["math","group-theory","lie-groups","ulam","gpt-6-astra","openai","ai-for-math"],"science":{"field":"mathematics","subfield":"group theory / Lie groups","problem":"Ulam's problem: is every Lie group countably representable (isomorphic to a group of permutations of a countable set)?","result":"Yes: every Lie group, and hence every locally compact second countable group, embeds in Sym(N).","open_since":"1960","ai_system":["GPT-6 Astra"],"human_role":"AI-assisted: GPT-6 Astra produced the key countable-index deformation for SL3(R) after three weeks of discussion; the authors extended it to all simple Lie groups, checked it and rewrote the proof","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint by two established group theorists; no formal proof"},"status":"pending","shock":"A question from Ulam's problem book fell after a model supplied the step the human reduction had been missing, and the co-author is one of the most prominent critics of OpenAI's maths attributions."},"body_md":"## What happened\n\nOn 13 Oct 2026 Nicolas Monod and Andreas Thom posted [arXiv 2610.18464](https://arxiv.org/abs/2610.18464), proving that every Lie group can be realised as a group of permutations of a countable set. Schreier and Ulam had shown this for R in 1935, which led Ulam to ask whether it holds for all Lie groups. Linear Lie groups were known, and Conversano and Monod reduced the question to connected simple Lie groups in 2024. The remaining case was simple groups that are only central extensions of linear groups, where the cohomological obstruction lives on \"wild\" subgroups of countable index.\n\nThe new tool is Theorem C: a subalgebra of R of countable index together with a continuous path of ring homomorphisms from a countable real-closed field to the inclusion, built from Puiseux series over fields of analytic functions and glued along countably many pieces. The continuity lets the authors trivialise the central extension on the corresponding subgroups.\n\nThe authors give a detailed account of the AI's role. The proof \"emerged from three weeks of discussions with OpenAI's GPT\", which started on SL3(R). \"GPT Astra eventually produced the countable-index deformation underlying Theorem C.\" The humans proposed the extension to SLn(R) and other simple groups, checked and rewrote everything, and found that a large part of the construction already appears in Parusiński–Rond (2020). They still call the Puiseux embedding with prescribed residues and its gluing \"new and creative\".\n\nAndreas Thom is the Dresden group theorist who, in September, criticised OpenAI's framing of Astra's non-sofic group result as ignoring his work with Gábor Kun (see [Astra's ten advances](/e/2026-08-01-openai-astra-ten-advances/)). His recent Mathstodon posts did not mention this paper (checked 14 Oct). No Hacker News thread was found (Algolia, 14 Oct).\n\n## Why it matters\n\nIt is a classical, well-known question answered with a clearly credited AI contribution to the decisive step, and with an unusually frank account of what was new and what turned out to be in the literature. It comes from a mathematician who had publicly challenged AI-maths attribution, which makes the credit given here more significant.","disputed":[{"label":"Verification","text":"Unrefereed preprint by two established group theorists; no formal proof","sources":[]}],"related":[{"id":"2026-10-14-ai-assisted-results-mid-october-2026","url":"https://postcutoff.com/e/2026-10-14-ai-assisted-results-mid-october-2026/","date":"2026-10-14","date_precision":"day","short_title":"Mid-October 2026: arXiv results with disclosed AI help","deck":null,"takeaway":"The 13 Oct arXiv listing alone brought a human write-up of GPT-6 Astra's rational exponents proof, Ulam's Lie group question answered with an Astra construction, a better-than-2 k-median algorithm, and about a dozen smaller results whose AI statements range from 'suggested by ChatGPT' to 'GPT 6 Pro was used … to obtain all other new results'.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":20,"official":19,"filed":"2026-10-14","updated":"2026-10-15","orgs":["OpenAI","Anthropic","various mathematicians"]},{"id":"2026-10-06-openai-math-release-722-manuscripts","url":"https://postcutoff.com/e/2026-10-06-openai-math-release-722-manuscripts/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems","deck":"Including quasi-Riemann, Unique Games, Hodge for CM abelian varieties and free group factors","takeaway":"If even a fraction of these results hold up, this is the largest single jump in mathematical knowledge on record, produced by an AI system in about six weeks.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":84,"official":13,"filed":"2026-10-07","updated":"2026-10-15","orgs":["OpenAI"]},{"id":"2026-08-01-openai-astra-ten-advances","url":"https://postcutoff.com/e/2026-08-01-openai-astra-ten-advances/","date":"2026-08-01","date_precision":"day","short_title":"OpenAI's unreleased 'Astra' model claims ten advances in maths and theoretical CS, with Lean proofs","deck":null,"takeaway":"It moved the frontier from individual AI-assisted results to a lab producing batches of significant theorems.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":14,"official":5,"filed":"2026-09-29","updated":"2026-10-13","orgs":["OpenAI"]}],"people":[{"id":"terence-tao","name":"Terence Tao","url":"https://postcutoff.com/person/terence-tao/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-14","type":"filed","text":"Created from the arXiv paper (arXiv AI-disclosure list)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-14","run":null,"sources_read":"The arXiv paper (arXiv AI-disclosure list)","updated":"2026-10-14","human_review":null,"version":{"date":"2026-10-14"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":166,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":105,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":196,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":135,"in_training_data":false}],"short_url":"https://postcutoff.com/s/ulam-question-answered"}