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.
Under Choice, a submodule of an arbitrary-rank free module over a PID is free
Statement
Assume the Axiom of Choice. If is a commutative principal ideal domain, is a free -module on an arbitrary set, and is a submodule, then is free.
Facts & Assumptions
Given: Such , and AC.
In a PID every ideal is principal, and the ring is a domain: Principal ideal domain.
A free module has unique finite-support basis expansions, including the empty basis for zero: The free module on a set and its standard basis.
AC selects an element of each nonempty set in a set-indexed family: The Axiom of Choice.
Under AC every set can be well ordered: The well-ordering theorem.
A property on a well-order follows if its truth below any element implies its truth at that element: Transfinite induction.
Proof
Fix a basis of and well-order . Put , , and . The coordinate projection is linear by uniqueness of basis expansions.
Its image is an ideal: and for and . Write . For each with , the set of pairs with , , and is nonempty. AC selects such a pair simultaneously for these indices. In particular . Let .
We verify the hypothesis of transfinite induction for the assertion that is spanned by the with , . Suppose the assertion holds at every and take . If , put . Otherwise , and for some ; put . In both situations . If , its finite support has a greatest element , so the assertion at expresses in the required earlier generators. If , its expression is the empty sum. Restoring when present proves the assertion at .
For a finite relation with distinct , suppose some coefficient is nonzero and take the greatest such index . Every with has zero coordinate. Applying gives . Since is a domain and , this forces , contrary to its selection. Thus all coefficients vanish.
Transfinite induction now proves the assertion at every . Each nonzero has a greatest support index and hence belongs to one ; therefore the span . This also covers a limit initial segment: every one of its finite supports lies in a smaller principal initial segment, so no additional generator is needed at a limit cut.
Spanning and independence make a basis. If , every and this is the empty basis; if , also . In rank one the same construction is simply the zero ideal or its single nonzero generator. These possibilities require no choice from an empty fiber.
Depends on
Used by
Dependency tree · two levels
17 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
- Garrett, Finitely-generated modules, §6, Theorem 6.0.1 and proof, printed pp.177–178 (standard reference, not scraped)
- Goel, Commutative Algebra, Chapter 8, footnote 2, printed p.137 (PDF index 137) (standard reference, not scraped)