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.
An ideal maximal among the non-finitely-generated ideals is prime
Statement
Let be a commutative ring and let be an ideal of that is maximal in the set of non-finitely-generated ideals of (If some ideal is not finitely generated, there is one maximal among the ideals that are not): that is, is not finitely generated, and every ideal of strictly containing is finitely generated. Then is a prime ideal (Prime ideals and maximal ideals in a commutative ring).
Facts & Assumptions
Given: A commutative ring and an ideal maximal in the set of ideals of that are not finitely generated (If some ideal is not finitely generated, there is one maximal among the ideals that are not). For an ideal and , write and .
A proper ideal of a commutative ring is prime when implies or (Prime ideals and maximal ideals in a commutative ring).
In a commutative ring, consists of finite sums , and ; the empty sum is included and equals (In a commutative ring, consists of finite sums , and ).
For , is the intersection of all two-sided ideals containing , so ; is written (The ideal generated by a subset and principal ideals).
For ideals of , the sum is (The sum and product of two-sided ideals).
A nonempty subset is a two-sided ideal exactly when it is closed under and under for all , (Ideal criteria and intersections of ideals).
Proof
is a proper ideal: the unit ideal is generated by one element, so , whereas .
Suppose is not prime. By the previous step it is proper, so there are with , and .
The ideal strictly contains , since lies in it and not in , so by maximality it is finitely generated. Every element of has the form with and , because ; so a finite generating list may be written with , and .
The set is an ideal of : it contains , and if then and for every . It contains , since for , and it contains , since ; as the containment is strict, so by maximality is finitely generated, say with .
The set is an ideal, being closed under differences and under multiplication by because is, and it is generated by : any is , so . Moreover by the definition of .
. The inclusion from right to left holds because each lies in and . For the other inclusion take and write with and ; then lies in , so and , whence .
Both summands are finitely generated, so is finitely generated, contradicting . The supposition of step 1.2 is therefore untenable: whenever , either or , and with step 1.1 this makes prime.
Remarks
-
Where each maximality use goes. Maximality of in is used exactly twice, in step 2.1 on and in step 2.2 on the colon ideal ; both are strictly larger than precisely because and .
-
The generators of are normalised, not merely chosen. Writing them as with is what lets step 3.2 separate the part of lying in from the multiple of ; an unnormalised list would not split that way.
-
No Noetherian hypothesis anywhere. The lemma is used inside a proof whose conclusion is that the ring is Noetherian, so assuming a chain condition here would be circular.
Depends on
- If some ideal is not finitely generated, there is one maximal among the ideals that are not
- Prime ideals and maximal ideals in a commutative ring
- In a commutative ring, $(S)$ consists of finite sums $\sum r_i s_i$, and $(a)=Ra$
- The ideal generated by a subset and principal ideals
- The sum $I+J$ and product $IJ$ of two-sided ideals
- Ideal criteria and intersections of ideals
Used by
Dependency tree · two levels
14 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., (16.10) (standard reference, not scraped)
- J. S. Milne, A Primer of Commutative Algebra, v4.03, §3 (standard reference, not scraped)