Canonical Weierstrass zeta series and Theorem 1 data
DefinitionWeierstrassEllipticZeta_DefsFor a period pair , let . Define the canonical Weierstrass zeta function by
and define the fixed-base-point increment
For lattice periods this represents the usual quasi-period. The functions are defined as total Lean expressions; convergence and base-point independence are not assumed as axioms.
For a finite indexed family, HasAlgebraicallyIndependentPair means that two entries with distinct indices form an algebraically independent pair over . The ten-entry family for the main theorem is
The lattice, , , and use Mathlib's PeriodPair definitions. No theorem is asserted by this definition bundle.
import Mathlib.Analysis.SpecialFunctions.Elliptic.Weierstrass
import Mathlib.RingTheory.AlgebraicIndependent.Basic
noncomputable section
namespace WeierstrassEllipticZeta
/-- The canonical lattice series for Weierstrass zeta (DLMF 23.2.5).
This is a total function; claims about analytic values must exclude lattice points.
Convergence and quasi-periodicity are mathematical obligations, not assumptions here. -/
def weierstrassZeta (L : PeriodPair) (z : ℂ) : ℂ :=
1 / z + ∑' l : L.lattice,
if l = 0 then 0 else
1 / (z - (l : ℂ)) + 1 / (l : ℂ) + z / (l : ℂ) ^ 2
/-- A fixed-base-point increment of the canonical zeta function.
For a lattice period this is the usual quasi-period. Both base points are
outside the lattice when `ω ∈ L.lattice`. -/
def zetaQuasiPeriod (L : PeriodPair) (ω : ℂ) : ℂ :=
weierstrassZeta L (L.ω₁ / 2 + ω) - weierstrassZeta L (L.ω₁ / 2)
/-- Two entries at distinct indices are algebraically independent over `ℚ`. -/
def HasAlgebraicallyIndependentPair {n : ℕ} (values : Fin n → ℂ) : Prop :=
∃ i j : Fin n, i ≠ j ∧ AlgebraicIndependent ℚ ![values i, values j]
/-- The ten entries in Senthil Kumar's Theorem 1, in their displayed order. -/
def theoremOneValues (L : PeriodPair) (ω u₁ u₂ : ℂ) : Fin 10 → ℂ :=
![L.g₂, L.g₃, ω, zetaQuasiPeriod L ω, u₁, u₂,
L.weierstrassP u₁, weierstrassZeta L u₁,
L.weierstrassP u₂, weierstrassZeta L u₂]
end WeierstrassEllipticZeta
Read-back
What the Lean code literally says, in plain math · GPT-6 (Codex)
WeierstrassEllipticZeta.weierstrassZeta. For every period pair of complex numbers that are linearly independent over , and every , let . This definition assigns the complex number , where The sum is the unordered infinite sum over the lattice elements; by the total infinite-sum convention it is zero if this family is not summable. All divisions are total complex-field divisions, so a fraction with zero denominator is zero. The argument is unrestricted, including zero and other lattice points: , and if , the fraction in that lattice element's summand is zero.
WeierstrassEllipticZeta.zetaQuasiPeriod. For every period pair of complex numbers linearly independent over , and every , this definition assigns . Here , and, for every , , with The primed sum denotes the unordered infinite sum, assigned zero if the family is not summable, and any fraction with zero denominator is zero. There is no requirement that be a lattice element or nonzero; in particular . The shifted argument may be a lattice element, including zero, and the same total-function conventions apply there.
WeierstrassEllipticZeta.HasAlgebraicallyIndependentPair. For every implicitly supplied natural number , including , set . For every family , this predicate holds exactly when there exist indices such that and the ordered pair is algebraically independent over . Explicitly, the latter condition means that the evaluation map , , with rational coefficients mapped into by the usual inclusion, is injective; equivalently, for every , implies . Only the existence of such a pair is required, with no uniqueness requirement. For or , the predicate is false because there are no two distinct indices.
WeierstrassEllipticZeta.theoremOneValues. For every period pair of complex numbers linearly independent over , and all three arbitrary complex numbers , this definition returns the function whose values, in index order from through , are . To specify every entry, put , , , and for . The remaining entries use , where and . Every primed sum is the unordered infinite sum, assigned zero if its family is not summable, and every fraction with zero denominator is zero. Each sum includes the zero lattice element, with its contribution interpreted by these formulas. The inputs may be zero, may belong to the lattice, and may coincide; the ten entries need not be distinct. In particular, , and .