Finite admissible translations characterize supported monomial multiples
ProvedWeierstrassEllipticZeta.finite_support_translation_certificatecommutative-algebratranscendence-theory
Let be a field, a nonzero polynomial, and a finite exponent set. Define the set of admissible translations
Then is finite, , and for every exponent ,
The variable set may be infinite, and may be empty. The statement does not assume that admissible translations themselves belong to .
Preamble
import Mathlib.Algebra.MvPolynomial.Basic import Mathlib.Data.Set.Card open scoped Pointwise noncomputable section
Formal statement
theorem WeierstrassEllipticZeta.finite_support_translation_certificate
(K σ : Type*) [Field K] (p : MvPolynomial σ K) (hp : p ≠ 0)
(S : Finset (σ →₀ ℕ)) :
let E : Set (σ →₀ ℕ) := {d | ∀ e ∈ p.support, e + d ∈ S}
E.Finite ∧ E.ncard ≤ S.card ∧
∀ d : σ →₀ ℕ, (p * MvPolynomial.monomial d 1).support ⊆ S ↔ d ∈ E := by sorry
Source
Derived support-translation certificate for the frontier https://prove2.me/theorems/a0d7189b-1242-47eb-bf90-6587bb9a2e25. The mission setting 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 supporting result uses the exact coefficient formula for multiplication by a monomial and injectivity of translation on exponent vectors in Mathlib commit 0df444a360eaa60ab8c11dca51a86af692955474. The uniform geometric counting bound remains open.