Some $q$-supercongruences from transformation formulas for basic   hypergeometric series

Victor J.W. Guo; Michael J. Schlosser

arXiv:1812.06324·math.NT·August 4, 2020

Some $q$-supercongruences from transformation formulas for basic hypergeometric series

Victor J.W. Guo, Michael J. Schlosser

PDF

TL;DR

This paper develops new $q$-supercongruences using advanced hypergeometric transformation formulas and techniques like microscoping, extending known supercongruences and introducing novel transformation formulas for basic hypergeometric series.

Contribution

It introduces new $q$-supercongruences derived from transformation formulas and develops a new transformation formula for a nonterminating ${}_{12}phi_{11}$ series.

Findings

01

Established $q$-analogues of supercongruences by Long and others.

02

Derived a new transformation formula for a nonterminating ${}_{12}phi_{11}$ series.

03

Generalized Rogers' linearization formula for $q$-ultraspherical polynomials.

Abstract

Several new $q$ -supercongruences are obtained using transformation formulas for basic hypergeometric series, together with various techniques such as suitably combining terms, and creative microscoping, a method recently developed by the first author in collaboration with Wadim Zudilin. More concretely, the results in this paper include $q$ -analogues of supercongruences (referring to $p$ -adic identities remaining valid for some higher power of $p$ ) established by Long, by Long and Ramakrishna, and several other $q$ -supercongruences. The six basic hypergeometric transformation formulas which are made use of are Watson's transformation, a quadratic transformation of Rahman, a cubic transformation of Gasper and Rahman, a quartic transformation of Gasper and Rahman, a double series transformation of Ismail, Rahman and Suslov, and a new transformation formula for a nonterminating…

Equations451

k = 0 \sum \infty (- 1)^{k} (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{5}}{k ! ^{5}} = \frac{2}{Γ ( \frac{3}{4} ) ^{4}},

k = 0 \sum \infty (- 1)^{k} (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{5}}{k ! ^{5}} = \frac{2}{Γ ( \frac{3}{4} ) ^{4}},

k = 0 \sum (p - 1) /2 (- 1)^{k} (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{5}}{k ! ^{5}} \equiv ⎩ ⎨ ⎧ - \frac{p}{Γ _{p} ( \frac{3}{4} ) ^{4}} (mod p^{3}), 0 (mod p^{3}), if p \equiv 1 (mod 4), if p \equiv 3 (mod 4) .

k = 0 \sum (p - 1) /2 (- 1)^{k} (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{5}}{k ! ^{5}} \equiv ⎩ ⎨ ⎧ - \frac{p}{Γ _{p} ( \frac{3}{4} ) ^{4}} (mod p^{3}), 0 (mod p^{3}), if p \equiv 1 (mod 4), if p \equiv 3 (mod 4) .

k = 0 \sum (p - 1) /2 \frac{( \frac{1}{2} ) _{k}^{4}}{k ! ^{4}} \equiv a_{p} (mod p^{3}),

k = 0 \sum (p - 1) /2 \frac{( \frac{1}{2} ) _{k}^{4}}{k ! ^{4}} \equiv a_{p} (mod p^{3}),

η (2 z)^{4} η (4 z)^{4} := q n = 1 \prod \infty (1 - q^{2 n})^{4} (1 - q^{4 n})^{4}, q = e^{2 π i z} .

η (2 z)^{4} η (4 z)^{4} := q n = 1 \prod \infty (1 - q^{2 n})^{4} (1 - q^{4 n})^{4}, q = e^{2 π i z} .

k = 0 \sum (p - 1) /2 (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{6}}{k ! ^{6}} \equiv p k = 0 \sum (p - 1) /2 \frac{( \frac{1}{2} ) _{k}^{4}}{k ! ^{4}} (mod p^{4}) for p > 3,

k = 0 \sum (p - 1) /2 (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{6}}{k ! ^{6}} \equiv p k = 0 \sum (p - 1) /2 \frac{( \frac{1}{2} ) _{k}^{4}}{k ! ^{4}} (mod p^{4}) for p > 3,

k = 0 \sum (p - 1) /2 (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{6}}{k ! ^{6}} \equiv p a_{p} (mod p^{4}) for p > 3.

k = 0 \sum (p - 1) /2 (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{6}}{k ! ^{6}} \equiv p a_{p} (mod p^{4}) for p > 3.

(a; q)_{k} := \frac{( a ; q ) _{\infty}}{( a q ^{k} ; q ) _{\infty}}, where (a; q)_{\infty} = j ⩾ 0 \prod (1 - a q^{j}) .

(a; q)_{k} := \frac{( a ; q ) _{\infty}}{( a q ^{k} ; q ) _{\infty}}, where (a; q)_{\infty} = j ⩾ 0 \prod (1 - a q^{j}) .

(a_{1}, \dots, a_{m}; q)_{k} = (a_{1}; q)_{k} \dots (a_{m}; q)_{k}, k \in C \cup \infty.

(a_{1}, \dots, a_{m}; q)_{k} = (a_{1}; q)_{k} \dots (a_{m}; q)_{k}, k \in C \cup \infty.

[x k] = [x k]_{q} = ⎩ ⎨ ⎧ \frac{( q ^{x - k + 1} ; q ) _{k}}{( q ; q ) _{k}}, 0, if k ⩾ 0, otherwise.

[x k] = [x k]_{q} = ⎩ ⎨ ⎧ \frac{( q ^{x - k + 1} ; q ) _{k}}{( q ; q ) _{k}}, 0, if k ⩾ 0, otherwise.

(- 1)^{k} q^{k^{2}} [- \frac{1}{2} k]_{q^{2}} = \frac{( q ; q ^{2} ) _{k}}{( q ^{2} ; q ^{2} ) _{k}} = \frac{1}{( - q ; q ) _{k}^{2}} [2 k k] .

(- 1)^{k} q^{k^{2}} [- \frac{1}{2} k]_{q^{2}} = \frac{( q ; q ^{2} ) _{k}}{( q ^{2} ; q ^{2} ) _{k}} = \frac{1}{( - q ; q ) _{k}^{2}} [2 k k] .

_{r} ϕ_{s} [a_{1}, a_{2}, \dots, a_{r} b_{1}, \dots, b_{s}; q, z] := k = 0 \sum \infty \frac{( a _{1} , a _{2} , \dots , a _{r} ; q ) _{k}}{( q , b _{1} , \dots , b _{s} ; q ) _{k}} [(- 1)^{k} q^{(2 k)}]^{1 + s - r} z^{k},

_{r} ϕ_{s} [a_{1}, a_{2}, \dots, a_{r} b_{1}, \dots, b_{s}; q, z] := k = 0 \sum \infty \frac{( a _{1} , a _{2} , \dots , a _{r} ; q ) _{k}}{( q , b _{1} , \dots , b _{s} ; q ) _{k}} [(- 1)^{k} q^{(2 k)}]^{1 + s - r} z^{k},

{}_{8}\phi_{7}\!\left[\begin{array}[]{cccccccc}a,&qa^{\frac{1}{2}},&-qa^{\frac{1}{2}},&b,&c,&d,&e,&f\\ &a^{\frac{1}{2}},&-a^{\frac{1}{2}},&aq/b,&aq/c,&aq/d,&aq/e,&aq/f\end{array};q,\,\frac{a^{2}q^{2}}{bcdef}\right]

{}_{8}\phi_{7}\!\left[\begin{array}[]{cccccccc}a,&qa^{\frac{1}{2}},&-qa^{\frac{1}{2}},&b,&c,&d,&e,&f\\ &a^{\frac{1}{2}},&-a^{\frac{1}{2}},&aq/b,&aq/c,&aq/d,&aq/e,&aq/f\end{array};q,\,\frac{a^{2}q^{2}}{bcdef}\right]

\displaystyle\quad=\frac{(aq,aq/de,aq/df,aq/ef;q)_{\infty}}{(aq/d,aq/e,aq/f,aq/def;q)_{\infty}}\,{}_{4}\phi_{3}\!\left[\begin{array}[]{c}aq/bc,\ d,\ e,\ f\\ aq/b,\,aq/c,\,def/a\end{array};q,\,q\right],

k = 0 \sum \infty \frac{( - 1 ) ^{k} ( 1 - a q ^{2 k} ) ( a , b , c , d , e ; q ) _{k}}{( 1 - a ) ( q , a q / b , a q / c , a q / d , a q / e ; q ) _{k}} (\frac{a ^{2} q ^{2}}{b c d e})^{k} q^{(2 k)}

k = 0 \sum \infty \frac{( - 1 ) ^{k} ( 1 - a q ^{2 k} ) ( a , b , c , d , e ; q ) _{k}}{( 1 - a ) ( q , a q / b , a q / c , a q / d , a q / e ; q ) _{k}} (\frac{a ^{2} q ^{2}}{b c d e})^{k} q^{(2 k)}

\displaystyle\quad=\frac{(aq,aq/de;q)_{\infty}}{(aq/d,aq/e;q)_{\infty}}\,{}_{3}\phi_{2}\!\left[\begin{array}[]{c}aq/bc,\ d,\ e\\ aq/b,\,aq/c\end{array};q,\,\frac{aq}{de}\right].

Φ_{n} (q) := 1 ⩽ k ⩽ n g c d (n, k) = 1 \prod (q - ζ^{k}),

Φ_{n} (q) := 1 ⩽ k ⩽ n g c d (n, k) = 1 \prod (q - ζ^{k}),

d ∣ n, d > 1 \prod Φ_{d} (q) = [n],

d ∣ n, d > 1 \prod Φ_{d} (q) = [n],

k = 0 \sum n - 1 [4 k + 1] \frac{( q ; q ^{2} ) _{k}^{6}}{( q ^{2} ; q ^{2} ) _{k}^{6}} q^{k}

k = 0 \sum n - 1 [4 k + 1] \frac{( q ; q ^{2} ) _{k}^{6}}{( q ^{2} ; q ^{2} ) _{k}^{6}} q^{k}

k = 0 \sum (n - 1) /2 [4 k + 1] \frac{( q ; q ^{2} ) _{k}^{6}}{( q ^{2} ; q ^{2} ) _{k}^{6}} q^{k}

\sum_{k=0}^{(p-1)/2}\frac{(\frac{1}{2})_{k}^{3}}{k!^{3}}\equiv\begin{cases}-\displaystyle\Gamma_{p}\bigg{(}\frac{1}{4}\bigg{)}^{4}\pmod{p^{2}},&\text{if $p\equiv 1\pmod{4}$,}\\ 0\pmod{p^{2}},&\text{if $p\equiv 3\pmod{4}$.}\end{cases}

