Main theorem of elimination theory: Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>Whitlams
m A simple motivating example: fixed typo "parabola" should have been "hyperbola"
 
(No difference)

Latest revision as of 15:28, 17 August 2020

Template:Short description 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 Template:Math be a field, denote by kn the Template:Math-dimensional projective space over Template:Math. The main theorem of elimination theory is the statement that for any Template:Math and any algebraic variety Template:Mvar defined over Template:Math, the projection map V×knV sends Zariski-closed subsets to Zariski-closed subsets.

The main theorem of elimination theory is a corollary and a generalization of Macaulay's theory of multivariate resultant. The resultant of Template:Mvar homogeneous polynomials in Template:Mvar 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.

A simple motivating example

The affine plane over a field Template:Mvar is the direct product A2=Lx×Ly of two copies of Template:Mvar. Let

π:Lx×LyLx

be the projection

(x,y)π(x,y)=x.

This projection is not closed for the Zariski topology (nor for the usual topology if k= or k=), because the image by π of the hyperbola Template:Mvar of equation xy1=0 is Lx{0}, which is not closed, although Template:Mvar is closed, being an algebraic variety.

If one extends Ly to a projective line Py, the equation of the projective completion of the hyperbola becomes

xy1y0=0,

and contains

π(0,(1,0))=0,

where π is the prolongation of π to Lx×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 Template:Mvar-axis.

More generally, the image by π of every algebraic set in Lx×Ly is either a finite number of points, or Lx with a finite number of points removed, while the image by π of any algebraic set in Lx×Py is either a finite number of points or the whole line Ly. It follows that the image by π of any algebraic set is an algebraic set, that is that π is a closed map for Zariski topology.

The main theorem of elimination theory is a wide generalization of this property.

Classical formulation

For stating the theorem in terms of commutative algebra, one has to consider a polynomial ring R[𝐱]=R[x1,,xn] over a commutative Noetherian ring Template:Mvar, and a homogeneous ideal Template:Mvar generated by homogeneous polynomials f1,,fk. (In the original proof by Macaulay, Template:Mvar was equal to Template:Mvar, and Template:Mvar was a polynomial ring over the integers, whose indeterminates were all the coefficients of thefis.)

Any ring homomorphism φ from Template:Mvar into a field Template:Mvar, defines a ring homomorphism R[𝐱]K[𝐱] (also denoted φ), by applying φ to the coefficients of the polynomials.

The theorem is: there is an ideal 𝔯 in Template:Mvar, uniquely determined by Template:Mvar, such that, for every ring homomorphism φ from Template:Mvar into a field Template:Mvar, the homogeneous polynomials φ(f1),,φ(fk) have a nontrivial common zero (in an algebraic closure of Template:Mvar) if and only if φ(𝔯)={0}.

Moreover, 𝔯=0 if Template:Math, and 𝔯 is principal if Template:Math. In this latter case, a generator of 𝔯 is called the resultant of f1,,fk.

Using above notation, one has first to characterize the condition that φ(f1),,φ(fk) do not have any non-trivial common zero. This is the case if the maximal homogeneous ideal 𝔪=x1,,xn is the only homogeneous prime ideal containing φ(I)=φ(f1),,φ(fk). Hilbert's Nullstellensatz asserts that this is the case if and only if φ(I) contains a power of each xi, or, equivalently, that 𝔪dφ(I) for some positive integer Template:Mvar.

For this study, Macaulay introduced a matrix that is now called Macaulay matrix in degree Template:Mvar. Its rows are indexed by the monomials of degree Template:Mvar in x1,,xn, and its columns are the vectors of the coefficients on the monomial basis of the polynomials of the form mφ(fi), where Template:Mvar is a monomial of degree ddeg(fi). One has 𝔪dφ(I) if and only if the rank of the Macaulay matrix equals the number of its rows.

If Template:Math, the rank of the Macaulay matrix is lower than the number of its rows for every Template:Mvar, and, therefore, φ(f1),,φ(fk) have always a non-trivial common zero.

Otherwise, let di be the degree of fi, and suppose that the indices are chosen in order that d2d3dkd1. The degree

D=d1+d2++dnn+1=1+i=1n(di1)

is called Macaulay's degree or Macaulay's bound because Macaulay's has proved that φ(f1),,φ(fk) have a non-trivial common zero if and only if the rank of the Macaulay matrix in degree Template:Mvar is lower than the number to its rows. In other words, the above Template:Mvar may be chosen once for all as equal to Template:Mvar.

Therefore, the ideal 𝔯, whose existence is asserted by the main theorem of elimination theory, is the zero ideal if Template:Math, and, otherwise, is generated by the maximal minors of the Macaulay matrix in degree Template:Mvar.

If Template:Math, Macaulay has also proved that 𝔯 is a principal ideal (although Macaulay matrix in degree Template:Mvar is not a square matrix when Template:Math), which is generated by the resultant of φ(f1),,φ(fn). This ideal is also generically a prime ideal, as it is prime if Template:Mvar is the ring of integer polynomials with the all coefficients of φ(f1),,φ(fk) as indeterminates.

Geometrical interpretation

In the preceding formulation, the polynomial ring R[𝐱]=R[x1,,xn] defines a morphism of schemes (which are algebraic varieties if Template:Mvar is finitely generated over a field)

Rn1=Proj(R[𝐱])Spec(R).

The theorem asserts that the image of the Zariski-closed set Template:Math defined by Template:Mvar is the closed set Template:Math. Thus the morphism is closed.

See also

References