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.
The polynomial ring in countably many variables is not Noetherian
Example
Let be a field and, for , write for the iterated polynomial ring, so that and (Polynomial rings in finitely many commuting indeterminates by iteration). Identify with the subring of constant polynomials in , which is the identification the published iterative definition already makes and which is legitimate because the constant-polynomial map is an injective unital ring homomorphism (Polynomial convolution makes a commutative ring containing as its constant subring). Under it
and the union
carries well-defined operations, making it a commutative ring: the polynomial ring in the countably many indeterminates over .
Then is not Noetherian. Writing for the ideal of generated by the first indeterminates, with , the chain
is strictly ascending and therefore never stabilises.
Facts & Assumptions
Given: A field , the rings for , and their union .
Polynomial rings in finitely many commuting indeterminates are defined by and ; at each stage the coefficient ring embeds as the constant polynomials, so all preceding indeterminates remain present (Polynomial rings in finitely many commuting indeterminates by iteration).
For every commutative ring the polynomial ring is a commutative ring, and the constant-polynomial map is an injective unital ring homomorphism (Polynomial convolution makes a commutative ring containing as its constant subring).
A subset of a ring is a subring when and is closed under addition, additive inverses and multiplication; it is then a ring with the same zero and identity (Subring: a subset containing and closed under addition, additive inverses and multiplication).
For , is the intersection of all two-sided ideals containing , so (The ideal generated by a subset and principal ideals).
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 commutative rings , a unital ring homomorphism and , there is a unique unital ring homomorphism extending on constants and sending to (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
For a commutative ring, being Noetherian is equivalent to every ascending chain of ideals indexed by stabilising (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).
Verification
Under the identification of with the constants of , each is a subring of , so the family is increasing and any two of its members are comparable.
The union is a commutative ring. Given there is with , by comparability of the two stages containing them; define and there. The value does not depend on the stage chosen, because a larger stage contains the smaller as a subring and the operations of a subring are the restrictions of the ambient ones. Each ring axiom involves finitely many elements, which again lie in a common , where the axiom holds. The identity is and the zero is .
For let be the ideal of generated by ; at the generating set is empty and . Since the generating sets increase with , so do the ideals: .
The inclusions are strict, because . Suppose with ; all the lie in a common with , so the equation holds in . Iterating the one-variable universal property along the tower defining produces a -algebra homomorphism with and for every with . Applying to the supposed equation gives in , which is false. So and .
The chain is an ascending chain of ideals of indexed by in which every inclusion is strict, so no index has for all : already . The ascending chain condition therefore fails, and is not Noetherian.
Remarks
-
Every finite stage is Noetherian and the union is not. Each is Noetherian by If is Noetherian then is Noetherian for every ; the Noetherian condition is not preserved by unions of increasing chains of rings, and this is the standard witness for that.
-
The identification of with the constants of is the one the published definition makes. Polynomial rings in finitely many commuting indeterminates by iteration states that the coefficient ring embeds at each stage and that all preceding indeterminates remain present; the union above is taken along exactly those embeddings, and the injectivity that makes the identification harmless is Polynomial convolution makes a commutative ring containing as its constant subring.
-
is needed in the substitution. Sending every indeterminate to would kill as well and prove nothing; the target is what keeps one indeterminate alive while all the others vanish.
Depends on
- 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
- Polynomial rings in finitely many commuting indeterminates by iteration
- Polynomial convolution makes $R[x]$ a commutative ring containing $R$ as its constant subring
- The ideal generated by a subset and principal ideals
- In a commutative ring, $(S)$ consists of finite sums $\sum r_i s_i$, and $(a)=Ra$
- Universal property of $R[x]$: a coefficient homomorphism and the image of $x$ determine a unique ring homomorphism
- Subring: a subset containing $1_R$ and closed under addition, additive inverses and multiplication
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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.1) (standard reference, not scraped)
- B. Totaro, Commutative Algebra (Michaelmas 2011), notes by Z. Norwood, §8 (standard reference, not scraped)