Ramanujan's Generating Function for Partitions Modulo 7

1 comment

Ramanujan's Partition Congruences

Based on the empirical analysis of a table of partitions Ramanujan conjectured his famous partition congruences p(5n+4)0(mod5)p(7n+5)0(mod7)p(11n+6)0(mod11) and gave some of the most beautiful proofs for them (see here). In addition to these proofs he gave the following generating functions for p(5n+4),p(7n+5): n=0p(5n+4)qn=5{(1q5)(1q10)(1q15)}5{(1q)(1q2)(1q3)}6 and n=0p(7n+5)qn=7{(1q7)(1q14)(1q21)}3{(1q)(1q2)(1q3)}4+49q{(1q7)(1q14)(1q21)}7{(1q)(1q2)(1q3)}8 We have already established (2) in one of our posts and this post deals with the identity (3) concerning generating function of partitions modulo 7.

The identity (3) is exceedingly difficult to prove using elementary techniques and most of the proofs involve heavy symbolic manipulation which is normally done using a software like MAPLE or MACSYMA. I tried to obtain some help from MSE to get a proof which used something possible via hand calculation but did not get any good answers there. I chanced to read an old paper titled "Some Identities involving the Partition Function" by Oddmund Kolberg which provided very nice and elementary proofs of the identities (2) and (3) in a systematic fashion. This post tries to elaborate on the concise proof available in that paper.

The Basic Technique

The main idea of the proof is to start with the following well known identities of Euler and Jacobi: f(q)=(1q)(1q2)(1q3)=n=(1)nqn(3n+1)/2 and f3(q)={(1q)(1q2)(1q3)}3=n=0(1)n(2n+1)qn(n+1)/2 and split each of the series above based on the powers of q modulo some prime number. Here we focus on the specific case where the prime number concerned is 7. Thus we can write f(q)=n=(1)nqn(3n+1)/2=g0+g1+g2+g3+g4+g5+g6=6s=0gs=6s=0(n(3n+1)/2s(mod7)(1)nqn(3n+1)/2) and f3(q)=n=0(1)nqn(n+1)/2=h0+h1+h2+h3+h4+h5+h6=6s=0hs=6s=0(n0,n(n+1)/2s(mod7)(1)n(2n+1)qn(n+1)/2) Clearly the expression n(3n+1)/2 falls into one of the four class classes 0,1,2,5 modulo 7 so that g3=g4=g6=0 Similarly we have h2=h4=h5=0 On the other hand we can evaluate g2 by noting that n(3n+1)/22(mod7)24{n(3n+1)/2}+1490(mod7)(6n+1)20(mod7)6n+10(mod7)n1(mod7) We thus have g2=n=(1)7n+1q(7n+1)(21n+4)/2=n=(1)7nq2q49n(3n+1)/2=q2f(q49) In a similar fashion we can calculate h6=7q6f3(q49) so that h6=7g32.

We thus have the following values of gs,hs: g2=q2f(q49),g3=g4=g6=0h6=7q6f3(q49)=7g32,h2=h4=h5=0 Using the relation hs=(gs)3 we get hs=(g0+g1+g2+g5)3 and on equating the terms based on their modulo classes on each side (after cubing RHS) we get 3(g20g2+g21g0+g22g5)=h2=03(g21g2+g22g0+g25g1)=h4=03(g20g5+g22g1+g25g2)=h5=0g32+6g0g1g5=h6=7g32 Putting α=g0/g2,β=g1/g2,γ=g5/g2 we can rewrite the above equations as αβ2+α2+γ=0βγ2+β2+α=0γα2+γ2+β=0αβγ=1 We now relate these quantities with the partition function p(n).

Relation with Partition Function p(7n+5)

