Bounded polynomials annihilating the elliptic coordinate values
OpenWeierstrassEllipticZeta.bounded_subset_wp_annihilatorFix the elliptic-extension geometry of the current frontier. There exists a constant with the following property, uniform in all subsequent choices.
Retain the ambient hypotheses of bounded_subset_period_contact_obstruction: positive integers with ; a finite set containing zero; a bihomogeneous polynomial of bidegree ; the specified finite nonzero local orders of the normalized chart evaluations, at least on ; the bounds for the degrees of the th chart derivatives; and both chart certificates on .
For every subset containing zero with
there exists a nonzero polynomial such that
and
The polynomial may depend on all the displayed finite data. No coefficient or height bound is requested. Multiplicities are in the polynomial variable ; they are not asserted to follow automatically from the original chart derivative conditions. The geometric and chart-certificate assumptions stay on the ambient set .
This is a sufficient algebraic construction for the current period-count frontier. The bound on its degree, including the cost of the lattice class, is the remaining open geometric estimate. It is a derived proof target, not a numbered statement quoted from the source 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_annihilator (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 →
(Polynomial.X - Polynomial.C (G.L.weierstrassP z)) ^ ((U : ℕ) + 1) ∣ p
:= by sorry