Unique bounded time-polynomial inverses modulo finite contact ideals
ProvedWeierstrassEllipticZeta.triangular_contact_bounded_inverseFix complex elliptic parameters , a chart , a finite set , and contact orders . Write , for the chart contact ideal of order at , and .
Assume that for every , and assume the explicit Chinese remainder property: every family has a simultaneous representative with .
Let be monic and . Define by substituting for , and by substituting for . Assume the exact membership criterion
Let satisfy whenever , and set .
There exists such that
and
This is unique among polynomials of degree less than satisfying the inverse congruence. Moreover, for every ,
and .
The subtraction in natural-number degree bounds is truncated. Polynomial degree takes the value at zero, while multivariate total degree of zero is zero. Empty contact sets, zero contact orders and are included. All contact and presentation assumptions above are explicit hypotheses of the formal statement.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.MvPolynomial.Degrees import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Algebra.Polynomial.Div import Mathlib.Algebra.Polynomial.Degree.Domain import Mathlib.Data.Complex.Basic import Mathlib.RingTheory.Ideal.Operations open WeierstrassEllipticZeta open scoped Classical
theorem WeierstrassEllipticZeta.triangular_contact_bounded_inverse
(g₂ g₃ : ℂ) (c : Fin 2) (V : Finset (Fin 4 → ℂ)) (n : V → ℕ)
(hpower : ∀ v : V, RingHom.ker (MvPolynomial.eval v.val) ^ n v ≤
extensionChartContactIdeal g₂ g₃ c v.val (n v))
(hcrt : ∀ p : V → MvPolynomial (Fin 4) ℂ,
∃ q : MvPolynomial (Fin 4) ℂ, ∀ v : V,
q - p v ∈ extensionChartContactIdeal g₂ g₃ c v.val (n v))
(M : Polynomial ℂ) (hM : M.Monic) (r : Fin 3 → Polynomial ℂ)
(hmem : ∀ f : MvPolynomial (Fin 4) ℂ,
f ∈ (⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)) ↔
M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f)
(q : MvPolynomial (Fin 4) ℂ)
(hq : ∀ v : V, 0 < n v → MvPolynomial.eval v.val q ≠ 0) :
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
∃ b : Polynomial ℂ,
b.degree < (M.natDegree : ℕ) ∧
(Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) b).totalDegree ≤
M.natDegree - 1 ∧
1 - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b * q ∈ I ∧
(1 - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b * q).totalDegree ≤
M.natDegree - 1 + q.totalDegree ∧
(∀ b' : Polynomial ℂ, b'.degree < (M.natDegree : ℕ) →
1 - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b' * q ∈ I → b' = b) ∧
(∀ f : MvPolynomial (Fin 4) ℂ, f * q ∈ I ↔ f ∈ I) ∧
I ⊔ Ideal.span {q} = ⊤ := by sorry