An Elimination Method Based on Seidenberg’s Theory and Its Applications

Abstract

In this paper we present an elimination method for algebraically closed fields based on Seidenberg’s theory. The method produces, for any pair [PS, QS] of sets of multivariate polynomials, a sequence of triangular forms TF 1,…, TF e and polynomial sets US 1,…, US e such that the difference set of common zeros of PS and QS is the same as the union of the difference sets of common zeros of TF i and US i. Moreover, the triangular forms TF i and polynomial sets US i can be so computed as to give a necessary and sufficient condition for the given system to have algebraic zeros for some prescribed variables. This method has a number of applications such as to solving systems of polynomial equations and inequalities, mechanical theorem proving in geometry, irreducible decomposition of algebraic varieties and constructive proof of Hilbert’s Nullstellensatz which are partially discussed in the paper. Preliminary experiments show that the efficiency of this method is at least comparable with that of the well-known methods of characteristic sets and Gröbner bases for some applications. A few illustrative yet encouraging examples performed by a draft implementation of the method are given.KeywordsExtension FieldElimination MethodCommon ZeroTriangular FormIrreducible DecompositionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.