Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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 cubic differential equation

Statement

Let Λ=Zω1+Zω2 be a full complex lattice with oriented basis (ω1,ω2) (Complex lattice and quotient torus), let ℘=℘Λ be its Weierstrass function (Weierstrass p function) and let

G4:=G4(Λ)=∑ω∈Λ∖{0}ω−4,G6:=G6(Λ)=∑ω∈Λ∖{0}ω−6,

where the sums are the unordered finite-subset sums over the lattice. Then:

  1. both families (ω−4)ω≠0 and (ω−6)ω≠0 are absolutely summable, so G4 and G6 are well defined complex numbers;
  2. with the invariants g2:=60 G4,g3:=140 G6, the Λ-elliptic meromorphic functions (℘′)2 and 4℘3−g2℘−g3 agree on C∖Λ: (℘′)2=4℘3−g2℘−g3.

Facts & Assumptions

Given: A full complex lattice Λ=Zω1+Zω2 with oriented basis (ω1,ω2), its Weierstrass function ℘=℘Λ and derivative ℘′, and the sums Gk=∑ω≠0ω−k over the finite-subset net.

[F1]

ω1,ω2 are real-linearly independent: the only (a,b)∈R2 with aω1+bω2=0 is (a,b)=(0,0), so in particular ω1≠0≠ω2 and ω2∉Rω1 (Complex lattice and quotient torus).

[F2]

For every z∈C one has zz‾=∣z∣2, ∣z∣≥0, ∣z∣=0 iff z=0, ∣zw∣=∣z∣ ∣w∣, and ∣z+w∣≤∣z∣+∣w∣; also Re⁡z and Im⁡z satisfy z=Re⁡z+iIm⁡z and ∣z∣2=(Re⁡z)2+(Im⁡z)2 (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive, Real and imaginary parts, complex conjugation, and modulus).

[F3]

℘Λ(z)=z−2+∑ω∈Λ∖{0}fω(z) with fω(z)=(z−ω)−2−ω−2, defined through the finite-subset net, and the definition is designed so that the sum is independent of any enumeration (Weierstrass p function). Moreover (the Remarks of the same item): fω=2zω−z2(z−ω)2ω2 is holomorphic in z on the disc ∣z∣<∣ω∣ with fω(0)=0, and for ∣z∣≤R, ∣ω∣≥2R its modulus is OR(∣ω∣−3).

[F4]

℘ is holomorphic on C∖Λ, even, and Λ-periodic; at each lattice point it has a double pole with principal part (z−λ)−2 and there are no other poles; ℘′(z)=−2∑ω∈Λ(z−ω)−3 with this series normally convergent on C∖Λ, and ℘′ is odd and Λ-elliptic (Normal convergence, parity and periodicity of the Weierstrass p function).

[F5]

A Λ-elliptic function is a meromorphic function on C with f(z+λ)=f(z) for all z and all λ∈Λ; constants are elliptic, and sums, products, constant multiples and quotients with nonvanishing denominator of Λ-elliptic functions are again Λ-elliptic (Elliptic function for a lattice).

[F6]

A Λ-elliptic function with no poles is constant (Divisor and residue laws for elliptic functions).

[F7]

If f is holomorphic on a punctured disc 0<∣z−a∣<R and bounded on some punctured neighbourhood of a, then a is a removable singularity, and the holomorphic extension satisfies F(a)=lim⁡z→af(z) (Characterizations of removable singularities).

[F8]

A holomorphic f on an open set Ω equals its Taylor series at a throughout the largest centred disc contained in Ω: f(z)=∑n≥0f(n)(a)n!(z−a)n for ∣z−a∣<ρa (A holomorphic function equals its Taylor series throughout the largest centred disc in its domain).

[F9]

If gj are holomorphic on an open Ω and the partial sums of ∑jgj converge locally uniformly to g, then g is holomorphic and g(k)=∑jgj(k) for every k, the derivative series converging locally uniformly (A locally uniformly convergent series of holomorphic functions may be differentiated term by term).

[F10]

Complex derivatives are linear and satisfy the product rule and the chain rule: (fg)′=f′g+fg′ and (g∘f)′(a)=g′(f(a))f′(a); the derivative of z↦(z−ω)−2 is −2(z−ω)−3, and constant functions have derivative zero (Linearity, product, reciprocal, and quotient rules for complex derivatives, The chain rule for complex derivatives).

