--- id: "2026-10-06-free-group-factors-isomorphism-openai" url: "https://postcutoff.com/e/2026-10-06-free-group-factors-isomorphism-openai/" as_of: "2026-11-22T13:32:00+01:00" date: "2026-10-06" date_precision: day category: science importance: 5 confidence: medium status: [Result confirmed] verification: Expert-checked sources: 4 editor: human editor human_review: null version: "2026-10-19" --- As of: 2026-11-22 13:32 CET. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/e/2026-10-06-free-group-factors-isomorphism-openai/ # OpenAI model claims the free group factor problem Full title: OpenAI model claims the free group factor problem: L(F₂) ≅ L(F₃), so all free group factors are isomorphic (Lean-formalized) Family 287 of OpenAI's 6 Oct 2026 math release claims an affirmative answer to the free group factor isomorphism problem, a central open question of von Neumann algebra theory. The 23-page manuscript says L(F₂) and L(F₃) are isomorphic, so by the Dykema–Rădulescu dichotomy all interpolated free group factors, including L(F∞), are isomorphic and their fundamental group is ℝ₊. The result is formalized in Lean by OpenAI, and a reasoning summary is published. ## Key facts - Paper: 'An isomorphism of the free group factors' (dated 23 Sep 2026, 23 pages): 'We solve the free group factor isomorphism problem affirmatively by proving that L(F₂) and L(F₃) are isomorphic as tracial von Neumann algebras' - Lean scope: 'interpolated free group factors with any parameters r,s>1, including the infinite parameter, are normally trace-preservingly isomorphic'; the fundamental-group consequence is not a separate formal statement - First expert follow-up (14 Oct): Dima Shlyakhtenko (UCLA, free probability), arXiv 2610.19590, 'Building on OpenAI's proof of isomorphism of free group factors', gives a self-contained proof that the C*-algebra generated by a free semicircular n-tuple does not depend on n ∈ {2, 3, …, ∞}, which implies L(F_n) ≅ L(F_2). His reformulation centres on an 'Automorphism Approximation Property'. Statement: 'This work is based on [9] and proofs that are AI-generated. ChatGPT 6.0 Pro was used in the analysis of OpenAI's proof, and in preparation of this manuscript.' - Reasoning summary (abridged chain of thought): the model first tried rigidity and free-entropy obstructions to an isomorphism (Popa, Boutonnet–Drimbe–Ioana–Popa, Peterson, Jung, Hayes) before finding the construction ## What happened OpenAI's catalogue says family 287 resolves the free group factor problem: the von Neumann algebras generated by the free groups on two and three generators are isomorphic. A classical dichotomy then makes all of them isomorphic. The Lean formalization covers the isomorphism of all interpolated free group factors. On 14 Oct Dima Shlyakhtenko posted the first specialist follow-up ([arXiv 2610.19590](https://arxiv.org/abs/2610.19590)). He shows that OpenAI's argument can be modified to prove a formally stronger C*-algebra statement: C*(S₁, …, S_n) ≅ C*(S₁, S₂) for free semicircular systems and every n ∈ {2, 3, …, ∞}. Reduced free products of copies of the Jiang–Su algebra are likewise isomorphic for different n. Reduced free group C*-algebras, which by Pimsner–Voiculescu are not isomorphic for different ranks, still have strong free absorption properties. His proof is self-contained and "does not rely on the results of [9]". He writes that the work "is based on [9] and proofs that are AI-generated" and that ChatGPT 6.0 Pro was used to analyse OpenAI's proof. ## Why it matters The problem has been one of the best-known open questions in operator algebras for decades. An affirmative answer, especially one checked by machine, would reshape the field. Until specialists confirm that the Lean definitions of group von Neumann algebras and interpolated factors match the classical ones, and read the construction, it is a claim. ## Your AI and this story - GPT-6.2 Astra (training cutoff May 2026): 128 days after its cutoff - Claude Opus 5.5 (training cutoff June 2026): 98 days after its cutoff - Gemini 4 Hydrogen (training cutoff March 2026): 189 days after its cutoff - Grok 4.7 (training cutoff May 2026): 128 days after its cutoff ## Sources 1. [Paper: An isomorphism of the free group factors](https://github.com/openai/math/blob/main/preprints/An-isomorphism-of-the-free-group-factors-September-23-2026/An-isomorphism-of-the-free-group-factors-September-23-2026.pdf) (github.com, paper) 2. [Reasoning summary: Isomorphism of free group factors](https://github.com/openai/math/blob/main/reasoning_traces/free-group-factor-isomorphism.pdf) (github.com, paper) 3. [Shlyakhtenko: On the isomorphism of semicircular algebras (arXiv 2610.19590)](https://arxiv.org/abs/2610.19590) (arxiv.org, paper) 4. [Lean scope note for family 287](https://github.com/openai/math/blob/main/lean/docs/287.md) (github.com, code) ## Changes - 2026-10-19: Status pending → confirmed (a leading specialist published a self-contained proof; same standard as the Brennan entry) - 2026-10-15: Added Shlyakhtenko's self-contained reworking and semicircular C*-algebra extension (arXiv 2610.19590) - 2026-10-07 (filed): Created from the openai/math repository ## Related - 2026-10-14: [Mid-October 2026: arXiv results with disclosed AI help](https://postcutoff.com/e/2026-10-14-ai-assisted-results-mid-october-2026/index.md) - 2026-10-06: [OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems](https://postcutoff.com/e/2026-10-06-openai-math-release-722-manuscripts/index.md) - 2026-08-01: [OpenAI's unreleased 'Astra' model claims ten advances in maths and theoretical CS, with Lean proofs](https://postcutoff.com/e/2026-08-01-openai-astra-ten-advances/index.md)