\sum_{k=0}^{(p-1)/2}\frac{(\frac{1}{2})_{k}^{3}}{k!^{3}}\equiv\begin{cases}-\displaystyle\Gamma_{p}\bigg{(}\frac{1}{4}\bigg{)}^{4}\pmod{p^{2}},&\text{if $p\equiv 1\pmod{4}$,}\\ 0\pmod{p^{2}},&\text{if $p\equiv 3\pmod{4}$.}\end{cases}

k = 0 \sum (p - 1) /2 \frac{( q ; q ^{2} ) _{k}^{2} ( q ^{2} ; q ^{4} ) _{k}}{( q ^{2} ; q ^{2} ) _{k}^{2} ( q ^{4} ; q ^{4} ) _{k}} q^{2 k}

k = 0 \sum (p - 1) /2 \frac{( q ; q ^{2} ) _{k}^{2} ( q ^{2} ; q ^{4} ) _{k}}{( q ^{2} ; q ^{2} ) _{k}^{2} ( q ^{4} ; q ^{4} ) _{k}} q^{2 k}

\equiv ⎩ ⎨ ⎧ [(p - 1) /2 (p - 1) /4]_{q^{4}}^{2} \frac{q ^{(p - 1) /2}}{( - q ^{2} ; q ^{2} ) _{(p - 1) /2}^{2}} (mod [p]^{2}), 0 (mod [p]^{2}), if p \equiv 1 (mod 4), if p \equiv 3 (mod 4) .

k = 0 \sum (p - 1) /2 (- 1)^{k} (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{5}}{k ! ^{5}} \equiv p k = 0 \sum (p - 1) /2 \frac{( \frac{1}{2} ) _{k}^{3}}{k ! ^{3}} (mod p^{3}),

k = 0 \sum (p - 1) /2 (- 1)^{k} (4 k + 1) \frac{( \frac{1}{2} ) _{k}^{5}}{k ! ^{5}} \equiv p k = 0 \sum (p - 1) /2 \frac{( \frac{1}{2} ) _{k}^{3}}{k ! ^{3}} (mod p^{3}),

k = 0 \sum n - 1 (- 1)^{k} [4 k + 1] \frac{( q ; q ^{2} ) _{k}^{5}}{( q ^{2} ; q ^{2} ) _{k}^{5}} q^{k^{2} + k}

k = 0 \sum n - 1 (- 1)^{k} [4 k + 1] \frac{( q ; q ^{2} ) _{k}^{5}}{( q ^{2} ; q ^{2} ) _{k}^{5}} q^{k^{2} + k}

k = 0 \sum (n - 1) /2 (- 1)^{k} [4 k + 1] \frac{( q ; q ^{2} ) _{k}^{5}}{( q ^{2} ; q ^{2} ) _{k}^{5}} q^{k^{2} + k}

\sum_{k=0}^{p-1}(6k+1)\frac{(\frac{1}{3})_{k}^{6}}{k!^{6}}\equiv\begin{cases}-p\displaystyle\Gamma_{p}\bigg{(}\frac{1}{3}\bigg{)}^{9}\pmod{p^{6}},&\text{if $p\equiv 1\pmod{6}$,}\\[10.0pt] -\frac{p^{4}}{27}\displaystyle\Gamma_{p}\bigg{(}\frac{1}{3}\bigg{)}^{9}\pmod{p^{6}},&\text{if $p\equiv 5\pmod{6}$.}\end{cases}

\sum_{k=0}^{p-1}(6k+1)\frac{(\frac{1}{3})_{k}^{6}}{k!^{6}}\equiv\begin{cases}-p\displaystyle\Gamma_{p}\bigg{(}\frac{1}{3}\bigg{)}^{9}\pmod{p^{6}},&\text{if $p\equiv 1\pmod{6}$,}\\[10.0pt] -\frac{p^{4}}{27}\displaystyle\Gamma_{p}\bigg{(}\frac{1}{3}\bigg{)}^{9}\pmod{p^{6}},&\text{if $p\equiv 5\pmod{6}$.}\end{cases}

k = 0 \sum n - 1 [6 k + 1] \frac{( q ; q ^{3} ) _{k}^{6}}{( q ^{3} ; q ^{3} ) _{k}^{6}} q^{3 k} \equiv ⎩ ⎨ ⎧ 0 (mod [n]), 0 (mod [n] Φ_{n} (q)), if n \equiv 1 (mod 3), if n \equiv 2 (mod 3) .

k = 0 \sum n - 1 [6 k + 1] \frac{( q ; q ^{3} ) _{k}^{6}}{( q ^{3} ; q ^{3} ) _{k}^{6}} q^{3 k} \equiv ⎩ ⎨ ⎧ 0 (mod [n]), 0 (mod [n] Φ_{n} (q)), if n \equiv 1 (mod 3), if n \equiv 2 (mod 3) .

k = 0 \sum n - 1 [2 d k + 1] \frac{( q ; q ^{d} ) _{k}^{4}}{( q ^{d} ; q ^{d} ) _{k}^{4}} q^{(d - 2) k} \equiv 0 (mod Φ_{n} (q)^{2}) .

k = 0 \sum n - 1 [2 d k + 1] \frac{( q ; q ^{d} ) _{k}^{4}}{( q ^{d} ; q ^{d} ) _{k}^{4}} q^{(d - 2) k} \equiv 0 (mod Φ_{n} (q)^{2}) .

\frac{( a q ; q ^{2} ) _{(n - 1) /2 - k}}{( q ^{2} / a ; q ^{2} ) _{(n - 1) /2 - k}} \equiv (- a)^{(n - 1) /2 - 2 k} \frac{( a q ; q ^{2} ) _{k}}{( q ^{2} / a ; q ^{2} ) _{k}} q^{(n - 1)^{2} /4 + k} (mod Φ_{n} (q)) .

\frac{( a q ; q ^{2} ) _{(n - 1) /2 - k}}{( q ^{2} / a ; q ^{2} ) _{(n - 1) /2 - k}} \equiv (- a)^{(n - 1) /2 - 2 k} \frac{( a q ; q ^{2} ) _{k}}{( q ^{2} / a ; q ^{2} ) _{k}} q^{(n - 1)^{2} /4 + k} (mod Φ_{n} (q)) .

\frac{( a q ; q ^{2} ) _{(n - 1) /2}}{( q ^{2} / a ; q ^{2} ) _{(n - 1) /2}}

\frac{( a q ; q ^{2} ) _{(n - 1) /2}}{( q ^{2} / a ; q ^{2} ) _{(n - 1) /2}}

\equiv \frac{( 1 - a q ) ( 1 - a q ^{3} ) \dots ( 1 - a q ^{n - 2} )}{( 1 - q ^{2 - n} / a ) ( 1 - q ^{4 - n} / a ) \dots ( 1 - q ^{- 1} / a )}

= (- a)^{(n - 1) /2} q^{(n - 1)^{2} /4} (mod Φ_{n} (q)) .

\frac{( a q ; q ^{2} ) _{(n - 1) /2 - k}}{( q ^{2} / a ; q ^{2} ) _{(n - 1) /2 - k}}

\frac{( a q ; q ^{2} ) _{(n - 1) /2 - k}}{( q ^{2} / a ; q ^{2} ) _{(n - 1) /2 - k}}

\equiv \frac{( a q ; q ^{2} ) _{(n - 1) /2}}{( q ^{2} / a ; q ^{2} ) _{(n - 1) /2}} \frac{( 1 - q ^{1 - 2 k} / a ) ( 1 - q ^{3 - 2 k} / a ) \dots ( 1 - q ^{- 1} / a )}{( 1 - a q ^{- 2 k} ) ( 1 - a q ^{2 - 2 k} ) \dots ( 1 - a q ^{- 2} )},

Peer Reviews

No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.

Videos

No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.

Full text

Some

$q$ -supercongruences from transformation formulas for basic hypergeometric series

Victor J. W. Guo

School of Mathematics and Statistics, Huaiyin Normal University, Huai’an 223300, Jiangsu, People’s Republic of China

[email protected]

and

Michael J. Schlosser

Fakultät für Mathematik, Universität Wien, Oskar-Morgenstern-Platz 1, A-1090 Vienna, Austria

[email protected]

Abstract.

Several new $q$ -supercongruences are obtained using transformation formulas for basic hypergeometric series, together with various techniques such as suitably combining terms, and creative microscoping, a method recently developed by the first author in collaboration with Zudilin. More concretely, the results in this paper include $q$ -analogues of supercongruences (referring to $p$ -adic identities remaining valid for some higher power of $p$ ) established by Long, by Long and Ramakrishna, and several other $q$ -supercongruences. The six basic hypergeometric transformation formulas which are made use of are Watson’s transformation, a quadratic transformation of Rahman, a cubic transformation of Gasper and Rahman, a quartic transformation of Gasper and Rahman, a double series transformation of Ismail, Rahman and Suslov, and a new transformation formula for a nonterminating very-well-poised ${}_{12}\phi_{11}$ series. Also, the nonterminating $q$ -Dixon summation formula is used. A special case of the new ${}_{12}\phi_{11}$ transformation formula is further utilized to obtain a generalization of Rogers’ linearization formula for the continuous $q$ -ultraspherical polynomials.

Key words and phrases:

basic hypergeometric series, supercongruences, identities, linearization

2010 Mathematics Subject Classification:

Primary 33D15; Secondary 11A07, 11F33, 33D45

The first author was partially supported by the National Natural Science Foundation of China (grant 11771175). The second author was partially supported by Austrian Science Fund grant P32305.

1. Introduction

Ramanujan, in his second letter to Hardy on February 27, 1913, mentioned the following identity

[TABLE]

where $\Gamma(x)$ is the Gamma function and where $(a)_{k}=a(a+1)\cdots(a+k-1)$ is the Pochhammer symbol. A $p$ -adic analogue of (1.1) was conjectured by Van Hamme [56, Eq. (A.2)] as follows:

[TABLE]

Here and throughout the paper, $p$ always denotes an odd prime and $\Gamma_{p}(x)$ is the $p$ -adic Gamma function. The congruence (1.2) was later proved by McCarthy and Osburn [44] through a combination of ordinary and Gaussian hypergeometric series. Recently, the congruence (1.2) for $p\equiv 3\pmod{4}$ and $p>3$ was further generalized by Liu [38] to the modulus $p^{4}$ case.

It is well known that some truncated hypergeometric series are closely related to Calabi-Yau threefolds over finite fields and are further relevant to the coefficients of modular forms. For example, using the fact that the Calabi-Yau threefold in question is modular, which was proved by Ahlgren and Ono [4], Kilbourn [35] succeeded in proving Van Hamme’s (M.2) supercongruence:

