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 finitely generated PID module is its torsion submodule direct-summed with a finite free module
Statement
If is finitely generated over a PID , then
for some . A finitely generated PID module is its torsion submodule direct-summed with a finite free module. The torsion submodule is canonical; a free complement need not be.
Facts & Assumptions
Given: The torsion submodule from Torsion elements and -primary elements form submodules over a domain and finite free modules as in The free module on a set and its standard basis.
Every finitely generated PID module is a finite free module direct-summed with cyclic torsion quotients (Invariant-factor decomposition of a finitely generated module over a PID).
Proof
In [L1], every cyclic quotient is torsion, and every torsion element has zero component in the free summand because a free module over a domain is torsion-free. Thus the direct sum of the cyclic quotients is exactly .
Substituting that identification into the invariant-factor decomposition gives . It includes pure torsion when , pure free modules when , and the zero module when both vanish.
The torsion submodule is canonical because it is defined by alone, while a free complement is not. Suppose is a nonzero nonunit and put . Since is a domain, an element killed by some nonzero scalar has , and kills every ; hence . Both and are free of rank one, because forces , and each meets only in while shows and likewise for . They are distinct: lies in only if , contrary to being a nonunit.
Depends on
Used by
Dependency tree · two levels
12 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
- K. Conrad, Modules over a PID, Theorem 4.1 (standard reference, not scraped)