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.
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 bound 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 p 1 , … , p 2 n {\displaystyle p_{1},\ldots ,p_{2n}} be polynomials of degree two which are of degree one in n indeterminate x 1 , … x n , {\displaystyle x_{1},\ldots x_{n},} and also of degree one in y 1 , … y n . {\displaystyle y_{1},\ldots y_{n}.} (that is the polynomials are bilinear. In this case, Bézout's theorem bounds the number of solutions by
2 2 n , {\displaystyle 2^{2n},}
while the multi-homogeneous Bézout theorem gives the bound (using Stirling's approximation)
( 2 n n ) = ( 2 n ) ! ( n ! ) 2 ∼ 2 2 n π n . {\displaystyle {\binom {2n}{n}}={\frac {(2n)!}{(n!)^{2}}}\sim {\frac {2^{2n}}{\sqrt {\pi n}}}.}
Statement A multi-homogeneous polynomial is a polynomial that is homogeneous with respect to several sets of variables. More precisely, consider k positive integers n 1 , … , n k {\displaystyle n_{1},\ldots ,n_{k}} , and, for i = 1, ..., k, the n i + 1 {\displaystyle n_{i}+1} indeterminates x i , 0 , x i , 1 , … , x i , n i . {\displaystyle x_{i,0},x_{i,1},\ldots ,x_{i,n_{i}}.} A polynomial in all these indeterminates is multi-homogeneous of multi-degree d 1 , … , d k , {\displaystyle d_{1},\ldots ,d_{k},} if it is homogeneous of degree d i {\displaystyle d_{i}} in x i , 0 , x i , 1 , … , x i , n i . {\displaystyle x_{i,0},x_{i,1},\ldots ,x_{i,{n_{i}}}.}
A multi-projective variety is a projective subvariety of the product of projective spaces
P n 1 × ⋯ × P n k , {\displaystyle \mathbb {P} _{n_{1}}\times \cdots \times \mathbb {P} _{n_{k}},}
… excerpt ends here. Continue reading the full article.