[TABLE]

where $a_{p}$ is the $p$ -th coefficient of a weight $4$ modular form

[TABLE]

Applying Whipple’s ${}_{7}F_{6}$ transformation formula, Long [41] proved that

[TABLE]

which in view of the supercongruence (1.3) can be written as

[TABLE]

The main aim of this paper is to give $q$ -analogues of some known supercongruences, including a partial $q$ -analogue of Long’s supercongruence (1.4) (partial in the sense that the modulo $p^{4}$ condition is replaced by the weaker condition modulo $p^{3}$ ). We provide such a result in Theorem 2.1 in the form of two transformations of truncated basic hypergeometric series. In addition, several other $q$ -supercongruences are given. These results are proved by special instances of transformation formulas for basic hypergeometric series. (See Theorem A.1 in the Appendix for a new basic hypergeometric transformation formula which we make use of.)

Throughout we assume $q$ to be fixed with $0<|q|<1$ . We refer to $q$ as the “base”. For $a,k\in\mathbb{C}$ , the $q$ -shifted factorial is defined by

[TABLE]

For brevity, we frequently use the shorthand notation

[TABLE]

Moreover, the $q$ -binomial coefficients $\begin{bmatrix}\begin{smallmatrix}x\\ k\end{smallmatrix}\end{bmatrix}$ are defined by

[TABLE]

It is easy to see that

[TABLE]

Following Gasper and Rahman [14], basic hypergeometric ${}_{r}\phi_{s}$ series with $r$ upper parameters $a_{1},\dots,a_{r}$ , $s$ lower parameters $b_{1},\dots,b_{s}$ , base $q$ and argument $z$ are defined by

[TABLE]

where $q\neq 0$ when $r>s+1$ . Such a series terminates if one of the upper parameters, say, $a_{r}$ , is of the form $q^{-n}$ , where $n$ is a nonnegative integer. If the series does not terminate, then it converges for $|z|<1$ .

In many of our proofs we will make use of Watson’s ${}_{8}\phi_{7}$ transformation formula [14, Appendix (III.17)]:

[TABLE]

which is valid whenever the ${}_{8}\phi_{7}$ series converges and the ${}_{4}\phi_{3}$ series terminates. In particular, we will also make use of the limiting case $f=q^{-n}\to\infty$ , which we state for convenience:

[TABLE]

Other transformations we make use of are a quadratic transformation formula of Rahman, stated in (6.5), a cubic transformation formula of Gasper and Rahman, stated in (7.3), a quartic transformation formula by Gasper and Rahman, stated in (8.3), a double series transformation by Ismail, Rahman and Suslov, stated in (11.3), and a new transformation formula for a nonterminating ${}_{12}\phi_{11}$ series into two multiples of nonterminating ${}_{4}\phi_{3}$ series, given as Theorem A.1 in the Appendix. We also make use of the $q$ -Dixon summation, stated in (10.1).

For further material on basic hypergeometric series and more generally, to special functions, we refer to the text books by Gasper and Rahman [14], and by Andrews, Askey and Roy [3], respectively. In particular, in our computations we implicitly make heavy use of elementary manipulations of $q$ -shifted factorials (see [14, Appendix I]).

Recall that the $q$ -integer is defined as $[n]=[n]_{q}=1+q+\cdots+q^{n-1}$ . Moreover, the $n$ -th cyclotomic polynomial $\Phi_{n}(q)$ is given by

[TABLE]

where $\zeta$ is an $n$ -th primitive root of unity. It is clear that $\Phi_{n}(q)$ is a polynomial in $q$ with integer coefficients. Further,

[TABLE]

in particular, $\Phi_{p}(q)=[p]$ for prime $p$ .

We say that two rational functions $A(q)$ and $B(q)$ in $q$ are congruent modulo a polynomial $P(q)$ , denoted by $A(q)\equiv B(q)\pmod{P(q)}$ , if the numerator of the reduced form of $A(q)-B(q)$ is divisible by $P(q)$ in the polynomial ring $\mathbb{Z}[q]$ . We refer the reader to [1, 8, 17, 18, 19, 20, 21, 22, 23, 24, 25, 28, 37, 40, 46, 50, 54, 55, 58, 59] for some interesting $q$ -congruences.

2. The main results

The following is our $q$ -analogue of (1.4), where the modulo $p^{4}$ condition is replaced by the weaker condition modulo $p^{3}$ .

Theorem 2.1.

Let $n$ be a positive odd integer. Then

[TABLE]

Noticing that the terms corresponding to $k$ in the upper half range $(n-1)/2<k\leqslant n-1$ are congruent to [math] modulo $\Phi_{n}(q)^{3}$ but not modulo $[n]\Phi_{n}(q)^{2}$ in general, we conclude that (2.1a) and (2.1b) are in fact different congruences. Of course, when $n=p$ is an odd prime and $q=1$ , they are both equivalent to (1.4) modulo $p^{3}$ . The proof of Theorem 2.1 is deferred to Section 3.

Van Hamme [56, Eq. (H.2)] proved the following supercongruence:

[TABLE]

The first author and Zeng [28, Cor. 1.2] gave a $q$ -analogue of (2.2) as follows:

[TABLE]

We do not know any $q$ -analogue of (1.2). However, we are able to provide a $q$ -analogue of a very closely related identity. In particular, since $\Gamma_{p}(\frac{1}{4})^{4}\Gamma_{p}(\frac{3}{4})^{4}=1$ , from (1.2) and (2.2) we deduce that

[TABLE]

which was already noticed by Mortenson [45]. We are able to give the following complete $q$ -analogue of (2.3).

Theorem 2.2.

Let $n$ be a positive odd integer. Then

[TABLE]

Note that, just like in Theorem 2.1, the two congruences (2.4a) and (2.4b) are not equivalent. The proof of Theorem 2.2 is deferred to Section 3.

Long and Ramakrishna [42, Thm. 2] proved the following supercongruence:

[TABLE]

This result is stronger than Van Hamme’s (D.2) supercongruence conjecture which asserts a congruence modulo $p^{4}$ for $p\equiv 1\pmod{6}$ . Long and Ramakrishna also pointed out that (2.5) does not hold modulo $p^{7}$ in general.

We propose the following partial $q$ -analogue of Long and Ramakrishna’s supercongruence (2.5).

Theorem 2.3.

Let $n$ be a positive integer coprime with $3$ . Then

[TABLE]

We also partially confirm the $a=1$ case of the second congruence in [29, Conj. 5.2].

Theorem 2.4.

Let $d$ and $n$ be positive integers with $d>2$ and $n\equiv-1\pmod{d}$ . Then

[TABLE]

The proofs of Theorems 2.3 and 2.4 are deferred to Section 4.

In Section 3, we shall prove Theorems 2.1 and 2.2 using the creative microscoping method developed by the first author and Zudilin [29]. Roughly speaking, to prove a $q$ -supercongruence modulo $\Phi_{n}(q)^{3}$ , we prove its generalization with an extra parameter $a$ so that the corresponding congruence holds modulo $\Phi_{n}(q)(1-aq^{n})(a-q^{n})$ . Since the polynomials $\Phi_{n}(q)$ , $1-aq^{n}$ , and $a-q^{n}$ are relatively prime, this generalized $q$ -congruence can be established modulo these three polynomials individually. Finally, by taking the limit $a\to 1$ , we obtain the original $q$ -supercongruence of interest. We learned that this creative microscoping method has already caught the interests of Guillera [15] and Straub [51].

Further, we introduce a new idea for proving some congruences modulo $\Phi_{n}(q)$ . In many instances in this paper, the congruences $\sum_{k=0}^{(n-1)/2}a_{n,k}\equiv 0\pmod{\Phi_{n}(q)}$ are proved by simply showing $a_{k}+a_{(n-1)/2-k}\equiv 0\pmod{\Phi_{n}(q)}$ (instead of, say, evaluating certain infinite series at roots of unity which was illustrated in [29]).

The proofs of Theorems 2.3 and 2.4 in Section 4 again are done by showing a more general identity but otherwise are accomplished in a slightly different way. All the proofs of Theorems 2.1–2.4 in Sections 3 and 4, and of the further results from Section 5, are based on Watson’s ${}_{8}\phi_{7}$ transformation formula. We also confirm a three-parametric $q$ -congruence conjecture in Section 6 based on a quadratic transformation formula of Rahman. Further, in Section 7 we deduce some $q$ -congruences from a cubic transformation formula of Gasper and Rahman. Similarly, in Section 8 we deduce some $q$ -congruences from a quartic transformation formula of Gasper and Rahman. The $q$ -supercongruences in Section 9 are proved similarly but are derived using a new ${}_{12}\phi_{11}$ transformation formula. Since the latter formula is of independent interest, its derivation is given in the Appendix. It is also shown there how a special case of the ${}_{12}\phi_{11}$ transformation formula can be utilized to obtain a generalization of Rogers’ linearization formula for the continuous $q$ -ultraspherical polynomials. In Section 10 some $q$ -supercongruences are deduced from the $q$ -Dixon summation. In Section 11 we deduce $q$ -super congruences –most of them only conjectural– from a double series transformation of Ismail, Rahman and Suslov. Finally, in Section 12, some concluding remarks are given and some related conjectures for further study are proposed. For example, we conjecture that the congruence (2.6) still holds modulo $[n]\Phi_{n}(q)^{3}$ for $n\equiv 2\pmod{3}$ .

3. Proofs of Theorems 2.1 and

2.2

We first give the following lemma.

Lemma 3.1.

Let $n$ be a positive odd integer. Then, for $0\leqslant k\leqslant(n-1)/2$ , we have

[TABLE]

Proof.

Since $q^{n}\equiv 1\pmod{\Phi_{n}(q)}$ , we have

[TABLE]

Further, modulo $\Phi_{n}(q)$ , we have

[TABLE]

which in combination with (3) establishes the assertion. ∎

We now use the above lemma to prove the following result which was originally conjectured by the first author and Zudilin [29, Conj. 5.6].

Theorem 3.2.

Let $n\equiv 3\pmod{4}$ be a positive integer. Then

[TABLE]

Proof.

By Lemma 3.1, we have

[TABLE]

Noticing that $q^{n}\equiv 1\pmod{\Phi_{n}(q)}$ and, for odd $n$ , $\Phi_{n}(q^{2})=\Phi_{n}(q)\Phi_{n}(-q)$ , we get

[TABLE]

for any positive integer $n$ with $n\equiv 3\pmod{4}$ and $0\leqslant k\leqslant(n-1)/2$ . This completes the proof of the theorem. ∎

