import numberdb.sage
from sage.modular.modsym.modsym import ModularSymbols
from sage.rings.rational_field import QQ
from sage.rings.integer_ring import ZZ
from sage.rings.infinity import infinity
from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
from math import comb, gcd, lcm
# The unique level-one, weight-twelve form is Delta.
M = ModularSymbols(1, 12, sign=-1)
A = M.cuspidal_subspace().decomposition()[0]
period = A.rational_period_mapping()
R = PolynomialRing(QQ, 'X')
X = R.gen()
p = sum(comb(10,j) * period(M.modular_symbol([j,0,infinity]))[0]
* X**(10-j) for j in range(1,10,2))
den = lcm(*(int(c.denominator()) for c in p.list()))
c = [ZZ(den*a) for a in p.list()]
g = gcd(*(int(a) for a in c))
if c[-1] < 0:
g = -g
print(PolynomialRing(ZZ,'X')([a//g for a in c]))Computed using exact rational modular symbols [3]. The rational period map of each one-dimensional simple cuspidal new factor in the minus sign space evaluates the odd monomial moments on the path from zero to infinity. Binomial weighting gives a rational polynomial; clearing denominators, dividing by its coefficient gcd and making its leading coefficient positive gives the stored integer polynomial. No rational reconstruction from approximate periods is used.
Independent full and new dimension formulas [5], Propositions 6.1 and 6.4, agree in all 21 considered spaces, including the empty ones. A separate PARI newform decomposition agrees on all 33 embedded forms through the Sturm bounds, and all 33 indices agree exactly with the full-zero companion roster. For each rational form, Sage and PARI agree on the first 100 Fourier coefficients. The integer eta product for $\Delta$ controls those coefficients before the comparisons.
PARI period-polynomial computations [4] at 160 and 220 decimal working digits agree with every exact coefficient ratio. At 220 working digits the largest absolute ratio error is less than $6.6\times10^{-229}$. A separate split Mellin sum uses 450 Fourier terms at 150 working digits and 600 at 190; at 190 working digits its largest ratio error is less than $1.7\times10^{-198}$. Three nonzero exponential-integral controls test the implemented Mellin weights first. These numerical checks corroborate the exact construction; their analytic errors are not claimed to be certified.
Primitivity, positive leading coefficient, odd parity and the reciprocal identity are checked exactly for every polynomial; the level-one three-term relation and roots $\pm1$ are checked in every level-one row. The published $\Delta$ parity shape supplies a nonzero normalization control. The attached generator, checks, complete form roster, argument-selection rationale and numerical evidence record the reproducible computation and coordinated skill manifest.