back to table · edit · history · where entries came from · files · download
7165 bytes, as of the version from 2026-11-17 04:25 (current). Recorded here, not run.
"""T732: Abel--Jacobi logarithms of complete oriented Heegner class traces.
SageMath 10.9, numberdb. This module contains no credentials or session attribution.
The full lattice is computed from integral modular symbols, never from a
curve-label period convention. Exact curve models only supply Fourier coefficients;
Sturm comparison with the unique normalized cusp form identifies those coefficients.
"""
import numberdb.sage as numberdb
from sage.rings.rational_field import QQ
from sage.rings.integer_ring import ZZ
from sage.rings.real_arb import RealBallField
from sage.rings.complex_arb import ComplexBallField
from sage.rings.infinity import infinity
from sage.modular.modsym.modsym import ModularSymbols
from sage.modular.arithgroup.all import Gamma0
from sage.matrix.constructor import matrix, identity_matrix
from sage.quadratic_forms.binary_qf import BinaryQF, BinaryQF_reduced_representatives
from sage.schemes.elliptic_curves.constructor import EllipticCurve
from sage.arith.misc import gcd, xgcd
from functools import lru_cache
from itertools import combinations
import math
LEVELS=(11,14,15,17,19,20,21,24,27,32,36,49)
MODELS={11:(0,-1,1,-10,-20),14:(1,0,1,4,-6),15:(1,1,1,-10,-10),17:(1,-1,1,-1,-14),19:(0,1,1,-9,-15),20:(0,1,0,4,4),21:(1,0,0,-4,-1),24:(0,-1,0,-4,4),27:(0,0,1,0,-7),32:(0,0,0,4,0),36:(0,0,0,0,1),49:(1,-1,0,-2,-1)}
@lru_cache(None)
def topology(N):
M=ModularSymbols(N,2,sign=0);S=M.cuspidal_submodule();I=S.integral_structure()
assert S.dimension()==2 and I.rank()==2
P=S.integral_period_mapping()
assert [list(P(M(b))) for b in I.basis()]==[[1,0],[0,1]]
loops=[]
for g in Gamma0(N).farey_symbol().generators():
a,b,c,d=map(ZZ,g.matrix().list())
if not c: continue
if c<0:a,b,c,d=-a,-b,-c,-d
v=I.coordinate_vector(M([infinity,QQ(a)/c]).element())
assert all(t in ZZ for t in v)
loops.append(((a,b,c,d),v))
pair=next(((g,h) for g,h in combinations(loops,2) if abs(matrix(QQ,[g[1],h[1]]).det())==1),None)
assert pair is not None, 'no primitive loop pair'
T=matrix(ZZ,[I.coordinate_vector(M.star_involution()(M(b)).element()) for b in I.basis()])
r=(T-identity_matrix(2)).left_kernel().basis()[0]
r=r*r.denominator();r=r/gcd(r.list());assert all(t in ZZ for t in r)
_,x,y=xgcd(ZZ(r[0]),ZZ(r[1]));s=matrix(ZZ,[[-y,x]]).row(0)
# In these integral coordinates, conjugation sends s to alpha*r-s.
tr=s*T+s; j=next(j for j in [0,1] if r[j]);alpha=tr[j]/r[j];assert tr==alpha*r and alpha in ZZ
s=s-(ZZ(alpha)//ZZ(2))*r;delta=int(ZZ(alpha)%2)
c=P(M([infinity,0]));kappa=c[j]/r[j];assert c==kappa*r
assert S.atkin_lehner_operator(N).matrix()==-identity_matrix(2)
E=EllipticCurve(MODELS[N]);assert E.conductor()==N
sturm=int(Gamma0(N).index()//6)
af=S.q_eigenform(sturm+2,names='a');an=E.anlist(sturm+1)
assert all(QQ(af[n])==an[n] for n in range(1,sturm+1))
return dict(M=M,S=S,I=I,pair=pair,r=r,s=s,delta=delta,kappa=kappa,E=E,sturm=sturm,star=T)
@lru_cache(None)
def coefficients(N,M):
return topology(N)['E'].anlist(M)
class Evaluator:
def __init__(self,N,bits=480):
self.N=int(N);self.bits=int(bits);self.R=RealBallField(bits);self.C=ComplexBallField(bits);self.eps=self.R(2)**(-bits+40);self.max_terms=0;self.max_tail=self.R(0)
def primitive(self,tau):
C,R=self.C,self.R;q=(2*C.pi()*C.gen(0)*tau).exp();rho=R(q.abs().upper())
assert 0<rho<1
count=max(1,int(math.ceil(((-self.bits+40)*math.log(2)+math.log(float(1-rho))-math.log(2))/math.log(float(rho)))))
tail=2*rho**(count+1)/(1-rho)
while not tail<self.eps:
count+=1;tail=2*rho**(count+1)/(1-rho)
a=coefficients(self.N,count);v=C(0)
for n in range(1,count+1):
if a[n]:v+=C(QQ(a[n])/n)*(q**n)
e=R(0,rad=tail.upper());v+=C(e,e)
assert v.real().is_finite() and v.imag().is_finite()
self.max_terms=max(self.max_terms,count);self.max_tail=max(self.max_tail,tail)
return v
def loop(self,g):
a,b,c,d=g;C=self.C
return self.primitive(C(QQ(a)/c,QQ(1)/c))-self.primitive(C(-QQ(d)/c,QQ(1)/c))
@lru_cache(None)
def periods(self):
t=topology(self.N);g,h=t['pair'];A=matrix(QQ,[g[1],h[1]]).inverse();values=[self.loop(g[0]),self.loop(h[0])]
lam=[sum(A[j,k]*values[k] for k in range(2)) for j in range(2)]
r,s=t['r'],t['s'];w=sum(r[j]*lam[j] for j in range(2))
assert w.imag().contains_zero() and not w.real().contains_zero()
sign=1 if w.real()>0 else -1;r=sign*r;w=sign*w
v=sum(s[j]*lam[j] for j in range(2));assert not v.imag().contains_zero()
if v.imag()<0:s=-s;v=-v
# Recompute exact real normalization after signs.
tr=s*t['star']+s;j=next(j for j in [0,1] if r[j]);alpha=tr[j]/r[j];assert tr==alpha*r
s=s-(ZZ(alpha)//ZZ(2))*r;delta=int(ZZ(alpha)%2)
assert all(t in ZZ for t in r) and all(t in ZZ for t in s)
assert abs(matrix(QQ,[r,s]).det())==1
v=sum(s[j]*lam[j] for j in range(2))
w1=self.C(w.real());w2=self.C(delta*w1.real()/2,v.imag())
assert (w2-v).contains_zero() and w1.real()>0 and w2.imag()>0
kappa=sign*t['kappa']
return w1,w2,delta,kappa,lam,r,s
def trace(self,D,beta):
C,R=self.C,self.R;w1,w2,delta,kappa,*_=self.periods();forms=nsystem(self.N,int(D),int(beta))
z=sum((self.primitive(C(-QQ(B)/(2*A),R(-D).sqrt()/(2*A))) for A,B,Cc,_ in forms for B in [B]),C(0))
# Fricke(-1) and class conjugation force 2*Re(z)/w1-h*kappa integral.
h=len(forms);rr=2*z.real()/w1.real()-h*kappa
m=int(rr.center().round());assert (rr-m).contains_zero() and R(rr.rad())<R(1)/4
x=(h*kappa+m)/2
snapped=C(x*w1.real(),z.imag());assert (z-snapped).contains_zero()
v=z.imag()/w2.imag();u=x-delta*v/2
ku=unique_floor(u+R(1)/2);kv=unique_floor(v+R(1)/2)
xr=x-ku-QQ(kv*delta)/2
ell=C(xr*w1.real(),z.imag()-kv*w2.imag())
return ell,dict(forms=forms,raw=z,real_ratio=x,u=u,v=v,shifts=(ku,kv),periods=(w1,w2))
def unique_floor(a):
lo=ZZ(a.lower().floor());hi=ZZ(a.upper().floor())
if lo!=hi:raise BoundaryError(str(a))
return lo
class BoundaryError(ValueError):pass
@lru_cache(None)
def nsystem(N,D,beta):
target={tuple(q) for q in BinaryQF_reduced_representatives(D,primitive_only=True)};found={}
for a in range(1,2001):
A=N*a
for B in range(-A+(beta+A)%(2*N),A+1,2*N):
if (B*B-D)%(4*A):continue
C=(B*B-D)//(4*A)
if gcd([a,B,C*N])!=1:continue
red=tuple(BinaryQF([A,B,C]).reduced_form());assert red in target
if red not in found:found[red]=(A,B,C,red)
if set(found)==target:return tuple(found[k] for k in sorted(found))
raise ValueError('N-system enumeration cap reached')
def selection(bound=100):
for N in LEVELS:
for d in range(3,bound+1):
D=ZZ(-d)
if not D.is_fundamental_discriminant() or gcd(D,N)!=1:continue
for beta in range(2*N):
if (beta*beta-D)%(4*N)==0:yield dict(N=N,D=int(D),beta=beta)