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 and functions
Definition
Let be a full complex lattice, and let the sum over and the product over be the unordered finite-subset limits of Weierstrass p function: the net of partial sums, respectively partial products, over the finite subsets ordered by inclusion, when it converges independently of the exhaustion. The Weierstrass -function and -function of are
where is the second Weierstrass elementary factor (Weierstrass elementary factors). The following theorem of this page proves that the defining net converges normally on for and on for , so that both functions are well defined and depend only on the set .
A lattice element is primitive when it is part of a -basis of , equivalently when for every integer . For a primitive period put
The quasi-period laws
for every primitive are proved in Convergence, zeros and quasi-periods of the Weierstrass zeta and sigma functions ↗, together with , , , the oddness of and , and the fact that is entire with simple zeros exactly at the lattice points.
Remarks
Why the corrections. The summand of , vanishes to second order at , so the single term carries the whole principal part there; at a general lattice point the translation exhibits the principal part . Similarly the factor has a simple zero at and no other zero, and its expansion shows that the correction is exactly what makes the product converge on compact sets. Both facts are proved in the items named above.
Normalisation. The factor in front of is chosen so that is a simple zero and ; the constants are the analogues of the half-period values , and for an oriented basis the Legendre relation holds; it is proved in Convergence, zeros and quasi-periods of the Weierstrass zeta and sigma functions ↗. Extend the quasi-period constants additively from the chosen basis by . For an arbitrary period , iteration gives The sign is when is primitive: then , so are not both even and is odd. For a primitive period, the additive constant agrees with the displayed definition , by applying the zeta translation law at and using oddness.
Primitive-period criterion. Fix a -basis of and write with . For , both basis membership and the no-divisor condition fail. If , put . Uniqueness of coordinates shows that for an integer exactly when divides both and ; since divides both coordinates and every positive common divisor is at most (Common divisor, and the greatest common divisor , with the convention ), no such exists exactly when . By Bézout's identity: for integers not both zero, is the least positive element of ; in particular has an integer solution, in that case there are integers with . Then belongs to , and the coordinate matrix of has determinant , so is a -basis. Conversely, if is a member of a -basis and , writing in that basis would make its coordinate on equal to , not an integer.
Depends on
- Complex lattice and quotient torus
- Weierstrass p function
- Weierstrass elementary factors
- Common divisor, and the greatest common divisor $\gcd(a,b)$, with the convention $\gcd(0,0) := 0$
- Bézout's identity: for integers $a, b$ not both zero, $\gcd(a,b)$ is the least positive element of $\{\, ax + by : x, y \in \mathbb{Z} \,\}$; in particular $ax + by = \gcd(a,b)$ has an integer solution
Used by
Dependency tree · two levels
24 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)