Setup and Classification Rule
Let be a prime and let Let be the Hecke operator and let For we define the syndrome algebra as in the computation script below.
We assign one of four categories to level as follows:
smooth iff ;
split node iff and contains a nontrivial idempotent that lifts to ;
cusp iff , , and no split idempotent lift exists;
non-split node iff , , and no split idempotent lift exists.
The split/non-split distinction is implemented by the same Hensel lifting test used in src/hecke/hecke_prime_node_census.py.
Computation
The classification is computed by
computing a basis of from ModularSymbols(N,2).cuspidal_subspace(),
forming ,
computing on from a small prime Hecke set,
searching for a nontrivial mod- idempotent and lifting it to .
[thm:census500] The scan returns exactly Smooth levels are the complement of the 44 non-smooth levels.
[thm:census1000] The scan over the 164 prime levels in this range gives
Observed Split Nodes
The split-node primes in the range are The non-split-node primes in this range are The cusp levels are
qdim-2+ Block
Across , exactly levels have . The values of occurring in each category are:
Asymptotics
The split-node counts up to these points are At these values this is close to linear growth in the number of primes scanned: This motivates the conjecture that split-node primes have positive density among prime levels (with respect to prime counting in this family), and that non-split nodes also persist with positive lower density.
The quantities have nonzero limits as .
Reproducibility
All classification data are generated by src/hecke/hecke_prime_node_census.py, with outputs src/hecke/hecke_prime_node_census.json, src/hecke/hecke_prime_node_census.md, src/hecke/hecke_prime_node_census_upto_1000.json, and src/hecke/hecke_prime_node_census_upto_1000.md. Exact matrices and syndrome-algebra consistency checks are in src/hecke/hecke_syndrome_lift.py, src/heegner/heegner_syndrome_algebra.py.
9 The Sage Developers, SageMath, https://www.sagemath.org.