The \(C_ \ell\) Bailey transform and Bailey lemma (Q690355): Difference between revisions

The Bailey transform is a distillation by \textit{G. E. Andrews} [\(q\)- series: their development and application in analysis, number theory, combinatorics, physics, and computer algebra (1986; Zbl 0594.33001)] of a technique developed by W. N. Bailey for proving the Rogers-Ramanujan identities and generating large families of similar results. It is an iterative procedure that establishes the equivalence of a doubly infinite string of identities. Proving any one of the identities in the string establishes the validity of all of them. The Bailey transform can be used to take a simple identity and build it into a more complex one with added structure. More usefully, given a conjectured identity it enables one to search for simpler equivalent identities. The Bailey transform itself rests on a classical summation theorem for a \(_ 4\phi_ 3\) basic hypergeometric series. This paper is based on the observation that a result by \textit{R. A. Gustafson} [Proc. Ramanujan International Symp. Anal. 185-224, Pune, India (1989)] implies a generalization of the \(_ 4\phi_ 3\) summation theorem. This generalization replaces the basic hypergeometric series with a series reflecting the symmetry of the root system \(C_ l\) for positive integer \(l\). The authors construct a generalization of the Bailey transform that incorporates this \(C_ l\) symmetry, and they use it to prove a connection coefficient result for a \(C_ l\) generalization of the little \(q\)-Jacobi polynomials.