Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

The modular discriminant and the j-invariant

Definition

The modular discriminant is

Δ(τ):=E4(τ)3−E6(τ)21728,

a cusp form of weight 12 with q-expansion q−24q2+O(q3) and without zeros on H (The discriminant is a nonvanishing cusp form of weight 12, Eisenstein series are modular forms; their Fourier coefficients). The j-invariant is the quotient

j(τ):=E4(τ)3Δ(τ),τ∈H,

which is holomorphic on H because Δ does not vanish there (Meromorphic functions on a plane domain). Since E43 and Δ both transform with the factor (cτ+d)12 under every γ∈SL2(Z), the quotient satisfies j(γ⋅τ)=j(τ) (Level-one modular forms and cusp forms).

The q-expansion and the cusp. From E43=1+720q+O(q2) and Δ=q(1−24q+O(q2)) (Eisenstein series are modular forms; their Fourier coefficients, The discriminant is a nonvanishing cusp form of weight 12),

j(τ)=q−11+720q+O(q2)1−24q+O(q2)=q−1+744+O(q),

so j has a simple pole at the cusp: its associated function of q is meromorphic at q=0 with a pole of order one. The special values follow from the zeros of E4,E6 (The zeros of E4 and E6 at the elliptic points): E6(i)=0 and E4(i)≠0 give j(i)=E4(i)3E4(i)3/1728=1728, while E4(ω)=0 gives j(ω)=0; the valence formula (The level-one valence formula) is what makes these the only relevant zeros.

Depends on

Used by

Dependency tree · two levels

39 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