Projective multiplicity obstruction on the explicit period quotient group
OpenWeierstrassEllipticZeta.quotient_group_projective_multiplicity_obstructionLet be a complex period pair with lattice , normalized entire sigma differential data , and entire functions having no common zero and satisfying
Let be a -linear map equal to the canonical zeta quasiperiod at every lattice element. Use the quotient group and maps
There is a real constant , uniform in the following inputs. Let be integers, finite with , and a complex bihomogeneous polynomial of bidegree in two additive and five elliptic projective coordinates. Suppose its entire evaluation is not identically zero. Suppose that at every and in every chart with , the evaluation
has vanishing order at least at . Then there are an additive subgroup and nonnegative integers with , such that either and , or and , and
Here orders are extended natural numbers and is the additive quotient map. This is the remaining geometric obstruction for the concrete period quotient: identification with the projective algebraic group, the multiplicity bound and the subgroup projection profiles remain to be proved. The complete quotient-geometry theorem supplies the canonical and transfers its conclusion to the parameter subgroup .
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.quotient_group_projective_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 ω) :
∃ 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, S j v ≠ 0 →
((3 * U + 1 : ℕ) : ℕ∞) ≤ analyticOrderAt
(fun z : ℂ => MvPolynomial.eval
![1, z, S 0 z / S j z, S 1 z / S j z,
S 2 z / S j z, S 3 z / S j z, S 4 z / S j z] 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