algebra / Combinatorial group theory; word problem and embedding theorems

The Boone-Higman conjecture: groups with solvable word problem embed in finitely presented simple groups

Theorem 1.1: a finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group. The route is Theorem 1.2: every such group embeds in a finitely presented group with a faithful two-transitive action on a countable set with finitely generated point stabilizers, built as a mapping torus of an affine Steinberg group over finitely presented F2\mathbb F_2-algebras, which Zaremsky's criterion for twisted Brin-Thompson groups turns into a finitely presented simple overgroup. The higher-finiteness strengthening is the companion's separate entry; no explicit bound on the size of the presentation is given.

50Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

algebraSep 23, 2026Significance 50/100Registry: lean checked

The Boone-Higman conjecture: groups with solvable word problem embed in finitely presented simple groups

Prior state unknown→proved

Theorem 1.1: a finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group. The route is Theorem 1.2: every such group embeds in a finitely presented group with a faithful two-transitive action on a countable set with finitely generated point stabilizers, built as a mapping torus of an affine Steinberg group over finitely presented F2\mathbb F_2-algebras, which Z…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: a finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group. The route is Theorem 1.2: every such group embeds in a finitely presented group with a faithful two-transitive action on a countable set with finitely generated point stabilizers, built as a mapping torus of an affine Steinberg group over finitely presented F2\mathbb F_2-algebras, which Zaremsky's criterion for twisted Brin-Thompson groups turns into a finitely presented simple overgroup. The higher-finiteness strengthening is the companion's separate entry; no explicit bound on the size of the presentation is given.

Theorem 1.1: a finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group. The route is Theorem 1.2: every such group embeds in a finitely presented group with a faithful two-transitive action on a countable set with finitely generated point stabilizers, built as a mapping torus of an affine Steinberg group over finitely presented F2\mathbb F_2-algebras, which Zaremsky's criterion for twisted Brin-Thompson groups turns into a finitely presented simple overgroup. The higher-finiteness strengthening is the companion's separate entry; no explicit bound on the size of the presentation is given.

Recorded attempts

Evidence graph

Connected research record

The Boone-Higman conjecture: groups with solvable word problem embed in finitely presented simple groups — Mathematical Frontier Network