17.11 Transformations of q-Appell Functions17.13 Integrals

§17.12 Bailey Pairs

Bailey Pairs

A sequence of pairs of rational functions of several variables (\alpha _{n},\beta _{n}), n=0,1,2,\dots, is called a Bailey pair provided that for each n\geqq 0

17.12.3 \beta _{n}=\sum _{{j=0}}^{n}\frac{\alpha _{j}}{\left(q;q\right)_{{n-j}}\left(aq;q\right)_{{n+j}}}.

Strong Bailey Lemma

When (17.12.5) is iterated the resulting infinite sequence of Bailey pairs is called a Bailey Chain.

The Bailey pair that implies the Rogers–Ramanujan identities §17.2(vi) is:

17.12.6
\alpha _{n}=\frac{\left(a;q\right)_{{n}}(1-aq^{{2n}})(-1)^{n}q^{{n(3n-1)/2}}a^{n}}{\left(q;q\right)_{{n}}(1-a)},
\beta _{n}=\frac{1}{\left(q;q\right)_{{n}}}.

The Bailey pair and Bailey chain concepts have been extended considerably. See Andrews (2000, 2001), Andrews and Berkovich (1998), Andrews et al. (1999), Milne and Lilly (1992), Spiridonov (2002), and Warnaar (1998).