Elimination theory

In commutative algebra and algebraic geometry, elimination theory is the classical name for algorithmic approaches to eliminating between polynomials of several variables.

The linear case would now routinely be handled by Gaussian elimination, rather than the theoretical solution provided by Cramer's rule. In the same way, computational techniques for elimination can in practice be based on Gröbner basis methods. There is however older literature on types of "eliminant", including "resultants" to find common roots of polynomials, "discriminants" and so on. In particular the discriminant appears in invariant theory, and is often constructed as the invariant of either a curve or an "n"-ary "k"-ic form. Whilst discriminants are always constructed resultants, the variety of constructions and their meaning tends to vary. A modern and systematic version of theory of the discriminant has been developed by Gelfand and coworkers. Some of the systematic methods have a homological basis, that can be made explicit, as in Hilbert's theorem on syzygies. This field is at least as old as Bézout's theorem.

The historical development of commutative algebra, which was initially called "ideal theory", is closely linked to concepts in elimination theory: ideas of Kronecker, who wrote a major paper on the subject, were adapted by Hilbert and effectively 'linearised' while dropping the explicit constructive content. The process continued over many decades: the work of F.S. Macaulay who gave his name to Cohen-Macaulay modules was motivated by elimination.

There is also a logical content to elimination theory, as seen in the Boolean satisfiability problem. In the worst case it is presumably hard to eliminate variables computationally. "Elimination of quantifiers" is a term used in mathematical logic to explain that in some cases—algebraic geometry of projective space over an algebraically closed field being one—existential quantifiers can be removed. The content of this, in the geometric case, is that an algebraic correspondence (i.e., a Zariski-closed relation) between two projective spaces projects to a Zariski-closed set: the condition on "x" that "x" R "y" for some "y" is a polynomial condition on "x". There is some historical evidence that this fact influenced Hilbert's thinking about the prospects for proof theory.

See also

* Buchberger algorithm
* Resultant

References

* Israel Gelfand, Mikhail Kapranov, Andrey Zelevinsky, "Discriminants, resultants, and multidimensional determinants". Mathematics: Theory & Applications. Birkhäuser Boston, Inc., Boston, MA, 1994. x+523 pp. ISBN 0-8176-3660-9
* Serge Lang, "Algebra". Revised third edition. Graduate Texts in Mathematics, vol. 211. Springer-Verlag, New York, 2002. xvi+914 pp. ISBN 0-387-95385-X