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 nonzero finite projective module over a Dedekind domain splits off a rank-one summand
Statement
Assume the Axiom of Choice. Let be a Dedekind domain and let be a nonzero finite projective -module. Then there exist a finite projective module and an invertible fractional ideal such that .
Facts & Assumptions
Given: A Dedekind domain , its fraction field , and a nonzero finite projective -module .
Every finite torsion-free module over a Dedekind domain is projective (Finite torsion-free modules over Dedekind domains are projective).
Invertible fractional ideals are exactly the finite rank-one projective modules (Invertible fractional ideals are exactly the rank-one projective modules).
Proof
The -vector space is nonzero because is a nonzero projective module over a domain. Choose a nonzero -linear functional . Its image on the finite module is a finitely generated nonzero -submodule , so is a fractional ideal. As a submodule of the field , the module is torsion-free; since it is finitely generated, [L1] makes it projective. Because is surjective, one has , so has rank one. Therefore [L2] makes an invertible fractional ideal.
The restricted map is surjective by construction. Since is projective by step 1.1, this surjection splits. Therefore . Put . Then is finite projective as a direct summand of .
Depends on
Used by
Dependency tree · two levels
13 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
- J. P. May, Notes on Dedekind Rings (standard reference, not scraped)
- The Stacks Project, Lemma 15.22.11 (standard reference, not scraped)