A universal group with thirteen relators

Qiuyu Ren

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.

What was already known

Valiev’s 21-relator universal group and the simulator tools adapted from Kegel, Li and Ren’s smaller undecidable group constructions.

AI involvement AI-led

Qiuyu Ren credits GPT-6 Astra with finding the proof and drafting the manuscript under his direction. Ren guided revisions. The proof credits earlier Higman, Valiev and Kegel–Li–Ren constructions.

Importance Notable

The construction reduces the earlier universal group from 21 defining relations to 13.

Technical verification Formal (Lean)

The project reports Lean compilation and an axiom audit of the exact existence theorem. It supplies a comparator target and reports no outside human check.

Formal checking

The project reports Lean compilation and an axiom audit of the exact existence theorem. It supplies a comparator target and reports no outside human check.

Checker
Qiuyu Ren’s project via Lean 4
Scope
UniversalGroup.exists_two_generator_thirteen_relator_universal_group, using the pinned Mathlib development and a source-reported axiom audit.
Basis
Reported by the linked checker

Human understanding Partial

Ren reports understanding some parts of the proof. The source does not describe full human understanding of the compression argument.

Correction and publication history