Bézout's theorem

Template:Short description Template:About Bézout's theorem is a statement in algebraic geometry concerning the number of common zeros of Template:Mvar polynomials in Template:Mvar indeterminates. In its original form the theorem states that in general the number of common zeros equals the product of the degrees of the polynomials.<ref>Template:MacTutor Biography</ref> It is named after Étienne Bézout.

In some elementary texts, Bézout's theorem refers only to the case of two variables, and asserts that, if two plane algebraic curves of degrees <math>d_1</math> and <math>d_2</math> have no component in common, they have <math>d_1d_2</math> intersection points, counted with their multiplicity, and including points at infinity and points with complex coordinates.Template:Sfn

In its modern formulation, the theorem states that, if Template:Mvar is the number of common points over an algebraically closed field of Template:Mvar projective hypersurfaces defined by homogeneous polynomials in Template:Math indeterminates, then Template:Mvar is either infinite, or equals the product of the degrees of the polynomials. Moreover, the finite case occurs almost always.

In the case of two variables and in the case of affine hypersurfaces, if multiplicities and points at infinity are not counted, this theorem provides only an upper bound of the number of points, which is almost always reached. This bound is often referred to as the Bézout bound.

Bézout's theorem is fundamental in computer algebra and effective algebraic geometry, by showing that most problems have a computational complexity that is at least exponential in the number of variables. It follows that in these areas, the best complexity that can be hoped for will occur with algorithms that have a complexity that is polynomial in the Bézout bound.

History

In the case of plane curves, Bézout's theorem was essentially stated by Isaac Newton in his proof of Lemma 28 of volume 1 of his Principia in 1687, where he claims that two curves have a number of intersection points given by the product of their degrees.Template:Sfn However, Newton had stated the theorem as early as 1665.<ref>Template:Cite book</ref>

The general theorem was later published in 1779 in Étienne Bézout's Théorie générale des équations algébriques. He supposed the equations to be "complete", which in modern terminology would translate to generic. Since with generic polynomials, there are no points at infinity, and all multiplicities equal one, Bézout's formulation is correct, although his proof does not follow the modern requirements of rigor. This and the fact that the concept of intersection multiplicity was outside the knowledge of his time led to a sentiment expressed by some authors that his proof was neither correct nor the first proof to be given.<ref>Template:Cite book</ref>

The proof of the statement that includes multiplicities requires an accurate definition of the intersection multiplicities, and was therefore not possible before the 20th century. The definitions of multiplicities that was given during the first half of the 20th century involved continuous and infinitesimal deformations. It follows that the proofs of this period apply only over the field of complex numbers. It is only in 1958 that Jean-Pierre Serre gave a purely algebraic definition of multiplicities, which led to a proof valid over any algebraically closed field.Template:Sfn

Modern studies related to Bézout's theorem obtained different upper bounds to system of polynomials by using other properties of the polynomials, such as the Bernstein–Kushnirenko theorem, or generalized it to a large class of functions, such as Nash functions.<ref>Template:Cite journal</ref>

Statement

Plane curves

Suppose that X and Y are two plane projective curves defined over a field F that do not have a common component (this condition means that X and Y are defined by polynomials, without common divisor of positive degree). Then the total number of intersection points of X and Y with coordinates in an algebraically closed field E that contains F, counted with their multiplicities, is equal to the product of the degrees of X and Y.

General case

The generalization in higher dimension may be stated as:

Let n projective hypersurfaces be given in a projective space of dimension n over an algebraically closed field, which are defined by n homogeneous polynomials in n + 1 variables, of degrees <math>d_1, \ldots,d_n.</math> Then either the number of intersection points is infinite, or the number of intersection points, counted with multiplicity, is equal to the product <math>d_1 \cdots d_n.</math> If the hypersurfaces are in relative general position, then there are <math>d_1 \cdots d_n</math> intersection points, all with multiplicity 1.

There are various proofs of this theorem, which either are expressed in purely algebraic terms, or use the language of algebraic geometry. Three algebraic proofs are sketched below.

Bézout's theorem has been generalized as the so-called multi-homogeneous Bézout theorem.

Affine case

The affine case of the theorem is the following statement, that was proven in 1983 by David Masser and Gisbert Wüstholz.Template:Sfn

