Bounded polynomials with high analytic contact in the elliptic coordinate
OpenWeierstrassEllipticZeta.bounded_subset_wp_contact_polynomialFix the elliptic-extension geometry of the current frontier. There is a constant , uniform in the following data.
Keep all the hypotheses of bounded_subset_wp_annihilator: positive integers with ; a finite set containing zero; a bihomogeneous polynomial of bidegree ; the prescribed finite nonzero orders of the normalized chart evaluations, at least on ; degree bounds on the iterated chart derivatives; and both chart certificates on .
For each containing zero with
there is a nonzero polynomial such that
and
The constant depends only on the fixed geometry; the polynomial may depend on all the finite data. There is no coefficient or height requirement. No contact condition is imposed at lattice points, where has a pole.
This is a derived target for the quantitative polynomial construction. Its contact condition concerns the new polynomial , so it still must be deduced from the hypotheses on . The analytic multiplicity transfer is proved separately. The uniform degree and contact construction remains open; this statement does not assert the full zero estimate from the paper.
import Mathlib.Algebra.Polynomial.Roots import Mathlib.Algebra.Order.Archimedean.Real.Basic import Mathlib.Data.Finsupp.Interval import Mathlib.Order.Interval.Finset.Nat import Mathlib.RingTheory.MvPolynomial.Basic import Definitions.Def_WeierstrassEllipticZeta_InterfaceGeometry import Mathlib.Analysis.Analytic.Polynomial open WeierstrassEllipticZeta open scoped Pointwise Classical Topology
theorem WeierstrassEllipticZeta.bounded_subset_wp_contact_polynomial (G : Frontier.Geometry) :
∃ C : ℝ, 0 < C ∧ ∀ m n : ℕ, ∀ U : Fin ((G.B (m + 2 * n) - 2) / 3 + 1),
1 ≤ m → 1 ≤ n → 1 ≤ (U : ℕ) → ∀ X : Finset ℂ,
0 ∈ X → ∀ Q : MvPolynomial (Fin 7) ℂ,
(∀ d ∈ Q.support, d 0 + d 1 = m ∧
d 2 + d 3 + d 4 + d 5 + d 6 = n) →
(∀ (c : Fin 2) (z : ℂ), G.S (extensionChartDenominator c) z ≠ 0 →
let f := fun w => MvPolynomial.eval (extensionChartCoordinates G.S c w)
(extensionChartNormalize c Q)
∃! k : ℕ, k < G.B (m + 2 * n) ∧
(z ∈ X + X + X → 3 * (U : ℕ) + 1 ≤ k) ∧
(∀ j < k, iteratedDeriv j f z = 0) ∧ iteratedDeriv k f z ≠ 0 ∧
∃ g : ℂ → ℂ, AnalyticAt ℂ g z ∧ g z ≠ 0 ∧
f =ᶠ[𝓝 z] (fun w => (w - z) ^ k * g w)) →
(∀ (c : Fin 2) (k : ℕ),
((extensionChartDerivation G.L.g₂ G.L.g₃ c)^[k] (extensionChartNormalize c Q)).totalDegree ≤
m + 2 * n + k) →
Frontier.HasChartCertificates G m n (U : ℕ) X Q →
∀ Y : Finset ℂ, Y ⊆ X → 0 ∈ Y →
Y.card = ⌊(C * (m : ℝ) * (n : ℝ) ^ 2) /
(((U : ℕ) + 1 : ℕ) : ℝ)⌋₊ + 1 →
∃ p : Polynomial ℂ, p ≠ 0 ∧
((2 * p.natDegree + ((U : ℕ) + 1) : ℕ) : ℝ) ≤ C * (n : ℝ) ^ 2 ∧
∀ z ∈ Y, z ∉ G.L.lattice → ∀ j < 3 * (U : ℕ) + 1,
iteratedDeriv j (fun w => p.eval (G.L.weierstrassP w)) z = 0
:= by sorry