Similarly, we can prove that the third $q$ -congruence in [29, Conj. 5.2] is true modulo $\Phi_{n}(q)$ and is therefore further true modulo $[n]$ (again as in the proof of Theorem 2.1).

We shall establish the following two-parameter generalization of Theorem 2.1.

Theorem 3.3.

Let $n$ be a positive odd integer. Then, modulo $\Phi_{n}(q)(1-aq^{n})(a-q^{n})$ ,

[TABLE]

Proof.

For $a=q^{-n}$ or $a=q^{n}$ , the left-hand side of (3.2) is equal to

[TABLE]

By Watson’s ${}_{8}\phi_{7}$ transformation formula (1.12), we can rewrite the right-hand side of (3.5) as

[TABLE]

It is easy to see that the fraction before the sum on the right-hand side of (3.9) is equal to $[n]q^{(1-n)/2}$ . This proves that the congruence (3.2) holds modulo $1-aq^{n}$ or $a-q^{n}$ .

Moreover, by Lemma 3.1, it is easy to see that, modulo $\Phi_{n}(q)$ , the $k$ -th and $((n-1)/2-k)$ -th terms on the left-hand side of (3.2) cancel each other, i.e.,

[TABLE]

When the left-hand side of (3.2) has an odd number of factors, the central term will remain. This happens when $n=4l+1$ for some positive integer $l$ , and in this case the central term has index $k=l$ and one directly sees that $[4k+1]=[n]$ is a factor of the summand. In total, this proves that the left-hand side of (3.2) is congruent to [math] modulo $\Phi_{n}(q)$ , and therefore the congruence (3.2) also holds modulo $\Phi_{n}(q)$ . Since $\Phi_{n}(q)$ , $1-aq^{n}$ and $a-q^{n}$ are relatively prime polynomials, the proof of (3.2) is complete. ∎

Proof of Theorem 2.1.

The limits of the denominators on both sides of (3.2) as $a\to 1$ are relatively prime to $\Phi_{n}(q)$ , since $0\leqslant k\leqslant(n-1)/2$ . On the other hand, the limit of $(1-aq^{n})(a-q^{n})$ as $a\to 1$ has the factor $\Phi_{n}(q)^{2}$ . Thus, the limiting case $a,b\to 1$ of (3.2) gives the following congruence

[TABLE]

which also implies that

[TABLE]

since $(q;q^{2})_{k}^{6}/(q^{2};q^{2})_{k}^{6}\equiv 0\pmod{\Phi_{n}(q)^{3}}$ for $k$ in the range $(n-1)/2<k\leqslant n-1$ . It remains to show that the above two congruences are still true modulo $[n]$ , or equivalently,

[TABLE]

For $n>1$ , let $\zeta\neq 1$ be an $n$ -th root of unity, not necessarily primitive. That is, $\zeta$ is a primitive root of unity of odd degree $d\mid n$ . Let $c_{q}(k)$ denote the $k$ -th term on the left-hand side of the congruences in (3.12), i.e.,

[TABLE]

The congruences (3.10) and (3.11) with $n=d$ imply that

[TABLE]

Observe that

[TABLE]

We have

[TABLE]

and

[TABLE]

which means that the sums $\sum_{k=0}^{n-1}c_{q}(k)$ and $\sum_{k=0}^{(n-1)/2}c_{q}(k)$ are both divisible by the cyclotomic polynomial $\Phi_{d}(q)$ . Since this is true for any divisor $d>1$ of $n$ , we conclude that they are divisible by

[TABLE]

thus establishing (3.12). ∎

Proof of Theorem 2.2.

Similarly as in the proof of Theorem 2.1, letting $a\to 1$ and $b\to\infty$ in (3.2), we obtain

[TABLE]

which also implies that

[TABLE]

Along the same lines as in the proof of Theorem 2.1, we can show that

[TABLE]

Combining the above congruences, we are led to (2.4a) and (2.4b). ∎

4. Proofs of Theorems 2.3 and

2.4

We shall prove the following common generalization of Theorems 2.3 and 2.4.

Theorem 4.1.

Let $n$ and $d$ be positive integers with $d\geqslant 3$ and $\gcd(n,d)=1$ . Then

[TABLE]

Proof.

Let $\alpha$ and $j$ be integers. Since

[TABLE]

and $1-q^{\alpha n}\equiv 0\pmod{\Phi_{n}(q)}$ , we obtain

[TABLE]

It follows that

[TABLE]

Similarly, we have

[TABLE]

Since $\gcd(n,d)=1$ , we know that there exists a positive integer $\alpha<d$ such that $\alpha n\equiv 1\pmod{d}$ . Then by [14, Appendix (III.18)] (i.e., (1.12) with $f=q^{-\alpha n}$ ), modulo $\Phi_{n}(q)^{2}$ , the left-hand side of (4.1) is congruent to

[TABLE]

It is clear that $(q^{d+1};q^{d})_{(\alpha n-1)/d}$ in the numerator has the factor $1-q^{\alpha n}$ and is therefore divisible by $\Phi_{n}(q)$ , while the denominator is coprime with $\Phi_{n}(q)$ . This proves (4.1) for the second case.

Furthermore, if $n\equiv-1\pmod{d}$ , then, modulo $\Phi_{n}(q)^{2}$ , the left-hand side of (4.1) is congruent to

[TABLE]

It is easy to see that this time the numerator has the factor $(1-q^{(d-1)n})(1-q^{(2-d)n})$ and is therefore divisible by $\Phi_{n}(q)^{2}$ , and again the denominator is coprime with $\Phi_{n}(q)$ . This proves (4.1) for the first case. ∎

Letting $a=1$ and $d=3$ in (4.1), we get

[TABLE]

Similarly as in the proof of Theorem 2.1, we can prove that

[TABLE]

This completes the proof of (2.6).

Likewise, taking $a\to 0$ in (4.1), we obtain

[TABLE]

This completes the proof of (2.7).

It appears that the following generalization with one more parameter $b$ is still true.

Conjecture 4.2.

Let $n$ and $d$ be positive integers with $d\geqslant 3$ and $\gcd(n,d)=1$ . Then

[TABLE]

5. More $q$ -congruences from Watson’s transformation

Throughout this section, $m$ always stands for $n-1$ or $(n+1)/2$ . Note that the special case of [29, Thm. 4.9] with $r=-1$ , $d=2$ and $a=1$ gives

[TABLE]

In this section, we shall give some similar congruences.

Theorem 5.1.

Let $n>1$ be a positive odd integer. Then

[TABLE]

Proof.

We first establish the following result:

[TABLE]

For $a=q^{-n}$ or $a=q^{n}$ , the left-hand side of (5.2) is equal to

[TABLE]

By the limiting case of Watson’s transformation formula (1.15), we can rewrite the right-hand side of (5.3) as

[TABLE]

It is easy to see that

[TABLE]

This proves that the congruence (5.2) holds modulo $(1-aq^{n})(a-q^{n})$ .

On the other hand, by Lemma 3.1, for $0\leqslant k\leqslant(n+1)/2$ , we have

[TABLE]

It follows that the $k$ -th and $((n+1)/2-k)$ -th terms on the left-hand side of (5.2) cancel each other modulo $\Phi_{n}(q)$ . When the respective sum has an odd number of factors, the central term will remain. This happens when $n=4l-1$ for some positive integer $l$ , and in this case the central term has index $k=l$ and one directly sees that $[4k-1]=[n]$ is a factor of the summand. In total, this proves that the congruence (5.2) also holds modulo $\Phi_{n}(q)$ . Since the polynomials $\Phi_{n}(q)$ , $1-aq^{n}$ and $a-q^{n}$ are coprime with one another, the proof of (5.2) is complete.

Letting $a\to 1$ in (5.2), one sees that the congruence (5.1) holds modulo $\Phi_{n}(q)^{3}$ by noticing that $(q^{-1};q^{2})_{5}^{k}/(q^{2};q^{2})_{k}^{5}\equiv 0\pmod{\Phi_{n}(q)^{3}}$ for $(n+1)/2<k\leqslant n-1$ . Along the same lines of the proof of Theorem 2.1, we can prove that

[TABLE]

i.e., that the congruence (5.1) holds modulo $[n]$ . Since $\operatorname{lcm}(\Phi_{n}(q)^{3},[n])=[n]\Phi_{n}(q)^{2}$ , the proof of the theorem is complete. ∎

Corollary 5.2.

We have

[TABLE]

Theorem 5.3.

Let $n>1$ be a positive odd integer. Then

[TABLE]

Proof.

We first establish the following congruence:

[TABLE]

Letting $q\mapsto q^{2}$ and $c\to 0$ followed by $a=b=q^{-1}$ , $d=q^{-1-n}$ and $e=q^{-1+n}$ in the limiting case of Watson’s transformation formula (1.15), we obtain

[TABLE]

By the $q$ -Chu-Vandermonde summation formula [14, Appendix (II.6)], for odd $n>1$ , we have

[TABLE]

Letting $q\mapsto q^{-1}$ in the above equality, we see that the summation on the right-hand side of (5.7) is equal to [math]. This proves that the congruence (5.6) holds modulo $(1-aq^{n})(a-q^{n})$ .

On the other hand, similarly as before, by (5.4) one sees that the sum of the $k$ -th and $((n+1)/2-k)$ -th terms on the left-hand side of (5.6) are congruent to [math] modulo $\Phi_{n}(q)$ (and also, when the respective sum has an odd number of factors, i.e., when $n=4l-1$ for some positive integer $l$ , then the remaining central term has index $k=l$ and one directly sees that $[4k-1]=[n]$ is a factor of the summand). This thus proves that the congruence (5.6) is also true modulo $\Phi_{n}(q)$ . This completes the proof of (5.6).

Let $c_{q}(k)$ denote the $k$ -th term on the left-hand side of (5.6). In the same vein as in the proof of Theorem 2.1, we can further prove that

[TABLE]

Thus, we have proved that

[TABLE]

The parts of the denominators in (5.10) which contain the parameter $a$ are the factors of $(aq^{2},q^{2}/a;q^{2})_{(n+1)/2}$ or $(aq^{2},q^{2}/a;q^{2})_{n-1}$ . Their limits as $a\to 1$ are relatively prime to $\Phi_{n}(q)$ . On the other hand, the limit of $(1-aq^{n})(a-q^{n})$ as $a\to 1$ has the factor $\Phi_{n}(q)^{2}$ . Therefore, the limiting case $a\to 1$ of the congruence (5.10) reduces to (5.5) modulo $\Phi_{n}(q)^{3}$ . But the congruences (5.9) are still true when $a=1$ which implies that the congruence (5.5) holds modulo $[n]$ . This completes the proof of the theorem. ∎

