Dimension bound for the elliptic coordinate in the contact quotient
OpenWeierstrassEllipticZeta.bounded_subset_wp_cyclic_dimensionFix the elliptic-extension geometry of the frontier. There is a constant , uniform in all the following finite data.
Keep every ambient hypothesis of bounded_subset_wp_contact_polynomial: positive integers in the stated finite-jet range; a finite set containing zero; a bihomogeneous polynomial of bidegree ; the finite, nonzero normalized chart orders, at least on ; the degree bounds on iterated chart derivatives; and both chart certificates.
For each containing zero with
form the regular-chart contact quotient
Here records vanishing along the elliptic-extension chart flow through derivative order , at the point with coordinates . Let be the class of . Then
The dimension concerns the subalgebra generated by the elliptic coordinate, rather than the whole quotient. Finiteness and the correspondence with the least degree of a polynomial satisfying these contact conditions are proved separately. The quantitative estimate is the remaining open geometric step.
The constant, subset-size threshold, and additive term are exactly those of the parent. This is a derived reformulation of that frontier, not a numbered theorem quoted from the paper. A checked converse establishes equivalence with the parent using the same constant.
import Mathlib.RingTheory.Adjoin.Basic import Mathlib.Algebra.Polynomial.Roots import Mathlib.Algebra.Order.Archimedean.Real.Basic import Mathlib.Data.Finsupp.Interval import Mathlib.Order.Interval.Finset.Nat import Mathlib.RingTheory.MvPolynomial.Basic import Definitions.Def_WeierstrassEllipticZeta_InterfaceGeometry import Mathlib.Analysis.Analytic.Polynomial open WeierstrassEllipticZeta open scoped Pointwise Classical Topology
theorem WeierstrassEllipticZeta.bounded_subset_wp_cyclic_dimension (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 →
∀ Y : Finset ℂ, Y ⊆ X → 0 ∈ Y →
Y.card = ⌊(C * (m : ℝ) * (n : ℝ) ^ 2) /
(((U : ℕ) + 1 : ℕ) : ℝ)⌋₊ + 1 →
let Z := Y.filter (fun z => z ∉ G.L.lattice)
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ z : Z, extensionChartContactIdeal G.L.g₂ G.L.g₃ 0
(extensionChartCoordinates G.S 0 z.val) (3 * (U : ℕ) + 1)
let x := Ideal.Quotient.mk I (MvPolynomial.X (1 : Fin 4))
((2 * Module.finrank ℂ (Algebra.adjoin ℂ ({x} : Set _)) +
((U : ℕ) + 1) : ℕ) : ℝ) ≤ C * (n : ℝ) ^ 2 := by sorry