![]() |
|
|
| |
|
||||
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. A slightly more general statement of Hilbert's basis theorem is: if R is a left (respectively right) Noetherian ring, then the polynomial ring R[X] is also left (respectively right) Noetherian. The Mizar project has completely formalized and automatically checked a proof of Hilbert's basis theorem in the HILBASIS file (http://www.mizar.org/JFM/Vol12/hilbasis.html). ReferenceCox, Little, and O'Shea, Ideals, Varieties, and Algorithms, Springer-Verlag, 1997. de:Hilbertscher Basissatz |
|
|
|
|
|
|
|
Copyright 2008 WordIQ.com - Privacy Policy
::
Terms of Use
:: Contact Us
:: About Us This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Hilbert's Basis Theorem". |