Bounded resultant relation certificates in the elliptic contact quotient
OpenWeierstrassEllipticZeta.bounded_subset_resultant_relationsThere is a positive constant depending only on the mission geometry with the following property. Take the exact parameters and assumptions of bounded_subset_wp_univariate_jet_rank: positive , the prescribed finite range for , a finite containing zero, a polynomial of bidegree , the stated nonzero local chart orders and analytic factorizations with order at least on , all chart-derivation degree bounds, and the chart certificates.
For every containing zero with
put and . Let be the intersection of the order- chart-zero contact ideals at , put , and let be the class of the elliptic coordinate .
There exist , polynomials , and nonnegative integers such that all coefficients of have -degree at most , respectively, at least one polynomial has positive -degree,
and
The relations must vanish in the contact quotient, including its nilpotents; vanishing only at the underlying points is insufficient. The full parent hypotheses, uniform constant, finite range, and subset threshold are retained. The proved resultant bound yields the parent rank estimate. A Lean converse chooses , equal to the minimal polynomial of viewed as constant in , and , establishing equivalence with the same constant. The bounded relation construction remains open.
import Mathlib.RingTheory.Polynomial.Resultant.Basic import Mathlib.LinearAlgebra.Matrix.Rank 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_resultant_relations (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 N := 3 * (U : ℕ) + 1
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ z : Z, extensionChartContactIdeal G.L.g₂ G.L.g₃ 0
(extensionChartCoordinates G.S 0 z.val) N
let x := Ideal.Quotient.mk I (MvPolynomial.X (1 : Fin 4))
∃ (y : MvPolynomial (Fin 4) ℂ ⧸ I)
(F H : Polynomial (Polynomial ℂ)) (a b : ℕ),
(∀ i, (F.coeff i).natDegree ≤ a) ∧
(∀ i, (H.coeff i).natDegree ≤ b) ∧
(F.natDegree ≠ 0 ∨ H.natDegree ≠ 0) ∧
F.resultant H ≠ 0 ∧
F.eval₂ (Polynomial.aeval x).toRingHom y = 0 ∧
H.eval₂ (Polynomial.aeval x).toRingHom y = 0 ∧
((2 * (F.natDegree * b + H.natDegree * a) + ((U : ℕ) + 1) : ℕ) : ℝ) ≤
C * (n : ℝ) ^ 2 := by sorry