Mock-modular forms of weight one - UCLA Department of Mathematics
Mock-modular forms of weight one - UCLA Department of Mathematics
Mock-modular forms of weight one - UCLA Department of Mathematics
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
MOCK-MODULAR FORMS OF WEIGHT ONE 33<br />
Pro<strong>of</strong> <strong>of</strong> Proposition 6.1. If f(z) = f 1 (Nz) with f 1 (z) a <strong>modular</strong> function <strong>of</strong> level <strong>one</strong>, then<br />
(f|W N )(z) = (f|U N )(z) and<br />
f lift,N,B (z) = f lift,B<br />
1 (z) = f 1 (pz)ϑ B (z).<br />
This case <strong>of</strong> the proposition follows from Corollary 5.2. By Lemma 6.2, it is enough to prove<br />
the proposition for f(z) ∈ M !,new<br />
0 (N). In that case, some calculations show that<br />
(81) f lift,N,B (z) = −N(f|U N )(pz)ϑ B (Nz) + (f(pz)ϑ B (z)) |U N .<br />
Let χ p (N) = ɛ. It is easy to see that f lift,N,B (z) ∈ M !,ɛ<br />
1 (p). Since g ψ (z) ∈ S + 1 (p), Proposition<br />
3.4 tells us that 〈f lift,N,B , g ψ 〉 reg = 0 when ɛ = −1. So we can suppose χ p (N) = ɛ = 1.<br />
By Lemma 6.4, it is easy to see that M !,new<br />
0 (N) is generated by the set S 1 ∪ S 2 , where<br />
(82)<br />
S 1 := {f m (z) : m ≥ 1 + g N , N 2 ∤ m}<br />
S 2 := {f N 2 m(z) − N+1<br />
δ N (m) f m(z) : m ≥ 1 + g N }.<br />
Let f(z) = f N 2 m(z) − N+1<br />
δ N (m) f m(z) ∈ S 2 . We can uniquely write the integer m as N r m ′ with<br />
r ≥ 0, m ′ ≥ −1 and gcd(N, m ′ ) = 1. Then at the cusp infinity, we have<br />
f(z) = q −N r+2 m ′ − N+1<br />
δ N (N r m ′ ) q−N r m ′ + O(1).<br />
From equation (81), it follows that the −n th Fourier coefficient <strong>of</strong> f lift,N,B (z) can be written<br />
as<br />
(<br />
( ))<br />
( )<br />
pN r m ′<br />
c(f lift,N,B pN<br />
, −n) = −N r r+1 m ′ −n<br />
B − N+1 r N<br />
−n<br />
N<br />
δ N (N r m ′ ) B N<br />
(<br />
)<br />
+ r B (−Nn + pN r+2 m ′ ) − N+1 r δ N (N r m ′ ) B(−Nn + pN r m ′ ) .<br />
When r = 0, we can rewrite the equation above as<br />
c(f lift,N,B , −n) = −(N + 1) ( ( )<br />
r B pm ′ − n N + rB (pm ′ − Nn) )<br />
( )<br />
)<br />
pNm<br />
+<br />
(r ′ −n<br />
B + r<br />
N<br />
B (N(pNm ′ − n))<br />
(<br />
)<br />
= −(N + 1)c T N (j lift,B<br />
m<br />
), −n + c (j ′<br />
Nm ′(pz)T N (ϑ B )(z), −n) .<br />
Notice that j pNm ′(pz)T N (ϑ B )(z) = j lift,B[n]<br />
Nm<br />
(z) + j lift,B[n]−1<br />
′<br />
Nm<br />
(z). Since this is true for all n ≥ 1<br />
′<br />
and the principal part uniquely determines a form in M !,+<br />
f lift,N,B (z) = −(N + 1)T N<br />
(<br />
j lift,B<br />
m ′<br />
)<br />
(z)<br />
+ j lift,B[n]<br />
Nm ′<br />
1 (p) up to <strong>forms</strong> in M + 1 (p), we have<br />
(z) + j lift,B[n]−1 (z) + g f (z)<br />
for some g f (z) ∈ M + 1 (p) with integral linear combination <strong>of</strong> c(f, n)’s as Fourier coefficients.<br />
Since T N is self-adjoint with respect to the regularized inner product and<br />
T N (g ψ )(z) = (ψ([n]) + ψ([n]))g ψ (z)<br />
for N prime with χ p (N) = 1, we can rewrite 〈f lift,N,B , g ψ 〉 reg as<br />
〈f lift,N,B , g ψ 〉 reg = −(N + 1)(ψ([n]) + ψ([n]))〈j lift,B<br />
m ′ , g ψ 〉 reg + ρ N,B,ψ (Nm ′ ) + 〈g f , g ψ 〉.<br />
Nm ′