Next Article in Journal
Integrating Sensor Embeddings with Variant Transformer Graph Networks for Enhanced Anomaly Detection in Multi-Source Data
Previous Article in Journal
Robust a Posteriori Error Estimates of Time-Dependent Poisson–Nernst–Planck Equations
Previous Article in Special Issue
Evaluation of Infinite Series by Integrals
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Revisiting a Classic Identity That Implies the Rogers–Ramanujan Identities III †

Department of Mathematical Sciences, University of Illinois Springfield, Springfield, IL 62703-5407, USA
Dedicated to Professor G. E. Andrews and Professor B. Berndt on the occasion of their 85th birthdays.
Mathematics 2024, 12(17), 2611; https://doi.org/10.3390/math12172611
Submission received: 30 June 2024 / Revised: 18 August 2024 / Accepted: 19 August 2024 / Published: 23 August 2024
(This article belongs to the Special Issue Recent Advances on Ramanujan Theories in Mathematics and Physics)

Abstract

:
This is the third installment in a series of papers on a one-parameter extension of the Rogers–Ramanujan identities (this extension was discovered independently by Rogers and Ramanujan). In this paper, we report a new proof of this identity. Our key ingredient is the Bridge Lemma, an identity that connects the both sides of the one-parameter refinement, which differ significantly in terms of their complexity.

1. Introduction

The celebrated Rogers–Ramanujan identities are the following pair of identities, with | q | < 1 (here and throughout the rest of the paper)
1 + n = 1 q n 2 ( 1 q ) ( 1 q n ) = n = 1 1 ( 1 q 5 n 4 ) ( 1 q 5 n 1 ) ,
1 + n = 1 q n ( n + 1 ) ( 1 q ) ( 1 q n ) = n = 1 1 ( 1 q 5 n 3 ) ( 1 q 5 n 2 ) .
They are some of the most important and beautiful results in theory of partitions. For a history of these results, see [1] and Entries 38 (i) and (ii) in [2]. For a modern introduction, see [3]. Also, see the following excellent resources for their proofs: [4,5,6,7,8,9,10,11,12]. The Rogers–Ramanujan identities have transcended the boundaries of pure mathematics and found applications in diverse areas in physics, including statistical mechanics and conformal field theory (here are a few selected references [13,14,15,16,17,18,19]).
A beautiful one-parameter extension is given by
k = 0 q k 2 ( q ) k a k = r = 0 ( 1 ) r a 2 r q r ( 5 r 1 ) / 2 1 a q 2 r 1 ( q ) r a q r ; q .
Here, a is a parameter and the q-Pochhammer symbol is defined by
( a ; q ) n : = k = 0 n 1 ( 1 a q k ) if n 1 ,
with ( a ; q ) 0 : = 1 . A frequently used notation is ( q ) n : = ( q ; q ) n .
Equation (3) was discovered independently by Rogers and Ramanujan and their proofs appeared in the same paper [20] (which was arranged by G. Hardy). See [21] for further details. They use (3) to establish (1) and (2): this is achieved by setting a = 1 and a = q , respectively, and applying the Jacobi triple product identity to the right-hand side of (3) (which converts sums to products). See [9] for details.
In our recent work [22,23], we revisited (3) in elementary manners, exploring, in particular, how various parts in the right-hand side of (3) cancel each other out to give the much simpler left-hand side. We briefly describe these results in Appendix A.
The approaches to (3) by Rogers and Ramanujan are essentially the same (a streamlined version can be found in the work of Hardy and Wright [9]). Their proofs start with the complicated right-hand side of (3), a daunting expression that seems to defy comprehension. From this, they derive a difference equation. The left-hand side of (3) emerges as a power series solution of the same difference equation.
Often, beginners who encounter (3) for the first time wonder how one can derive the right-hand side from the relatively simple left-hand side of the identity through elementary algebraic manipulations. Motivated by the significant difference in complexity between both sides of (3), it is evident that some terms need to be added to the left side. What remains very non-trivial is determining what terms should be added: there are not many clues as to how the two sides are connected or related.
In this paper, we present a new proof of (3) that addresses this question from an elementary point of view. In particular, we identify the extra terms that need to be added to the left-hand side of (3) in order to derive the right-hand side (see the Bridge Lemma in Section 2). These terms (referred to as Z m ( 1 , 2 ) ( k ) below) are highly elusive because they are transformed and manipulated by non-trivial summations (e.g., see (18) and the evaluation of J r in (21)), making them unrecognizable on the right side of (3).
The details of the Bridge Lemma are provided in Section 2. A new and direct proof of (3) can be found in Section 3. We conclude with an open question in Section 4.

