Matching works

1 work

math.NT — Number Theory

Hecke eigenvalues in level 1 modulo powers of 2 and 3: Hatada's question (1981) and the Coleman-Stein conjecture

Contributed by David Niedbala Giraudin

Let ff be a normalized Hecke eigenform of level 11 and weight kk, with eigenvalues an(f)a_n(f). In 1981 Hatada asked whether ap(f)≡1+p(mod2a)a_p(f)\equiv 1+p \pmod{2^a} whenever p≡±1(mod2a−1)p\equiv\pm1\pmod{2^{a-1}} and 6≤a≤136\le a\le 13. Rustom's congruence modulo 128128 answers this for a≤7a\le 7. We show that the answer is affirmative for a≤10a\le 10 and negative for a=11a=11, 1212 and 1313, the counterexamples coming from weight 1616 and p=12289p=12289. The proof combines Rustom's theorem with a certificate for T5T_5 modulo 512512 on period polynomials, a 22-adic Galois law (for instance ap≡1+pk−1(mod210)a_p\equiv 1+p^{k-1}\pmod{2^{10}} for every p≡1(mod8)p\equiv 1\pmod 8), and a reduction to a computation in a finite group. As a consequence, ap(f)=0a_p(f)=0 implies p≡−1(mod211)p\equiv -1\pmod{2^{11}}. At the prime 33 we show that, on Hatada's lattice of period polynomials, T22≡9(k−1)2(mod27)T_2^2\equiv 9(k-1)^2\pmod{27}, with refinements modulo 8181. This gives an independent proof of Conjecture 9.1 of Rustom without any ramification hypothesis and of the level 11 case of the Coleman--Stein conjecture, both of which also follow from Rustom's recent classification modulo 8181. We also prove that an(f)≡σk−1(n)(mod81)a_n(f)\equiv\sigma_{k-1}(n)\pmod{81} for every n≡1(mod3)n\equiv 1\pmod 3, and a 33-adic Galois law modulo 243243 on the Galois group of Q(−3)\mathbb{Q}(\sqrt{-3}), which gives congruences modulo 243243 and 729729 for suitable split primes and a bilinear law for primes ℓ≡2(mod3)\ell\equiv 2\pmod 3. Beyond 729729, for every prime ℓ≡2(mod3)\ell\equiv 2\pmod 3 we prove aℓ2≡σk−1(ℓ)2(mod3min⁡(2j+2,10))a_\ell^2\equiv\sigma_{k-1}(\ell)^2\pmod{3^{\min(2j+2,10)}}, where j=v3(ℓ+1)j=v_3(\ell+1); the exponent 2j+22j+2 is attained for j≤4j\le 4 and fails for j=5j=5. Each statement is marked as proved, known, verified or open. The finite computations are certified by seven Python scripts, provided as ancillary files.

Primarily AI-generated textHuman understanding: no partsColeman-Stein conjectureGalois representationsHecke eigenvaluescongruences of modular formsperiod polynomials

Advanced search

Text
Human understanding
Linked formalizations