Consider Template:Mvar affine hypersurfaces that are defined over an algebraically closed field by Template:Mvar polynomials in Template:Mvar variables, of degrees <math>d_1, \ldots,d_n.</math> Then either the number of intersection points is infinite, or the number of intersection points, counted with their multiplicities, is at most the product <math>d_1 \cdots d_n.</math> If the hypersurfaces are in relative general position, then there are exactly <math>d_1 \cdots d_n</math> intersection points, all with multiplicity 1.

The last assertion is a corollary of Bézout's theorem, but the first assertion is not, because of the possibility of a finite number of intersection points in the affine space, together with infinitely many intersection points at infinity.

This theorem a corollary, not explicitly stated, of a more general statement proved by Masser and Wüstholz.

For stating the general result, one has to recall that the intersection points form an algebraic set, and that there is a finite number of intersection points if and only if all component of the intersection have a zero dimension (an algebraic set of positive dimension has an infinity of points over an algebraically closed field). An intersection point is said isolated if it does not belong to a component of positive dimension of the intersection; the terminology make sense, since an isolated intersection point has neighborhoods (for Zariski topology or for the usual topology in the case of complex hypersurfaces) that does not contain any other intersection point.

Consider Template:Mvar projective hypersurfaces that are defined over an algebraically closed field by Template:Mvar homogeneous polynomials in <math>n+1</math> variables, of degrees <math>d_1, \ldots,d_n.</math> Then, the sum of the multiplicities of their isolated intersection points is at most the product <math>d_1 \cdots d_n.</math> The result remains valid for any number Template:Mvar of hypersurfaces, if one sets <math>d_{m+1}=0</math> in the case <math>m<n,</math> and, otherwise, if one orders the degrees for having <math>d_2\ge d_3\ge\cdots \ge d_m \ge d_1.</math> That is, there is no isolated intersection point if <math>m<n,</math> and, otherwise, the bound is the product of the smallest degree and the <math>n-1</math> largest degrees.

Examples (plane curves)

Two lines

The equation of a line in a Euclidean plane is linear, that is, it equates a polynomial of degree one to zero. So, the Bézout bound for two lines is Template:Math, meaning that two lines either intersect at a single point, or do not intersect. In the latter case, the lines are parallel and meet at a point at infinity.

One can verify this with equations. The equation of a first line can be written in slope-intercept form <math>y=sx+m</math> or, in projective coordinates <math>y=sx+mt</math> (if the line is vertical, one may exchange Template:Mvar and Template:Mvar). If the equation of a second line is (in projective coordinates) <math>ax+by+ct=0,</math> by substituting <math>sx+mt</math> for Template:Mvar in it, one gets <math>(a+bs)x + (c+bm)t=0.</math> If <math>a+bs\ne 0, </math> one gets the Template:Mvar-coordinate of the intersection point by solving the latter equation in Template:Mvar and putting Template:Math

If <math>a+bs= 0, </math> that is <math>s=-a/b,</math> the two line are parallel as having the same slope. If <math>m\ne -c/b,</math> they are distinct, and the substituted equation gives Template:Math. This gives the point at infinity of projective coordinates Template:Math.

A line and a curve

As above, one may write the equation of the line in projective coordinates as <math>y=sx+mt.</math> If curve is defined in projective coordinates by a homogeneous polynomial <math>p(x,y,t)</math> of degree Template:Mvar, the substitution of Template:Mvar provides a homogeneous polynomial of degree Template:Mvar in Template:Mvar and Template:Mvar. The fundamental theorem of algebra implies that it can be factored in linear factors. Each factor gives the ratio of the Template:Mvar and Template:Mvar coordinates of an intersection point, and the multiplicity of the factor is the multiplicity of the intersection point.

If Template:Mvar is viewed as the coordinate of infinity, a factor equal to Template:Mvar represents an intersection point at infinity.

If at least one partial derivative of the polynomial Template:Mvar is not zero at an intersection point, then the tangent of the curve at this point is defined (see Template:Slink), and the intersection multiplicity is greater than one if and only if the line is tangent to the curve. If all partial derivatives are zero, the intersection point is a singular point, and the intersection multiplicity is at least two.

Two conic sections

Two conic sections generally intersect in four points, some of which may coincide. To properly account for all intersection points, it may be necessary to allow complex coordinates and include the points on the infinite line in the projective plane. For example:

