Hilbert's basis theorem explained

In mathematics Hilbert's basis theorem asserts that every ideal of a polynomial ring over a field has a finite generating set (a finite basis in Hilbert's terminology).

In modern algebra, rings whose ideals have this property are called Noetherian rings. Every field, and the ring of integers are Noetherian rings. So, the theorem can be generalized and restated as: every polynomial ring over a Noetherian ring is also Noetherian.

The theorem was stated and proved by David Hilbert in 1890 in his seminal article on invariant theory, where he solved several problems on invariants. In this article, he proved also two other fundamental theorems on polynomials, the Nullstellensatz (zero-locus theorem) and the syzygy theorem (theorem on relations). These three theorems were the starting point of the interpretation of algebraic geometry in terms of commutative algebra. In particular, the basis theorem implies that every algebraic set is the intersection of a finite number of hypersurfaces.

Another aspect of this article had a great impact on mathematics of the 20th century; this is the systematic use of non-constructive methods. For example, the basis theorem asserts that every ideal has a finite generator set, but the original proof does not provide any way to compute it for a specific ideal. This approach was so astonishing for mathematicians of that time that the first version of the article was rejected by Paul Gordan, the greatest specialist of invariants of that time, with the comment "This is not mathematics. This is theology." Later, he recognized "I have convinced myself that even theology has its merits."

Statement

If

R is a ring, let R[X] denote the ring of polynomials in the indeterminate X over R . Hilbert proved that if R is "not too large", in the sense that if R is Noetherian, the same must be true for R[X] . Formally,

Hilbert's Basis Theorem. If

R is a Noetherian ring, then R[X] is a Noetherian ring.

Corollary. If R is a Noetherian ring, then R[X _{1,...c,X} _{n]} is a Noetherian ring.

Hilbert proved the theorem (for the special case of multivariate polynomials over a field) in the course of his proof of finite generation of rings of invariants. The theorem is interpreted in algebraic geometry as follows: every algebraic set is the set of the common zeros of finitely many polynomials.

Hilbert's proof is highly non-constructive: it proceeds by induction on the number of variables, and, at each induction step uses the non-constructive proof for one variable less. Introduced more than eighty years later, Gröbner bases allow a direct proof that is as constructive as possible: Gröbner bases produce an algorithm for testing whether a polynomial belong to the ideal generated by other polynomials. So, given an infinite sequence of polynomials, one can construct algorithmically the list of those polynomials that do not belong to the ideal generated by the preceding ones. Gröbner basis theory implies that this list is necessarily finite, and is thus a finite basis of the ideal. However, for deciding whether the list is complete, one must consider every element of the infinite sequence, which cannot be done in the finite time allowed to an algorithm.

Proof

Theorem. If

R is a left (resp. right) Noetherian ring, then the polynomial ring R[X] is also a left (resp. right) Noetherian ring.

Remark. We will give two proofs, in both only the "left" case is considered; the proof for the right case is similar.

First proof

Suppose

ak a \subseteq R[X] is a non-finitely generated left ideal. Then by recursion (using the axiom of dependent choice) there is a sequence of polynomials \{ f _{0,} f _{1,} \ldots \} such that if ak b _{n} is the left ideal generated by f _{0,} \ldots, f _{n-1} then f _{n} \in ak a \setminus ak b _{n} is of minimal degree. By construction, \{\deg(f _{0),} \deg(f _{1),} \ldots \} is a non-decreasing sequence of natural numbers. Let a _{n} be the leading coefficient of f _{n} and let ak{b} be the left ideal in R generated by a _{0,a} _{1,\ldots} . Since R is Noetherian the chain of ideals(a _{0)\subset(a} _{0,a} _{1)\subset(a} _{0,a} _{1,a} _{2)} \subset …

must terminate. Thus

ak b = (a _{0,\ldots} ,a _{N-1} ) for some integer N . So in particular,a _{N=\sum} _{i<N} u _{i} a _{i} , u _{i} \in R.

Now consider

