Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-29
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 G be a finitely generated group and suppose

GA1AmFr,

where each Aj is nontrivial, freely indecomposable, and not infinite cyclic, and Fr is a free group of finite rank. If also

GB1BnFs

is another such decomposition, then m=n, after permuting indices each Aj is conjugate to Bj, and r=s.

Facts & Assumptions

Given: A finitely generated group G equipped with the two displayed decompositions in the statement.

[L1]

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)

[L2]

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)

[L3]

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

technique · direct
1.1

Fix j. Apply [L1] to the subgroup AjG inside the decomposition GB1BnFs. Because Aj 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 Fs is free, so a nontrivial such subgroup would be either infinite cyclic or freely decomposable. Therefore the unique nontrivial Kurosh factor is Aj itself, and it is contained in a conjugate of some Bk.

L1L2given
2.1

Let Bk=gBkg1 be a conjugate containing Aj. Now view Bk as a subgroup of the first decomposition GA1AmFr and apply [L1] again. The identity double coset for the factor Aj contributes the nontrivial subgroup Aj to the Kurosh decomposition of Bk. Since Bk is also freely indecomposable and not infinite cyclic, its Kurosh decomposition has no second nontrivial factor and no free part. Hence Bk=Aj. So every Aj is conjugate to some Bk.

L1step 1.1
3.1

Apply the same argument with the roles of the two decompositions reversed: every Bk is conjugate to some Aj. Also, applying [L1] to the subgroup Aj inside its own decomposition shows that Aj meets every conjugate of A for j and every conjugate of Fr trivially, because the identity double coset for Aj already supplies the only possible nontrivial Kurosh factor. Therefore two distinct Aj cannot both be conjugate to the same Bk. By symmetry the correspondence is bijective, so after permuting indices we get m=n and each Aj is conjugate to Bj.

L1step 2.1
4.1

After that permutation, quotient G by the normal closure of the factors A1,,Am. In the first decomposition this kills the nonfree factors and leaves Fr; in the second decomposition it kills the conjugate factors B1,,Bm and leaves Fs. Thus FrFs. Since both free groups have finite rank, [L3] gives r=s. This proves the uniqueness and rank statement.

L3step 3.1

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