Polynomial certificate or period-class multiplicity bound
OpenWeierstrassEllipticZeta.time_eliminant_multiplicity_obstructionFix the elliptic-extension geometry, including its projective lift, compatible differential flow, truncation function , and contact-ideal identities. There is a constant with the following property.
Let , let be a finite subset of the complex numbers containing zero, and let be bihomogeneous of bidegree . Retain the normalized derivative degree bound, both fixed chart certificates, and the parent's local analytic factorization and first-nonzero-derivative assumptions. The local order is less than everywhere in a valid chart and at least on .
Then either there is a nonzero univariate complex polynomial satisfying
or the period-class bound holds:
where is the period lattice.
The first alternative is a concrete polynomial certificate for the parent's point-count bound. All hypotheses and the period-class alternative are unchanged. Constructing a certificate of the required degree from the geometric hypotheses, or establishing the period alternative, remains the open quantitative step.
import Definitions.Def_WeierstrassEllipticZeta_InterfaceGeometry import Mathlib.Analysis.Analytic.Polynomial open WeierstrassEllipticZeta open scoped Pointwise Classical Topology
theorem WeierstrassEllipticZeta.time_eliminant_multiplicity_obstruction (G : Frontier.Geometry) :
∃ C : ℝ, 0 < C ∧ ∀ m n U : ℕ,
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 →
((∃ P : Polynomial ℂ, P ≠ 0 ∧
(P.natDegree : ℝ) ≤ C * (m : ℝ) * (n : ℝ) ^ 2 ∧
∀ x ∈ X, ∀ k < U + 1, (Polynomial.derivative^[k] P).eval x = 0) ∨
((U + 1 : ℕ) : ℝ) * (G.L.lattice.mkQ '' (X : Set ℂ)).ncard ≤
C * (n : ℝ) ^ 2) := by sorry