We have the generating function of the partition function p(n) given by the formula n=0p(n)qn=1f(q) We split the series on the left based on powers of q modulo 7 so that p(n)qn=6s=0Ps with Ps defined by Ps=n=0p(7n+s)q7n+s We thus have the following equations P0+P1+P2+P3+P4+P5+P6=1f(q)g0+g1+g2+g3+g4+g5+g6=f(q) Multiplying the above equations and arranging terms based on their modulo classes we get g0P0+g6P1+g5P2+g4P3+g3P4+g2P5+g1P6=1g1P0+g0P1+g6P2+g5P3+g4P4+g3P5+g2P6=0g2P0+g1P1+g0P2+g6P3+g5P4+g4P5+g3P6=0g3P0+g2P1+g1P2+g0P3+g6P4+g5P5+g4P6=0g4P0+g3P1+g2P2+g1P3+g0P4+g6P5+g5P6=0g5P0+g4P1+g3P2+g2P3+g1P4+g0P5+g6P6=0g6P0+g5P1+g4P2+g3P3+g2P4+g1P5+g0P6=0 Using Cramer's rule we can calculate the desired sum P5 corresponding to p(7n+5) as P5=D5/D where D and D5 are the following determinants D=|g0g6g5g4g3g2g1g1g0g6g5g4g3g2g2g1g0g6g5g4g3g3g2g1g0g6g5g4g4g3g2g1g0g6g5g5g4g3g2g1g0g6g6g5g4g3g2g1g0| D5=|g1g0g6g5g4g2g2g1g0g6g5g3g3g2g1g0g6g4g4g3g2g1g0g5g5g4g3g2g1g6g6g5g4g3g2g0| Calculating these determinants above is bit of a challenge but is made possible by the vanishing of some of gs and the relations (9).

Evaluation of determinants D,D5

