Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reduced polynomial matrices for finite elliptic derivative equations

Definition
WeierstrassEllipticZeta_ReducedJetSystems

by tomasz · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

elliptic-functionspolynomialstranscendence

Fix a period pair LLL, complex numbers θ,ν\theta,\nuθ,ν, and g∈Z[X][Y]g\in\mathbb Z[X][Y]g∈Z[X][Y]. For a polynomial, ℓ\ellℓ denotes the sum of the absolute values of all integer coefficients.

Reduced arithmetic jet-system data mean that there exist positive integers B,HB,HB,H with the following property. For any nonnegative M,L0,TM,L_0,TM,L0​,T, let

I={0,…,L0}×{0,…,M}2,k(n)=(L0,5M,5M,5M,Kn,Kn,Kn,Kn),Kn=L0+5M+n.I=\{0,\ldots,L_0\}\times\{0,\ldots,M\}^2,\qquad k(n)=(L_0,5M,5M,5M,K_n,K_n,K_n,K_n),\quad K_n=L_0+5M+n.I={0,…,L0​}×{0,…,M}2,k(n)=(L0​,5M,5M,5M,Kn​,Kn​,Kn​,Kn​),Kn​=L0​+5M+n.

Choose eight numerator and denominator polynomials Sa,Qa∈Z[X,Y]S_a,Q_a\in\mathbb Z[X,Y]Sa​,Qa​∈Z[X,Y], whose total degrees are at most dad_ada​ and lengths at most hah_aha​, respectively. There exists a matrix

R=(Rn,i)0≤n<Ti∈IR=(R_{n,i})_{\substack{0\le n<T\\i\in I}}R=(Rn,i​)0≤n<Ti∈I​​

of integer bivariate polynomials. Writing Dn=∑a=07ka(n)daD_n=\sum_{a=0}^7 k_a(n)d_aDn​=∑a=07​ka​(n)da​, every entry satisfies

deg⁡YRn,i<deg⁡Yg,deg⁡X[Yj]Rn,i≤BDn(j≥0),\deg_Y R_{n,i}<\deg_Yg,\qquad \deg_X[Y^j]R_{n,i}\le BD_n\quad(j\ge0),degY​Rn,i​<degY​g,degX​[Yj]Rn,i​≤BDn​(j≥0), ℓ(Rn,i)≤n! 241(L0+M+n)(∏a=07haka(n))HDn+1.\ell(R_{n,i})\le n!\,2^{41(L_0+M+n)}\left(\prod_{a=0}^7h_a^{k_a(n)}\right)H^{D_n+1}.ℓ(Rn,i​)≤n!241(L0​+M+n)(a=0∏7​haka​(n)​)HDn​+1.

This matrix precedes the following points and coefficient vectors. For any v,z,z+vv,z,z+vv,z,z+v outside the lattice, suppose the coordinate presentations satisfy

Sa(θ,ν)=Qa(θ,ν)Jv(z)a,S_a(\theta,\nu)=Q_a(\theta,\nu)J_v(z)_a,Sa​(θ,ν)=Qa​(θ,ν)Jv​(z)a​,

where

Jv(z)=(z+v,ζ(v),℘(v),℘′(v),ζ(z),℘(z),℘′(z),℘′′(z)).J_v(z)=(z+v,\zeta(v),\wp(v),\wp'(v),\zeta(z),\wp(z),\wp'(z),\wp''(z)).Jv​(z)=(z+v,ζ(v),℘(v),℘′(v),ζ(z),℘(z),℘′(z),℘′′(z)).

For i=(i0,i2,i3)i=(i_0,i_2,i_3)i=(i0​,i2​,i3​), set

Gi(w)=(w+v)i0[2(℘(v)−℘(w))]3M℘(w+v)i2ζ(w+v)i3,Δn=∏a=07Qa(θ,ν)ka(n).G_i(w)=(w+v)^{i_0}[2(\wp(v)-\wp(w))]^{3M} \wp(w+v)^{i_2}\zeta(w+v)^{i_3},\qquad \Delta_n=\prod_{a=0}^7Q_a(\theta,\nu)^{k_a(n)}.Gi​(w)=(w+v)i0​[2(℘(v)−℘(w))]3M℘(w+v)i2​ζ(w+v)i3​,Δn​=a=0∏7​Qa​(θ,ν)ka​(n).

The exact entry evaluations are

Rn,i(θ,ν)=ΔnGi(n)(z).R_{n,i}(\theta,\nu)=\Delta_nG_i^{(n)}(z).Rn,i​(θ,ν)=Δn​Gi(n)​(z).

If additionally z−vz-vz−v is regular and all eight evaluated denominators are nonzero, then for every complex vector c=(ci)i∈Ic=(c_i)_{i\in I}c=(ci​)i∈I​,

