Poisson product formula in one block
ProvedMvResultant.poisson_blockLet , and let be the resultant of forms of degrees in variables. Here it is characterized by: vanishing exactly at systems with a nontrivial common zero, the normalization , and irreducibility. Fix and forms of degree for . Suppose is a set of points , each with and for all . Then for every form of degree ,
This is Poisson's formula in the case where the other equations are in general position, with the multiplicities settled by the exact block degree of the resultant. It expresses the dependence of the resultant on one equation through the values of that equation at the common zeros of the others.
Formalization Note The system with in place is Function.update F i φ. The resultant is evaluated through MvPolynomial.aeval of the coefficients of the system.
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly open HararySachs.Hyper
namespace MvResultant
theorem poisson_block {n : ℕ} {D : Fin n → ℕ} (hD : ∀ j, 1 ≤ D j)
(res : MvPolynomial (ResVar n D) ℤ) (hres : IsResultant n D res) (i : Fin n)
(F : Fin n → MvPolynomial (Fin n) ℂ) (hF : ∀ j, j ≠ i → (F j).IsHomogeneous (D j))
(P : Finset (Fin n → ℂ)) (hcard : P.card = ∏ j ∈ Finset.univ.erase i, D j)
(hP : ∀ p ∈ P, p i = 1 ∧ ∀ j, j ≠ i → MvPolynomial.eval p (F j) = 0)
(φ : MvPolynomial (Fin n) ℂ) (hφ : φ.IsHomogeneous (D i)) :
MvPolynomial.aeval
(fun v : ResVar n D => MvPolynomial.coeff v.2.1 (Function.update F i φ v.1))
(MvPolynomial.map (Int.castRingHom ℂ) res) =
MvPolynomial.aeval (fun v : ResVar n D =>
MvPolynomial.coeff v.2.1 (Function.update F i (MvPolynomial.X i ^ D i) v.1))
(MvPolynomial.map (Int.castRingHom ℂ) res) *
∏ p ∈ P, MvPolynomial.eval p φ := by sorry
end MvResultant