algebra / Geometric group theory; finiteness properties and embedding theorems

A universal group of type F-infinity containing every finitely presented group (F-infinity Higman embedding)

Theorem 1.1 constructs one group HH of type F∞F_\infty containing every finitely presented group; by Higman's theorem its finitely generated subgroups are exactly the finitely generated recursively presented groups (Corollary 1.2). No word-problem hypothesis is imposed. The classifying space need not be finite-dimensional, so type FF is not claimed, and HH is not claimed simple.

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

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

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

A universal group of type F-infinity containing every finitely presented group (F-infinity Higman embedding)

Prior state unknown→proved

Theorem 1.1 constructs one group HH of type F∞F_\infty containing every finitely presented group; by Higman's theorem its finitely generated subgroups are exactly the finitely generated recursively presented groups (Corollary 1.2). No word-problem hypothesis is imposed. The classifying space need not be finite-dimensional, so type FF is not claimed, and HH is not claimed simple.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1 constructs one group HH of type F∞F_\infty containing every finitely presented group; by Higman's theorem its finitely generated subgroups are exactly the finitely generated recursively presented groups (Corollary 1.2). No word-problem hypothesis is imposed. The classifying space need not be finite-dimensional, so type FF is not claimed, and HH is not claimed simple.

Theorem 1.1 constructs one group HH of type F∞F_\infty containing every finitely presented group; by Higman's theorem its finitely generated subgroups are exactly the finitely generated recursively presented groups (Corollary 1.2). No word-problem hypothesis is imposed. The classifying space need not be finite-dimensional, so type FF is not claimed, and HH is not claimed simple.

Recorded attempts

Evidence graph

Connected research record

A universal group of type F-infinity containing every finitely presented group (F-infinity Higman embedding) — Mathematical Frontier Network