Coordinate contact recurrences and degree-weighted face bounds
OpenWeierstrassEllipticZeta.coordinate_recurrence_contact_obstructionUnder the geometric, analytic, degree, and chart-certificate hypotheses of the weighted-face frontier, there is a positive real constant , independent of the admissible , for which one of the following alternatives holds.
First, assign each point of to a valid chart . For each chart choose bounds and a nonzero polynomial such that and belongs to the contact ideal of order at every assigned point. These choices satisfy
In addition, for each chart and coordinate choose a polynomial supported in . At every point assigned to chart , the coordinate relation
belongs to the same contact ideal of order . The polynomial must work simultaneously at all points assigned to that chart.
Alternatively, the lattice classes represented by obey
These are open sufficient conditions for the preceding frontier. Coordinate relations in the contact ideals imply its box-boundary jet rank equalities. Their existence is retained as an explicit requirement, along with the uniform face bound and all original admissibility hypotheses. No converse asserting that every boundary rank equality gives such coordinate-only relations is claimed.
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.coordinate_recurrence_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) ∧
∃ b : Fin 2 → (Fin 4 →₀ ℕ),
∃ p : Fin 2 → MvPolynomial (Fin 4) ℂ,
((∑ c : Fin 2, ∑ i : Fin 4,
(p c).degreeOf i * ∏ j ∈ (Finset.univ : Finset (Fin 4)).erase i,
(b c j + 1) : ℕ) : ℝ) ≤ C * (m : ℝ) * (n : ℝ) ^ 2 ∧
(∀ c : Fin 2, p c ≠ 0) ∧
(∀ (c : Fin 2) (i : Fin 4), (p c).degreeOf i ≤ b c i) ∧
(∀ c : Fin 2, ∀ x : {z : X // a z = c},
p c ∈ extensionChartContactIdeal G.L.g₂ G.L.g₃ c
(extensionChartCoordinates G.S c x.val.val) ((U : ℕ) + 1)) ∧
∃ r : Fin 2 → Fin 4 → MvPolynomial (Fin 4) ℂ,
(∀ (c : Fin 2) (i : Fin 4), ∀ e ∈ (r c i).support,
e ≤ Finsupp.single i (b c i)) ∧
∀ (c : Fin 2) (i : Fin 4), ∀ x : {z : X // a z = c},
MvPolynomial.X i ^ (b c i + 1) - r c i ∈
extensionChartContactIdeal G.L.g₂ G.L.g₃ c
(extensionChartCoordinates G.S c x.val.val) ((U : ℕ) + 1)) ∨
(((U : ℕ) + 1 : ℕ) : ℝ) * (G.L.lattice.mkQ '' (X : Set ℂ)).ncard ≤
C * (n : ℝ) ^ 2) := by sorry