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 submodule of an arbitrary-rank free module over a PID is free
Statement
Assume the Axiom of Choice. If is a PID, is a free -module, and , then is free (with no finite-rank assumption on ).
Facts & Assumptions
Given: a basis of , a submodule , and AC.
A PID is a domain and every ideal is principal (Principal ideal domain).
Basis expansions are unique and have finite support (The free module on a set and its standard basis).
AC permits simultaneous selections from a set-indexed family of nonempty sets (The Axiom of Choice).
Under AC the set admits a well-order (The well-ordering theorem).
Induction over a well-ordered set is valid (Transfinite induction).
Proof
Use [L4] to well-order . For let and be the spans of the corresponding basis initial segments. Let be the image of under the -coordinate map. This image is an ideal because the coordinate map is -linear.
If , [L1] supplies a nonzero generator and the definition of the image supplies with -coordinate . The sets of such pairs are nonempty and indexed by a subset of ; use [L3] to choose them simultaneously. This is the second use of AC, after well-ordering the basis.
If and , then . If , write its -coordinate as ; then . In either case the remainder has finite support below .
Induct on using [L5] to show that is spanned by the chosen with . By step 3.1 it suffices to handle a finite-support remainder in . A zero remainder needs no generators; otherwise its support has a greatest element , so the induction hypothesis at applies. This includes least and limit positions without selecting a cofinal sequence. Every nonzero element of has a greatest support element, so the chosen family spans .
In a nonzero finite relation among the chosen , take the greatest index with nonzero coefficient . Its -coordinate is : all smaller-index vectors have zero coordinate there. Since is a domain and , this coordinate is nonzero, a contradiction. Thus the family is independent and is a basis by step 4.1. If or is empty or zero as applicable, the same argument gives the empty basis.
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
- Weibel, An Introduction to Homological Algebra (standard reference, not scraped)