Multi-homogeneous Bézout theorem

From HandWiki
Revision as of 06:42, 27 June 2023 by DanMescoff (talk | contribs) (fix)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In algebra and algebraic geometry, the multi-homogeneous Bézout theorem is a generalization to multi-homogeneous polynomials of Bézout's theorem, which counts the number of isolated common zeros of a set of homogeneous polynomials. This generalization is due to Igor Shafarevich.[1]

Motivation

Given a polynomial equation or a system of polynomial equations it is often useful to compute or to bound the number of solutions without computing explicitly the solutions.

In the case of a single equation, this problem is solved by the fundamental theorem of algebra, which asserts that the number of complex solutions is bounded by the degree of the polynomial, with equality, if the solutions are counted with their multiplicities.

In the case of a system of n polynomial equations in n unknowns, the problem is solved by Bézout's theorem, which asserts that, if the number of complex solutions is finite, their number is bounded by the product of the degrees of the polynomials. Moreover, if the number of solutions at infinity is also finite, then the product of the degrees equals the number of solutions counted with multiplicities and including the solutions at infinity.

However, it is rather common that the number of solutions at infinity is infinite. In this case, the product of the degrees of the polynomials may be much larger than the number of roots, and better bounds are useful.

Multi-homogeneous Bézout theorem provides such a better root when the unknowns may be split into several subsets such that the degree of each polynomial in each subset is lower than the total degree of the polynomial. For example, let [math]\displaystyle{ p_1, \ldots, p_{2n} }[/math] be polynomials of degree two which are of degree one in n indeterminate [math]\displaystyle{ x_1, \ldots x_n, }[/math] and also of degree one in [math]\displaystyle{ y_1, \ldots y_n. }[/math] (that is the polynomials are bilinear. In this case, Bézout's theorem bounds the number of solutions by

[math]\displaystyle{ 2^{2n}, }[/math]

while the multi-homogeneous Bézout theorem gives the bound (using Stirling's approximation)

[math]\displaystyle{ \binom{2n}{n}= \frac{(2n)!}{(n!)^2}\sim \frac{2^{2n}}{\sqrt{\pi n}}. }[/math]

Statement

A multi-homogeneous polynomial is a polynomial that is homogeneous with respect to several sets of variables.

More precisely, consider k positive integers [math]\displaystyle{ n_1, \ldots, n_k }[/math], and, for i = 1, ..., k, the [math]\displaystyle{ n_i+1 }[/math] indeterminates [math]\displaystyle{ x_{i,0}, x_{i,1}, \ldots, x_{i,n_i}. }[/math] A polynomial in all these indeterminates is multi-homogeneous of multi-degree [math]\displaystyle{ d_1, \ldots, d_k, }[/math] if it is homogeneous of degree [math]\displaystyle{ d_i }[/math] in [math]\displaystyle{ x_{i,0}, x_{i,1}, \ldots, x_{i,{n_i}}. }[/math]

A multi-projective variety is a projective subvariety of the product of projective spaces

[math]\displaystyle{ \mathbb P_{n_1}\times \cdots\times \mathbb P_{n_k}, }[/math]

where [math]\displaystyle{ \mathbb P_n }[/math] denote the projective space of dimension n. A multi-projective variety may be defined as the set of the common nontrivial zeros of an ideal of multi-homogeneous polynomials, where "nontrivial" means that [math]\displaystyle{ x_{i,0}, x_{i,1}, \ldots, x_{i,n} }[/math] are not simultaneously 0, for each i.

Bézout's theorem asserts that n homogeneous polynomials of degree [math]\displaystyle{ d_1, \ldots, d_n }[/math] in n + 1 indeterminates define either an algebraic set of positive dimension, or a zero-dimensional algebraic set consisting of [math]\displaystyle{ d_1\cdots d_n }[/math] points counted with their multiplicities.

For stating the generalization of Bézout's theorem, it is convenient to introduce new indeterminates [math]\displaystyle{ t_1, \ldots, t_k, }[/math] and to represent the multi-degree [math]\displaystyle{ d_1, \ldots, d_k }[/math] by the linear form [math]\displaystyle{ \mathbf d=d_1t_1+\cdots + d_kt_k. }[/math] In the following, "multi-degree" will refer to this linear form rather than to the sequence of degrees.

Setting [math]\displaystyle{ n=n_1+\cdots +n_k, }[/math] the multi-homogeneous Bézout theorem is the following.

With above notation, n multi-homogeneous polynomials of multi-degrees [math]\displaystyle{ \mathbf d_1, \ldots, \mathbf d_n }[/math] define either a multi-projective algebraic set of positive dimension, or a zero-dimensional algebraic set consisting of B points, counted with multiplicities, where B is the coefficient of

[math]\displaystyle{ t_1^{n_1}\cdots t_k^{n_k} }[/math]

in the product of linear forms

[math]\displaystyle{ \mathbf d_1 \cdots \mathbf d_n. }[/math]

Non-homogeneous case

The multi-homogeneous Bézout bound on the number of solutions may be used for non-homogeneous systems of equations, when the polynomials may be (multi)-homogenized without increasing the total degree. However, in this case, the bound may be not sharp, if there are solutions "at infinity".

Without insight on the problem that is studied, it may be difficult to group the variables for a "good" multi-homogenization. Fortunately, there are many problems where such a grouping results directly from the problem that is modeled. For example, in mechanics, equations are generally homogeneous or almost homogeneous in the lengths and in the masses.

References

  1. Shafarevich, I.R. (2012) [1977]. Basic Algebraic Geometry. Grundlehren der mathematischen Wissenschaften. 213. Springer. ISBN 978-3-642-96200-4. https://books.google.com/books?id=m6nwCAAAQBAJ.