Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Weierstrass p function

Definition

Let Λ⊆C be a full complex lattice with oriented basis (ω1,ω2) (Complex lattice and quotient torus). The Weierstrass ℘-function of Λ is the function

℘Λ(z):=1z2+∑ω∈Λ∖{0}(1(z−ω)2−1ω2),z∈C∖Λ,

where the sum over the lattice points different from 0 is the unordered (finite-subset) sum: for the directed set of finite subsets F⊆Λ∖{0} ordered by inclusion, one forms the net of partial sums ∑ω∈F((z−ω)−2−ω−2), and ∑ω∈Λ∖{0}(⋯ ) denotes its limit when the net converges and the limit does not depend on the directed set — equivalently, when the family is absolutely summable, i.e. when sup⁡F∑ω∈F∣(z−ω)−2−ω−2∣<∞ and the partial sums converge. The following theorem of this page proves that for every z∈C∖Λ the family is absolutely summable, with normal (locally uniform, enumeration-free) convergence on C∖Λ; this is the sense in which ℘Λ is well defined beyond the displayed formula. In particular no ordering of Λ is used and the value does not depend on one.

Remarks

The two correction terms. The summand 1(z−ω)2−1ω2=2zω−z2(z−ω)2ω2 is holomorphic in z on the disc ∣z∣<∣ω∣, so each summand is holomorphic near the origin; at z=0 its value is (−ω)−2−ω−2=0. The single uncorrected term z−2 therefore supplies the entire principal part at the lattice point 0, and the subtractions make the remaining series vanish at 0: the constant term of the Laurent expansion of ℘Λ at 0 is 0. At a general lattice point λ∈Λ the same computation after the translation z↦z+λ shows that the principal part of ℘Λ at λ is (z−λ)−2.

Translation and parity. Reindexing the sum by ω↦−ω — a bijection of Λ∖{0} — replaces (z−ω)−2−ω−2 by (z+ω)−2−ω−2 and z by −z, which is the same expression; consequently the absolutely convergent sum satisfies ℘Λ(−z)=℘Λ(z) once its convergence is known, and ℘Λ is an even function. The sum depends only on the lattice Λ, not on the oriented basis chosen to describe it, since the underlying index set Λ and every summand depend on Λ alone.

Finite-subset convergence and absolute summability. For a complex family (ai)i∈I, use the real and imaginary parts and modulus of Real and imaginary parts, complex conjugation, and modulus. Absolute summability implies convergence of its finite-subset net by Square-summable families on an arbitrary index set and the space ℓ2(I). For the reverse direction, suppose the finite-subset sums sF:=∑i∈Fai converge to s∈C. Choose a finite F0 such that ∣sF−s∣<1 whenever F⊇F0; then ∣sF∣≤∣s∣+1 for every such F. For any finite set P⊆I∖F0 on which Re⁡(ai)>0, ∑i∈PRe⁡(ai)=Re⁡(sF0∪P−sF0)≤∣s∣+1+∣sF0∣. The same bound holds for finite sums of −Re⁡(ai) over negative terms, and likewise for the imaginary parts. Adding the finitely many terms in F0 shows that the finite subsums of ∣Re⁡(ai)∣ and ∣Im⁡(ai)∣ are bounded. Since ∣ai∣≤∣Re⁡(ai)∣+∣Im⁡(ai)∣, the finite subsums of ∣ai∣ are bounded, so the family is absolutely summable by the definition in Square-summable families on an arbitrary index set and the space ℓ2(I). This argument uses no enumeration or choice principle.

The cubic tail. For ∣z∣≤R and ∣ω∣≥2R the displayed numerator is bounded by 2R∣ω∣+R2 and the denominator is bounded below by 14∣ω∣4, so the summand is OR(∣ω∣−3). The lattice alone therefore controls the size of the terms, and the convergence proof only has to count how many lattice vectors occur at each scale; that count and the resulting normal convergence are proved in the next items of this page.

Depends on

Used by

Dependency tree · two levels

21 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources