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 leading coefficients of the degree- elements of an ideal of , together with , form an ideal of , and these ideals ascend with
Statement
Let be a commutative ring, let be an ideal of the polynomial ring (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution), and for set
Then is an ideal of for every , and
The index runs over , so the chain begins at , whose members are together with the nonzero constant polynomials that lie in .
Adjoining is not cosmetic. The zero polynomial has no degree and no leading coefficient (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree), so it contributes no element, and without the adjunction the set would be empty whenever contains no element of degree exactly .
Facts & Assumptions
Given: A commutative ring , an ideal of , and . A nonzero of degree with is said to realise at stage .
is the set of finitely supported functions , with and ; the constant is the sequence supported at with value , and is the sequence with coefficient at index and zero elsewhere (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).
For the degree is and the leading coefficient is ; the zero polynomial has no degree and no leading coefficient (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).
A nonempty subset is a two-sided ideal exactly when it is closed under and under for all , (Ideal criteria and intersections of ideals).
For nonzero over a commutative ring: if then ; the coefficient of in is , and if then (Degree inequalities for sums and products over a commutative ring).
An additive subgroup is a left ideal when for every and , and in a commutative ring the left, right and two-sided notions agree (Left, right and two-sided ideals).
Proof
Fix and read the displayed definition: consists of together with the leading coefficients of those elements of that are nonzero of degree exactly . In particular , so is a nonempty subset of ; and no element of other than the adjoined is , since a leading coefficient is nonzero by definition.
is closed under differences. Let . If then . If and , take realising at stage ; negation is coefficientwise, so is nonzero of degree with , and . If both are nonzero, take realisers at stage ; then is nonzero of degree , the coefficient of in is , and the coefficients of above index all vanish. Should , the difference lies in as the adjoined element; otherwise , the degree law gives , and the nonvanishing coefficient at forces with , so .
is closed under multiplication by elements of . Let and . If the product lies in as the adjoined element, and this covers and . Otherwise and ; take realising at stage and read as a constant polynomial, which is nonzero of degree with leading coefficient . The coefficient of in the product is , so ; the degree law then gives , and the nonvanishing coefficient at forces with . Since is an ideal of we have , so .
The stages ascend. Let with and let realise it at stage . Multiplying by shifts coefficients: by the convolution rule the coefficient of in is the coefficient of in for and is at . So has zero coefficients above index and coefficient at index , whence is a nonzero element of of degree with . Thus , and as well, so .
By the ideal criterion, a nonempty subset of a commutative ring closed under differences and under multiplication by arbitrary ring elements is an ideal; steps 2.1 and 2.2 supply exactly those closures, so is an ideal of .
Step 3.1 holds for every and step 2.3 gives for every , so the stages form an ascending chain of ideals of indexed by and beginning at . A nonzero element of has degree exactly when it is a nonzero constant, and its leading coefficient is then that constant, so is the set of constants lying in , the zero constant included.
Remarks
-
Exact degree, not degree at most . Defining the stage by "degree at most " gives the same ideals, but then the ideal property itself needs the shifting argument of step 2.3 rather than only the ascent. With exact degree the two facts separate cleanly, which is what the Hilbert basis argument uses: it needs a generator of a prescribed degree, not merely of bounded degree.
-
The chain need not be strictly increasing, and it need not stabilise. Nothing above assumes Noetherian. Stabilisation is exactly what the Noetherian hypothesis will buy, and it is not available here.
-
Why is closed under multiplication even where degrees drop. Over a ring with zero divisors can have degree below , and then ; step 2.2 records that case separately and sends it to the adjoined rather than pretending the degree is preserved.
Depends on
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
- Ideal criteria and intersections of ideals
- Degree inequalities for sums and products over a commutative ring
- Left, right and two-sided ideals
Used by
- Working the Hilbert basis construction on an ideal of ℤ[x] with non-monic stages Example
- A single cancellation step lowers the degree of a polynomial in an ideal once its leading coefficient lies in a realised stage Lemma
- Over a Noetherian ring, an ideal of R[x] is generated by finitely many polynomials realising generators of its stages up to the stabilisation degree Lemma
Dependency tree · two levels
10 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, §3 Theorem 3.7 (standard reference, not scraped)
- B. Totaro, Commutative Algebra (Michaelmas 2011), notes by Z. Norwood, §8 Theorem 8.3 (standard reference, not scraped)
- M. Hochster, Introduction to Commutative Algebra, Math 614, Theorem 5.6 (standard reference, not scraped)