Small presentations of universal groups
A finitely presented group is universal if it contains a copy of every finitely presented group as a subgroup. The problem asks how few defining relations a presentation of one universal group can use, with two generators sufficient for the known constructions.
Why it matters and what counts as progress
Why it matters: A smaller presentation makes universality possible with fewer relations. Its proof must retain the embeddings of all the input groups through each compression step.
What counts as progress: Construct a universal group with fewer defining relations, give a lower bound, or verify that a proposed compression preserves the subgroup embeddings.
How the problem developed
- 1961 · Higman embedding and universal groups [1]
Graham Higman Graham Higman proved that every finitely generated recursively presented group embeds in a finitely presented group. Applying the theorem to a group containing all finitely presented groups gives a finitely presented universal group.
- 1977 · A twenty-one-relator presentation [2]
M. K. Valiev M. K. Valiev constructed a universal group with 21 defining relations.
- 16 Oct 2026 · Thirteen relators [3]
Qiuyu Ren with GPT-6 Astra Qiuyu Ren reported a GPT-6 Astra proof of a universal group with two generators and 13 relations. The construction uses a final extension and generator elimination to reduce the number of relations.
- 5 Nov 2026 · Three relators [4]
Qiuyu Ren with the ChatGPT agent dot Ren reported a universal group with two generators and three relators, crediting a ChatGPT agent with the algebraic result.
AI contributions 2
Three-Relator Universal Group, Four-Relator Adian–Rabin Family, and Unrecognizability of
There is a universal group with a presentation using two generators and three relators. It contains an isomorphic copy of every finitely presented group, its abelianization is infinite cyclic, and one specified generator normally generates it.
A universal group with thirteen relators
There exists a group with a presentation using two generators and thirteen relators that contains a copy of every finitely presented group. The proof builds a six-generator host and compresses it using five HNN identifications and generator elimination.
Sources
- Higman embedding and universal groups
- A twenty-one-relator presentation
- A universal group with thirteen relators
- Later three-relator construction
- Pinned theorem, provenance and checking record
- Universal group with twenty-one defining relations
- Pinned Lean theorem statements
- Pinned project description and provenance
- Pinned project scope and AI disclosure
- Proof structure and earlier sources
- Small undecidable groups and unrecognizable 4-manifolds
Publication history
Three-Relator Universal Group, Four-Relator Adian–Rabin Family, and Unrecognizability of
Daily emails by default, only when there’s an update.