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.
Minimal support primes of a finite module are associated
Statement
Let be a Noetherian commutative ring and let be a finitely generated left -module. If is minimal in , then
Facts & Assumptions
Given: A Noetherian commutative ring , a finitely generated left -module , and a prime ideal minimal in .
The module admits a prime filtration with for prime ideals (Finite modules over Noetherian rings admit prime filtrations).
Support in a short exact sequence is the union of the supports of the outer terms (Support in a short exact sequence is the union of the outer supports).
The support of is exactly (The support of a cyclic quotient is its vanishing set).
Proof
Choose a prime filtration as in [L1]. Repeatedly applying [L2] to the short exact sequences and then using [L3] for gives
By step 1.1, the prime contains some . Since , the minimality of in the support forces . Choose the smallest such index , and choose whose image in is nonzero. Then , because any scalar killing kills its nonzero class in . Also for every , so .
For each , the minimal choice of gives and hence . Choose , and put . Because is prime and no factor lies in , one has . Since , this implies . Moreover because and . If , then ; as and is prime, this forces . Therefore , so .
Thus every support-prime minimal by inclusion is associated.
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
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., Theorem (17.18) (standard reference, not scraped)
- The Stacks Project, Proposition 10.63.6 (standard reference, not scraped)