Loading [MathJax]/jax/output/CommonHTML/jax.js

The Hilbert Basis Theorem

 David Hilbert in 1912
David Hilbert, 1862-1943 (photo 1912)

Hilbert first proved a form of the basis theorem in 1890.[1] It was so revolutionary at the time that Paul Gordan reportedly exclaimed, “This is not mathematics, it is theology!”.[2] van der Waerden gave an updated and generalized proof in Moderne Algebra in 1931, crediting Hilbert for the basic idea and Emil Artin for the specifics.[3] The proof here is updated still more, though still retaining van der Waerden's degree reduction strategy.

Hilbert Basis Theorem. Let R be a commutative ring with 1. If R is Noetherian, then R[x] is Noetherian as well.

Proof. Recall that a ring is Noetherian if its ideals satisfy the Ascending Chain Condition, or equivalently, if every ideal is finitely generated.

Suppose R is Noetherian and U is an ideal in R[x]. The objective is to prove that U is finitely generated. For m=0,1,2,, let

Lm= set of leading coefficients of polynomials of degree m in U, together with 0

Every nonzero αLm is associated with some polynomial a(x)=αxs+U with dega=sm.

Each Lm is an ideal in R. For suppose α,βLm. Then α and β are the leading coefficients of some polynomials a(x),b(x)U of degree less than or equal to m:

a(x)=αxs+U, where dega=sm,b(x)=βxt+U, where degb=tm.

Assume st and consider c(x)=a(x)xstb(x). Multiplying b(x) by xst or indeed by any other polynomial keeps the result in U since U is an ideal in R[x], and subtracting that from another element of U,a(x), keeps the final result c(x) in U also, so

c(x)=a(x)xstb(x)U=(αxs+)(βxs+)=(αβ)xs+.

Since c(x)U, this implies that either αβ=0 or αβ is the coefficient of the highest power of a polynomial of degree sm in U. In any event, αβLm. Similarly λαLm for any λR and so Lm is an ideal in R. Also:

L0L1L2,

so by the ACC in R, the chain stabilizes; that is, there is some n0 such that

Ln=Ln+1=Ln+2=.

Assume that n is the smallest such value. Since R is Noetherian, all its ideals are finitely generated, and in particular, each Lm has a finite set of generating values αR:

Lm=(αm1,αm2,,αmkm),mn.

By the definition of the Lm, each αmj is associated with a corresponding polynomial amj(x)U of degree less than or equal to m. The goal is to show that all the amj(x)U taken together generate U in R[x]. To this end, build ideals in R[x] paralleling the Lm:

Am=(am1(x),am2(x),,amkm(x)),mn.

First we establish the following:

For g(x)U with degg=mn there is some g1(x)U such that g(x)g1(x)An, where degg1<degg=m.(1)

For the sake of illustration, suppose g(x)=βxn+3+, where β0, so βLn+3=Ln. Assume further that:

Ln={α1,α2,α3}, putting αj=αn,j,An={a1(x),a2(x),a3(x)}, putting aj(x)=an,j(x),={α1xn1+,α2xn+,α3xn2+},

Note in the above that α1Ln means that there is a polynomial a1(x)An of degree less than or equal to n with α1 as the leading coefficient, say a1(x)=α1xn1+, where α10 and the ellipsis indicates terms in lower powers of x. In fact, the degree of a1(x) could have been anything less than or equal to n and a2(x) and a3(x) exemplify that possibility.

Since βLn:

β=λ1α1+λ2α2+λ3α3,λiR.

Put:

g1(x)=g(x)(λ1x4a1(x)+λ2x3a2(x)+λ3x5a2(x)),

where the highlighted weighting powers of x are chosen to scale the ai(x) in question to have the same degree as g(x). Note that the parenthesized expression is in An, since it consists of sums of polynomials in An multiplied by elements of R[x]. Continuing the calculation:

g1(x)=g(x)(λ1x4(α1xn1+)a1(x)+λ2x3(α2xn+)a2(x)+λ3x5(α3xn2+)a3(x))=βxn+3+((λ1α1xn+3+)+(λ2α2xn+3+)+(λ3α3xn+3+))=(β(λ1α1+λ2α2+λ3α3)0)xn+3+= a polynomial of degree n+2=m1,

so g1(x) is the polynomial promised in (1) in this example, and a general proof of (1) proceeds accordingly.

Keeping in mind that n is the point at which the ideals Lm in R stabilize (that is, Lm=Ln for mn), repeated applications of (1) produce a series of polynomials fi(x)U for any given f(x)U with degf=p>n:

f(x)=f1(x)+b(x),b(x)An,degf1p1,f1(x)=f2(x)+b(x),b(x)An,degf2p2,fr1(x)=fr(x)+b(r)(x),b(r)(x)An,degfrn,

where rpn, the inequality being strict if the degree is reduced by more than one at any step. Unrolling this sequence:

f(x)=fr(x)+b(x),b(x)An,degfrn.

That is, for every f(x)U of degree greater than n, there is an associated fr(x)U of degree less than or equal to n such that:

f(x)(fr(x),An),degfrn.

A similar degree reduction strategy is used on fr(x) by applying this principle:

For g(x)U with degg=m<n there is some g1(x)U such that g(x)g1(x)Am, where degg1<degg=m.(1')

(1') is proven just like (1) except that g(x)g1(x) in (1') is in Am1, the next ideal down, instead of An. Applying (1') to fr(x) produces polynomials h(x) and c(x) in U such that:

fr(x)=h(x)+c(x),c(x)An1,deghn1.

Combining (3) and (4):

f(x)(h(x),An,An1),deghn1.

Continuing in this fashion:

f(x)(An,An1,An2,,A0).

f(x) was assumed to be a polynomial in U of degree greater than n. If degfn, the latter part of the argument shows that f(x) is in an ideal generated by some subset of the Ai, so in either case:

U=(An,An1,An2,,A0).

Since each of the Ai is finitely generated in R[x] and n is a fixed value depending on U, it follows that U is finitely generated; and since this is true of every ideal in R[x],R[x] is Noetherian.QED.

Mike Bertrand

March 1, 2020


^ 1. "Ueber die Theorie der algebraischen Formen", by David Hilbert, Mathematische Annalen, 36 (4) (1890), pp. 473–534.

^ 2. A History of Abstract Algebra: From Algebraic Equations to Modern Algebra, by Jeremy Gray, Springer (2018), ISBN 978-3-319-94772-3. “This is not mathematics": p. 266. Gray translated the pertinent part of Hilbert's paper into English and discusses it helpfully in Chapter 25, pp. 263-273.

^ 3. See "On the Sources of My Book Moderne Algebra", by B. L. van der Waerden, Historia Mathematica, 2 (1975), pp. 31-40. "Emil Artin for the specifics" : p. 35.