roed314 / OMS

Converting Rob Pollack's overconvergent modular symbols .sage code to .py and putting it in Sage
4 stars 4 forks source link

Comparison broken for modsyms #18

Closed loefflerd closed 11 years ago

loefflerd commented 11 years ago

This is from a closed issue, and is now a doctest in the "lift" method in modsym.py:

sage: E = EllipticCurve('11a') sage: from sage.modular.pollack_stevens.space import ps_modsym_from_elliptic_curve sage: phi = ps_modsym_from_elliptic_curve(E) sage: philifted=phi.lift(11,4,algorithm='stevens',eigensymbol=True) sage: philifted.specialize() == phi False

Here the values of philifted.specialize() and phi have moments that compare as equal:

sage: [phi.values()[i].moment(j) == phi2.values()[i].moment(j) for i in xrange(3) for j in xrange(1)] [True, True, True]

but our comparison routines are broken. See also #11. Once this is fixed it would be nice to sanitize the doctest!

loefflerd commented 11 years ago

Fixed by d9d22f3.