• Two circles never intersect in more than two points in the plane, while Bézout's theorem predicts four. The discrepancy comes from the fact that every circle passes through the same two complex points on the line at infinity. Writing the circle <math display="block">(x-a)^2+(y-b)^2 = r^2</math> in homogeneous coordinates, we get <math display="block">(x-az)^2+(y-bz)^2 - r^2z^2 = 0,</math> from which it is clear that the two points Template:Math and Template:Math lie on every circle. When two circles do not meet at all in the real plane, the two other intersections have non-real coordinates, or if the circles are concentric then they meet at exactly the two points on the line at infinity with an intersection multiplicity of two.
• Any conic should meet the line at infinity at two points according to the theorem. A hyperbola meets it at two real points corresponding to the two directions of the asymptotes. An ellipse meets it at two complex points, which are conjugate to one anotherTemplate:Mdashin the case of a circle, the points Template:Math and Template:Math. A parabola meets it at only one point, but it is a point of tangency and therefore counts twice.
• The following pictures show examples in which the circle Template:Math meets another ellipse in fewer intersection points because at least one of them has multiplicity greater than one:

{{#invoke:Gallery|gallery}}

Multiplicity

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} The concept of multiplicity is fundamental for Bézout's theorem, as it allows having an equality instead of a much weaker inequality.

Intuitively, the multiplicity of a common zero of several polynomials is the number of zeros into which the common zero can split when the coefficients are slightly changed. For example, a tangent to a curve is a line that cuts the curve at a point that splits in several points if the line is slightly moved. This number is two in general (ordinary points), but may be higher (three for inflection points, four for undulation points, etc.). This number is the "multiplicity of contact" of the tangent.

This definition of a multiplicities by deformation was sufficient until the end of the 19th century, but has several problems that led to more convenient modern definitions: Deformations are difficult to manipulate; for example, in the case of a root of a univariate polynomial, for proving that the multiplicity obtained by deformation equals the multiplicity of the corresponding linear factor of the polynomial, one has to know that the roots are continuous functions of the coefficients. Deformations cannot be used over fields of positive characteristic. Moreover, there are cases where a convenient deformation is difficult to define (as in the case of more than two plane curves having a common intersection point), and even cases where no deformation is possible.Template:Citation needed

Currently, following Jean-Pierre Serre, a multiplicity is generally defined as the length of a local ring associated with the point where the multiplicity is considered.Template:Sfn Most specific definitions can be shown to be special case of Serre's definition.

In the case of Bézout's theorem, the general intersection theory can be avoided, as there are proofs (see below) that associate to each input data for the theorem a polynomial in the coefficients of the equations, which factorizes into linear factors, each corresponding to a single intersection point. So, the multiplicity of an intersection point is the multiplicity of the corresponding factor. The proof that this multiplicity equals the one that is obtained by deformation, results then from the fact that the intersection points and the factored polynomial depend continuously on the roots.

Proofs

Using the resultant (plane curves)

Let Template:Mvar and Template:Mvar be two homogeneous polynomials in the indeterminates Template:Math of respective degrees Template:Mvar and Template:Mvar. Their zeros are the homogeneous coordinates of two projective curves. Thus the homogeneous coordinates of their intersection points are the common zeros of Template:Mvar and Template:Mvar.

By collecting together the powers of one indeterminate, say Template:Mvar, one gets univariate polynomials whose coefficients are homogeneous polynomials in Template:Mvar and Template:Math.

For technical reasons, one must apply a change of coordinates so the degrees in Template:Mvar of Template:Mvar and Template:Mvar equal their total degrees (Template:Mvar and Template:Mvar), and each line passing through two intersection points does not pass through the point Template:Math (this means that no two point have the same [[Cartesian coordinate system|Cartesian Template:Mvar-coordinate]].

The resultant Template:Math of Template:Mvar and Template:Mvar with respect to Template:Mvar is a homogeneous polynomial in Template:Mvar and Template:Mvar that has the following property: <math>R(\alpha,\tau)=0</math> with <math>(\alpha, \tau)\ne (0,0)</math> if and only if it exist <math>\beta</math> such that <math>(\alpha, \beta, \tau)</math> is a common zero of Template:Mvar and Template:Mvar (see Template:Slink). The above technical condition ensures that <math>\beta</math> is unique. The first above technical condition means that the degrees used in the definition of the resultant are Template:Mvar and Template:Mvar; this implies that the degree of Template:Mvar is Template:Mvar (see Template:Slink).

As Template:Mvar is a homogeneous polynomial in two indeterminates, the fundamental theorem of algebra implies that Template:Mvar is a product of Template:Mvar linear polynomials. If one defines the multiplicity of a common zero of Template:Mvar and Template:Mvar as the number of occurrences of the corresponding factor in the product, Bézout's theorem is thus proved.

For proving that the intersection multiplicity that has just been defined equals the definition in terms of a deformation, it suffices to remark that the resultant and thus its linear factors are continuous functions of the coefficients of Template:Mvar and Template:Mvar.

Proving the equality with other definitions of intersection multiplicities relies on the technicalities of these definitions and is therefore outside the scope of this article.

Using Template:Mvar-resultant

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} In the early 20th century, Francis Sowerby Macaulay introduced the multivariate resultant (also known as Macaulay's resultant) of Template:Mvar homogeneous polynomials in Template:Mvar indeterminates, which is generalization of the usual resultant of two polynomials. Macaulay's resultant is a polynomial function of the coefficients of Template:Mvar homogeneous polynomials that is zero if and only the polynomials have a nontrivial (that is some component is nonzero) common zero in an algebraically closed field containing the coefficients.

The Template:Mvar-resultant is a particular instance of Macaulay's resultant, introduced also by Macaulay. Given Template:Mvar homogeneous polynomials <math>f_1,\ldots,f_n</math> in Template:Math indeterminates <math>x_0, \ldots, x_n,</math> the Template:Mvar-resultant is the resultant of <math>f_1,\ldots,f_n,</math> and <math>U_0x_0+\cdots +U_nx_n,</math> where the coefficients <math>U_0, \ldots, U_n</math> are auxiliary indeterminates. The Template:Mvar-resultant is a homogeneous polynomial in <math>U_0, \ldots, U_n,</math> whose degree is the product of the degrees of the <math>f_i.</math>

Although a multivariate polynomial is generally irreducible, the Template:Mvar-resultant can be factorized into linear (in the <math>U_i</math>) polynomials over an algebraically closed field containing the coefficients of the <math>f_i.</math> These linear factors correspond to the common zeros of the <math>f_i</math> in the following way: to each common zero <math>(\alpha_0, \ldots, \alpha_n)</math> corresponds a linear factor <math>(\alpha_0 U_0 + \cdots + \alpha_n U_n),</math> and conversely.

This proves Bézout's theorem, if the multiplicity of a common zero is defined as the multiplicity of the corresponding linear factor of the Template:Mvar-resultant. As for the preceding proof, the equality of this multiplicity with the definition by deformation results from the continuity of the Template:Mvar-resultant as a function of the coefficients of the <math>f_i.</math>

This proof of Bézout's theorem seems the oldest proof that satisfies the modern criteria of rigor.

Using the degree of an ideal

Bézout's theorem can be proved by recurrence on the number of polynomials by using the following theorem.

Let Template:Mvar be a projective algebraic set of dimension <math>\delta</math> and degree <math>d_1</math>, and Template:Mvar be a hypersurface (defined by a single polynomial) of degree <math>d_2</math>, that does not contain any irreducible component of Template:Mvar; under these hypotheses, the intersection of Template:Mvar and Template:Mvar has dimension <math>\delta-1</math> and degree <math>d_1d_2.</math>

For a (sketched) proof using Hilbert series, see Template:Slink.

Beside allowing a conceptually simple proof of Bézout's theorem, this theorem is fundamental for intersection theory, since this theory is essentially devoted to the study of intersection multiplicities when the hypotheses of the above theorem do not apply.

See also

• Multi-homogeneous Bézout theorem
• Template:Annotated link
• Template:Annotated link

Notes

<references/>

References

• Template:Cite book
• Template:Cite journal
• Template:Citation Alternative translation of earlier (2nd) edition of Newton's Principia.
• Template:Cite book

External links

• Template:Springer
• {{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web

|_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:BezoutsTheorem%7CBezoutsTheorem.html}} |title = Bézout's Theorem |author = Weisstein, Eric W. |website = MathWorld |access-date = |ref = Template:SfnRef }}

• Bezout's Theorem at MathPages