Compilation··3:06·Group theory

Cannon's Conjecture, Thompson's Group F and 7 More in Group Theory

Compilation · 3:06 · 15 October 2026Watch on YouTube →

Watch on YouTubeAbout the problem →

About this video

9 results from OpenAI's public mathematics catalogue, one per chapter. Each chapter names the problem, shows the real objects, and states what OpenAI claims; none of it is peer reviewed yet.

Chapters:
0:00 Cannon's Conjecture
0:21 Finitely Presented Burnside Problem
0:41 Thompson's Group F
1:02 Eilenberg–Ganea Conjecture
1:22 The Boone–Higman Conjecture
1:42 Dixmier's Unitarizability Problem
2:03 A Hyperbolic Group That Is Not Residually Finite
2:25 Quasi-Isometric Rigidity, Polycyclic Groups
2:46 Gersten's Conjecture

Cannon's Conjecture: Cannon's conjecture asks: if a hyperbolic group's boundary, its "edge at infinity", is a 2-sphere, must the group act geometrically on hyperbolic 3D space? Cannon and Swenson stated it in 1998, and it has been one of…
Explained: gradientdamage.com/p/246
Paper: github.com/openai/math/blob/main/preprints/A-Modulus-Proof-of…

Finitely Presented Burnside Problem: Burnside asked in 1902: if every element of a group returns to the start after finitely many steps, must a finitely generated group be finite? The answer is no, and Grigorchuk's tree group (1980) is the classic example…
Explained: gradientdamage.com/p/247
Paper: github.com/openai/math/blob/main/preprints/An-infinite-finite…

Thompson's Group F: Thompson's group F consists of the piecewise-linear maps of the interval [0, 1] to itself whose kinks sit at dyadic points and whose slopes are powers of 2.
Explained: gradientdamage.com/p/248
Paper: github.com/openai/math/blob/main/preprints/Thompsons-group-F-…

Eilenberg–Ganea Conjecture: Every group has a classifying space: a shape built from cells (points, edges, squares, cubes) on which the group acts.
Explained: gradientdamage.com/p/249
Paper: github.com/openai/math/blob/main/preprints/A-finitely-generat…

The Boone–Higman Conjecture: A group has a decidable word problem when a computer can always tell whether a product of generators equals the identity.
Explained: gradientdamage.com/p/250
Paper: github.com/openai/math/blob/main/preprints/Finite-algebraic-e…

Dixmier's Unitarizability Problem: OpenAI claims a solution to Dixmier's 1950 unitarizability problem for every discrete group: a group is amenable exactly when every uniformly bounded representation on a Hilbert space is similar to a unitary one.
Explained: gradientdamage.com/p/251
Paper: github.com/openai/math/blob/main/preprints/Unitarizability-Im…

A Hyperbolic Group That Is Not Residually Finite: Is every hyperbolic group residually finite, so that every nontrivial element shows up in some finite quotient? This has been a famous open question in geometric group theory.
Explained: gradientdamage.com/p/252
Paper: github.com/openai/math/blob/main/preprints/a-torsion-free-hyp…

Quasi-Isometric Rigidity, Polycyclic Groups: Draw a group as a map, with one dot per element and a link for every basic move, and then zoom out until only the large-scale shape is left.
Explained: gradientdamage.com/p/255
Paper: github.com/openai/math/blob/main/preprints/quasi-isometric-re…

Gersten's Conjecture: A one-relator group is built from a few symbols and a single rule.
Explained: gradientdamage.com/p/258
Paper: github.com/openai/math/blob/main/preprints/Baumslag-Solitar-f…

The animations illustrate the results; they are not proofs.

Gradient Damage: mathematics you can see, equations you can hear.
youtube.com/@gradientdamage

Chapters

One problem per chapter. Each name links to the result's own page, each time to that moment on YouTube.

  1. Cannon's Conjecture Group theory
  2. Finitely Presented Burnside Problem Group theory
  3. Thompson's Group F Group theory
  4. Eilenberg–Ganea Conjecture Group theory
  5. The Boone–Higman Conjecture Group theory
  6. Dixmier's Unitarizability Problem Group theory
  7. A Hyperbolic Group That Is Not Residually Finite Group theory
  8. Quasi-Isometric Rigidity, Polycyclic Groups Group theory
  9. Gersten's Conjecture Group theory