If we take a closer look at D we can see that it is the determinant of a circulant matrix A and therefore we can easily find the eigenvalues of this matrix and thereby calculate the determinant D as a product of eigenvalues. If ω is a 7th root of unity (including ω=1 also) then we can see that the expression g0+ωg1+ω2g2+ω3g3+ω4g4+ω5g5+ω6g6 is an eigenvalue of A and the vector (1,ω,ω2,ω3,ω4,ω5,ω6) is the corresponding eigenvector. If ω is a primitive 7th root of unity then all the 7th roots of unity are given by powers of ω and thus for each of t=0,1,2,3,4,5,6 we obtain the eigenvalue λt=g0+ωtg1+ω2tg2+ω3tg3+ω4tg4+ω5tg5+ω6tg6 and therefore we have the determinant D given by D=6t=0(g0+ωtg1+ω2tg2+ω3tg3+ω4tg4+ω5tg5+ω6tg6)=6t=06s=0ωstgs Using the definition of gs=gs(q) we can easily see that ωstgs(q)=gs(ωtq) and hence we have D=6t=06s=0ωstgs=6t=06s=0gs(ωtq)=6t=0f(ωtq)=6t=0n=1(1ωntqn)=n=16t=0(1ωtnqn)=n Before calculating D_{5} we need to perform a direct calculation of the determinant D using the usual definition of a determinant. To simplify the calculation we use the fact that g_{0} = \alpha g_{2}, g_{1} = \beta g_{2}, g_{5} = \gamma g_{2}, g_{3} = g_{4} = g_{6} = 0 and then we have D = g_{2}^{7}\begin{vmatrix}\alpha & 0 & \gamma & 0 & 0 & 1 & \beta\\ \beta & \alpha & 0 & \gamma & 0 & 0 & 1\\ 1 & \beta & \alpha & 0 & \gamma & 0 & 0\\ 0 & 1 & \beta & \alpha & 0 & \gamma & 0\\ 0 & 0 & 1 & \beta & \alpha & 0 & \gamma\\ \gamma & 0 & 0 & 1 & \beta & \alpha & 0\\ 0 & \gamma & 0 & 0 & 1 & \beta & \alpha\end{vmatrix} = g_{2}^{7}D' Thanks to the presence of the zeroes in D' and the fact that \alpha\beta\gamma = 1 the determinant D' can be calculated by hand with not so unreasonable effort and we get \begin{align}D'&= (\alpha^{7} + \beta^{7} + \gamma^{7}) - 7(\alpha\beta^{5} + \beta\gamma^{5} + \gamma\alpha^{5})\notag\\ &\,\,\,\,\,\,\,\,+ 14(\alpha^{2}\beta^{3} + \beta^{2}\gamma^{3} + \gamma^{2}\alpha^{3}) + 8\tag{15}\end{align} In the same manner we can calculate D_{5} = -g_{2}^{6}D'_{5} where D'_{5} = \begin{vmatrix}\beta & \alpha & 0 & \gamma & 0 & 1\\ 1 & \beta & \alpha & 0 & \gamma & 0\\ 0 & 1 & \beta & \alpha & 0 & 0\\ 0 & 0 & 1 & \beta & \alpha & \gamma\\ \gamma & 0 & 0 & 1 & \beta & 0\\ 0 & \gamma & 0 & 0 & 1 & \alpha\end{vmatrix} and \begin{align}D'_{5}&= (\alpha\beta^{5} + \beta\gamma^{5} + \gamma\alpha^{5}) - 4(\alpha^{2}\beta^{3} + \beta^{2}\gamma^{3} + \gamma^{2}\alpha^{3})\notag\\ &\,\,\,\,\,\,\,\,+ 3(\alpha^{3}\beta + \beta^{3}\gamma + \gamma^{3}\alpha) - 8\tag{16}\end{align} Since we know the value of D' in a closed form as D' = \frac{D}{g_{2}^{7}} = -\frac{f^{8}(-q^{7})}{q^{14}f^{8}(-q^{49})}\tag{17} the real issue is to evaluate D'_{5} in a closed form. For this we try to find relation between D' and D'_{5}. We use a new set of variables y_{1}, y_{2}, y_{3} defined by y_{1} = \alpha^{3}\beta, y_{2} = \beta^{3}\gamma, y_{3} = \gamma^{3}\alpha\tag{18} and then apply equation (10) to evaluate the following expressions \begin{align}\alpha^{2}\beta^{3}&= y_{1}y_{2} = - y_{1} - 1\tag{19a}\\ \beta^{2}\gamma^{3} &= y_{2}y_{3} = - y_{2} - 1\tag{19b}\\ \gamma^{2}\alpha^{3} &= y_{3}y_{1} = - y_{3} - 1\tag{19c}\end{align} y_{1}y_{2}y_{3} = 1\tag{20} \alpha\beta^{5} = y_{1} - y_{2} + 1, \beta\gamma^{5} = y_{2} - y_{3} + 1, \gamma\alpha^{5} = y_{3} - y_{1} + 1\tag{21} \begin{align}\alpha^{7}&= - y_{1}^{2} + y_{1} - y_{3} - 1\tag{22a}\\ \beta^{7}&= - y_{2}^{2} + y_{2} - y_{1} - 1\tag{22b}\\ \gamma^{7}&= - y_{3}^{2} + y_{3} - y_{2} - 1\tag{22c}\end{align} Using equation (15) and the above relations between y_{i} we get \begin{align}D'&= -(y_{1}^{2} + y_{2}^{2} + y_{3}^{2}) - 14(y_{1} + y_{2} + y_{3}) - 58\notag\\ &= -(y_{1} + y_{2} + y_{3})^{2} - 16(y_{1} + y_{2} + y_{3}) - 64\notag\\ &= -(y_{1} + y_{2} + y_{3} + 8)^{2}\notag\end{align} Using equation (17) we get y_{1} + y_{2} + y_{3} + 8 = \pm\frac{f^{4}(-q^{7})}{q^{7}f^{4}(-q^{49})} and clearly we can see that the expression y_{1} begins with -q^{-7} so that we need to take the negative sign on RHS in above equation. We finally have y_{1} + y_{2} + y_{3} = -\frac{f^{4}(-q^{7})}{q^{7}f^{4}(-q^{49})} - 8\tag{23} In the same manner we can see that D'_{5} = 7(y_{1} + y_{2} + y_{3}) + 7 = -7\frac{f^{4}(-q^{7})}{q^{7}f^{4}(-q^{49})} - 49 We now have \begin{align}\sum_{n = 0}^{\infty}p(7n + 5)q^{7n + 5}&= P_{5} = \frac{D_{5}}{D} = \frac{-g_{2}^{6}D'_{5}}{g_{2}^{7}D'} = -\frac{D'_{5}}{g_{2}D'}\notag\\ &= \frac{1}{q^{2}f(-q^{49})}\cdot\frac{q^{14}f^{8}(-q^{49})}{f^{8}(-q^{7})}\left(7\frac{f^{4}(-q^{7})}{q^{7}f^{4}(-q^{49})} + 49\right)\notag\\ &= q^{5}\left(7\frac{f^{3}(-q^{49})}{f^{4}(-q^{7})} + 49q^{7}\frac{f^{7}(-q^{49})}{f^{8}(-q^{7})}\right)\notag\end{align} Cancelling q^{5} from both sides and replacing q^{7} by q we get the Ramanujan's identity \sum_{n = 0}^{\infty}p(7n + 5)q^{n} = 7\frac{f^{3}(-q^{7})}{f^{4}(-q)} + 49q\frac{f^{7}(-q^{7})}{f^{8}(-q)} The above proof is totally elementary and it is probable that Ramanujan did something similar to obtain his formula. The same technique of splitting series for f(-q) and 1/f(-q) into multiple parts based on the modulo classes of the powers of q can be used to prove the identity (2) for partitions modulo 5. In the above technique the only hard part is the calculation of determinants by brute force which is somewhat laborious. For a person like Ramanujan with unmatched powers of symbolic manipulation this would have been a child's play.

