Proof of Hilbert's basis theorem by leading coefficients
Builds on Noetherian ringAscending chain conditionPolynomial ringCommutative ringIdealIdeal generated by a subsetLeading coefficientDegree of a polynomial
Proof
We argue by contradiction, with the leading coefficients of a badly chosen sequence of polynomials.
- Let be a Noetherian commutative ring. Let be its polynomial ring. For , write for the ideal generated by . For a nonzero polynomial, is its degree.
- First we show: if every ideal of is finitely generated, then is Noetherian.
- Let be ideals of , and let be their union. Two elements of lie in a common , since the form a chain. So is an ideal.
- Let . Each lies in some . Let be the largest . Then all lie in , so .
- For we get , so . This is the ascending chain condition.
- So it is enough to show that every ideal of is finitely generated. Suppose that some ideal is not.
- We choose recursively. Suppose are chosen, and let , with .
- Since is not finitely generated, . Choose of least degree. Note , because .
- The degrees satisfy . Indeed, and , so . The minimality of applies.
- Let be the leading coefficient of . Let be the ideal of generated by . Then .
- Since is Noetherian, there is with for all . Let . Then , so with .
- Let . The exponents are nonnegative by Step 9. So .
- Each term has degree at most . Its coefficient of is . So the coefficient of in is .
- Hence is or has degree less than . Also .
- If , then , which is false. So , and in particular .
- So is an element of of smaller degree than . This contradicts the choice of in Step 8.
- So every ideal of is finitely generated. By Steps 2 to 5, is Noetherian.
Idea
If an ideal of needed infinitely many generators, we could pick them one by one with the smallest possible degree. Their leading coefficients generate a chain of ideals in , which must stop growing. Then one new leading coefficient is a combination of earlier ones, and subtracting a matching combination of earlier polynomials lowers the degree. This contradicts the minimal choice.
Reading path
To understand this page from the ground up, read these 11 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Ascending chain condition definition
- Group concept
- Ring definition
- Commutative ring definition
- Polynomial ring definition
- Ideal definition
- Degree of a polynomial definition
- Ideal generated by a subset definition
- Leading coefficient definition
- Noetherian ring definition
- Proof of Hilbert's basis theorem by leading coefficients proof
Where this leads
5 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Hilbert%27s_basis_theorem, Proof, First proof
About this page
| Tag | BFN4MBMZ1E |
|---|---|
| URI | m2://BFN4MBMZ1E |
| Kind | proof |
| Writing | W0 stub |
| MSC | 13E05 |
| Proves | Hilbert's basis theorem |
| Uses | Noetherian ring, Ascending chain condition, Polynomial ring, Commutative ring, Ideal, Ideal generated by a subset, Leading coefficient, Degree of a polynomial |
| Methods | Proof by contradiction |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.