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.
and are Noetherian but not Artinian
Example
Let be a field. Then and are Noetherian rings, but neither is Artinian.
Facts & Assumptions
Given: A field .
Verification
Every ideal of is an additive subgroup, so Every subgroup of is for exactly one natural number makes it principal; then A commutative ring is Noetherian exactly when every ideal is finitely generated, exactly when its ideals satisfy the ascending chain condition, and exactly when every nonempty set of ideals has a maximal member shows that is Noetherian. Also If is Noetherian then is Noetherian for every applied to the field shows that is Noetherian.
In the principal ideals form a strict descending chain, because for every . Likewise is a strict descending chain of ideals in . Therefore neither ring is Artinian.
These two standard examples show that Noetherianity alone does not imply Artinianness.
Depends on
- Field
- Every subgroup of $(\mathbb{Z}, +)$ is $\langle n \rangle = n\mathbb{Z}$ for exactly one natural number $n$
- A commutative ring is Noetherian exactly when every ideal is finitely generated, exactly when its ideals satisfy the ascending chain condition, and exactly when every nonempty set of ideals has a maximal member
- If $R$ is Noetherian then $R[x_1,\ldots,x_n]$ is Noetherian for every $n\in\mathbb N$
- The ideal generated by a subset and principal ideals
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
34 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, Sections 3 and 16 (standard reference, not scraped)
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., Example (19.7) (standard reference, not scraped)