Partition Congruence p(49n + 47) \equiv 0\pmod{49}

Ramanujan's motivation for the identity (3) was to prove the partition congruence p(49n + 47) \equiv 0\pmod{49}\tag{24} and he gave a very short proof of this congruence in the following manner. Using binomial theorem it is easy to check that (1 - q)^{7} = 1 - q^{7} + 7J where J is a power series in q with integral coefficients and hence we can write \frac{1 - q^{7}}{(1 - q)^{7}} = 1 + 7J where J again represents some power series in q with integer coefficients (note that each instance of J may represent a different power series in q). Replace q with q^{2}, q^{3}, \ldots and multiplying the results we get \frac{(1 - q^{7})(1 - q^{14})(1 - q^{21})\cdots}{\{(1 - q)(1 - q^{2})(1 - q^{3})\cdots\}^{7}} = \frac{f(-q^{7})}{f^{7}(-q)}= 1 + 7J\tag{25} Using identity (3) we can write \dfrac{{\displaystyle \sum_{n = 0}^{\infty}p(7n + 5)q^{n + 1}}}{7f^{2}(-q^{7})} = qf^{3}(-q)\frac{f(-q^{7})}{f^{7}(-q)} + 7q^{2}\frac{f^{5}(-q^{7})}{f^{8}(-q)} and using (25) we can now write \dfrac{{\displaystyle \sum_{n = 0}^{\infty}p(7n + 5)q^{n + 1}}}{7f^{2}(-q^{7})} = qf^{3}(-q) + 7J = \sum_{n = 0}^{\infty}(-1)^{n}(2n + 1)q^{n(n + 1)/2 + 1} + 7J We next need to analyze the coefficient of q^{7n} on both sides. On the RHS we can see that \begin{align}\frac{n(n + 1)}{2} + 1 &\equiv 0\pmod{7}\notag\\ \Leftrightarrow n(n + 1) + 2 &\equiv 0\pmod{7}\notag\\ \Leftrightarrow n(n + 1) &\equiv 5\pmod{7}\notag\\ \Leftrightarrow 4n(n + 1) + 1 &\equiv 0\pmod{7}\notag\\ \Leftrightarrow (2n + 1)^{2} &\equiv 0\pmod{7}\notag\\ \Leftrightarrow (2n + 1) &\equiv 0\pmod{7}\notag\end{align} so that the coefficient of q^{7n} on the RHS is a multiple of 7. It follows that the coefficient of q^{7n} in \sum_{n = 0}^{\infty}p(7n + 5)q^{n + 1} is a multiple of 49. Thus we have p(49n + 47)\equiv 0\pmod{49}.

Print/PDF Version

1 comment :: Ramanujan's Generating Function for Partitions Modulo 7

Post a Comment

  1. Good one!