2. The Bridge Lemma

The main result in this section is the Bridge Lemma (Lemma 2), which provides the connection (“bridge”) between the two sides of (3).
For k 0 , define
Z m ( k ) : = Z m ( 1 ) ( k ) Z m ( 2 ) ( k ) ,
where
  • Z m ( 1 ) ( k ) : = 0 if m < k , and
    Z m ( 1 ) ( k ) : = q k 2 + 2 k l ( q ) k q l ; q l ( q ) l if m k , with l : = m k .
  • Z m ( 2 ) ( k ) : = 0 if m k , and
    Z m ( 2 ) ( k ) : = q k 2 + 2 k l ( q ) k q l + 1 ; q l 1 ( q ) l 1 if m k + 1 , with l : = m k .
With this understood, we have
Lemma 1.
For  k 0 , the following is true:
Z m ( k ) = q k 2 ( q ) k i f m = k , 0 otherwise .
Remark 1.
When  m = k , Z m ( k )  gives the coefficient of  a k  on the left-hand side of (3).
Proof. 
For m < k , (8) follows from the definition of Z m ( 1 , 2 ) ( k ) (as both of them are zero). For m = k , only Z k ( 1 ) ( k ) contributes (and gives q k 2 ( q ) k ). For m k + 1 , (8) follows from the fact that Z m ( 1 , 2 ) ( k ) are equal because of
q l ; q l ( q ) l = q l + 1 ; q l 1 ( q ) l 1 .
It follows from Lemma 1 that
Lemma 2
(The Bridge Lemma).
a k q k 2 ( q ) k = m k a m Z m ( k ) .
This is because only Z k ( k ) contributes. Note that the term on the left side of (9) is the k-th term on the left-hand side of (3).
This Lemma is very crucial in our derivation of (3), as it serves as the bridge between the two sides, which are so different in terms of complexity. Indeed, let us write (9) as
a k q k 2 ( q ) k = a k Z k ( k ) This gives the left side . + m k + 1 a m ( Z m ( 1 ) ( k ) Z m ( 2 ) ( k ) = Z m ( k ) ) .
The terms in the sum over m are essential for deriving the right-hand of (3), as we will see in the next section.
The compact forms of Z m ( 1 , 2 ) ( k ) , as in (6) and (7), come in handy in the proof of Lemma 1. For our proof of (3) in the next section, we rewrite them as follows. Define
λ r , k ( q ) : = 1 ( q ) r r k q ( 1 ) r k q ( r k ) ( r k 1 ) / 2 + r 2 ,
where the q-binomial numbers (the Gaussian polynomials) are defined by
A B q = ( 1 q A ) ( 1 q A 1 ) ( 1 q A B + 1 ) ( 1 q B ) ( 1 q B 1 ) ( 1 q ) = ( q ) A ( q ) B ( q ) A B if 0 B A , 0 otherwise .
By applying the q-binomial theorem to the numerators (to q l ; q l and q l + 1 ; q l 1 respectively), we have
Z m ( 1 ) ( k ) = r = k m λ r , k ( q ) q ( r + k ) ( m r ) ( q ) m r if m k ,
Z m ( 2 ) ( k ) = r = k m 1 λ r , k ( q ) q ( r + k ) ( m r 1 ) + 2 r ( q ) m r 1 if m k + 1 .
See Appendix B for the idea of proof.
With the above understood, we can turn to the next section.

3. A New Proof of (3)

