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.
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[1], where he solved several problems on invariants.
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.
"[2] Later, he recognized "I have convinced myself that even theology has its merits.
denote the ring of polynomials in the indeterminate
Formally, Hilbert's Basis Theorem.
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.
[1] 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.
is a non-finitely generated left ideal.
Then by recursion (using the axiom of dependent choice) there is a sequence of polynomials
is a non-decreasing sequence of natural numbers.
is Noetherian the chain of ideals must terminate.
be the set of leading coefficients of members of
be the set of leading coefficients of members of
be of minimal degree, and denote its leading coefficient by
Note that the only reason we had to split into two cases was to ensure that the powers of
multiplying the factors were non-negative in the constructions.
Hilbert's basis theorem has some immediate corollaries.
Formal proofs of Hilbert's basis theorem have been verified through the Mizar project (see HILBASIS file) and Lean (see ring_theory.polynomial).