In abstract algebra and functional analysis, few conjectures have cast a longer shadow than those governing group approximations and operator algebras. The third and fourth manuscripts in OpenAI's collection claim to resolve two legendary open problems: the existence of an explicit non-sofic group and the invalidation of Fields Medalist Alain Connes's Rigidity Conjecture.
1. Constructing a Non-Sofic Group
Sofic groups—introduced by Mikhail Gromov in 1999—are groups whose multiplication tables can be asymptotically approximated by finite permutation matrices. The paper constructs an explicit non-sofic group using the unit group of the binary Leavitt algebra:
- Isolates a finitely generated property-(T) subgroup.
- Deploys expander decomposition theorems on candidate permutation actions.
- Leverages self-similarity to force an embedding of Thompson's group (V), yielding a direct structural contradiction.
2. The Disproof of Connes's Rigidity Conjecture
Connes conjectured that an infinite-conjugacy-class (ICC) group with Kazhdan's property (T) is uniquely determined up to isomorphism by its group von Neumann algebra (L(G)).
The paper refutes this by constructing an infinite family of pairwise nonisomorphic property-(T) groups sharing the exact same von Neumann algebra:
Verified Primary Sources & Citations
Every empirical claim, economic metric, and technical assertion in this publication is cross-referenced against primary research literature and regulatory records:
-
OpenAI Research: Ten Advances in Mathematics and Theoretical Computer Science ↗
249-page collection of Lean 4 formalizations, Cohn-Elkies sphere bounds, and non-sofic constructions.
-
Lean 4 Interactive Theorem Prover Community & Mathlib ↗
Machine-checked formal verification repository for the discrete geometry and operator algebra theorems.
-
Annals of Mathematics — Cohn-Elkies Linear Programming Bounds ↗
Foundational discrete geometry papers governing sphere packing in high Euclidean dimensions.

Discussion & Insights (0)
Join the discussion on Career Circle
Sign in or create a free account to post comments, ask questions, and engage with the author.