In algebraic geometry, the main theorem of elimination theory states that every projective scheme is proper. A version of this theorem predates the existence of scheme theory. It can be stated, proved, and applied in the following more classical setting. Let be a field, denote by
n | |
P | |
k |
V x
n | |
P | |
k |
\toV
The main theorem of elimination theory is a corollary and a generalization of Macaulay's theory of multivariate resultant. The resultant of homogeneous polynomials in variables is the value of a polynomial function of the coefficients, which takes the value zero if and only if the polynomials have a common non-trivial zero over some field containing the coefficients.
This belongs to elimination theory, as computing the resultant amounts to eliminate variables between polynomial equations. In fact, given a system of polynomial equations, which is homogeneous in some variables, the resultant eliminates these homogeneous variables by providing an equation in the other variables, which has, as solutions, the values of these other variables in the solutions of the original system.
A2=Lx x Ly
\pi\colonLx x Ly\toLx
(x,y)\mapsto\pi(x,y)=x.
This projection is not closed for the Zariski topology (nor for the usual topology if
k=\R
k=\C
\pi
xy-1=0
Lx\setminus\{0\},
If one extends
Ly
Py,
xy1-y0=0,
\overline\pi(0,(1,0))=0,
\overline\pi
\pi
Lx x Py.
This is commonly expressed by saying the origin of the affine plane is the projection of the point of the hyperbola that is at infinity, in the direction of the -axis.
More generally, the image by
\pi
Lx x Ly
Lx
\overline\pi
Lx x Py
Ly.
\overline\pi
\overline\pi
The main theorem of elimination theory is a wide generalization of this property.
R[x]=R[x1,\ldots,xn]
f1,\ldots,fk.
fis.
\varphi
R[x]\toK[x]
\varphi
\varphi
The theorem is: there is an ideal
akr
\varphi
\varphi(f1),\ldots,\varphi(fk)
\varphi(akr)=\{0\}.
Moreover,
akr=0
akr
akr
f1,\ldots,fk.
Using above notation, one has first to characterize the condition that
\varphi(f1),\ldots,\varphi(fk)
akm=\langlex1,\ldots,xn\rangle
\varphi(I)=\langle\varphi(f1),\ldots,\varphi(fk)\rangle.
\varphi(I)
xi,
akmd\subseteq\varphi(I)
For this study, Macaulay introduced a matrix that is now called Macaulay matrix in degree . Its rows are indexed by the monomials of degree in
x1,\ldots,xn,
m\varphi(fi),
d-\deg(fi).
akmd\subseteq\varphi(I)
If, the rank of the Macaulay matrix is lower than the number of its rows for every, and, therefore,
\varphi(f1),\ldots,\varphi(fk)
Otherwise, let
di
fi,
d2\ged3\ge … \gedk\ged1.
D=d1+d2+ … +dn-n+1=
n | |
1+\sum | |
i=1 |
(di-1)
\varphi(f1),\ldots,\varphi(fk)
Therefore, the ideal
akr,
If, Macaulay has also proved that
akr
\varphi(f1),\ldots,\varphi(fn).
\varphi(f1),\ldots,\varphi(fk)
R[x]=R[x1,\ldots,xn]
n-1 | |
P | |
R |
=\operatorname{Proj}(R[x])\to\operatorname{Spec}(R).
The theorem asserts that the image of the Zariski-closed set defined by is the closed set . Thus the morphism is closed.