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 be a full complex lattice with oriented basis (Complex lattice and quotient torus). The Weierstrass -function of is the function
where the sum over the lattice points different from is the unordered (finite-subset) sum: for the directed set of finite subsets ordered by inclusion, one forms the net of partial sums , and 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 and the partial sums converge. The following theorem of this page proves that for every the family is absolutely summable, with normal (locally uniform, enumeration-free) convergence on ; 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 is holomorphic in on the disc , so each summand is holomorphic near the origin; at its value is . The single uncorrected term therefore supplies the entire principal part at the lattice point , and the subtractions make the remaining series vanish at : the constant term of the Laurent expansion of at is . At a general lattice point the same computation after the translation shows that the principal part of at is .
Translation and parity. Reindexing the sum by — a bijection of — replaces by and by , which is the same expression; consequently the absolutely convergent sum satisfies 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 , 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 . For the reverse direction, suppose the finite-subset sums converge to . Choose a finite such that whenever ; then for every such . For any finite set on which , The same bound holds for finite sums of over negative terms, and likewise for the imaginary parts. Adding the finitely many terms in shows that the finite subsums of and are bounded. Since , the finite subsums of are bounded, so the family is absolutely summable by the definition in Square-summable families on an arbitrary index set and the space . This argument uses no enumeration or choice principle.
The cubic tail. For and the displayed numerator is bounded by and the denominator is bounded below by , so the summand is . 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
- Weierstrass ζ and σ functions Definition
- Addition and duplication for ℘ Example
- Half-period values of the square lattice Example
- Rectangular lattices, real mapping, and inverse elliptic integrals Example
- Square and hexagonal lattice invariants Example
- Degree two of ℘ and its four branch points Lemma
- Addition formula for ℘ Theorem
- Convergence, zeros and quasi-periods of the Weierstrass zeta and sigma functions Theorem
- Nonvanishing of the lattice discriminant Theorem
- Normal convergence, parity and periodicity of the Weierstrass p function Theorem
- The chord-tangent group law and elliptic uniformization Theorem
- The field of elliptic functions is generated by ℘ and ℘' Theorem
- The torus is biholomorphic to its Weierstrass cubic Theorem
- Weierstrass cubic differential equation Theorem
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
- J. S. Milne, Modular Functions and Modular Forms, Ch. 3, pp. 41-47 (standard reference, not scraped)
- C. T. McMullen, Advanced Complex Analysis, Math 213a course notes, Ch. 5 §5.1, pp. 79-90 (standard reference, not scraped)
- NIST Digital Library of Mathematical Functions, §23.2, equations 23.2.1-23.2.17 (standard reference, not scraped)