Hilbert's basis theorem

From HandWiki
Short description: Polynomial rings are Noetherian rings

In mathematics, specifically commutative algebra, Hilbert's basis theorem says that a polynomial ring over a Noetherian ring is Noetherian.

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.[1]

Corollary. If

R

is a Noetherian ring, then

R[X1,,Xn]

is a Noetherian ring.

This can be translated into algebraic geometry as follows: every algebraic set over a field can be described as the set of common roots of finitely many polynomial equations. Hilbert proved the theorem (for the special case of polynomial rings over a field) in the course of his proof of finite generation of rings of invariants.[2]

Hilbert produced an innovative proof by contradiction using mathematical induction; his method does not give an algorithm to produce the finitely many basis polynomials for a given ideal: it only shows that they must exist. One can determine basis polynomials using the method of Gröbner bases.

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 𝔞R[X] is a non-finitely generated left ideal. Then by recursion (using the axiom of dependent choice) there is a sequence of polynomials {f0,f1,} such that if 𝔟n is the left ideal generated by f0,,fn1 then fn𝔞𝔟n is of minimal degree. By construction, {deg(f0),deg(f1),} is a non-decreasing sequence of natural numbers. Let an be the leading coefficient of fn and let 𝔟 be the left ideal in R generated by a0,a1,. Since R is Noetherian the chain of ideals

(a0)(a0,a1)(a0,a1,a2)

must terminate. Thus 𝔟=(a0,,aN1) for some integer N. So in particular,

aN=i<Nuiai,uiR.

Now consider

g=i<NuiXdeg(fN)deg(fi)fi,

whose leading term is equal to that of fN; moreover, g𝔟N. However, fN𝔟N, which means that fNg𝔞𝔟N has degree less than fN, contradicting the minimality.

Second proof

Let 𝔞R[X] be a left ideal. Let 𝔟 be the set of leading coefficients of members of 𝔞. This is obviously a left ideal over R, and so is finitely generated by the leading coefficients of finitely many members of 𝔞; say f0,,fN1. Let d be the maximum of the set {deg(f0),,deg(fN1)}, and let 𝔟k be the set of leading coefficients of members of 𝔞, whose degree is k. As before, the 𝔟k are left ideals over R, and so are finitely generated by the leading coefficients of finitely many members of 𝔞, say

f0(k),,fN(k)1(k)

with degrees k. Now let 𝔞*R[X] be the left ideal generated by:

{fi,fj(k): i<N,j<N(k),k<d}.

We have 𝔞*𝔞 and claim also 𝔞𝔞*. Suppose for the sake of contradiction this is not so. Then let h𝔞𝔞* be of minimal degree, and denote its leading coefficient by a.

Case 1: deg(h)d. Regardless of this condition, we have a𝔟, so a is a left linear combination
a=jujaj
of the coefficients of the fj. Consider
h0=jujXdeg(h)deg(fj)fj,
which has the same leading term as h; moreover h0𝔞* while h𝔞*. Therefore hh0𝔞𝔞* and deg(hh0)<deg(h), which contradicts minimality.
Case 2: deg(h)=k<d. Then a𝔟k so a is a left linear combination
a=jujaj(k)
of the leading coefficients of the fj(k). Considering
h0=jujXdeg(h)deg(fj(k))fj(k),
we yield a similar contradiction as in Case 1.

Thus our claim holds, and 𝔞=𝔞* 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[X0,,Xn1] will also be Noetherian.
  2. Since any affine variety over Rn (i.e. a locus-set of a collection of polynomials) may be written as the locus of an ideal 𝔞R[X0,,Xn1] 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.
  3. If A is a finitely-generated R-algebra, then we know that AR[X0,,Xn1]/𝔞, where 𝔞 is an ideal. The basis theorem implies that 𝔞 must be finitely generated, say 𝔞=(p0,,pN1), 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).

References

  1. Roman 2008, p. 136 §5 Theorem 5.9
  2. Hilbert, David (1890). "Über die Theorie der algebraischen Formen". Mathematische Annalen 36 (4): 473–534. doi:10.1007/BF01208503. ISSN 0025-5831. 

Further reading

  • Cox, Little, and O'Shea, Ideals, Varieties, and Algorithms, Springer-Verlag, 1997.
  • {{citation | last=Roman | first=Stephen