Finite auxiliary systems from bounded nonzero derivatives
ProvedWeierstrassEllipticZeta.complex_auxiliary_systems_of_bounded_grid_derivativesLet be a period pair with lattice and canonical Weierstrass functions . Fix complex numbers , a bivariate integer polynomial of positive outer degree, and with . Assume the regular auxiliary-grid data, auxiliary-parameter estimates, off the lattice, and the cleared zeta addition identity. No algebraic or transcendence assumption on is needed for this construction.
Use the actual parameters
the unshifted grids and , and . Write
Assume AuxiliaryGridJetMatrixData: a constant such that for every integer derivative cutoff , a constant gives, for all sufficiently large , polynomial matrices for , , together with their nonlattice coordinate presentations. Their outer degrees are below , inner degrees are bounded by , and coefficient lengths by . The size bound and dimension gap hold. Their evaluations are exactly the period-cleared monomial derivatives at lattice points and the eight-denominator-cleared translate derivatives at nonlattice points. At each point their common evaluated kernel is exactly the vanishing of all original derivatives through order . Matrices and presentations are chosen before the coefficient vector.
Assume also the following two uniform size estimates, conditional on the vanishing of all for on , and of all derivatives below at :
- For each real , , all sufficiently large give, for every coefficient vector with , every , and ,
- For each presentation constant , real , , all sufficiently large give, for every vector with , every , every permitted eight-coordinate presentation at , and ,
where are its nonzero evaluated denominators and .
Finally assume the bounded nonzero-derivative estimate: there is an integer such that for all sufficiently large , every nonzero coefficient vector has for some and .
Then there are constants such that for all sufficiently large there is a ComplexAuxiliarySystem with coefficient budget , size and polynomial-height budget , decay constant , and outer degree strictly below . Explicitly, it consists of finite polynomial linear equations and tests, with at least eight times as many columns as equations, polynomial degree and coefficient bounds prescribed by that structure, and the property that every nonzero complex vector of norm at most in each coordinate satisfying the equations has a nonzero test value of norm at most . The equations and all tests precede the choice of that vector. One can take . The bounded nonzero-derivative estimate is an input, not a conclusion of this theorem.
import Definitions.Def_WeierstrassEllipticZeta_GridJetMatrices import Definitions.Def_TranscendenceTheory_ComplexAuxiliarySystem open scoped Polynomial open Filter WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.complex_auxiliary_systems_of_bounded_grid_derivatives
(L : PeriodPair) (ω u₁ u₂ θ ν : ℂ) (g : ℤ[X][X]) (d : ℤ[X])
(hg : 0 < g.natDegree) (hd : Polynomial.aeval θ d ≠ 0)
(h_grid : RegularAuxiliaryGridData L ω u₁ u₂)
(h_parameters : AuxiliaryGridParameterData L ω u₁ u₂)
(h_zeta_deriv : ∀ z : ℂ, z ∉ L.lattice →
HasDerivAt (weierstrassZeta L) (-L.weierstrassP z) z)
(h_zeta_addition : ∀ z v : ℂ,
z ∉ L.lattice → v ∉ L.lattice → z + v ∉ L.lattice →
2 * (L.weierstrassP v - L.weierstrassP z) * weierstrassZeta L (z + v) =
2 * (weierstrassZeta L z + weierstrassZeta L v) *
(L.weierstrassP v - L.weierstrassP z) +
L.derivWeierstrassP v - L.derivWeierstrassP z)
(h_grid_matrices : AuxiliaryGridJetMatrixData L ω u₁ u₂ θ ν g d)
(h_period_decay : ∀ B K : ℝ, 0 ≤ B → 0 < K → ∀ᶠ N : ℕ in atTop,
let m := auxiliaryL0 N
let l := auxiliaryL N
∀ c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ,
(∀ i, ‖c i‖ ≤ Real.exp (B * N)) →
let f : ℂ → ℂ := fun z => ∑ i, c i * z ^ i.1.val *
L.weierstrassP z ^ i.2.1.val * weierstrassZeta L z ^ i.2.2.val
(∀ x ∈ shiftedAuxiliaryGrid u₁ u₂ ω
![auxiliaryS N, auxiliaryS N, auxiliaryS3 N],
∀ j < m + 1, iteratedDeriv j f x = 0) →
∀ v ∈ auxiliaryGrid u₁ u₂ ω
![3 * auxiliaryS N, 3 * auxiliaryS N, 3 * auxiliaryS3 N],
v ∈ L.lattice → ∀ n : ℕ, (n : ℝ) ≤ K * m →
(∀ j < n, iteratedDeriv j f (u₁ / 2 + v) = 0) →
‖(Polynomial.aeval θ d) ^ (7 * (m + 2 * l + n)) * iteratedDeriv n f (u₁ / 2 + v)‖ ≤
Real.exp (-(N : ℝ) ^ 2 * Real.log N / 147456))
(h_arithmetic_nonlattice_decay : ∀ (C : ℕ) (B K : ℝ), 0 ≤ B → 0 < K → ∀ᶠ N : ℕ in Filter.atTop,
let m := auxiliaryL0 N
let l := auxiliaryL N
let s := auxiliaryS N
∀ c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ,
(∑ i, ‖c i‖) ≤ Real.exp (B * N) →
let F : ℂ → ℂ := fun w => ∑ i, c i * w ^ i.1.val *
L.weierstrassP w ^ i.2.1.val * weierstrassZeta L w ^ i.2.2.val
(∀ x ∈ shiftedAuxiliaryGrid u₁ u₂ ω ![s, s, auxiliaryS3 N],
∀ j < m + 1, iteratedDeriv j F x = 0) →
∀ v ∈ auxiliaryGrid u₁ u₂ ω ![3 * s, 3 * s, 3 * auxiliaryS3 N],
v ∉ L.lattice →
∀ P : NonlatticeCoordinatePresentation L θ ν v (u₁ / 2) C N s,
∀ n : ℕ, (n : ℝ) ≤ K * m →
(∀ j < n, iteratedDeriv j F (u₁ / 2 + v) = 0) →
‖(∏ a, MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν]
(P.denominator a) ^ nonlatticeJetWeight m l n a) *
(2 * (L.weierstrassP v - L.weierstrassP (u₁ / 2))) ^ (3 * l) *
iteratedDeriv n F (u₁ / 2 + v)‖ ≤
Real.exp (-(N : ℝ) ^ 2 * Real.log N / 147456))
(h_escape : ∃ 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) :
∃ a c : ℝ, 0 < a ∧ 0 < c ∧
∀ᶠ N : ℕ in Filter.atTop,
∃ S : TranscendenceTheory.ComplexAuxiliarySystem
θ ν a ((3 + ‖θ‖ + ‖ν‖) * a) c N,
S.yDegree < g.natDegree := by sorry