Point-count or period-class degree bound from local multiplicities
OpenWeierstrassEllipticZeta.projection_degree_multiplicity_obstructionFix the elliptic-extension geometry with its entire projective lift, compatible differential flow, truncation function , and contact-ideal identities. There is a real constant with the following property.
Let , let be a finite subset of the complex numbers containing zero, and let be bihomogeneous of bidegree . Assume the normalized derivatives have degree at most and both charts have the fixed finite contact certificates of weight .
At every valid chart point, assume the normalized chart function has a unique first nonzero derivative index less than , and locally factors as the corresponding power times an analytic function nonzero at the point. On , that index is at least .
Then at least one of the following bounds holds, with the period lattice:
This is the remaining quantitative multiplicity estimate. The hypotheses are exactly those of the parent frontier; the conclusion is the proved equivalent numerical form of its subgroup bound.
import Definitions.Def_WeierstrassEllipticZeta_InterfaceGeometry import Mathlib.Analysis.Analytic.Polynomial open WeierstrassEllipticZeta open scoped Pointwise Classical Topology
theorem WeierstrassEllipticZeta.projection_degree_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 →
(((U + 1 : ℕ) : ℝ) * X.card ≤ C * (m : ℝ) * (n : ℝ) ^ 2 ∨
((U + 1 : ℕ) : ℝ) * (G.L.lattice.mkQ '' (X : Set ℂ)).ncard ≤
C * (n : ℝ) ^ 2) := by sorry