Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28
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.

A free group of rank at least two has subgroups of every finite rank

Statement

If F is a free group of rank at least 2, then for every integer m≥1 there is a subgroup of F of rank m.

Facts & Assumptions

Given: A free group F of rank at least 2.

[L1]

A free basis is the generating subset appearing in the universal property of a free group (A free basis of a group).

[L2]

Finite rank means cardinality of a finite free basis (The rank of a free group admitting a finite basis).

[L3]

A subgroup of index d in a rank-two free group has rank 1+d (The Schreier index-rank formula).

Proof

technique · direct
1.1L1L2givenconstruct

Choose a free basis X of F with at least two elements, and fix distinct x,y∈X. Let L=⟨x,y⟩. For any group G and any function u:{x,y}→G, extend u to a function on X by sending every basis element outside {x,y} to eG. The universal property in [L1] then gives a unique homomorphism F→G, whose restriction to L extends u. Hence {x,y} is a free basis of L, so [L2] gives rank⁡(L)=2.

2.1L3step 1.1givenconstruct

For m=1, the cyclic subgroup ⟨x⟩ has free basis {x}. Now assume m≥2. Because L is free on {x,y}, there is a surjective homomorphism π:L→(Z/(m−1),+) with π(x)=1 and π(y)=0. Let Hm=ker⁡π. Then [L:Hm]=m−1, so [L3] gives rank⁡(Hm)=1+(m−1)=m.

3.1step 2.1∎

The subgroup ⟨x⟩ handles m=1, and the subgroups Hm≤L≤F handle every m≥2. Therefore F has subgroups of every finite rank.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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