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 with basis , a subgroup , and the Axiom of Choice.
Every element of has a unique finite integer-coordinate expansion in this basis (The free module on a set and its standard basis).
Every subgroup of is for a unique integer (Every subgroup of is for exactly one natural number ).
AC chooses an element from each member of a set-indexed family of nonempty sets (The Axiom of Choice), and implies that admits a well-order (The well-ordering theorem).
Induction over any supplied well-order is valid in ZF (Transfinite induction).
Proof
Well-order . For , let be the span of the with , and put . The -coordinate homomorphism has image for a uniquely determined . Put .
For each the set is nonempty. Apply AC to this set-indexed family and fix simultaneously for all . These are the only choices of lifts in the argument; they do not depend recursively on previously chosen bases.
We prove by well-ordered induction on that is spanned by with and . Suppose this is proved below , and take . If , write and set ; if , set . In both cases has finite support strictly below . If that support is empty, . Otherwise it has a greatest element , and is in the required span by the induction hypothesis. Thus so is . Conversely all the indicated belong to . This verifies the inductive implication, including the least-element and limit cases, and [L4] proves the assertion for every .
The family is linearly independent. Indeed, in a nonzero finite relation choose the greatest index with nonzero coefficient . Its -coordinate is , since all smaller-indexed vectors have zero -coordinate. This is nonzero in , contradicting the relation. Every nonzero has a greatest basis-support index and belongs to , so step 3.1 also proves spanning of all . Hence is a basis. If or is empty the same reasoning says 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
- Charles A. Weibel, An Introduction to Homological Algebra, Chapters 3–4 (standard reference, not scraped)