Multiplicity obstruction on the two-chart elliptic-extension locus
OpenWeierstrassEllipticZeta.projective_chart_locus_multiplicity_obstructionLet be a complex period pair with lattice , invariants , normalized entire sigma differential data , and entire functions without a common zero, satisfying
Let be a -linear map equal to the canonical quasiperiods. Put
Let be the locus
Let
Suppose has nonzero homogeneous coordinate vectors
for all . Write for a chosen nonzero representative of the underlying projective point .
There is a real constant uniform in integers , finite sets containing zero, and complex bihomogeneous polynomials of bidegree in two additive and five projective coordinates. Assume
If, for every and with , the function
has analytic vanishing order at least at , then there are an additive subgroup and nonnegative integers with , such that either and , or and , and
Here , , and is the additive quotient map. Analytic orders take values in the extended natural numbers. The map takes values in the part of the explicit projective algebraic locus covered by the two standard affine charts with coordinate indices zero and two. Its identification with an algebraic-group embedding, the geometric multiplicity bound and subgroup projection profiles remain open obligations; neither surjectivity onto the whole locus nor finiteness of subgroup intersections is assumed.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionChartLocus import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionLocus import Mathlib.LinearAlgebra.Projectivization.Basic import Definitions.Def_TranscendenceTheory_GraphQuotientExtension import Mathlib.Analysis.Analytic.Order import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Analysis.Calculus.IteratedDeriv.Defs import Mathlib.Algebra.Group.Pointwise.Finset.Basic import Mathlib.LinearAlgebra.Quotient.Basic import Mathlib.Data.Set.Card open WeierstrassEllipticZeta open scoped Pointwise open TranscendenceTheory
theorem WeierstrassEllipticZeta.projective_chart_locus_multiplicity_obstruction
(L : PeriodPair) (D : EllipticSigmaDifferentialData L)
(S : Fin 5 → ℂ → ℂ)
(hS : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
(hS_value : ∀ z : ℂ, z ∉ L.lattice → ∀ j : Fin 5,
S j z = D.sigma z ^ 3 * ![1, L.weierstrassP z, L.derivWeierstrassP z,
weierstrassZeta L z,
L.derivWeierstrassP z * weierstrassZeta L z + 2 * L.weierstrassP z ^ 2] j)
(hS_ne : ∀ z : ℂ, ∃ j : Fin 5, S j z ≠ 0)
(η : L.lattice →ₗ[ℤ] ℂ)
(hη : ∀ ω : L.lattice, η ω = zetaQuasiPeriod L ω)
(P : GraphQuotientExtension L.lattice η → ProjectiveExtensionChartLocus L.g₂ L.g₃)
(hP : ∀ z u : ℂ, ∃ hv :
![S 0 z, S 1 z, S 2 z, S 3 z + u * S 0 z, S 4 z + u * S 2 z] ≠ 0,
(P ((extensionPeriodGraph L.lattice η).mkQ (z, u))).val.val = Projectivization.mk ℂ
![S 0 z, S 1 z, S 2 z, S 3 z + u * S 0 z, S 4 z + u * S 2 z] hv) :
∃ 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) →
(fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) ≠ 0 →
(∀ v ∈ X + X + X, ∀ j : Fin 5,
(P ((extensionCurve L.lattice η v).2)).val.val.rep j ≠ 0 →
((3 * U + 1 : ℕ) : ℕ∞) ≤ analyticOrderAt
(fun z : ℂ => MvPolynomial.eval
![1, z,
(P ((extensionCurve L.lattice η z).2)).val.val.rep 0 /
(P ((extensionCurve L.lattice η z).2)).val.val.rep j,
(P ((extensionCurve L.lattice η z).2)).val.val.rep 1 /
(P ((extensionCurve L.lattice η z).2)).val.val.rep j,
(P ((extensionCurve L.lattice η z).2)).val.val.rep 2 /
(P ((extensionCurve L.lattice η z).2)).val.val.rep j,
(P ((extensionCurve L.lattice η z).2)).val.val.rep 3 /
(P ((extensionCurve L.lattice η z).2)).val.val.rep j,
(P ((extensionCurve L.lattice η z).2)).val.val.rep 4 /
(P ((extensionCurve L.lattice η z).2)).val.val.rep j] Q) v) →
∃ H : Submodule ℤ (GraphExtensionGroup L.lattice η), ∃ a b : ℕ,
((a = 1 ∧ H ≤ LinearMap.ker (extensionAdditiveProjection L.lattice η)) ∨
(a = 0 ∧ H ≤ LinearMap.ker (extensionEllipticProjection L.lattice η))) ∧
b ≤ 2 ∧
((U + 1 : ℕ) : ℝ) *
(H.mkQ '' (extensionCurve L.lattice η '' (X : Set ℂ))).ncard ≤
C * (m : ℝ) ^ a * (n : ℝ) ^ b := by sorry