Small monomial sets with stable boundary jet ranks or a period-class bound
OpenWeierstrassEllipticZeta.boundary_jet_rank_contact_obstructionFix the elliptic-extension geometry, its entire projective lift, differential flow, truncation function , and contact-ideal identities. There exists a constant that works uniformly as follows.
For every , consider
Let be finite and contain zero, and let be bihomogeneous of bidegree . Assume the normalized chart derivatives have degree at most and the fixed chart certificates have weight .
At every valid chart point, assume the normalized function has a unique first nonzero derivative index below , together with its analytic local power factorization. On , this index is at least .
Then either one can assign each to a valid chart and choose finite exponent sets containing zero such that
with the following property. For a chart , define
and let be the vector of the chart derivatives of of orders through , evaluated at every point assigned to chart . For both charts,
Or the period lattice satisfies
The jet vectors include all assigned contacts simultaneously. The constant is independent of the degree pair, the weight, the finite set, and the polynomial.
import Definitions.Def_WeierstrassEllipticZeta_InterfaceGeometry import Mathlib.Analysis.Analytic.Polynomial open WeierstrassEllipticZeta open scoped Pointwise Classical Topology
theorem WeierstrassEllipticZeta.boundary_jet_rank_contact_obstruction (G : Frontier.Geometry) :
∃ C : ℝ, 0 < C ∧ ∀ m n : ℕ, ∀ U : Fin ((G.B (m + 2 * n) - 2) / 3 + 1),
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 →
((∃ a : X → Fin 2,
(∀ x : X, G.S (extensionChartDenominator (a x)) x.val ≠ 0) ∧
∃ S : Fin 2 → Finset (Fin 4 →₀ ℕ),
let B := fun c : Fin 2 => (Finset.univ.biUnion fun i : Fin 4 =>
(S c).image (fun d => d + Finsupp.single i 1)) \ S c
let jets := fun (c : Fin 2) (p : MvPolynomial (Fin 4) ℂ)
(x : {z : X // a z = c}) (k : Fin ((U : ℕ) + 1)) =>
MvPolynomial.eval (extensionChartCoordinates G.S c x.val.val)
((extensionChartDerivation G.L.g₂ G.L.g₃ c)^[k.val] p)
((∑ c : Fin 2, (S c).card : ℕ) : ℝ) ≤ C * (m : ℝ) * (n : ℝ) ^ 2 ∧
(∀ c : Fin 2, 0 ∈ S c) ∧
∀ c : Fin 2,
Module.finrank ℂ (Submodule.span ℂ
((fun d : Fin 4 →₀ ℕ => jets c (MvPolynomial.monomial d 1)) ''
((S c ∪ B c : Finset (Fin 4 →₀ ℕ)) : Set (Fin 4 →₀ ℕ)))) =
Module.finrank ℂ (Submodule.span ℂ
((fun d : Fin 4 →₀ ℕ => jets c (MvPolynomial.monomial d 1)) ''
(S c : Set (Fin 4 →₀ ℕ))))) ∨
(((U : ℕ) + 1 : ℕ) : ℝ) * (G.L.lattice.mkQ '' (X : Set ℂ)).ncard ≤
C * (n : ℝ) ^ 2) := by sorry