Chapter 1: about the problem

Group theory·OpenAI Math·Result 246

Cannon's conjecture

Every word-hyperbolic group with boundary homeomorphic to S2 admits a proper cocompact isometric action on hyperbolic three-space with finite kernel, proving Cannon's conjecture. Every torsion-free such group is therefore the fundamental group of a closed hyperbolic three-manifold. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 2: about the problem

Group theory·OpenAI Math·Result 247·from 0:21

An infinite finitely presented residually finite 2-group and a finitely presented nil algebra

Constructs an infinite finitely presented residually finite group whose elements all have finite 2-power order, answering the finitely presented Burnside problem negatively even in this class. The construction also yields an infinite-dimensional finitely presented nil associative 𝔽2-algebra and a finitely presented infinite-dimensional algebraic unitization, giving negative answers to the corresponding nilpotence and Kurosh finiteness questions. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 3: about the problem

Group theory·OpenAI Math·Result 248·from 0:41

Thompson's group F is nonamenable

Proves that Thompson's group F, the group of dyadic piecewise linear homeomorphisms of the interval, is nonamenable, resolving its longstanding amenability problem. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 4: about the problem

Group theory·OpenAI Math·Result 249·from 1:02

A finitely generated Eilenberg–Ganea counterexample

Constructs a finitely generated residually finite group with integral cohomological dimension two and geometric dimension three, disproving the Eilenberg–Ganea conjecture. It has no two-dimensional classifying space, even with infinitely many cells. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 5: about the problem

Group theory·OpenAI Math·Result 250·from 1:22

Boone–Higman embeddings with higher finiteness

A finitely generated group has decidable word problem exactly when it embeds in a finitely presented simple group, proving the Boone–Higman conjecture. The target can have type F∞: a classifying space with finitely many cells in each dimension. A single group of type F∞ can also contain every finitely presented group. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 6: about the problem

Group theory·OpenAI Math·Result 251·from 1:42

Amenability, unitarizability, and strong Ulam stability

Resolves Dixmier's problem for all discrete groups: amenability is equivalent to every uniformly bounded Hilbert-space representation being similar to a unitary representation. For countable discrete groups, amenability is also equivalent to strong Ulam stability: sufficiently accurate unitary approximate representations are uniformly close in operator norm to genuine representations on the same, possibly infinite-dimensional, Hilbert space. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 7: about the problem

Group theory·OpenAI Math·Result 252·from 2:03

A torsion-free hyperbolic group that is neither residually finite nor linear over any field

Constructs a torsion-free word-hyperbolic group that is not residually finite, answering the residual-finiteness question negatively. One fixed nonidentity element is killed by every finite-dimensional linear representation over every commutative field, so the group is not linear over any such field. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 8: about the problem

Group theory·OpenAI Math·Result 255·from 2:25

Quasi-isometric recognition of virtually polycyclic groups

Proves that every finitely generated group quasi-isometric to a finitely generated virtually polycyclic group is virtually polycyclic, resolving the Eskin–Fisher–Whyte lattice-recognition conjecture. Equivalently, a group quasi-isometric to a lattice in a connected simply connected solvable Lie group is virtually a uniform lattice in some such Lie group, possibly a different one. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 9: about the problem

Group theory·OpenAI Math·Result 258·from 2:46

Gersten’s conjecture and virtual compact specialness of one-relator groups

Proves Gersten's conjecture: every finitely generated one-relator group containing no Baumslag–Solitar subgroup BS(m,n), with m,n ≠ 0, is word-hyperbolic. It also proves that every word-hyperbolic one-relator group is virtually compact special.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Topics

Cannon's conjectureBurnside problemThompson's group FEilenberg-Ganea conjectureBoone-Higman conjectureDixmier problemhyperbolic groupquasi-isometric rigidityGersten conjectureGroup theoryOpenAI mathAI proofAI mathematicsmathsGradient Damage