Canonical bounded linear division modulo a triangular ideal
ProvedWeierstrassEllipticZeta.triangular_bounded_modular_divisionLet , let be an ideal of , let be monic, and let . Write , let substitute for the four variables, and let substitute for . Assume
for every . Suppose satisfy .
There exists a complex-linear map with the explicit formula
For every it satisfies
and
For every polynomial of degree below ,
Furthermore, if and only if . The map is the unique complex-linear map for which every output has degree below and satisfies the displayed division congruence.
The modulus remainder is division by the monic polynomial . Subtraction in natural-number bounds is truncated; polynomial degree at zero is and multivariate total degree at zero is zero. The case , and hence , is included. The result applies under the explicit presentation and inverse-certificate hypotheses and does not assume additional contact geometry.
import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.MvPolynomial.Degrees import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Algebra.Polynomial.RingDivision import Mathlib.Algebra.Polynomial.Degree.Domain import Mathlib.Data.Complex.Basic import Mathlib.RingTheory.Ideal.Operations open scoped Classical
theorem WeierstrassEllipticZeta.triangular_bounded_modular_division
(I : Ideal (MvPolynomial (Fin 4) ℂ)) (M : Polynomial ℂ)
(hM : M.Monic) (r : Fin 3 → Polynomial ℂ)
(hmem : ∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p)
(q a : MvPolynomial (Fin 4) ℂ) (ha : 1 - a * q ∈ I) :
∃ T : MvPolynomial (Fin 4) ℂ →ₗ[ℂ] Polynomial ℂ,
(∀ p : MvPolynomial (Fin 4) ℂ,
T p = (MvPolynomial.aeval (Fin.cons Polynomial.X r) (p * a)) %ₘ M ∧
(T p).degree < (M.natDegree : ℕ) ∧
(Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) (T p)).totalDegree ≤
M.natDegree - 1 ∧
p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T p) * q ∈ I ∧
(p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T p) * q).totalDegree ≤
max p.totalDegree (M.natDegree - 1 + q.totalDegree) ∧
(∀ b : Polynomial ℂ, b.degree < (M.natDegree : ℕ) →
(p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b * q ∈ I ↔ b = T p))) ∧
(∀ p : MvPolynomial (Fin 4) ℂ, T p = 0 ↔ p ∈ I) ∧
(∀ T' : MvPolynomial (Fin 4) ℂ →ₗ[ℂ] Polynomial ℂ,
(∀ p : MvPolynomial (Fin 4) ℂ, (T' p).degree < (M.natDegree : ℕ) ∧
p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T' p) * q ∈ I) → T' = T) := by sorry