It appears that the congruence conditions stated in Theorem 5.3 and its extension in (5.6) can be strengthened:

Conjecture 5.4.

Let $n>1$ be a positive odd integer. Then

[TABLE]

Theorem 5.5.

Let $n>3$ be a positive odd integer. Then

[TABLE]

Proof.

The proof is similar to that of Theorem 5.3. We first establish

[TABLE]

for odd $n>1$ . Letting $q\mapsto q^{2}$ and $c\to 0$ followed by $a=b=q$ , $d=q^{-1-n}$ and $e=q^{-1+n}$ in (1.15), we obtain

[TABLE]

As we have already mentioned in the proof of Theorem 5.3, the summation on the right-hand side of (5.13) is equal to [math] by the $q\mapsto q^{-1}$ case of (5.8). Thus, we have proved that the congruence (5.12) holds modulo $(1-aq^{n})(a-q^{n})$ .

On the other hand, similarly as before, by (5.4) one sees that the sum of the $k$ -th and $((n-1)/2-k)$ -th terms on the left-hand side of (5.12) are congruent to [math] modulo $\Phi_{n}(q)$ for $0\leqslant k\leqslant(n-1)/2$ . Moreover, the summand for $k=(n+1)/2$ on the right-hand side of (5.13) is clearly congruent to [math] modulo $\Phi_{n}(q)$ because of the factor $(q;q^{2})_{(n+1)/2}$ in the numerator. This proves that the congruence (5.12) is also true modulo $\Phi_{n}(q)$ . The proof of (5.12) is completed.

For $n>3$ , we have $(n+3)/2<n$ and so the denominator of the left-hand side of (5.12) is relatively prime to $\Phi_{n}(q)$ when taking the limit as $a\to 1$ . Therefore, the congruence (5.11) holds modulo $\Phi_{n}(q)^{3}$ for $n>3$ by taking $a\to 1$ in (5.12). On the other hand, it is also easy to see that the congruence (5.11) holds modulo $\Phi_{3}(q)$ for $n=3$ . Let $c_{q}(k)$ denote the $k$ -th term on the left-hand side of (5.12). Similarly to the proof of Theorem 2.1, we can further prove that

[TABLE]

This proves (5.11). ∎

We conjecture that the following generalization of (5.12) and Theorem 5.5 is still true.

Conjecture 5.6.

Let $n>3$ be a positive odd integer. Then

[TABLE]

Analogously, letting $q\mapsto q^{2}$ and $c\to 0$ followed by $a=q$ , $b=q^{-1}$ , $d=q^{-1-n}$ and $e=q^{-1+n}$ in (1.15), we can prove the following result:

[TABLE]

We label the limiting case $a\to 1$ as the following theorem.

Theorem 5.7.

Let $n>3$ be a positive odd integer. Then

[TABLE]

Moreover, if $\gcd(n,3)=1$ , then the above congruence holds modulo $[n]\Phi_{n}(q)^{2}$ .

It seems that the following generalization of (5.14) and (5.15) still holds.

Conjecture 5.8.

Let $n>3$ be a positive odd integer. Then

[TABLE]

We also have the following similar result.

Theorem 5.9.

Let $n>1$ be a positive odd integer. Then

[TABLE]

Proof.

It is easy to see by induction on $N$ that

[TABLE]

Putting $N=(n-1)/2$ in the above identity and using (1.6), we get

[TABLE]

The proof then follows from the fact that $\gcd([n],[n+1])=1$ and $\gcd([n],(-q;q)_{N})=1$ (for odd $n$ ). ∎

Let $n=p$ and $q=1$ in (5.17). Using Fermat’s little theorem, we immediately obtain the following conclusion.

Corollary 5.10.

We have

[TABLE]

We end this section with the following conjecture, which is similar to Conjecture 4.2. Similarly as in the proof of Theorem 4.1, we can confirm it for $b=1$ .

Conjecture 5.11.

Let $n$ and $d$ be positive integers with $d\geqslant 3$ and $\gcd(n,d)=1$ . Then

[TABLE]

6. Proof of a three-parametric $q$ -congruence from

a quadratic transformation of Rahman

In this section, we confirm a three-parametric $q$ -congruence conjecture of the first author and Zudilin [29, Conj. 4.6].

Theorem 6.1.

Let $n$ be a positive odd integer. Then, modulo $[n](1-aq^{n})(a-q^{n})$ ,

[TABLE]

where $M=n-1$ or $(n-1)/2$ .

The congruence (6.1) modulo $(1-aq^{n})(a-q^{n})$ has already been proved by the first author and Zudilin [29, Thm. 4.7]. Moreover, the congruence (6.1) with $c=1$ was established in [29, Thm. 4.8]. Therefore, it remains to be proven that (6.1) holds modulo $[n]$ , i.e.,

[TABLE]

Proof.

We need to use a quadratic transformation formula of Rahman [48] (see also [14, Eq. (3.8.13)]):

[TABLE]

provided $d$ or $aq/d$ is not of the form $q^{-2n}$ , $n$ a non-negative integer. It is clear that (6.2) is true for $n=1$ . We now suppose that $n>1$ . Let $a=q^{1-n}$ in (6.5) and then we further set $d=aq$ and replace $b$ and $c$ with $q/b$ and $q/c$ , respectively. Then the left-hand side of (6.5) terminates at $k=(n-1)/2$ , and the right-side of (6.5) vanishes because the numerator contains the factor $(q^{3-n};q^{2})_{\infty}$ . Namely, we have

[TABLE]

Since $q^{n}\equiv 1\pmod{\Phi_{n}(q)}$ , we immediately get

[TABLE]

Finally, the proof of (6.2) is completely analogous to that of Theorem 2.1 (more precisely, to the proofs of (3.12a) and (3.12b)). ∎

Letting $a,b\to 1$ and $c\to 0$ in (6.1), we obtain

[TABLE]

(see also [22]), while letting $a,b\to 1$ and $c\to-1$ in (6.1), we get

[TABLE]

It is easy to see that both (6.6) and (6.7) are $q$ -analogues of the following supercongruence:

[TABLE]

where $M=p-1$ or $M=(p-1)/2$ . The congruence (6.8) with $M=(p-1)/2$ was first proved by Guillera and Zudilin [16] using the WZ (Wilf–Zeilberger) method. For $M=p-1$ , Hu [31] proved an even stronger congruence, namely

[TABLE]

Also the $M=(p-1)/2$ case of (6.8) can be extended to a congruence modulo $p^{4}$ , namely

[TABLE]

where $E_{p-3}$ is the $(p-3)$ -th Euler number, which was conjectured by Sun [52, Conj. 5.1(ii)] and recently proved by Mao and Zhang [43].

Here we would like to propose a supercongruence similar to (6.8).

Conjecture 6.2.

We have

[TABLE]

Unfortunately, we were not able to find any $q$ -analogue of (6.11), even for the simple case modulo $p$ .

Moreover, letting $a\to 1$ , $b\to-1$ and $c\to 0$ in (6.1), we get

[TABLE]

while letting $a\to 1$ and $b,c\to 0$ in (6.1), we arrive at

[TABLE]

It is worth mentioning that both (6.12) and (6.13) are $q$ -analogues of the following supercongruence due to Guillera and Zudilin [16]:

[TABLE]

The congruence (6.13) with $M=n-1$ was first established by the first author [22] using the $q$ -WZ method. The congruence (6.12) is new.

Sun [52, Conj. 5.1(ii)] conjectured that

[TABLE]

(where $E_{p-3}$ is again the $(p-3)$ -th Euler number), for any prime $p>3$ , which was confirmed by Chen, Xie and He [9].

Motivated by Conjecture 6.2, (6.10) and (6.15), we would like to raise the following problems.

Problem 6.3.

Is there a “ $3k-1$ version” of the supercongruence (6.14)?

Problem 6.4.

Are there any $q$ -analogues of hypergeometric supercongruences involving Euler numbers as in (6.10) or (6.15)?

7. Some $q$ -congruences from a cubic transformation

of Gasper and Rahman

Gasper and Rahman [13] (see also [14, Eq. (3.8.18)]) obtained the following cubic transformation:

[TABLE]

This transformation for $d=0$ becomes a summation formula and has been used by the first author and Zudilin [29] to prove the following $q$ -congruence: modulo $[n](1-aq^{n})(a-q^{n})$ ,

[TABLE]

where $M=n-1$ or $(n-1)/2$ , $\big{(}\frac{\cdot}{\cdot}\big{)}$ is the Jacobi–Kronecker symbol, and $\gcd(n,6)=1$ .

In this section, we shall deduce some $q$ -congruences from (7.3) with $d\neq 0$ .

Theorem 7.1.

Let $n>1$ be a positive integer coprime with $6$ . Then

[TABLE]

Proof.

We specialize (7.3) by taking $q\mapsto q^{2}$ , then $c=q^{1-n}/a$ , $d=q$ , and replace $a$ by $aq$ . The right-hand side of the resulting identity vanishes, because the numerator of the first fraction contains the factors $(q^{5-n};q^{6})_{\infty}$ and $(q^{7-n};q^{6})_{\infty}$ , and the numerator of the second fraction has the factor $(q^{3-n};q^{2})_{\infty}$ . At the same time, the left-hand side terminates at $k=(n-1)/2$ (in fact, much earlier, at $k=\lfloor n/4\rfloor$ ), for the summand involves the term $(q^{1-n};q^{2})_{2k}$ . This proves that

[TABLE]

Since $q^{n}\equiv 1\pmod{\Phi_{n}(q)}$ , we deduce that the congruence (7.5) holds modulo $\Phi_{n}(q)$ .

We now assume that $n\equiv 5\pmod{6}$ . It remains to show that

[TABLE]

or equivalently,

[TABLE]

This identity again follows straightforwardly from (7.3) by setting $q\mapsto q^{2}$ , $a=q^{1-n}$ , $c=q^{n}$ , and $d=q$ . In fact, the left-hand side of the resulting identity terminates at $k=(n-1)/2$ and is therefore just the left-hand side of (7.6). On the other hand, the right-hand side of the resulting identity vanishes because the first fraction is equal to

[TABLE]

and the second fraction is equal to

[TABLE]

This completes the proof of the theorem. ∎

Similarly as in the proof of Theorem 7.1, we can prove the following result.

Theorem 7.2.

Let $n>1$ be a positive integer coprime with $6$ . Then

[TABLE]

Letting $a\to 1$ in Theorems 7.1 and 7.2, we obtain

Corollary 7.3.

Let $n>1$ be a positive integer coprime with $6$ . Then

[TABLE]

and

[TABLE]

We shall also prove the following results.

Theorem 7.4.

