Box degree counts and boundary jet stability at contacts
OpenWeierstrassEllipticZeta.box_degree_boundary_jet_contact_obstructionUnder the geometric, analytic, degree, and chart-certificate hypotheses of the support-translation 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 a coordinate bound and a nonzero polynomial satisfying . The polynomial belongs to the contact ideal of order at every point assigned to that chart. For the box and its coordinate boundary
the span of the joint derivative-evaluation vectors of monomials indexed by has the same dimension as the span indexed by . Here the vector records the chart derivation iterates of orders at all assigned points. These choices also satisfy the numerical estimate
Alternatively, the number of distinct lattice classes represented by satisfies
This is an open sufficient construction for the preceding frontier. Choosing boxes is an additional requirement; it is not claimed that arbitrary finite support sets are boxes. The zero exponent automatically lies in each box. All contact conditions, boundary rank equalities, admissibility conditions, and the uniformity of are retained.
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.box_degree_boundary_jet_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 →₀ ℕ),
let S := fun c : Fin 2 => Finset.Iic (b c)
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)
∃ p : Fin 2 → MvPolynomial (Fin 4) ℂ,
((∑ c : Fin 2, ∏ i : Fin 4, (b c i + 1) : ℕ) : ℝ) ≤
C * (m : ℝ) * (n : ℝ) ^ 2 +
((∑ c : Fin 2, ∏ i : Fin 4, (b c i - (p c).degreeOf i + 1) : ℕ) : ℝ) ∧
(∀ 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)) ∧
∀ 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