Genericity certificate: the other rows have the full set of normalized common zeros
ProvedHararySachs.Hyper.generic_row_pointsLet , , , let be the normalized resultant of forms of degree , and fix a row . For a complex tensor , let
Then there is a nonzero polynomial in the entries of with the following property. Whenever :
- there are distinct points with that are common zeros of for all ;
- the resultant of the system obtained by replacing with is nonzero.
Condition 2 says that the other equations have no common zero on the hyperplane . Together with condition 1 it says that they are in general position: their common zeros are distinct points, all off that hyperplane. This is the hypothesis under which Poisson's product formula takes its simple form, and since it holds on a Zariski-dense set.
Formalization Note The conclusion is stated with explicit forms X j ^ (k-1) - ∑ t, C (a (j,t)) * ∏ s, X (t s); the resultant in condition 2 is the evaluation of res at the coefficients of the system with row replaced by X i ^ (k-1).
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly
namespace HararySachs.Hyper
theorem generic_row_points (n k : ℕ) (hk : 2 ≤ k) (hn : 1 ≤ n)
(res : MvPolynomial (ResVar n (fun _ => k - 1)) ℤ)
(hres : IsResultant n (fun _ => k - 1) res) (i : Fin n) :
∃ Δ : MvPolynomial (Fin n × (Fin (k - 1) → Fin n)) ℂ, Δ ≠ 0 ∧
∀ a : Fin n × (Fin (k - 1) → Fin n) → ℂ, MvPolynomial.eval a Δ ≠ 0 →
(∃ P : Finset (Fin n → ℂ), P.card = (k - 1) ^ (n - 1) ∧
∀ p ∈ P, p i = 1 ∧ ∀ j, j ≠ i →
MvPolynomial.eval p (MvPolynomial.X j ^ (k - 1) -
∑ t : Fin (k - 1) → Fin n,
MvPolynomial.C (a (j, t)) * ∏ s, MvPolynomial.X (t s)) = 0) ∧
MvPolynomial.aeval (fun v : ResVar n (fun _ => k - 1) =>
MvPolynomial.coeff v.2.1 (Function.update
(fun j => MvPolynomial.X j ^ (k - 1) -
∑ t : Fin (k - 1) → Fin n,
MvPolynomial.C (a (j, t)) * ∏ s, MvPolynomial.X (t s))
i (MvPolynomial.X i ^ (k - 1)) v.1))
(MvPolynomial.map (Int.castRingHom ℂ) res) ≠ 0 := by sorry
end HararySachs.Hyper