[F11]

Z×Z is at most countable, every nonempty at most countable set admits a surjection from N, and the integers are a surjective image of N×N (A product of two at most countable sets is at most countable, A nonempty set is at most countable iff it is a surjective image of N, Q is countably infinite).

Proof

technique · direct
1.1F2F1

(Gap estimate for the lattice.) Put A:=∣ω1∣2, B:=Re⁡(ω1ω2‾), C:=∣ω2∣2. Expanding with [F2] gives, for real s,t, ∣sω1+tω2∣2=As2+2Bst+Ct2; completing the square in the two variables gives As2+2Bst+Ct2=A(s+BAt)2+AC−B2At2≥AC−B2At2 and symmetrically As2+2Bst+Ct2=C(t+BCs)2+AC−B2Cs2≥AC−B2Cs2, hence ∣sω1+tω2∣2≥AC−B2max⁡(A,C)max⁡(s2,t2). Here A,C>0 by [F1], and AC−B2=(Im⁡(ω1ω2‾))2>0: indeed AC=∣w∣2 and ww‾=∣w∣2 for w:=ω1ω2‾ by [F2], so AC−B2=(Im⁡w)2, and Im⁡w=0 would make ω2/ω1=w‾ / ∣ω1∣2 real, making ω2 a real multiple of ω1, contrary to [F1]. Therefore δ:=(AC−B2)/max⁡(A,C) is positive and ∣mω1+nω2∣≥δmax⁡(∣m∣,∣n∣) for all integers m,n, so every nonzero lattice point has modulus at least δ and Λ∩{∣z∣≤R} is finite for every R.

2.1F2F3F9F10F11step 1.1

(Local uniform convergence and derivatives of the corrected series.) The nonzero lattice points with ∣ω∣<1 are finite by step 1.1. For k≥0, the shell 2k≤∣ω∣<2k+1 contains at most (2k+2/δ+1)2 points, so its contribution to ∑∣ω∣−3 is at most (2k+2/δ+1)22−3k=O(2−k). Thus ∑ω≠0∣ω∣−3<∞. Put r:=δ/2. For ∣z∣≤r and ω≠0, one has ∣z−ω∣≥∣ω∣/2 and ∣2zω−z2∣≤52r∣ω∣, so by [F2] and [F2, F3, F9, F11, F10, step 1.1] ∣fω(z)∣=∣2zω−z2∣∣z−ω∣2∣ω∣2≤10r∣ω∣3. Hence the finite-subset net of corrected summands converges uniformly on ∣z∣≤r; call its sum S. By [F9], S is holomorphic on ∣z∣<r, and for 0<∣z∣<r the defining formula gives S(z)=℘(z)−z−2. The lattice is countable by [F11], so choose an enumeration (ωj); its partial sums converge locally uniformly to S. Applying [F9] gives S(k)(0)=∑jfωj(k)(0). For k≥1, [F10] gives fω(k)(0)=(k+1)!ω−k−2, while fω(0)=0 by [F3]. Therefore S(k)(0)/k!=(k+1)Gk+2 for k≥1 and S(0)=0.

3.1step 2.1step 1.1

(Absolute convergence of G4 and G6.) By step 2.1, ∑∣ω∣−3 converges. For ∣ω∣≥1 and k≥3, ∣ω∣−k≤∣ω∣−3, while the lattice points with 0<∣ω∣<1 are finite by step 1.1. Thus the families (ω−k) are absolutely summable for k=3,4,5,6. In particular G4 and G6 are well-defined complex numbers, with convergent finite-subset sums.

4.1step 3.1

(Odd sums vanish.) The map ω↦−ω is a bijection of Λ∖{0} and the families (ω−3) and (ω−5) are absolutely summable by step 3.1, so reindexing gives G3=∑ω(−ω)−3=−∑ωω−3=−G3 and G5=−G5; hence G3=G5=0.

5.1

