Upper bound for the block degrees of the resultant
ProvedMvResultant.blockDegree_leLet and . Let be the multivariate resultant of homogeneous forms in variables. It is characterised (IsResultant, following Hu–Huang–Ling–Qi, Definition 1.1) by three properties:
- it vanishes at the coefficients of over if and only if the forms have a common nonzero zero;
- ;
- it is irreducible over .
For , the -th block is the set of coefficient variables of the form . A polynomial is homogeneous of degree in block if every monomial in its support has total exponent in these variables (weighted homogeneity with weight on block and elsewhere).
Statement. Assume for all . If is homogeneous of degree in block , then
Expected proof, via the Macaulay determinant. Put , and build the square Macaulay matrix indexed by the monomials of degree :
- each row monomial is assigned to the first form with , with the form placed last in the order;
- the row lists the coefficients of .
Then:
- vanishes on every solvable system, since the monomial vector of a common zero lies in its kernel;
- on the diagonal system, so ;
- the rows assigned to are linear in block , and there are exactly of them.
By Divisibility from the Nullstellensatz: every polynomial vanishing at all solvable systems is divisible by . This holds because the vanishing locus of is the set of solvable systems, and is prime, hence radical, since is irreducible. So , which gives the bound.
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly open HararySachs.Hyper
namespace MvResultant
theorem blockDegree_le {n : ℕ} {D : Fin n → ℕ} (hD : ∀ j, 1 ≤ D j)
(res : MvPolynomial (ResVar n D) ℤ) (hres : IsResultant n D res) (i : Fin n) (δ : ℕ)
(hδ : res.IsWeightedHomogeneous (fun v : ResVar n D => if v.1 = i then 1 else 0) δ) :
δ ≤ ∏ j ∈ Finset.univ.erase i, D j := by sorry
end MvResultant