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.

Kurosh subgroup theorem

Statement

Let G=iIGi and let HG. For each i, choose one representative ti,λ from every double coset H\G/Gi for which Hti,λGiti,λ1{e}. Then

H(i,λHti,λGiti,λ1)F,

for some free group F.

Facts & Assumptions

Given: A free product G=iIGi and a subgroup HG.

[L1]

A free product is the group characterized by the canonical factor maps from the family (Gi)iI. (The free product of an arbitrary family of groups)

[L2]

The path group of a graph of groups is generated by the vertex groups and the oriented edges, with only the reversal relations and the edge-group conjugacy relations. (The path group of a graph of groups)

[L3]

The relative fundamental group is obtained from the path group by killing the edges of a chosen maximal subtree. (The fundamental group of a graph of groups relative to a maximal tree)

[L4]

The graph-of-groups fundamental group acts on its Bass-Serre tree, and vertex and edge stabilizers are conjugates of the chosen vertex and edge groups. (The fundamental group acts without inversions on its Bass-Serre tree)

[L5]

Bass-Serre structure identifies a group acting without inversions on a tree with the fundamental group of its quotient graph of stabilizers. (Bass-Serre structure theorem)

Proof

technique · direct
1.1

Let X be the star-shaped graph with one central vertex of trivial group, one leaf vertex vi of group Gi for each iI, and one trivial edge joining the center to vi. The whole star is a maximal subtree, so [L2] and [L3] kill all edge symbols and leave only the leaf vertex groups with no cross-relations. By the universal property in [L1], this relative fundamental group is exactly iIGi, so we may regard G as the fundamental group of this graph of groups.

L1L2L3given
2.1

Let T be the Bass-Serre tree of the star graph of step 1.1. The subgroup H acts on T without inversions, so [L5] identifies H with the fundamental group of the quotient graph of groups H\T. By [L4], every edge stabilizer in T is trivial, and every vertex stabilizer over the leaf orbit of vi has the form HgGig1 for some gG.

L4L5step 1.1
3.1

Choose a maximal subtree T0 of H\T. Because every edge group is trivial, the quotient graph-of-groups path group has no conjugacy relations, only the reversal relations from [L2]. Killing the edges of T0 via [L3] therefore leaves a free product of the nontrivial vertex stabilizers together with a free group generated by the geometric edges outside T0. Hence H is a free product of the groups HgGig1 that occur as nontrivial vertex stabilizers, together with some free group F.

L2L3step 2.1
4.1

A vertex of T above the leaf vertex vi is a left coset gGi. Two such vertices, gGi and gGi, lie in the same H-orbit exactly when g=hga for some hH and aGi, equivalently when HgGi=HgGi. Thus the H-orbits of vertices above vi are indexed by the double cosets H\G/Gi, and choosing one representative from each double coset with nontrivial stabilizer gives exactly the index set in the statement. Combining this with step 3.1 proves the theorem.

step 2.1step 3.1algebra

Depends on

Used by

Dependency tree · two levels

15 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