(Taylor expansion of ℘ at the origin.) By [F8] applied to the holomorphic function S on ∣z∣<r, S(z)=∑k≥0S(k)(0)k!zk for ∣z∣<r, so by step 2.1 [F8, step 2.1, step 4.1] S(z)=∑k≥1(k+1)Gk+2zk=2G3z+3G4z2+4G5z3+5G6z4+∑k≥6(k+1)Gk+2zk, and since G3=G5=0 by step 4.1 the last sum is z6U(z) for a holomorphic U near 0. Thus, on 0<∣z∣<r, ℘(z)=z−2+3G4z2+5G6z4+z6U(z).

6.1

(Derivative expansion.) Differentiating the identity of step 5.1 termwise, which is legitimate for the locally uniformly convergent power series by [F9], gives [F9, F10, step 5.1] ℘′(z)=−2z−3+6G4z+20G6z3+z5V(z) for a holomorphic V near 0 (indeed ddz(z6U(z))=z5(6U(z)+zU′(z)) by the product rule of [F10]).

7.1

(Expansions of (℘′)2 and ℘3.) Write steps 5.1 and 6.1 as ℘(z)=z−2(1+3G4z4+5G6z6+z8U(z)) and ℘′(z)=−2z−3(1−3G4z4−10G6z6+z8V1(z)) with V1 holomorphic near 0 (one has z5V(z)=−2z−3⋅z8V1(z) with V1=−12V, and the constant term is absorbed since V is holomorphic). Squaring and cubing the brackets with the product rule of [F10] gives [F10, step 5.1, step 6.1] (℘′)2=4z−6(1−6G4z4−20G6z6+z8W1(z))=4z−6−24G4z−2−80G6+z2W(z), 4℘3=4z−6(1+9G4z4+15G6z6+z8X1(z))=4z−6+36G4z−2+60G6+z2X(z) with W,X holomorphic near 0; all displayed coefficients are read off by expanding the products (1+a+b+c)2 and (1+a+b+c)3 and using that the resulting remainders are holomorphic.

8.1

(The difference is bounded at the origin.) Put g2:=60G4, g3:=140G6 and F:=(℘′)2−4℘3+g2℘+g3, a meromorphic function on C∖Λ. Using step 7.1 and ℘(z)=z−2+O(z2) from step 5.1 [F7, step 7.1, step 5.1] F(z)=(−24−36+60)G4z−2+(−80−60+140)G6+z2Y(z)=z2Y(z) for a holomorphic Y near 0; in particular F(z)→0 as z→0, so F is bounded on a punctured neighbourhood of 0. By [F7] the singularity of F at 0 is removable and the extension has F(0)=lim⁡z→0F(z)=0.

9.1F4F5step 8.1

(F is elliptic and pole-free.) By [F4], ℘ and ℘′ are Λ-elliptic; by [F5] constants are elliptic and sums, products and constant multiples of elliptic functions are elliptic, so F=(℘′)2−4℘3+g2℘+g3 is a Λ-elliptic function. Its poles can only occur where ℘ or ℘′ has a pole, i.e. at lattice points, by [F4]; but F extends holomorphically at 0 by step 8.1 and F is Λ-periodic, so near every λ∈Λ one has F(λ+u)=F(u) for small u≠0, and the holomorphy at 0 passes to λ. Hence F is holomorphic on all of C: a Λ-elliptic function without poles.

10.1F6step 8.1step 3.1∎

(Conclusion.) By [F6] the pole-free elliptic function F is constant, and the constant is F(0)=0 by step 8.1. Hence (℘′)2−4℘3+g2℘+g3=0 on C∖Λ, that is (℘′)2=4℘3−g2℘−g3; and the absolute convergence of G4 and G6 is step 3.1.

Remarks

The proof never evaluates a conditionally convergent sum: absolute convergence of ∑∣ω∣−3 comes from the uniform gap δ of the lattice, and all rearrangements (the odd sums G3=G5=0 and the Taylor coefficients) are made in absolutely summable families. The invariants are normalised so that the Laurent coefficients 3G4 and 5G6 produce g2=20⋅3G4=60G4 and g3=28⋅5G6=140G6, matching the standard convention; the algebraic identity itself only uses that (g2,g3) is a certain pair of constants, and the specific normalisation is the one used later for the discriminant Δ=g23−27g32. The single non-elementary input is the removable-singularity theorem, which turns the cancellation of the three lowest Laurent terms into holomorphy at the origin.

Depends on

Used by

Dependency tree · two levels

88 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