Three-Relator Universal Group, Four-Relator Adian–Rabin Family, and Unrecognizability of #2(S2×S2)\#^{2}(S^{2}\times S^{2})

Get email updates

Qiuyu Ren

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.

What was already known

Valiev gave a universal group with 21 relators. The earlier Ren construction reduced the count to thirteen. This construction reduces the displayed presentation further.

AI involvement AI-led

The November manuscript credits the ChatGPT agent “dot” with producing the main algebraic results. GPT-6 Astra contributed to the writeup and later development under Ren’s direction.

Importance Notable

The construction substantially reduces the number of displayed relations in a universal finitely presented group.

Technical verification Formal (Lean)

The pinned Lean 4.35.0 development reports a complete proof of the three-relator theorem and a successful axiom audit. Its separate Challenge statement has a deliberate proof placeholder outside the Solution proof closure.

Formal checking

The pinned Lean 4.35.0 development reports a complete proof of the three-relator theorem and a successful axiom audit. Its separate Challenge statement has a deliberate proof placeholder outside the Solution proof closure.

Checker
Qiuyu Ren, reporting Lean 4 verification
Scope
The pinned Lean 4.35.0 development reports a complete proof of the three-relator theorem and a successful axiom audit. Its separate Challenge statement has a deliberate proof placeholder outside the Solution proof closure.
Basis
Reported by the linked checker

Human understanding Few

Ren reports some understanding in the deposit, but a specific human explanation of the central compression argument is undocumented.

Correction and publication history