Degree-bounded incidence relation for a generically finite rational parametrization
ProvedAPSCounting893.Main.rational_incidence_relation_boundedLet be a field of characteristic zero and let be rational functions with a common nonzero denominator . Write and assume that and every have degree at most , where . Suppose that some of the are algebraically independent over .
There is a nonzero polynomial in matrix coefficients such that
and vanishes identically on the generic matrices whose free entries are and whose pivot entries satisfy
This is a degree-bounded equation for the incidence locus of the projective closure of the rationally parametrized image. It supplies the quantitative output-projection certificate used in Proposition 3.14 of the APS argument.
Formalization Note The identity is evaluated in the fraction field of the polynomial ring in the independent free coefficients. Thus it is a polynomial identity, not an assumption about sampled coefficients.
import Mathlib set_option autoImplicit false open MvPolynomial
theorem APSCounting893.Main.rational_incidence_relation_bounded {K : Type} [Field K] [CharZero K] {r m : ℕ}
(Q : MvPolynomial (Fin r) K) (hQ : Q ≠ 0)
(P : Fin m → MvPolynomial (Fin r) K)
(v : Fin m → FractionRing (MvPolynomial (Fin r) K))
(hP : ∀ i, algebraMap _ (FractionRing (MvPolynomial (Fin r) K)) (P i) =
algebraMap _ (FractionRing (MvPolynomial (Fin r) K)) Q * v i)
(g : Fin r → Fin m) (hg : AlgebraicIndependent K (v ∘ g))
(d : ℕ) (hd : 0 < d) (hdQ : Q.totalDegree ≤ d) (hdP : ∀ i, (P i).totalDegree ≤ d) :
∃ q : MvPolynomial (Fin (r+1) × Fin (m+1)) K,
q ≠ 0 ∧ q.totalDegree ≤ (r+1)*d^r ∧ (let E := FractionRing (MvPolynomial (Fin r) K)
let S := MvPolynomial (Fin (r+1) × Fin m) E
MvPolynomial.aeval (R := K) (S₁ := FractionRing S) (fun a : Fin (r+1) × Fin (m+1) =>
Fin.cases (-algebraMap S (FractionRing S) (∑ j : Fin m, MvPolynomial.X (a.1,j)*MvPolynomial.C (v j)))
(fun j => algebraMap S (FractionRing S) (MvPolynomial.X (a.1,j))) a.2) q = 0) := by sorry