As we discussed in the Section 1, this proof starts from the left-hand side of (3), which is much simpler than the other side in form. Indeed, we have
k 0 a k q k 2 ( q ) k = k 0 m k a m Z m ( k ) ( the Bridge Lemma ) = k 0 m k a m Z m ( 1 ) ( k ) Z m ( 2 ) ( k ) ( ( 5 ) ) = k 0 m k a m Z m ( 1 ) ( k ) k 0 m k + 1 a m Z m ( 2 ) ( k ) .
To proceed, let us focus on the first sum in (15) (only on the sum over m):
m k a m Z m ( 1 ) ( k ) = m = k r = k m a m λ r , k ( q ) q ( r + k ) ( m r ) ( q ) m r ( ( 13 ) )
= r = k λ r , k ( q ) m = r a m q ( r + k ) ( m r ) ( q ) m r
= r = k λ r , k ( q ) a r a q r + k ; q .
To obtain (17), we have applied to the sum over m in (16) a result due to Euler
k = 0 z k ( q ) k = 1 ( z ; q )
(with z = a q r + k ).
The second sum in (15) can be handled similarly. The sum over m gives
m k + 1 a m Z m ( 2 ) ( k ) = m = k + 1 r = k m 1 a m λ r , k ( q ) q ( r + k ) ( m r 1 ) + 2 r ( q ) m r 1 ( ( 14 ) )
= r = k λ r , k ( q ) q 2 r m = r + 1 a m q ( r + k ) ( m r 1 ) ( q ) m r 1
= r = k λ r , k ( q ) a r + 1 q 2 r a q r + k ; q .
Again, we have applied (18) to the sum over m in (19) to obtain the last line.
Using (17) and (20) in (15), we have
k 0 a k q k 2 ( q ) k = k = 0 r = k λ r , k ( q ) a r 1 a q 2 r a q r + k ; q = r = 0 a r 1 a q 2 r k = 0 r λ r , k ( q ) a q r + k ; q = r = 0 ( 1 ) r a r q r 2 1 a q 2 r 1 ( q ) r k = 0 r r k q ( 1 ) r q ( r k ) ( r k 1 ) / 2 a q r + k ; q : = J r = a r q r ( 3 r 1 ) / 2 ( a q r ; q )   ;   see Appendix C = r = 0 ( 1 ) r a 2 r q r ( 5 r 1 ) / 2 1 a q 2 r 1 ( q ) r a q r ; q ,
which is the right-hand side of (3). Note that we have used the definition of λ r , k ( q ) (i.e., (11)) to obtain (21). To obtain the last step, we need to establish the evaluation of J r in (21)—see Appendix C for details.

4. Conclusions

We conclude this paper with a challenge: Find a connection between our approach and proofs based on Bailey’s Lemma (e.g., see [24,25]). In particular, see [24] for a detailed proof of (3) through the framework of Bailey’s lemma.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

We would like to thank Nikolaos Bagis for his kind invitation to contribute to the special issue Recent Advances on Ramanujan Theories in Mathematics and Physics. Additionally, we would like to express our appreciation for his leadership and guidance throughout this project. The MDPI editorial staff is outstanding. We would like to express our gratitude to the reviewers for their insightful comments and feedback on the manuscript, as well as their encouragement. We greatly appreciate the time and effort they dedicated to reviewing this paper, which contributed to its improvement and the overall quality. We would like to extend our warmest congratulations to G. E. Andrews and B. Berndt on the occasion of their 85th birthdays. We would like to thank them for their encouragement and inspiration over the years. We wish them many more years of good health, fulfillment, and continued impact.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. A Recap of the First Two Papers in the Series

One can view [22], the first paper in the series, as using ‘reverse engineering’ to understand (3). By expressing the right-hand side of (3) as a power series in a and comparing the coefficients of a k , one obtains (for k 1 )
q k 2 = 1 + r = 1 k / 2 k r r q ( 1 ) r q r ( r 1 ) / 2 + k r q k + 1 r ; q r + r = 1 ( k + 1 ) / 2 k r r 1 q ( 1 ) r q r ( r 1 ) / 2 + k ( r 1 ) q k + 1 r ; q r .
In [22], we proved the above identity in an elementary way by expanding the right-hand side of (A1) and tracking the cancellations (which was a bit tedious). To our surprise, there are remarkable cancellations and (A1) is equivalent to
q k 2 = 1 + q k 1 1 + q k + q 2 k + + q ( k 1 ) k ,
which is a finite geometric series. In the sequel, [23], we offer a new proof of (A1) by using a difference equation (since the left-hand side of (A1) satisfies q k 2 = q 2 k 1 q ( k 1 ) 2 , the right-hand side should do so as well).
The present paper follows an opposite path. We start from the left-hand side of (3), the relatively simpler side, and use the Bridge Lemma to arrive at the more complicated side. There should be a unifying framework behind these approaches. We hope to address this in the future.

Appendix B. Some Details on (13) and (14)

The proofs of (13) and (14) are similar. We will focus on the first one in this appendix.
Z m ( 1 ) ( k ) = q k 2 + 2 k l ( q ) k q l ; q l ( q ) l ( ( 6 ) , with l = m k 0 ) = q k 2 + 2 k l ( q ) k ( q ) l r = 0 l l r q ( 1 ) r q r ( r 1 ) / 2 + l r ( the q - binomial theorem ) = r = k m ( 1 ) r k ( q ) k ( q ) r k ( q ) m r q ( r k ) ( r k 1 ) / 2 + r 2 + ( r + k ) ( m r ) ( r r k ) = r = k m 1 ( q ) r r k q ( 1 ) r k q ( r k ) ( r k 1 ) / 2 + r 2 = λ r , k ( q )   ; see ( 11 ) q ( r + k ) ( m r ) ( q ) m r ,
which is (13).