(∀ 0≤n<T, ∑iRn,i(θ,ν)ci=0) ⟺ (∀ 0≤n<T, Fc(n)(z+v)=0),\left(\forall\,0\le n<T,\ \sum_iR_{n,i}(\theta,\nu)c_i=0\right) \ \Longleftrightarrow\ \left(\forall\,0\le n<T,\ F_c^{(n)}(z+v)=0\right),(∀0≤n<T, i∑​Rn,i​(θ,ν)ci​=0) ⟺ (∀0≤n<T, Fc(n)​(z+v)=0),

where

Fc(w)=∑i∈Iciwi0℘(w)i2ζ(w)i3.F_c(w)=\sum_{i\in I}c_iw^{i_0}\wp(w)^{i_2}\zeta(w)^{i_3}.Fc​(w)=i∈I∑​ci​wi0​℘(w)i2​ζ(w)i3​.

The exact evaluation identities also hold with zero coordinate denominators; nonzero denominators are required only for kernel equivalence. Constants are uniform in all cutoffs, orders, and presentations. The property assembles bounded reduced derivative presentations into finite linear equations. It does not produce grid-coordinate presentations, prove that their denominators are nonzero, choose asymptotic parameters, or establish a small nonzero test value.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_ReducedArithmeticJets

noncomputable section

open scoped Polynomial

namespace WeierstrassEllipticZeta

/-- Uniform reduced polynomial matrices for finite families of cleared derivatives,
together with the equivalence between their evaluated kernels and vanishing jets. -/
def ReducedArithmeticJetSystemData (L : PeriodPair) (θ ν : ℂ) (g : ℤ[X][X]) : Prop :=
  ∃ B H : ℕ, 0 < B ∧ 0 < H ∧
    ∀ (M L₀ T : ℕ),
      let I := Fin (L₀ + 1) × Fin (M + 1) × Fin (M + 1)
      let k : ℕ → Fin 8 → ℕ := fun n =>
        ![L₀, 5 * M, 5 * M, 5 * M,
          L₀ + 5 * M + n, L₀ + 5 * M + n, L₀ + 5 * M + n, L₀ + 5 * M + n]
      ∀ (s q : Fin 8 → MvPolynomial (Fin 2) ℤ) (d h : Fin 8 → ℕ),
        (∀ i, (s i).totalDegree ≤ d i) → (∀ i, (q i).totalDegree ≤ d i) →
        (∀ i, (∑ m ∈ (s i).support, ((s i).coeff m).natAbs) ≤ h i) →
        (∀ i, (∑ m ∈ (q i).support, ((q i).coeff m).natAbs) ≤ h i) →
        ∃ R : Fin T → I → ℤ[X][X],
          (∀ n i, (R n i).natDegree < g.natDegree ∧
            (∀ j, ((R n i).coeff j).natDegree ≤ B * ∑ a, k n a * d a) ∧
            (∑ j ∈ (R n i).support, ∑ a ∈ ((R n i).coeff j).support,
              (((R n i).coeff j).coeff a).natAbs) ≤
                (n.val.factorial * 2 ^ (41 * (L₀ + M + n)) * ∏ a, h a ^ k n a) *
                  H ^ ((∑ a, k n a * d a) + 1)) ∧
          ∀ (v z : ℂ), v ∉ L.lattice → z ∉ L.lattice → z + v ∉ L.lattice →
            (∀ a, MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν] (s a) =
              MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν] (q a) *
                ellipticJetCoordinates L v z a) →
            (∀ n i, (R n i).eval₂ (Polynomial.aeval θ).toRingHom ν =
              (∏ a, MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν] (q a) ^ k n a) *
                iteratedDeriv n (clearedAdditionMonomial L v M i.1 i.2.1 i.2.2) z) ∧
            (z - v ∉ L.lattice →
              (∀ a, MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν] (q a) ≠ 0) →
              ∀ c : I → ℂ,
                (∀ n, ∑ i, (R n i).eval₂ (Polynomial.aeval θ).toRingHom ν * c i = 0) ↔
                  ∀ n < T, iteratedDeriv n (fun w =>
                    ∑ i, c i * w ^ i.1.val * L.weierstrassP w ^ i.2.1.val *
                      weierstrassZeta L w ^ i.2.2.val) (z + v) = 0)

end WeierstrassEllipticZeta
Source
Formal interface for the reduced arithmetic entries of Section 5 Lemma 7(b) and the finite linear equations in the proof of Lemma 8, equation (29), Senthil Kumar K (2026). This definition records bounds, entry identities, and the kernel equivalence; it contains no proof of these properties. https://doi.org/10.1017/S001309152610145X

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me