Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-09 (gpt-6-astra)
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.

Subgroups of free abelian groups are free

Statement

Assume the Axiom of Choice. Every subgroup of a free abelian group is free abelian.

Facts & Assumptions

Given: A free abelian group F with basis (eb)b∈B, a subgroup H≤F, and the Axiom of Choice.

[L1]

Every element of F has a unique finite integer-coordinate expansion in this basis (The free module on a set and its standard basis).

[L2]

Every subgroup of Z is dZ for a unique integer d≥0 (Every subgroup of (Z,+) is ⟨n⟩=nZ for exactly one natural number n).

[L3]

AC chooses an element from each member of a set-indexed family of nonempty sets (The Axiom of Choice), and implies that B admits a well-order (The well-ordering theorem).

[L4]

Induction over any supplied well-order is valid in ZF (Transfinite induction).

Proof

technique · direct
1.1givenL1L2L3construct

Well-order B. For b∈B, let F≤b be the span of the ec with c≤b, and put H≤b=H∩F≤b. The b-coordinate homomorphism πb:F≤b→Z has image πb(H≤b)=dbZ for a uniquely determined db≥0. Put D={b∈B:db>0}.

2.1step 1.1L3choose

For each b∈D the set Xb={x∈H≤b:πb(x)=db} is nonempty. Apply AC to this set-indexed family and fix xb∈Xb simultaneously for all b∈D. These are the only choices of lifts in the argument; they do not depend recursively on previously chosen bases.

3.1step 1.1step 2.1L1L4induction

We prove by well-ordered induction on b that H≤b is spanned by xc with c∈D and c≤b. Suppose this is proved below b, and take h∈H≤b. If db>0, write πb(h)=qdb and set h′=h−qxb; if db=0, set h′=h. In both cases h′∈H has finite support strictly below b. If that support is empty, h′=0. Otherwise it has a greatest element c<b, and h′∈H≤c is in the required span by the induction hypothesis. Thus so is h. Conversely all the indicated xc belong to H≤b. This verifies the inductive implication, including the least-element and limit cases, and [L4] proves the assertion for every b.

4.1step 2.1step 3.1L1algebra∎

The family (xb)b∈D is linearly independent. Indeed, in a nonzero finite relation choose the greatest index b with nonzero coefficient nb. Its b-coordinate is nbdb, since all smaller-indexed vectors have zero b-coordinate. This is nonzero in Z, contradicting the relation. Every nonzero h∈H has a greatest basis-support index b and belongs to H≤b, so step 3.1 also proves spanning of all H. Hence (xb)b∈D is a basis. If B or D is empty the same reasoning says H=0 with empty basis.

Remarks

AC is used to well-order the supplied basis and to select the family of coordinate lifts. Given a well-ordered basis and that family of lifts, the remaining proof is choice-free. No arbitrary-rank PID theorem, projective splitting, or transfinite recursion is being imported implicitly.

Depends on

Used by

Dependency tree · two levels

33 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