Appendix C. The Evaluation of Jr in (21)

Our goal is to prove
J r : = k = 0 r r k q ( 1 ) k q ( r k ) ( r k 1 ) / 2 a q r + k ; q = a r q r ( 3 r 1 ) / 2 a q r ; q .
As we will show below, this is equivalent to
k = 0 r r k q ( 1 ) k q k ( k 1 ) / 2 + k ( 1 r ) ( a ; q ) k = a r ,
which is straightforward to verify.
To see the equivalence, first, we note that because of
( r k ) ( r k 1 ) 2 = r ( r 1 ) 2 + k ( k 1 ) 2 + k ( 1 r ) ,
(A3) is equivalent to
k = 0 r r k q ( 1 ) k q k ( k 1 ) / 2 + k ( 1 r ) a q r + k ; q = a r q r 2 a q r ; q ,
which, in turn, is equivalent to (after a a q r )
k = 0 r r k q ( 1 ) k q k ( k 1 ) / 2 + k ( 1 r ) a q k ; q = a r a ; q .
By multiplying ( a ; q ) to both sides of (A5), we have
k = 0 r r k q ( 1 ) k q k ( k 1 ) / 2 + k ( 1 r ) ( a ; q ) k = a r ,
which is (A4). Note that (A4) is the same as expressing a r in terms of the basis { ( a ; q ) k } k = 0 r .
We are to give two proofs of (A4) (hence implying (A3), the evaluation of J r ).
  • Method 1
Let us denote the left-hand side of (A4) by f r ( a ) (with f 0 ( a ) = 1 ). By using the well-known identity (see, e.g., [5])
r k q = r 1 k q q k + r 1 k 1 q ,
we have
f r ( a ) = f r 1 ( a ) ( 1 a ) q 1 r f r 1 ( a q ) .
It is straightforward to show that a r satisfies (A7) with the same initial condition. This proves (A4).
  • Method 2
Define the q-shift operator, ϵ , by ϵ f ( a ) = f ( a q ) . Define the operator Ω by
Ω : = ( 1 a ) ϵ .
Note that orders matter. For example, the operator Ω is not the same as ϵ ( 1 a ) .
A key result is
Ω k · 1 = ( a ; q ) k .
Here, the constant “1” on the left is the vacuum in which Ω acts (note that it is invariant under the action of ϵ , as ϵ · 1 = 1 ). It is not hard to prove (A9) by induction. We will instead illustrate it with an example:
Ω 3 · 1 = ( 1 a ) ϵ ( 1 a ) ϵ ( 1 a ) ϵ · 1 = 1 = ( 1 a ) ϵ ( 1 a ) ϵ ( 1 a ) · 1 = ( 1 a q ) · 1 = ( 1 a ) ϵ ( 1 a ) ( 1 a q ) · 1 = ( 1 a q ) ( 1 a q 2 ) · 1 = ( 1 a ) ( 1 a q ) ( 1 a q 2 ) = ( a ; q ) 3 ,
where we dropped the constant 1 on the last line, as there is no more ϵ operator.
With this understood, we have (where z r : = q 1 r )
The LHS of ( A 4 ) = k = 0 r r k q ( 1 ) k q k ( k 1 ) / 2 z r Ω k · 1 = z r Ω ; q r · 1 .
Note that, since the operator Ω commutes with the rest of the sum, we can apply the q-binomial theorem to obtain the last expression.
Finally, (A4) is established by showing
z r Ω ; q r · 1 = a r .
This can be proven by induction: assuming the r-th case, we have
z r + 1 Ω ; q r + 1 · 1 = 1 q r Ω z r Ω ; q r · 1 = 1 q r Ω a r · 1 = 1 q r ( 1 a ) ϵ a r · 1 = a r q r ( 1 a ) ( a q ) r = a r a r + a r + 1 = a r + 1 .
This gives the desired result, and (A10) and (A11) imply (A4).