Let $n$ be a positive integer coprime with $6$ . Then

[TABLE]

where $M=n-1$ or $(n-1)/2$ .

Proof.

It is easy to see by induction on $N$ that

[TABLE]

Note that $\frac{1}{[N+1]}\begin{bmatrix}\begin{smallmatrix}2N\\ N\end{smallmatrix}\end{bmatrix}$ is the well-known $q$ -Catalan number (see [10]), a polynomial in $q$ . Hence, the $q$ -binomial coefficient $\begin{bmatrix}\begin{smallmatrix}2N\\ N\end{smallmatrix}\end{bmatrix}$ is divisible by $[N+1]$ , so is $\begin{bmatrix}\begin{smallmatrix}2N\\ N\end{smallmatrix}\end{bmatrix}_{q^{3}}$ if $N+1$ is coprime with $3$ . It is also not difficult to prove that $\begin{bmatrix}\begin{smallmatrix}4N\\ 2N\end{smallmatrix}\end{bmatrix}$ is divisible by $[N+1]$ whenever $N+1$ is coprime with $6$ . Therefore, putting $N=n-1$ in (7.9), we can prove that the right-hand side is congruent to [math] modulo $[n]^{2}$ . Similarly, taking $N=(n-1)/2$ in (7.9), we arrive at the same conclusion. This time one $[n]$ comes from $[2N+1]$ and another $[n]$ comes from $\begin{bmatrix}\begin{smallmatrix}4N\\ 2N\end{smallmatrix}\end{bmatrix}$ . ∎

8. Some $q$ -congruences from a quartic transformation

of Gasper and Rahman

Gasper and Rahman [13] (see also [14, Ex. 3.33]) also obtained the following quartic transformation:

[TABLE]

In this section, we shall deduce two congruences from the quartic transformation (8.3).

Theorem 8.1.

Let $n$ be a positive integer with $n\equiv 5,7\pmod{8}$ . Then

[TABLE]

Proof.

Replacing $q$ by $q^{2}$ , $a$ by $q^{1-n}$ and $b$ by $q^{2-n}$ in (8.3), we see that the left-hand side terminates at $k=(n-1)/2$ , while the right-hand side vanishes. (Note that we cannot make such a replacement if $n\equiv 1,3\pmod{8}$ .) Namely, we have

[TABLE]

Since $q^{n}\equiv 1\pmod{\Phi_{n}(q)}$ , we immediately obtain (8.4) from the above identity. ∎

It is not difficult to see that the congruence (8.4) can also be derived from the following quartic summation formula of Gasper [12] (see also [14, Ex. 3.30]):

[TABLE]

Theorem 8.2.

Let $n$ be a positive integer with $n\equiv 5,7\pmod{8}$ . Then

[TABLE]

Proof.

Replacing $q$ by $q^{2}$ , $a$ by $q^{1-n}$ and $b$ by $q^{3}$ in (8.3), we see that the left-hand side again terminates at $k=(n-1)/2$ , while the right-hand side vanishes. That is,

[TABLE]

The proof of (8.5) then follows from the above identity and the fact $q^{n}\equiv 1\pmod{\Phi_{n}(q)}$ . ∎

We have the following two related conjectures.

Conjecture 8.3.

The congruence (8.4) is still true modulo $\Phi_{n}(q)^{2}$ for $n\equiv 5\pmod{8}$ . In particular, if $p\equiv 5\pmod{8}$ , then

[TABLE]

Conjecture 8.4.

The congruence (8.5) is still true modulo $\Phi_{n}(q)^{3}$ . In particular, if $p\equiv 5,7\pmod{8}$ , then

[TABLE]

9. Some $q$ -congruences from a new

${}_{12}\phi_{11}$ transformation

In this section, we shall deduce some $q$ -congruences from Theorem A.1, a new ${}_{12}\phi_{11}$ transformation formula, whose proof we give in the appendix. Although all of the $q$ -congruences are modulo $\Phi_{n}(q)$ , the $q=1$ cases sometimes can be generalized to supercongruences modulo higher powers (see Conjectures 12.6 and 12.7 in the next section).

Theorem 9.1.

Let $n\equiv 1\pmod{3}$ be a positive integer and $n>1$ . Then

[TABLE]

Proof.

Replacing $q\mapsto q^{3}$ and then letting $a=q^{1-n}$ , $b=c=d=q$ in (A.1), we obtain

[TABLE]

because the right-hand side of (A.1) contains the factor $(q^{1-n};q^{3})_{\infty}$ , which vanishes for $n\equiv 1\pmod{3}$ . Since $q^{n}\equiv 1\pmod{\Phi_{n}(q)}$ , we immediately deduce (9.1a) from (9.2) .

Similarly, if we change $c=q$ to $c\to 0$ in the above procedure, then we can prove (9.1b), while if we change $c=d=q$ to $c,d\to 0$ then we are led to (9.1c). ∎

Theorem 9.2.

Let $n\equiv 2\pmod{3}$ be a positive integer and $n>2$ . Then

[TABLE]

Proof.

Replacing $q\mapsto q^{3}$ and then letting $a=q^{-1-n}$ , $b=c=d=q^{-1}$ in (A.1), we obtain

[TABLE]

because the right-hand side of (A.1) contains the factor $(q^{2-n};q^{3})_{\infty}$ , which vanishes for $n\equiv 2\pmod{3}$ . It is easy to see that the denominator of (9.4) is relatively prime to $\Phi_{n}(q)$ for $n>2$ . Therefore, applying $q^{n}\equiv 1\pmod{\Phi_{n}(q)}$ , we obtain the desired congruence in (9.3a). Similarly (see the proof of (9.1b) and (9.1c)), we can prove (9.3b) and (9.3c). ∎

10. Some other $q$ -congruences from the

$q$ -Dixon sum

By using the $q$ -Dixon sum [14, Eq. (II.13)]:

[TABLE]

the first author and Zudilin [29, Thm. 4.12] proved the following result.

[TABLE]

in particular,

[TABLE]

They [29, Conj. 4.13] also conjectured that the congruence (10.3) still holds modulo $\Phi_{n}(q)^{2}\Phi_{n}(-q)$ .

In this section, we shall give further similar congruences from the $q$ -Dixon sum.

Theorem 10.1.

Let $n\equiv 1\pmod{4}$ be a positive integer. Then

[TABLE]

in particular,

[TABLE]

Proof.

Letting $q\mapsto q^{4}$ , $a\mapsto a^{2}/q^{2}$ , $b\mapsto b/q^{2}$ and $c\mapsto c/q^{2}$ in (10.1), we get

[TABLE]

Since $n\equiv 1\pmod{4}$ , putting $a=\pm q^{-n}$ in (10.6) we see that the left-hand side terminates at $k=(n+1)/2$ , while the right-hand side vanishes. This proves (10.4). For $n>1$ , taking the limit as $a,b,c\to 1$ in (10.4) we are led to (10.5). ∎

We conjecture that the following stronger version of (10.5) is also true.

Conjecture 10.2.

Let $n\equiv 1\pmod{4}$ be an integer and $n>1$ . Then

[TABLE]

Similarly to the proof of Theorem 10.1, taking $q\mapsto q^{4}$ , $a\mapsto a^{2}q^{2}$ and $b=c=q^{-2}$ in (10.1), we can prove the following result.

Theorem 10.3.

Let $n>1$ be a positive odd integer. Then

[TABLE]

in particular,

[TABLE]

Note that, for $n\equiv 3\pmod{4}$ , we can prove the following three-parametric congruence:

[TABLE]

Besides, for the $q=-1$ case of (10.8), it seems that the corresponding congruence can be strengthened as follows.

Conjecture 10.4.

Let $p\equiv 3\pmod{4}$ . Then

[TABLE]

Likewise, performing another set of parameter replacements $q\mapsto q^{4}$ , $a\mapsto a^{2}q^{2}$ , $b\mapsto bq^{2}$ , and $c\mapsto c/q^{2}$ in (10.1), we can deduce the following result.

Theorem 10.5.

Let $n\equiv 3\pmod{4}$ be a positive odd integer. Then

[TABLE]

in particular,

[TABLE]

We have the following conjectures.

Conjecture 10.6.

For any integer $n\equiv 3\pmod{4}$ and $n>3$ , the congruence (10.10) still holds modulo $\Phi_{n}(q)^{2}\Phi_{n}(-q)$ .

Conjecture 10.7.

Let $n\equiv 3\pmod{4}$ be a positive integer. Then

[TABLE]

It is easy to see that the congruence (10.11) is true modulo $\Phi_{n}(q)\Phi_{n}(-q)$ by taking $a,b\to 1$ and $c\to-1$ in (10.2). Moreover, it is also true when $q=1$ and $n=p$ is an odd prime, since Tauraso observed that

[TABLE]

While a $q$ -analogue of (10.12) was given by the first author [17], namely

[TABLE]

there is no closed form of the left-hand side of (10.11).

11. Some $q$ -congruences from a double series transformation

of Ismail, Rahman and Suslov

In [33, Thm. 1.1] Ismail, Rahman and Suslov derived the following transformation formula:

[TABLE]

provided $|a^{2}q^{2}/bcdef|<1$ .

If in (11.3) we replace $q$ by $q^{3}$ , take $a=g=q$ , $h=aq$ and $b=c=d=e=f=q^{2}$ , and suitably truncate the sum, then the following “divergent” $q$ -supercongruence appears to be true.

Conjecture 11.1.

Let $n>1$ be a positive integer with $n\equiv 1\pmod{3}$ .Then

[TABLE]

Furthermore, the above congruence holds modulo $\Phi_{n}(q)^{3}$ when $a=1$ .

On the other hand, if in (11.3) we replace $q$ by $q^{3}$ , take $a=g=q^{-1}$ , $h=aq^{-1}$ and $b=c=d=e=f=q$ , and suitably truncate the sum, then the following “divergent” $q$ -supercongruence appears to be true.

Conjecture 11.2.

Let $n>2$ be a positive integer with $n\equiv 2\pmod{3}$ . Then

[TABLE]

Furthermore, the above congruence holds modulo $\Phi_{n}(q)^{3}$ when $a=1$ .

If in (11.3) we replace $q$ by $q^{4}$ , take $a=b=c=d=e=f=q$ , $g=q^{-1}$ , $h=aq^{-1}$ , and suitably truncate the sum, then the following $q$ -supercongruence appears to be true.

Conjecture 11.3.

Let $n$ be a positive integer with $n\equiv 3\pmod{4}$ . Then

[TABLE]

Furthermore, the above congruence holds modulo $[n]\Phi_{n}(q)^{3}$ when $a=1$ .

