Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integer auxiliary grids and their regular geometric data

Definition
WeierstrassEllipticZeta_AuxiliaryGrids

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

complex-analysiselliptic-functionsfinite-sets

For u1,u2,ω∈Cu_1,u_2,\omega\in\mathbb Cu1​,u2​,ω∈C, define

v(m)=m1u1+m2u2+m3ω(m∈Z3),v(m)=m_1u_1+m_2u_2+m_3\omega\qquad(m\in\mathbb Z^3),v(m)=m1​u1​+m2​u2​+m3​ω(m∈Z3), Γ(A1,A2,A3)={v(m):0≤mi<Ai},Γ+=Γ+u1/2.\Gamma(A_1,A_2,A_3)=\{v(m):0\le m_i<A_i\}, \qquad \Gamma^+=\Gamma+u_1/2.Γ(A1​,A2​,A3​)={v(m):0≤mi​<Ai​},Γ+=Γ+u1​/2.

The side lengths are natural numbers; a zero side makes the corresponding finite grid empty. The accompanying proposition RegularAuxiliaryGridData records injectivity, lattice membership and congruences, regularity of every half-shifted integer point, exact finite-grid cardinalities, and the bound

∣z∣≤A1∣u1∣+A2∣u2∣+A3∣ω∣+∣u1∣/2(z∈Γ+).|z|\le A_1|u_1|+A_2|u_2|+A_3|\omega|+|u_1|/2 \qquad(z\in\Gamma^+).∣z∣≤A1​∣u1​∣+A2​∣u2​∣+A3​∣ω∣+∣u1​∣/2(z∈Γ+).

It also records periodicity of ℘,℘′\wp,\wp'℘,℘′ and the integer quasi-period law for the canonical zeta function at regular arguments. These fields are proof obligations, not axioms asserting that the data exist. They provide the geometric input used when constructing auxiliary equations on finite grids.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_Defs
import Mathlib.Data.Fintype.Pi

noncomputable section

namespace WeierstrassEllipticZeta

/-- Integer points in the rank-three group used in the auxiliary construction. -/
def integerGridPoint (u₁ u₂ ω : ℂ) (m : Fin 3 → ℤ) : ℂ :=
  (m 0 : ℂ) * u₁ + (m 1 : ℂ) * u₂ + (m 2 : ℂ) * ω

/-- The source grid with side lengths `A 0`, `A 1`, and `A 2`. -/
def auxiliaryGrid (u₁ u₂ ω : ℂ) (A : Fin 3 → ℕ) : Finset ℂ :=
  Finset.univ.image (fun m : (i : Fin 3) → Fin (A i) ↦
    integerGridPoint u₁ u₂ ω (fun i ↦ (m i : ℕ)))

/-- The regular grid on which the shifted auxiliary function is evaluated. -/
def shiftedAuxiliaryGrid (u₁ u₂ ω : ℂ) (A : Fin 3 → ℕ) : Finset ℂ :=
  (auxiliaryGrid u₁ u₂ ω A).image (fun z ↦ z + u₁ / 2)

/-- Geometric and period-translation data for the grids of Section 5.
The analytic interpolation and zero estimates are separate obligations. -/
structure RegularAuxiliaryGridData (L : PeriodPair) (ω u₁ u₂ : ℂ) : Prop where
  point_injective : Function.Injective (integerGridPoint u₁ u₂ ω)
  lattice_iff : ∀ m : Fin 3 → ℤ,
    integerGridPoint u₁ u₂ ω m ∈ L.lattice ↔ m 0 = 0 ∧ m 1 = 0
  congruent_iff : ∀ m n : Fin 3 → ℤ,
    integerGridPoint u₁ u₂ ω m - integerGridPoint u₁ u₂ ω n ∈ L.lattice ↔
      m 0 = n 0 ∧ m 1 = n 1
  shifted_regular : ∀ m : Fin 3 → ℤ,
    integerGridPoint u₁ u₂ ω m + u₁ / 2 ∉ L.lattice
  card_grid : ∀ A : Fin 3 → ℕ, (auxiliaryGrid u₁ u₂ ω A).card = ∏ i, A i
  card_shifted_grid : ∀ A : Fin 3 → ℕ,
    (shiftedAuxiliaryGrid u₁ u₂ ω A).card = ∏ i, A i
  shifted_grid_regular : ∀ (A : Fin 3 → ℕ) z,
    z ∈ shiftedAuxiliaryGrid u₁ u₂ ω A → z ∉ L.lattice
  shifted_grid_radius : ∀ (A : Fin 3 → ℕ) z,
    z ∈ shiftedAuxiliaryGrid u₁ u₂ ω A →
    ‖z‖ ≤ (A 0 : ℝ) * ‖u₁‖ + (A 1 : ℝ) * ‖u₂‖ +
      (A 2 : ℝ) * ‖ω‖ + ‖u₁‖ / 2
  period_values : ∀ (z : ℂ) (n : ℤ), z ∉ L.lattice →
    L.weierstrassP (z + n * ω) = L.weierstrassP z ∧
    L.derivWeierstrassP (z + n * ω) = L.derivWeierstrassP z ∧
    weierstrassZeta L (z + n * ω) =
      weierstrassZeta L z + n * zetaQuasiPeriod L ω

end WeierstrassEllipticZeta
Source
Senthil Kumar K (2026), Section 5 definition of Gamma before Lemma 7, the half-shifted function in Lemma 8, and Appendix equation (A.10); the quasi-period law is recalled in the Appendix before (A.4). The proposition bundles explicit consequences and its radius is an elementary triangle-inequality bound. https://www.cambridge.org/core/journals/proceedings-of-the-edinburgh-mathematical-society/article/algebraic-independence-of-values-of-weierstrass-elliptic-and-zeta-functions/E91A8EEEB1F63536D95D1DE7D7DD47E2

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