References

  1. Andrews, G.E. The Theory of Partitions. In Encyclopedia of Mathematics and its Applications; Reissued; Cambridge University Press: Cambridge, UK, 1998. [Google Scholar]
  2. Berndt, B.C. Ramanujan’s Notebooks; Part III; Springer: New York, NY, USA, 1991. [Google Scholar]
  3. Sills, A.V. An Invitation to the Rogers-Ramanujan Identities; CRC Press: Boca Raton, FL, USA, 2017. [Google Scholar]
  4. Andrews, G.E.; Askey, R.; Roy, R. Special Functions; Cambridge University Press: Cambridge, UK, 1999. [Google Scholar]
  5. Chan, H.-C. An Invitation to q-Series; World Scientific Publishing: Singapore, 2011. [Google Scholar]
  6. Chu, W.; Claudio, L.D. Classical Partition Identities and Basic Hypergeometric Series; Università degli Studi di Lecce: Lecce, Italy, 2004. [Google Scholar]
  7. Cooper, S. Ramanujan’s Theta Functions; Springer: New York, NY, USA, 2017. [Google Scholar]
  8. Guo, V.J.W.; Jouhet, F.; Zeng, J. New finite Rogers-Ramanujan identities. Ramanujan J. 2009, 19, 247–266. [Google Scholar] [CrossRef]
  9. Hardy, G.H.; Wright, E.M. An Introduction to the Theory of Numbers, 6th ed.; Heath-Brown, R., Silverman, J., Wiles, A., Eds.; Oxford University Press: Oxford, UK, 2008. [Google Scholar]
  10. Hirschhorn, M.D. The Power of q: A Personal Journey; Springer: New York, NY, USA, 2017. [Google Scholar]
  11. Johnson, W.P. Introduction to q-analysis; American Mathematical Society: Providence, RI, USA, 2020. [Google Scholar]
  12. McLaughlin, J. Topics and Methods in q-Series; World Scientific Publishing: Singapore, 2017. [Google Scholar]
  13. Andrews, G.E. The hard-hexagon model and Rogers-Ramanujan type identities. Proc. Natl. Acad. Sci. USA 1981, 78, 5290–5292. [Google Scholar] [CrossRef] [PubMed]
  14. Baxter, R.J. Rogers-Ramanujan identities in the hard hexagon model. J. Statist. Phys. 1981, 26, 427–452. [Google Scholar] [CrossRef]
  15. Baxter, R.J. Exactly Solved Models in Statistical Mechanics; Academic Press: London, UK, 1982. [Google Scholar]
  16. Berkovich, A.; McCoy, B.M. Rogers-Ramanujan identities: A century of progress from mathematics to physics. In Proceedings of the International Congress of Mathematicians, Berlin, Germany, 18–27 August 1998; Volume III, pp. 163–172. [Google Scholar]
  17. Belavin, A.; Gepner, D. Generalized Rogers Ramanujan Identities from AGT Correspondence. arXiv 2012, arXiv:1212.6600. [Google Scholar]
  18. Campbell, G.B. Rogers-Ramanujan identities in Statistical Mechanics. arXiv 2024, arXiv:2405.08425. [Google Scholar]
  19. Cecotti, S.; Neitzke, A.; Vafa, C. R-twisting and 4d/2d correspondences. arXiv 2010, arXiv:1006.3435. [Google Scholar]
  20. Rogers, L.J.; Ramanujan, S. Proof of certain identities in combinatory analysis. Cam. Phil. Soc. Proc. 1919, 19, 211–216. [Google Scholar]
  21. Andrews, G.E. On Identities implying the Rogers-Ramanujan identities. Houston J. Math. 1976, 2, 289–298. [Google Scholar]
  22. Chan, H.-C. Chasing after cancellations: Revisiting a classic identity that implies the Rogers–Ramanujan identities. Int. J. Number Theory 2021, 17, 297–310. [Google Scholar] [CrossRef]
  23. Chan, H.-C. Revisiting a classic identity that implies the Rogers–Ramanujan identities II. Axioms 2021, 10, 239. [Google Scholar] [CrossRef]
  24. Andrews, G.E. Bailey’s transform, lemma, chains and tree. In Special Functions 2000: Current Perspective and Future Directions; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2001; pp. 1–22. [Google Scholar]
  25. Warnaar, S.O. 50 years of Bailey’s lemma. In Proceedings of the Algebraic Combinatorics and Applications, Goessweinstein, Germany, 12–19 September 1999; Springer: Berlin, Germany, 2001; pp. 333–347. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Chan, H.-C. Revisiting a Classic Identity That Implies the Rogers–Ramanujan Identities III. Mathematics 2024, 12, 2611. https://doi.org/10.3390/math12172611

AMA Style

Chan H-C. Revisiting a Classic Identity That Implies the Rogers–Ramanujan Identities III. Mathematics. 2024; 12(17):2611. https://doi.org/10.3390/math12172611

Chicago/Turabian Style

Chan, Hei-Chi. 2024. "Revisiting a Classic Identity That Implies the Rogers–Ramanujan Identities III" Mathematics 12, no. 17: 2611. https://doi.org/10.3390/math12172611

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop