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 discriminant is a nonvanishing cusp form of weight 12
Statement
Define . Then is a cusp form of weight whose -expansion is in particular and , and the valence formula gives for every . Moreover and are linearly independent in , this space being two-dimensional with basis .
Facts & Assumptions
is a two-dimensional complex vector space. Multiplication adds weights, with , and ; the cusp forms are the kernel of the constant-term functional (The dimension of the space of level-one modular forms, Level-one modular forms and cusp forms).
Valence formula: for even and , (The level-one valence formula).
Proof
and by [F1], hence . From the displayed expansions, and . Therefore . In particular , , so is a cusp form, and .
Applying the valence formula [F2] to of weight gives ; every summand is a nonnegative multiple of , so all vanish and has no zeros on . Finally, if then comparing constant terms gives and comparing -coefficients gives , whence and ; so are linearly independent in the two-dimensional space and therefore form a basis.
Depends on
Used by
- The modular discriminant and the j-invariant Definition
- The first Fourier coefficients of E4, E6, Delta and j Example
- The j-invariant of the Legendre normal form Lemma
- The Jacobi product formula for the discriminant Lemma
- The graded ring of level-one modular forms Theorem
- The j-invariant classifies complex tori Theorem
Dependency tree · two levels
49 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 (v1.31, 2017) (standard reference, not scraped)
- D. Zagier, Elliptic Modular Forms and Their Applications, in The 1-2-3 of Modular Forms (Universitext, Springer, 2008) (standard reference, not scraped)
- C. T. McMullen, Advanced Complex Analysis, Math 213a course notes (Harvard, 2010) (standard reference, not scraped)