Coordinate recurrences reduce every box boundary monomial
ProvedWeierstrassEllipticZeta.box_coordinate_recurrence_reductioncommutative-algebratranscendence-theory
Let be a commutative ring, let be a finite variable set, and fix coordinate bounds . For each coordinate , let have support contained in . Thus involves only the variable and has degree at most .
Define the box and its coordinate boundary by
For every , there exists a polynomial supported in such that, for every ideal ,
The reduction can be chosen independently of the ideal. Zero bounds, zero recurrence polynomials, and an empty variable set are allowed. No field, domain, or independence hypothesis is required. The theorem supplies all box-boundary reductions from one coordinate recurrence per variable.
Preamble
import Mathlib.Algebra.MvPolynomial.Basic import Mathlib.Data.Finsupp.Interval import Mathlib.Order.Interval.Finset.Nat import Mathlib.RingTheory.Ideal.Basic open scoped Classical Pointwise noncomputable section
Formal statement
theorem WeierstrassEllipticZeta.box_coordinate_recurrence_reduction
(K σ : Type*) [CommRing K] [Fintype σ] [DecidableEq σ]
(b : σ →₀ ℕ) (r : σ → MvPolynomial σ K)
(hsupport : ∀ i : σ, ∀ e ∈ (r i).support, e ≤ Finsupp.single i (b i)) :
let S := Finset.Iic b
let B := (Finset.univ.biUnion fun i : σ =>
S.image (fun d => d + Finsupp.single i 1)) \ S
∀ d ∈ B, ∃ q : MvPolynomial σ K, q.support ⊆ S ∧
∀ I : Ideal (MvPolynomial σ K),
(∀ i : σ, MvPolynomial.X i ^ (b i + 1) - r i ∈ I) →
MvPolynomial.monomial d 1 - q ∈ I := by sorry
Source
Derived coordinate-recurrence certificate for the frontier https://prove2.me/theorems/1cce73f4-b850-4bca-a245-16357d88ad77. The mission context is Senthil Kumar K (2026), Algebraic independence of values of Weierstrass elliptic and zeta functions, Appendix A.2 and Theorem A.2, https://doi.org/10.1017/S001309152610145X. The box boundary reduction is derived using Mathlib commit 0df444a360eaa60ab8c11dca51a86af692955474, Algebra/MvPolynomial/Basic.lean (monomial_add_single, support_mul), Data/Finsupp/Single.lean (erase_same, erase_ne), and closure of ideals under multiplication. The connecting sketch reuses the proved finite_jet_span_interpolation and finite_span_rank_stability_iff theorems. The existence of suitable coordinate relations and the uniform geometric estimate remain open.