A bounded nonzero derivative on the enlarged auxiliary grid
ProvedWeierstrassEllipticZeta.auxiliary_grid_bounded_nonzero_derivativeLet be a complex period pair with lattice and canonical Weierstrass functions . Let satisfy RegularAuxiliaryGridData: the integer map
is injective; lies in exactly when ; two integer points are congruent modulo exactly when their first two coordinates agree; and every is outside . The data also includes the standard finite-grid cardinality, shifted-grid regularity and radius estimates, and period-translation formulas for and .
Define the unshifted rectangular grid
with integer indices, and put
There is an integer such that, for every sufficiently large integer and every nonzero coefficient vector , the function
has a nonzero derivative for some and some integer . The constant and the threshold are uniform in the coefficient vector. No size bound or initial vanishing condition is imposed on the coefficients. All evaluation points are regular by the grid hypotheses.
This is the bounded-order zero estimate needed in the auxiliary construction. It does not assert an upper bound on the magnitude of the selected derivative. The analytic estimates and arithmetic construction are separate proved steps.
import Definitions.Def_WeierstrassEllipticZeta_GridJetMatrices import Definitions.Def_TranscendenceTheory_ComplexAuxiliarySystem open scoped Polynomial open Filter WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.auxiliary_grid_bounded_nonzero_derivative
(L : PeriodPair) (ω u₁ u₂ : ℂ)
(h_grid : RegularAuxiliaryGridData L ω u₁ u₂) :
∃ K : ℕ, 1 ≤ K ∧ ∀ᶠ N : ℕ in Filter.atTop,
let m := auxiliaryL0 N
let l := auxiliaryL N
∀ c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ,
c ≠ 0 → ∃ v ∈ auxiliaryGrid u₁ u₂ ω
![3 * auxiliaryS N, 3 * auxiliaryS N, 3 * auxiliaryS3 N],
∃ n : ℕ, n ≤ K * m ∧
iteratedDeriv n (fun w => ∑ i, c i * w ^ i.1.val *
L.weierstrassP w ^ i.2.1.val * weierstrassZeta L w ^ i.2.2.val)
(u₁ / 2 + v) ≠ 0 := by sorry
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.