On the other hand, if in (11.3) we replace $q$ by $q^{4}$ , take $a=b=c=d=e=f=q^{-1}$ , $g=q^{-3}$ , $h=aq^{-3}$ , and suitably truncate the sum, then the following $q$ -supercongruence appears to be true.

Conjecture 11.4.

Let $n>1$ be a positive integer with $n\equiv 1\pmod{4}$ . Then

[TABLE]

Furthermore, the above congruence holds modulo $[n]\Phi_{n}(q)^{3}$ when $a=1$ .

Ismail, Rahman and Suslov [33, Eq. (5.4)] also noted the following transformation formula (which can be obtained from (11.3) by taking $d=aq/c$ and $h=0$ ):

[TABLE]

If in (11.18) we replace $q$ by $q^{4}$ , take $a=b=c=e=f=q^{-2}$ , $g=q^{5}$ and truncate the sum, then the following $q$ -supercongruence appears to be true.

Conjecture 11.5.

Let $n$ be a positive integer with $n\equiv 3\pmod{8}$ . Then

[TABLE]

Similarly as before, we can show that all the congruences in Conjectures 11.1–11.5 are true modulo $\Phi_{n}(q)$ . For example, we have the following parametric generalization of the congruence (11.21) modulo $\Phi_{n}(q)\Phi_{n}(-q)$ .

Theorem 11.6.

Let $n$ be a positive integer with $n\equiv 3\pmod{8}$ . Then, modulo $\Phi_{n}(q)\Phi_{n}(-q)$ ,

[TABLE]

Proof.

Let $q\to q^{4}$ , $a=q^{-2-2n}$ , $b=c=q^{-2}$ , $e=aq^{-2}$ , and $f=q^{-2}/a$ in (11.18). Then the left-hand side terminates at $k=(n+1)/2$ because of the factor $(q^{-2-2n};q^{4})_{k}$ in the numerator, while the right-hand side vanishes because of the factor $(q^{2-2n};q^{4})_{\infty}$ . The described specialization thus yields the following identity:

[TABLE]

Since $q^{2n}\equiv 1\pmod{\Phi_{n}(q)\Phi_{n}(-q)}$ , we immediately deduce the desired congruence from the above identity. ∎

12. Concluding remarks and further open problems

Most of the congruences in the manuscript [29] are modulo $[n](1-aq^{n})(a-q^{n})$ . However, the congruence (3.2) does not hold modulo $[n](1-aq^{n})(a-q^{n})$ in general. We only have a generalization of (3.2) with $a=1$ .

It is easy to see that the following generalization of (2.1b) in Theorem 2.1 is true.

Theorem 12.1.

Let $n$ be a positive odd integer. Then, modulo $[n]\Phi_{n}(q)^{2}$ ,

[TABLE]

Letting $a=1$ in Theorem 3.3, we see that the congruence (12.1) holds modulo $\Phi_{n}(q)^{3}$ . Therefore, Theorem 12.1 is equivalent to the left-hand side of (12.1) being congruent to [math] modulo $[n]$ . By (3.2), we see that the left-hand side of (12.1) is congruent to [math] modulo $\Phi_{n}(q)$ . And the same technique to prove congruences modulo $[n]$ from congruences modulo $\Phi_{n}(q)$ as used in the proofs of (3.12a) and (3.12b) still works here.

We conjecture that the following generalization of the second part of Theorem 2.3 is true.

Conjecture 12.2.

Let $n$ be a positive integer with $n\equiv 2\pmod{3}$ . Then

[TABLE]

We also have the following similar conjecture.

Conjecture 12.3.

Let $n>1$ be a positive integer with $n\equiv 1\pmod{3}$ . Then

[TABLE]

Note that, similar to the proof of Theorem 2.3, we can show that the above congruence holds modulo $[n]\Phi_{n}(q)$ . We point out that $q$ -congruences modulo $[n]\Phi_{n}(q)^{3}$ or $\Phi_{n}(q)^{4}$ are very difficult to prove. As far as we know, the following result

[TABLE]

due to the first author and Wang [27], is the unique $q$ -congruence modulo $[n]\Phi_{n}(q)^{3}$ in the literature that is completely proved. (Several similar conjectural $q$ -congruences are collected in [29].) It is natural to ask whether there is a complete $q$ -analogue of Long’s supercongruence (1.4).

Inspired by the $q$ -congruences in the previous sections, we shall propose the following conjecture.

Conjecture 12.4.

Let $n$ be a positive odd integer. Then

[TABLE]

Note that the left-hand side is not a truncated form of (A.1) with $q\mapsto q^{4}$ and $a=b=c=d=q$ . Therefore, even for the case modulo $\Phi_{n}(q)$ , the above conjecture is still open. Moreover, we cannot find any parametric generalization of the above conjecture, although one would believe that such a generalization should exist.

Similarly, the following conjecture seems to be true.

Conjecture 12.5.

Let $n>1$ be a positive odd integer. Then

[TABLE]

For the $q=1$ case of (9.1b), much more seems to be true. Numerical computations suggest the following result.

Conjecture 12.6.

Let $p\equiv 1\pmod{3}$ . Then

[TABLE]

We also have a similar conjecture related to (9.3b).

Conjecture 12.7.

Let $p\equiv 2\pmod{3}$ . Then

[TABLE]

Unfortunately, we failed to find complete $q$ -analogues of the above two conjectures. In particular, we do not know how to use the creative microscoping method to tackle them.

In [17, Conj. 5.4] the first author has made the following conjecture.

Conjecture 12.8.

Let $n$ and $r$ be positive integers. Then

[TABLE]

Note that the congruences (12.2a) for $r=1,2$ and (12.2b) for $r=1$ have been proved by the first author [17] himself, and the congruence (12.2b) for $r=2$ has been established by the first author and Wang [27].

In this section, we shall prove the following weaker form of the above conjecture.

Theorem 12.9.

The congruences (12.2a) and (12.2b) are true modulo $[n+1][2n+1]$ .

Proof.

The proof is similar to the second step of that of Theorem 3.3. By Lemma 3.1, it is easy to see that for odd $n$ we have

[TABLE]

and

[TABLE]

This proves that, for odd $n$ ,

[TABLE]

and

[TABLE]

Similar to the proofs of (3.12a) and (3.12b), we can further show that

[TABLE]

and

[TABLE]

where $M=n-1$ or $(n-1)/2$ . It is easy to see that the polynomials $[n+1]$ and $[2n+1]$ are relatively prime. The proof then follows from the above two congruences by replacing $n$ with $n+1$ or $2n+1$ and using the relation (1.6). ∎

Finally, we consider the general very-well-poised ${}_{2d}\phi_{2d-1}$ series (which satisfies Slater’s transformation [14, $r=d$ and $b_{2r}=a$ in Eq. (5.5.2)]) where we replace $q$ by $q^{d}$ and take all upper parameters to be $q$ . Then the following further generalization of Conjecture 12.2 appears to be true.

Conjecture 12.10.

Let $d\geqslant 3$ and $n$ be positive integers with $n\equiv-1\pmod{d}$ . Then

[TABLE]

where $M=((d-1)n-1)/d$ or $n-1$ .

Similarly, we consider the general very-well-poised ${}_{2d}\phi_{2d-1}$ series where we replace $q$ by $q^{d}$ and take all upper parameters to be $q^{-1}$ . Then the following generalization of Conjecture 12.3 appears to be true.

Conjecture 12.11.

Let $d\geqslant 3$ and $n>1$ be positive integers with $n\equiv 1\pmod{d}$ . Then

[TABLE]

where $M=((d-1)n+1)/d$ or $n-1$ .

Remark. Since the submission of the original version of this paper (which also appeared as a preprint on the arXiv) and the present final version, relevant developments have taken place. In particular, meanwhile some of our conjectures were confirmed by other authors. Recently, Wang [57] proved Conjecture 6.2 and he further extended it to the modulus $p^{4}$ case. The first author and Zudilin [30] proved Conjecture 10.2, Jana and Kalita [34] proved Conjectures 10.4, 12.6 and 12.7, Ni and Pan [46] proved Conjecture 12.8, and the authors themselves [24, 26] confirmed Conjectures 5.4, 12.10 and 12.11. Moreover, Liu [39] generalized Conjectures 12.6 and 12.7 to the modulus $p^{4}$ case.

Appendix A A new nonterminating ${}_{12}\phi_{11}$

transformation and linearization of the continuous $q$ -ultraspherical polynomials

Our starting point for deriving the nonterminating transformation formula in Theorem A.1 is the following transformation formula between two terminating very-well-poised ${}_{14}\phi_{13}$ series from [36, Thm. 4.1].

[TABLE]

where $\hat{a}=q^{-n}cd/ab$ .

We now have the following new transformation for a nonterminating very-well-poised ${}_{12}\phi_{11}$ series into two multiples of nonterminating ${}_{4}\phi_{3}$ series.

Theorem A.1.

We have

[TABLE]

where $|q/b|<1$ .

This result extends Gasper’s [11, Eq. (3.2)] (see also [14, Ex. 8.15]). Observe that the two ${}_{4}\phi_{3}$ series on the right-hand side are not balanced, nor well-poised. However, they satisfy the remarkable property that the quotient (not the product!) of corresponding upper and lower parameters is throughout the same, namely $b/q$ .

By replacing $a$ , $b$ , $c$ , $d$ in (A.1) by $q^{a}$ , $q^{b}$ , $q^{c}$ , $q^{d}$ , respectively, and letting $q\to 1^{-}$ we obtain the following transformation between a nonterminating very-well-poised ${}_{9}F_{8}$ series into two multiples of nonterminating ${}_{4}F_{3}$ series. (For the notion of a hypergeometric ${}_{r}F_{s}$ series, see [3]. In the following, we employ the condensed notation for products of Pochhammer symbols, $(a_{1},\dots,a_{m})_{k}=(a_{1})_{k}\cdots(a_{m})_{k}$ .)

[TABLE]

where, for convergence, $\Re(b)<\frac{3}{4}$ .

The transformation in (A) extends [11, Eq. (3.3)].

Proof of Theorem A.1.

We would like to take $n\to\infty$ in (A) but the series on the right-hand side has large terms near the end compared to those in the middle of the series which prevents us from taking the term-by-term limit directly. We thus apply a similar analysis as applied by Bailey [6, Eq. 8.5(3)] in his derivation of the nonterminating Watson transformation (who started with the terminating balanced very-well-poised ${}_{10}\phi_{9}$ transformation to derive a transformation of a nonterminating very-well-poised ${}_{8}\phi_{7}$ series into two multiples of balanced ${}_{4}\phi_{3}$ series), see also [14, Sec. 2.10]. In (A), we first replace $n$ by $2m+1$ . Then we write the series on the right-hand side as

