Jacobi Theta Function modularity translation quick q

binbagsss
Messages
1,291
Reaction score
12

Homework Statement



I have the Jacobi theta series: ##\theta^{m}(\tau) = \sum\limits^{\infty}_{n=0} r_{m}(\tau) q^{n} ##,

where ##q^{n} = e^{2\pi i n \tau} ## and I want to show that ##\theta^{m}(\tau + 1) = \theta^{m}(\tau) ##

(dont think its needed but) where ##r_{m} = ## number of ways of writing ##m## as the sum of ##n## squares.

Homework Equations



the above

The Attempt at a Solution


[/B]
so i get an extra ##e^{2\pi i n} ## factor, ## \theta^{m}(\tau) = \sum\limits^{\infty}_{n=0}r_{m}(\tau) q^{n} e^{2\pi i n} ##

I think it should be obvious what to do now, but I don't know what to do next?

Something like defining a new Fourier coefficient, ##r'{m}= r_{m} e^{2\pi i n} ## and then since the sum is to ? but that doesn't seem proper enough?

Many thanks.
 
Physics news on Phys.org
Hmm. You know that if n is an integer, e^{i 2n\pi} = 1?
 
stevendaryl said:
Hmm. You know that if n is an integer, e^{i 2n\pi} = 1?
oh my ! thank you ha :)
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top