A Gröbner-based treatment of elimination theory for affine varieties (Q2470060): Difference between revisions

The paper contains a thorough study of the extension and closure theorems of elimination theory. The results are well known in principle so the main benefit of the paper is the concise presentation of the arguments based on Gröbner bases proof techniques. In more detail, let \(R=k[x_{l+1},\dots,x_n]\) be a polynomial ring over a field \(k\), \(I\) an ideal in \(S=R[x_1,\dots,x_l]\), \(I_l=I\cap R\) the elimination ideal, \(G\) a Gröbner basis of \(I\) with respect to a block elimination order and \(\pi_l:\mathbb A^n\to \mathbb A^{n-l}\) the projection morphism of affine spaces. Then the author gives an algorithm to construct an ideal \(J\) with \(I_l\subset J\subset R\) such that the complement of \(V(J)\) is dense in \(V(I_l)\) and \(\pi_l(V(I))\cup V(J)=V(I_l)\), i.e., \(V(J)\) is a locus where the prolongation of zeroes of \(I_l\) in \(\mathbb A^{n-l}\) to zeroes of \(I\) in \(\mathbb A^n\) may fail. The main idea for the algorithm stems from a careful study of the vanishing of leading coefficients of \(g\in G\) considered as elements of \(S\). Several examples of increasing complexity are discussed in detail.