Two affine charts supply the analytic multiplicity inputs
ProvedWeierstrassEllipticZeta.two_chart_analytic_inputsLet the five complex functions be entire and satisfy
Let be a polynomial in seven variables, homogeneous of degree in its last five variables, and set
For either of the two affine charts, whose denominators are and , let be the evaluation of the corresponding normalized four-variable polynomial along the chart coordinates. Fix an arbitrary set and an integer .
Assume that has finite analytic order at at least one point where its chart denominator is nonzero. Assume also that at every point of , at least one valid affine chart has analytic order at least .
Then is not identically zero, and every projective normalization with nonzero denominator at a point of has analytic order at least there:
Only homogeneity in the last five variables is required. No multiplicity estimate, degree bound, finite enumeration of , or algebraic-group identification is assumed or concluded. The result supplies the analytic inputs needed to connect the older contact-ideal formulation of A.1 to its existing analytic obstruction formulation.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartNormalization import Mathlib.Analysis.Analytic.Order import Mathlib.Analysis.Analytic.Polynomial open WeierstrassEllipticZeta MvPolynomial open scoped Classical
theorem WeierstrassEllipticZeta.two_chart_analytic_inputs
(S : Fin 5 → ℂ → ℂ)
(hS : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
(hquad : ∀ z, S 0 z * S 4 z - S 2 z * S 3 z - 2 * S 1 z ^ 2 = 0)
(Q : MvPolynomial (Fin 7) ℂ) (n T : ℕ)
(hQ : ∀ d ∈ Q.support, d 2 + d 3 + d 4 + d 5 + d 6 = n)
(Y : Set ℂ)
(hfinite : ∃ (c : Fin 2) (z : ℂ), S (extensionChartDenominator c) z ≠ 0 ∧
analyticOrderAt (fun w => eval (extensionChartCoordinates S c w)
(extensionChartNormalize c Q)) z ≠ ⊤)
(hhigh : ∀ z ∈ Y, ∃ c : Fin 2, S (extensionChartDenominator c) z ≠ 0 ∧
(T : ℕ∞) ≤ analyticOrderAt (fun w => eval (extensionChartCoordinates S c w)
(extensionChartNormalize c Q)) z) :
(fun z : ℂ => eval ![1, z, S 0 z, S 1 z, S 2 z, S 3 z, S 4 z] Q) ≠ 0 ∧
∀ z ∈ Y, ∀ j : Fin 5, S j z ≠ 0 →
(T : ℕ∞) ≤ analyticOrderAt (fun w => eval
![1, w, S 0 w / S j w, S 1 w / S j w, S 2 w / S j w,
S 3 w / S j w, S 4 w / S j w] Q) z := by sorry