Math 2.0

Theorem

Grushko decomposition theorem

Statement

A useful consequence of the original Grushko theorem is the so-called Grushko decomposition theorem. It asserts that any nontrivial finitely generated group G can be decomposed as a free product

G = A1∗A2∗...∗Ar∗Fs, where s ≥ 0, r ≥ 0,

where each of the groups Ai is nontrivial, freely indecomposable (that is, it cannot be decomposed as a free product) and not infinite cyclic, and where Fs is a free group of rank s; moreover, for a given G, the groups A1, ..., Ar are unique up to a permutation of their conjugacy classes in G (and, in particular, the sequence of isomorphism types of these groups is unique up to a permutation) and the numbers s and r are unique as well.

More precisely, if G = B1∗...∗Bk∗Ft is another such decomposition then k = r, s = t, and there exists a permutation σ∈Sr such that for each i=1,...,r the subgroups Ai and Bσ(i) are conjugate in G.

The existence of the above decomposition, called the Grushko decomposition of G, is an immediate corollary of the original Grushko theorem, while the uniqueness statement requires additional arguments (see, for example).

Algorithmically computing the Grushko decomposition for specific classes of groups is a difficult problem which primarily requires being able to determine if a given group is freely decomposable. Positive results are available for some classes of groups such as torsion-free word-hyperbolic groups, certain classes of relatively hyperbolic groups, fundamental groups of finite graphs of finitely generated free groups and others.

Grushko decomposition theorem is a group-theoretic analog of the Kneser prime decomposition theorem for 3-manifolds which says that a closed 3-manifold can be uniquely decomposed as a connected sum of irreducible 3-manifolds.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first. The path takes the proof Proof of Grushko decomposition theorem.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proof of Grushko decomposition theorem proof
  2. Grushko decomposition theorem statement

Further reading

  1. Wikipedia, page 18715724, revision 1354577450, Grushko theorem, section Grushko decomposition theorem. adopted
About this page
TagKJSQAAXP54
URIm2://KJSQAAXP54
Kindstatement, theorem
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status KJSQAAXP54.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Proofs