Lower bound for the block degrees of the resultant
ProvedMvResultant.blockDegree_geLet 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, by specialisation. Fix for . Their common projective zeros are the distinct points with and each a -th root of unity. Restricted to these forms, becomes a polynomial in the coefficients of , which is homogeneous of degree . It vanishes on each hyperplane , so it is divisible by pairwise non-associate linear forms. It is nonzero: at there is no common zero. Hence .
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly open HararySachs.Hyper
namespace MvResultant
theorem blockDegree_ge {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