Result 287, Operator algebras

Isomorphism of the free group factors

Resolves the free group factor isomorphism problem: L(F2)≅L(F3)L(\mathbb F_2)\cong L(\mathbb F_3), and hence all interpolated free group factors, including L(F∞)L(\mathbb F_\infty), are isomorphic. Their common factor has fundamental group R>0\mathbb R_{\gt 0}.

The bigger picture

Why it matters

An algebra built from a free group might forget how many generators the group has. The manuscript claims this happens throughout the interpolated free group factors, removing generator count as a way to distinguish these algebras.

What changes?

The unreviewed manuscript reports a trace-preserving isomorphism between the free group factors on two and three generators. A free group has no relations beyond cancellation; its factor is an associated algebra of bounded operators, with a trace serving as an average. The classical free group factor alternative would then identify all interpolated free group factors, a continuous family extending these examples, including the infinitely generated one. Their common factor would have fundamental group equal to all positive real numbers.

What does that help mathematicians do?

If established, this would rule out distinguishing members of this family by any property preserved under trace-preserving isomorphism. Different generator counts would describe different constructions, not different resulting algebras. The fundamental-group conclusion also says that every positive amplification, a standard way to rescale a factor, yields an isomorphic algebra. Researchers could therefore treat both the family's parameter and these rescalings as changes that leave its isomorphism class unchanged.

Are there practical applications?

The immediate value is foundational, in the classification of operator algebras. The claimed result would let researchers transfer statements preserved by isomorphism between these free group factors and rule out attempts to separate them using such properties. The supplied sources describe no practical algorithm or physical application.

This section was generated by GPT-6 Astra Medium. This explanation is based on the result summary and manuscript abstracts below. This context is separate from OpenAI's source text.

Manuscript

An isomorphism of the free group factors

September 23, 2026 23 pages

We solve the free group factor isomorphism problem affirmatively by proving that L(F2)L(\mathbb F_2) and L(F3)L(\mathbb F_3) are isomorphic as tracial von Neumann algebras. The classical free group factor alternative then implies that all interpolated free group factors, including L(F∞)L(\mathbb F_\infty), are isomorphic and have fundamental group R>0\mathbb R_{\gt 0}.

Cite (BibTeX)
@misc{OAI:An-isomorphism-of-the-free-group-factors-September-23-2026,
  author = {{OpenAI}},
  title = {{An isomorphism of the free group factors}},
  howpublished = {OpenAI Math Release preprint
                  \href{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}{OAI:An-isomorphism-of-the-free-group-factors-September-23-2026}},
  year = {2026}
}

Lean formalization

OpenAI's note on what the formalization covers, from lean/docs/287.md.

Isomorphism of the free group factors

The following describes the scope of the Lean formalization related to the following accompanying paper(s):

Scope

The free group factor problem asks whether the von Neumann algebras of free groups of different ranks are isomorphic. The formalization proves that interpolated free group factors with any parameters r,s>1r,s>1, including the infinite parameter, are normally trace-preservingly isomorphic. The paper's fundamental-group conclusion is a further consequence rather than a separate selected statement here.

Comparator links

Result Comparator statement
Isomorphism of all interpolated free group factors InterpolatedFactors.lean

Data from github.com/openai/math at commit adc7f12, committed October 6, 2026 at 21:58 UTC, last checked for changes about 7 hours ago. Titles, subjects, summaries, abstracts and Lean notes are OpenAI's; page counts are read from the PDFs. The map, related results, search, kinds of results and the named-problem index are Emergent Mind's, built with text embeddings and an LLM, and may contain errors.

An Emergent Mind Labs project. Emergent Mind is not affiliated with OpenAI. None of these results has been peer reviewed. Cite the manuscripts themselves, using the BibTeX on each result's page.