Bounded nonzero auxiliary coefficients from grid matrices
ProvedWeierstrassEllipticZeta.bounded_auxiliary_polynomial_of_grid_matricesLet be a complex period pair and let . Let have positive -degree , and let . Assume that for every integer bivariate polynomial ,
Assume the bounded grid-matrix package AuxiliaryGridJetMatrixData for these data. With
this package supplies, for each fixed multiplier , uniformly bounded polynomial matrices on through order , with -degree below , -degree at most , length at most , size envelope , and the gap , where . Their common evaluated kernels at a point are exactly the vanishing of the corresponding ordinary monomial derivatives through order at . The package also contains nonzero-denominator presentations of all eight fixed/moving coordinates, their degree and length bounds, and the exact period-cleared and nonperiod-cleared entry evaluations. Matrices and presentations precede coefficient vectors.
There is such that for every sufficiently large one can choose , , with
and
Here the coefficient bounds quantify over every integer coefficient, including coefficients outside the support, and zero polynomial representatives are permitted. The vector after evaluation must be nonzero. No separate regular-grid, transcendence, monicity or denominator-nonvanishing hypothesis is imposed beyond the evaluation-kernel and grid-matrix assumptions. In particular, no geometric zero estimate is assumed. This is the coefficient-selection step in the proof of Lemma 8, with its matrix construction separated out.
import Definitions.Def_WeierstrassEllipticZeta_GridJetMatrices import Mathlib.RingTheory.Algebraic.Defs open scoped Polynomial open Filter WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.bounded_auxiliary_polynomial_of_grid_matrices
(L : PeriodPair) (ω u₁ u₂ θ ν : ℂ) (g : ℤ[X][X]) (d : ℤ[X])
(hg : 0 < g.natDegree)
(hker : ∀ p : ℤ[X][X],
p.eval₂ (Polynomial.aeval θ).toRingHom ν = 0 ↔ g ∣ p)
(hmat : AuxiliaryGridJetMatrixData L ω u₁ u₂ θ ν g d) :
∃ C : ℝ, 0 < C ∧ ∀ᶠ N : ℕ in Filter.atTop,
let m := auxiliaryL0 N
let l := auxiliaryL N
∃ p : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℤ[X][X],
(fun i => (p i).eval₂ (Polynomial.aeval θ).toRingHom ν) ≠ 0 ∧
(∀ i, (p i).natDegree < g.natDegree) ∧
(∀ i j, (((p i).coeff j).natDegree : ℝ) ≤ C * m) ∧
(∀ i j k, ‖((p i).coeff j).coeff k‖ ≤ Real.exp (C * N)) ∧
∀ v ∈ auxiliaryGrid u₁ u₂ ω ![auxiliaryS N, auxiliaryS N, auxiliaryS3 N],
∀ n ≤ m, iteratedDeriv n (fun w => ∑ i,
(p i).eval₂ (Polynomial.aeval θ).toRingHom ν * w ^ i.1.val *
L.weierstrassP w ^ i.2.1.val * weierstrassZeta L w ^ i.2.2.val)
(u₁ / 2 + v) = 0 := by sorry