[TABLE]

after which in each of the sums we can term-wise let $m\to\infty$ (which is justified by Tannery’s theorem [53, p. 292] under the restriction $|q/b|<1$ ). The identity in (A.1) thus follows. ∎

Notice that if in (A.1) we take $d=a/c$ the first series on the right-hand side reduces to $1$ . (If instead $d=ab^{2}/c$ then the second series on the right-hand side reduces to $1$ . The resulting series is equivalent to (A.2) by the substitution $c\mapsto c/b$ .) We thus have the following nonterminating very-well-poised ${}_{12}\phi_{11}$ summation:

Corollary A.2.

We have

[TABLE]

where $|q/b|<1$ .

A further special case of Corollary A.2 is worth stating separately. If we take $b=-1$ , the second sum reduces to its first term. We then obtain the following nonterminating very-well-poised ${}_{12}\phi_{11}$ summation where the two terms on the right-hand side satisfy a nice symmetry.

Corollary A.3.

We have

[TABLE]

If in (A.1) we take (instead of $d=a/c$ which led to Corollary A.2) $d=aq/c$ the prefactor of the first series on the right-hand vanishes. (If instead $d=ab^{2}/cq$ then the prefactor of the second series on the right-hand vanishes. The resulting series is equivalent to (A.4) by the substitution $c\mapsto ab/c$ .) We thus have the following nonterminating very-well-poised ${}_{10}\phi_{9}$ transformation:

Corollary A.4.

We have

[TABLE]

where $|q/b|<1$ .

We also record another (simpler) special case of (A), obtained by taking $d\to\infty$ . Alternatively, it can be obtained from Theorem A.1 by choosing $d=q^{-n}$ .

Corollary A.5.

We have

[TABLE]

We use Corollary A.5, which is equivalent to Gasper’s aforementioned identity in [11, Eq. (3.2)] (also stated in [14, Ex. 8.15]), to provide a generalization of Rogers’ linearization formula for the continuous $q$ -ultraspherical polynomials in (A).

The continuous $q$ -ultraspherical polynomials, which depend on a parameter $\beta$ and the base $q$ , are given by

[TABLE]

(Note that $\theta$ need not be real.) They were originally considered by Rogers [49] in 1884 (not aware of their orthogonality) in the pursuit of (what is now called) the Rogers–Ramanujan identities.

These functions, which can be written as

[TABLE]

are polynomials in $x$ of degree $n$ .

As was established by Askey and Ismail [5] (see also [32, Thm. 13.2.1]), the continuous $q$ -ultraspherical polynomials satisfy for $|\beta|<1$ the orthogonality relation

[TABLE]

Rogers [49] (cf. also [32, Thm. 13.3.2]) derived the following linearization formula:

[TABLE]

Rogers’ proof of (A) involved induction. Other proofs have been given by Bressoud [7], Rahman [47], and by Gasper [11] (see also [14, Sec. 8.5]). For our extension of Rogers’ linearization formula we define, for $\beta$ and $\nu$ being any two complex numbers,

[TABLE]

which is an even analytic function in $z$ . (Recall that in (1.5) the $q$ -shifted factorials were defined for any complex subindex.) These functions can be written as

[TABLE]

where $|qz^{2}/\beta|<1$ , for absolute convergence. For $\nu=n$ being a nonnegative integer, we have $F_{n}(z;\beta\,|\,q)=z^{n}C_{n}(x;\beta\,|\,q)$ , where $x=(z+z^{-1})/2$ (or, equivalently, $x=\cos\theta$ with $z=e^{i\theta}$ ).

Theorem A.6.

Let $\mu,\nu$ and $\beta$ be three complex numbers. Then we have the following identity of power series in $z$ .

[TABLE]

where $|qz^{2}/\beta|<1$ , for absolute convergence.

Proof.

In the subsequent manipulations of series we silently interchange double sums which is justified as all the involved series absolutely converge (if they do not terminate) for $|qz^{2}/\beta|<1$ . We start with expanding the product of the two functions on the left-hand side of (A.6) using (A.13):

[TABLE]

Now the inner sum over $l$ , which is a special terminating ${}_{4}\phi_{3}$ series, can be transformed into a multiple of a ${}_{12}\phi_{11}$ series using the $(a,b,c,n)\mapsto(\beta q^{\mu+\nu-2k},\beta,q^{\mu-k}\beta,k)$ case of (A.5). We thus obtain

[TABLE]

which, after identifying the inner sum as $F_{\mu+\nu-2k}(z;\beta\,|\,q)$ according to (A.13), establishes the assertion. ∎

Corollary A.7.

Rogers’ linearization formula for the continuous ultraspherical polynomials in (A) is true.

Proof.

In Theorem A.6 choose $\mu=m$ and $\nu=n$ for two nonnegative integers $m$ and $n$ . The identity (A.6) then reduces, after dividing both sides by $z^{n+m}$ , to (A). ∎

Acknowledgements. The authors would like to thank the anonymous referees for very careful readings of a previous version of this paper. Both authors thank Prof. Shishuo Fu at Chongqing University in China for hosting them for several days in September 2018, during which parts of the present research were performed.

Bibliography59

The reference list from the paper itself. Each links out to its DOI / PubMed record.

1[1] G.E. Andrews, q 𝑞 q -Analogs of the binomial coefficient congruences of Babbage, Wolstenholme and Glaisher, Discrete Math. 204 (1999), 15–25.
2[2] G.E. Andrews, The Theory of Partitions , Cambridge University Press, Cambridge, 1998.
3[3] G.E. Andrews, R.A. Askey, and R. Roy, Special functions , Encyclopedia of Mathematics and Its Applications 71 , Cambridge University Press, Cambridge, 1999.
4[4] S. Ahlgren and K. Ono, Gaussian hypergeometric series evaluation and Apéry number congruences, J. Reine Angew. Math. 518 (2000), 187–212.
5[5] R.A. Askey and M.E.H. Ismail, A generalization of the ultraspherical polynomials, in Studies in Pure Mathematics , Birkhäuser, Basel, 1983; pp. 55–78.
6[6] W.N. Bailey, Generalized hypergeometric series , Cambridge University Press, Cambridge, 1964.
7[7] D. Bressoud, Some identities for terminating q 𝑞 q -series, Math. Proc. Camb. Phil. Soc. 81 (1981), 211–223.
8[8] H.-Q. Cao and H. Pan, Factors of alternating binomial sums, Adv. Appl. Math. 45 (2010), 96–107.

TL;DR

Contribution

Findings

Abstract

Peer Reviews

Videos

Some

Abstract.

Key words and phrases:

2010 Mathematics Subject Classification:

1. Introduction

2. The main results

Theorem 2.1**.**

Theorem 2.2**.**

Theorem 2.3**.**

Theorem 2.4**.**

3. Proofs of Theorems 2.1 and

Lemma 3.1**.**

Proof.

Theorem 3.2**.**

Proof.

Theorem 3.3**.**

Proof.

Proof of Theorem 2.1.

Proof of Theorem 2.2.

4. Proofs of Theorems 2.3 and

Theorem 4.1**.**

Proof.

Conjecture 4.2**.**

5. More qqq-congruences from Watson’s transformation

Theorem 5.1**.**

Proof.

Corollary 5.2**.**

Theorem 5.3**.**

Proof.

Conjecture 5.4**.**

Theorem 5.5**.**

Proof.

Conjecture 5.6**.**

Theorem 5.7**.**

Conjecture 5.8**.**

Theorem 5.9**.**

Proof.

Corollary 5.10**.**

Conjecture 5.11**.**

6. Proof of a three-parametric qqq-congruence from

Theorem 6.1**.**

Proof.

Conjecture 6.2**.**

Problem 6.3**.**

Problem 6.4**.**

7. Some qqq-congruences from a cubic transformation

Theorem 7.1**.**

Proof.

Theorem 7.2**.**

Corollary 7.3**.**

Theorem 7.4**.**

Proof.

8. Some qqq-congruences from a quartic transformation

Theorem 8.1**.**

Proof.

Theorem 8.2**.**

Proof.

Conjecture 8.3**.**

Conjecture 8.4**.**

9. Some qqq-congruences from a new

Theorem 9.1**.**

Proof.

Theorem 9.2**.**

Proof.

10. Some other qqq-congruences from the

Theorem 10.1**.**

Proof.

Conjecture 10.2**.**

Theorem 10.3**.**

Conjecture 10.4**.**

Theorem 10.5**.**

Conjecture 10.6**.**

Conjecture 10.7**.**

11. Some qqq-congruences from a double series transformation

Theorem 2.1.

Theorem 2.2.

Theorem 2.3.

Theorem 2.4.

Lemma 3.1.

Theorem 3.2.

Theorem 3.3.

Theorem 4.1.

Conjecture 4.2.

5. More $q$ -congruences from Watson’s transformation

Theorem 5.1.

Corollary 5.2.

Theorem 5.3.

Conjecture 5.4.

Theorem 5.5.

Conjecture 5.6.

Theorem 5.7.

Conjecture 5.8.

Theorem 5.9.

Corollary 5.10.

Conjecture 5.11.

6. Proof of a three-parametric $q$ -congruence from

Theorem 6.1.

Conjecture 6.2.

Problem 6.3.

Problem 6.4.

7. Some $q$ -congruences from a cubic transformation

Theorem 7.1.

Theorem 7.2.

Corollary 7.3.

Theorem 7.4.

8. Some $q$ -congruences from a quartic transformation

Theorem 8.1.

Theorem 8.2.

Conjecture 8.3.

Conjecture 8.4.

9. Some $q$ -congruences from a new

Theorem 9.1.

Theorem 9.2.

10. Some other $q$ -congruences from the

Theorem 10.1.

Conjecture 10.2.

Theorem 10.3.

Conjecture 10.4.

Theorem 10.5.

Conjecture 10.6.

Conjecture 10.7.

11. Some $q$ -congruences from a double series transformation

Conjecture 11.1.

Conjecture 11.2.

Conjecture 11.3.

Conjecture 11.4.

Conjecture 11.5.

Theorem 11.6.

Theorem 12.1.

Conjecture 12.2.

Conjecture 12.3.

Conjecture 12.4.

Conjecture 12.5.

Conjecture 12.6.

Conjecture 12.7.

Conjecture 12.8.

Theorem 12.9.

Conjecture 12.10.

Conjecture 12.11.

Appendix A A new nonterminating ${}_{12}\phi_{11}$

Theorem A.1.

Corollary A.2.

Corollary A.3.

Corollary A.4.

Corollary A.5.

Theorem A.6.

Corollary A.7.