How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Grushko decomposition and rank additivity
Statement
Let be a finitely generated group and suppose
where each is nontrivial, freely indecomposable, and not infinite cyclic, and is a free group of finite rank. If also
is another such decomposition, then , after permuting indices each is conjugate to , and .
Facts & Assumptions
Given: A finitely generated group equipped with the two displayed decompositions in the statement.
Every subgroup of a free product is itself a free product of conjugates of subgroups of the factors together with a free group. (Kurosh subgroup theorem)
Every subgroup of a finitely generated free group is free; this is the finite-basis case of Nielsen-Schreier and requires no choice hypothesis. (Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis)
Any two finite free bases of the same free group have the same cardinality. (Any two finite free bases of the same group have the same cardinality)
Proof
Fix . Apply [L1] to the subgroup inside the decomposition . Because is freely indecomposable and not infinite cyclic, its Kurosh decomposition can contain neither a positive-rank free part nor two distinct nontrivial factors. By [L2], any subgroup of a conjugate of is free, so a nontrivial such subgroup would be either infinite cyclic or freely decomposable. Therefore the unique nontrivial Kurosh factor is itself, and it is contained in a conjugate of some .
Let be a conjugate containing . Now view as a subgroup of the first decomposition and apply [L1] again. The identity double coset for the factor contributes the nontrivial subgroup to the Kurosh decomposition of . Since is also freely indecomposable and not infinite cyclic, its Kurosh decomposition has no second nontrivial factor and no free part. Hence . So every is conjugate to some .
Apply the same argument with the roles of the two decompositions reversed: every is conjugate to some . Also, applying [L1] to the subgroup inside its own decomposition shows that meets every conjugate of for and every conjugate of trivially, because the identity double coset for already supplies the only possible nontrivial Kurosh factor. Therefore two distinct cannot both be conjugate to the same . By symmetry the correspondence is bijective, so after permuting indices we get and each is conjugate to .
After that permutation, quotient by the normal closure of the factors . In the first decomposition this kills the nonfree factors and leaves ; in the second decomposition it kills the conjugate factors and leaves . Thus . Since both free groups have finite rank, [L3] gives . This proves the uniqueness and rank statement.
Remarks
This is the uniqueness and free-rank additivity half of Grushko's theorem for decompositions already in hand. The classical existence half is deeper and is not re-proved on this page.
Depends on
Used by
Dependency tree · two levels
20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Roger C. Lyndon and Paul E. Schupp, Combinatorial Group Theory (standard reference, not scraped)
- John Meier, Groups, Graphs and Trees (standard reference, not scraped)