g = \sum _{i<N} u _{i} X ^{\deg(f _{N} ) - \deg(f _{i} )} f _{i} ,

whose leading term is equal to that of

f _{N} ; moreover, g\in ak b _{N} . However, f _{N} \notin ak b _{N} , which means that f _{N} - g \in ak a \setminus ak b _{N} has degree less than f _{N} , contradicting the minimality.

Second proof

Let

ak a \subseteq R[X] be a left ideal. Let ak b be the set of leading coefficients of members of ak a . This is obviously a left ideal over R , and so is finitely generated by the leading coefficients of finitely many members of ak a ; say f _{0,} \ldots, f _{N-1} . Let d be the maximum of the set \{\deg(f _{0),\ldots,} \deg(f _{N-1} )\} , and let ak b _{k} be the set of leading coefficients of members of ak a , whose degree is \le k . As before, the ak b _{k} are left ideals over R , and so are finitely generated by the leading coefficients of finitely many members of ak a , sayf ^{(k)} _{0} , \ldots, f ^{(k)} _{N ^{(k)} -1}

with degrees

\le k . Now let ak a ^{*\subseteq} R[X] be the left ideal generated by:\left\{f _{i} ,f ^{(k)} _{j} : i<N, j<N ^{(k)} , k<d \right\} .

We have

ak a ^{*\subseteqaka} and claim also ak a\subseteq ak a ^{*} . Suppose for the sake of contradiction this is not so. Then let h\in ak a \setminus ak a ^{*} be of minimal degree, and denote its leading coefficient by a .

Case 1:

\deg(h)\ge d . Regardless of this condition, we have a\in ak b , so a is a left linear combinationa = \sum _{j} u _{j} a _{j}

of the coefficients of the

f _{j} . Considerh _{0} = \sum _{j} u _{j} X ^{\deg(h) - \deg(f _{j} )} f _{j} ,

which has the same leading term as

h ; moreover h _{0} \in ak a ^{*} while h\notin ak a ^{*} . Therefore h - h _{0} \in ak a\setminus ak a ^{*} and \deg(h - h _{0)} < \deg(h) , which contradicts minimality.

Case 2:

\deg(h) = k < d . Then a\in ak b _{k} so a is a left linear combinationa = \sum _{j} u _{j} a ^{(k)} _{j}

of the leading coefficients of the

f ^{(k)} _{j} . Consideringh _{0=\sum} _{j} u _{j} X ^{\deg(h) - \deg(f ^{(k)} _{j} )} f ^{(k)} _{j} ,

we yield a similar contradiction as in Case 1.

Thus our claim holds, and

ak a = ak a ^{*} which is finitely generated.

Note that the only reason we had to split into two cases was to ensure that the powers of

X multiplying the factors were non-negative in the constructions.

Applications

Let

R be a Noetherian commutative ring. Hilbert's basis theorem has some immediate corollaries.

1. By induction we see that

R[X _{0,...c,X} _{n-1} ] will also be Noetherian.

1. Since any affine variety over

R ^{n} (i.e. a locus-set of a collection of polynomials) may be written as the locus of an ideal ak a\subset R[X _{0,} ... c, X _{n-1} ] and further as the locus of its generators, it follows that every affine variety is the locus of finitely many polynomials — i.e. the intersection of finitely many hypersurfaces.

1. If

A is a finitely-generated R -algebra, then we know that A \simeq R[X _{0,} ... c, X _{n-1} ] / ak a , where ak a is an ideal. The basis theorem implies that ak a must be finitely generated, say ak a = (p _{0,...c,} p _{N-1} ) , i.e. A is finitely presented.

Formal proofs

Formal proofs of Hilbert's basis theorem have been verified through the Mizar project (see HILBASIS file) and Lean (see ring_theory.polynomial).

Further reading

• Cox, Little, and O'Shea, Ideals, Varieties, and Algorithms, Springer-Verlag, 1997.
• Book: Reid, Constance.. Hilbert. Springer. 1996. 0-387-94674-8. New York. Constance Reid. The definitive English-language biography of Hilbert.