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 Artinian ring has only finitely many maximal ideals
Statement
Let be a commutative Artinian ring. Then has only finitely many maximal ideals.
This theorem uses dependent choice only through the minimum condition for Artinian modules.
Facts & Assumptions
Given: A commutative Artinian ring . The dependent-choice use named in the Statement is the minimum-condition step invoked below.
Every nonempty family of submodules of an Artinian module has a minimal member. Applied to the regular module of a commutative Artinian ring, every nonempty family of ideals has a minimal member. (DCC and minimal-condition characterizations of Artinian modules).
Proof
If has no maximal ideals then the conclusion is immediate. Otherwise let be the set of all finite nonempty intersections of maximal ideals of . This set is nonempty, so [L1] gives a member minimal under inclusion; write it as for maximal ideals .
Let be any maximal ideal of . Then is again a finite nonempty intersection of maximal ideals, so and . By the minimality from step 1.1, one has , hence . If were distinct from every , then for each we could choose and put . Now , but every maximal ideal is prime by Every maximal ideal of a commutative ring is prime, so some factor would lie in , contradicting the choice of the . Therefore every maximal ideal of is one of .
Therefore an Artinian ring has only finitely many maximal ideals.
Depends on
Used by
Dependency tree · two levels
8 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. S. Milne, A Primer of Commutative Algebra, v4.03, Proposition 16.3 (standard reference, not scraped)
- The Stacks Project, Section 10.53: Artinian rings (standard reference, not scraped)