Introduction
In 1914, Ramanujan [19 ] established the remarkable identity
∑ k = 0 ∞ ( 6 k + 1 ) ( 1 2 ) k 3 k ! 3 4 k = 4 π , (1) \sum_{k=0}^{\infty}(6k+1)\frac{\left(\frac{1}{2}\right)_k^3}{k!^3 4^k}=\frac{4}{\pi}, \tag*{(1)} k = 0 ∑ ∞ ( 6 k + 1 ) k ! 3 4 k ( 2 1 ) k 3 = π 4 , (1)
where ( a ) n = a ( a + 1 ) ⋯ ( a + n − 1 ) (a)_n=a(a+1)\cdots(a+n-1) ( a ) n = a ( a + 1 ) ⋯ ( a + n − 1 ) is the Pochhammer symbol. Motivated by Ramanujan’s series for 1 π \frac{1}{\pi} π 1 , Van Hamme [22 ] conjectured 13 p p p -adic analogues, now known as Ramanujan-type supercongruences. In particular, the conjecture associated with (1) is that for primes p > 3 p>3 p > 3 ,
∑ k = 0 p − 1 2 ( 6 k + 1 ) ( 1 2 ) k 3 k ! 3 4 k = ( − 1 ) p − 1 2 p ( m o d p 4 ) , (2) \sum_{k=0}^{\frac{p-1}{2}}(6k+1)\frac{\left(\frac{1}{2}\right)_k^3}{k!^3 4^k}=(-1)^{\frac{p-1}{2}}p\pmod{p^4}, \tag*{(2)} k = 0 ∑ 2 p − 1 ( 6 k + 1 ) k ! 3 4 k ( 2 1 ) k 3 = ( − 1 ) 2 p − 1 p ( mod p 4 ) , (2)
which was marked as (J.2) in his list. Early progress on (2) was obtained by Zudilin [27 ] , who verified the supercongruence modulo p 2 p^2 p 2 using the WZ method. The first complete proof of (2) was given by Long [17 ] , using hypergeometric identities and p p p -adic analysis. Later,
Long and Ramakrishna [18 ] established a related supercongruence modulo p 6 p^6 p 6 by means of p p p -adic Gamma function and hypergeometric series formulas. Further similar Ramanujan-type supercongruences have been established by various authors; see, for example, [13 , 15 ] .
Building on these results, the q q q -analogues of Ramanujan’s and Ramanujan-type π \pi π -series have attracted considerable attention. Guo and Liu [10 ] derived a q q q -analogue of the Ramanujan’s π \pi π -series (1) . For further references on this topic, see [1 , 2 , 14 , 20 ] . Meanwhile, Ramanujan-type supercongruences have been generalized to the q q q -settings by many authors. Guo [4 ] first established a weaker q q q -analogue of the supercongruence (2) , and subsequently proved the complete q q q -analogue in [6 ] using the q q q -microscope method. This method was introduced by Guo and Zudilin [12 ] and has subsequently led to numerous extensions of q q q -supercongruences; see, for example, [5 , 7 , 8 , 9 , 16 , 21 , 23 , 24 , 25 , 26 ] .
Recently, Guo and Zudilin [12 Theorem 4.5] showed that
∑ k = 0 m [ 6 k + 1 ] ( a q ; q 2 ) k ( q / a ; q 2 ) k ( q ; q 2 ) k ( b ; q 4 ) k ( a q 4 ; q 4 ) k ( q 4 / a ; q 4 ) k ( q 4 ; q 4 ) k ( q 3 / b ; q 2 ) k b k q k 2 + 2 k ≡ ( q 7 b ; q 4 ) ( n − r ) / 4 ( q 4 + r / b ; q 4 ) ( n − r ) / 4 b − ( n − r ) / 4 ( − q ) ( 1 − r ) / 2 [ n ] ( m o d [ n ] ( 1 − a q n ) ( a − q n ) ) (3) \sum_{k=0}^{m}[6k+1]\frac{(aq;q^2)_k(q/a;q^2)_k(q;q^2)_k(b;q^4)_k}{(aq^4;q^4)_k(q^4/a;q^4)_k(q^4;q^4)_k(q^3/b;q^2)_k}b^kq^{k^2+2k}
\equiv\frac{(q^7b;q^4)_{(n-r)/4}}{(q^{4+r}/b;q^4)_{(n-r)/4}}b^{-(n-r)/4}(-q)^{(1-r)/2}[n]\pmod{[n](1-aq^n)(a-q^n)} \tag*{(3)} k = 0 ∑ m [ 6 k + 1 ] ( a q 4 ; q 4 ) k ( q 4 / a ; q 4 ) k ( q 4 ; q 4 ) k ( q 3 / b ; q 2 ) k ( a q ; q 2 ) k ( q / a ; q 2 ) k ( q ; q 2 ) k ( b ; q 4 ) k b k q k 2 + 2 k ≡ ( q 4 + r / b ; q 4 ) ( n − r ) /4 ( q 7 b ; q 4 ) ( n − r ) /4 b − ( n − r ) /4 ( − q ) ( 1 − r ) /2 [ n ] ( mod [ n ] ( 1 − a q n ) ( a − q n )) (3)
where m = n − 1 m=n-1 m = n − 1 or n − 1 2 \frac{n-1}{2} 2 n − 1 , and n ≡ r ( m o d 4 ) n\equiv r\pmod4 n ≡ r ( mod 4 ) be an odd positive integer with r = ± 1 r=\pm1 r = ± 1 . Here and throughout the paper, we adopt the standard q q q -notations. For complex numbers a a a , q q q , and any nonnegative integer n n n , the q q q -shifted factorials are defined as
( a ; q ) ∞ = ∏ j = 0 ∞ ( 1 − a q j ) and ( a ; q ) n = ∏ j = 0 n − 1 ( 1 − a q j ) . (a;q)_\infty=\prod_{j=0}^{\infty}(1-aq^j)\quad\text{and}\quad(a;q)_n=\prod_{j=0}^{n-1}(1-aq^j). ( a ; q ) ∞ = j = 0 ∏ ∞ ( 1 − a q j ) and ( a ; q ) n = j = 0 ∏ n − 1 ( 1 − a q j ) .
For simplicity, we shall also adopt the compact notation
( a 1 , a 2 , … , a ℓ ; q ) n = ( a 1 ; q ) n ( a 2 ; q ) n ⋯ ( a ℓ ; q ) n (a_1,a_2,\ldots,a_\ell;q)_n=(a_1;q)_n(a_2;q)_n\cdots(a_\ell;q)_n ( a 1 , a 2 , … , a ℓ ; q ) n = ( a 1 ; q ) n ( a 2 ; q ) n ⋯ ( a ℓ ; q ) n
for n ∈ N 0 ∪ { ∞ } n\in\mathbb{N}_0\cup\{\infty\} n ∈ N 0 ∪ { ∞ } . In addition, the q q q -integer is given by [ n ] = ( 1 − q n ) / ( 1 − q ) [n]=(1-q^n)/(1-q) [ n ] = ( 1 − q n ) / ( 1 − q ) . Let Φ n ( q ) \Phi_n(q) Φ n ( q ) denote the n n n -th cyclotomic polynomial, which can be written as
Φ n ( q ) = ∏ 1 ≤ j ≤ n − 1 gcd ( j , n ) = 1 ( q − e 2 π i j / n ) ∈ Z [ q ] . \Phi_n(q)=\prod_{\substack{1\le j\le n-1\\\gcd(j,n)=1}}(q-e^{2\pi ij/n})\in\mathbb{Z}[q]. Φ n ( q ) = 1 ≤ j ≤ n − 1 g c d ( j , n ) = 1 ∏ ( q − e 2 π ij / n ) ∈ Z [ q ] .
Letting a → 1 a\to1 a → 1 , b → q − 1 b\to q^{-1} b → q − 1 and r = − 1 r=-1 r = − 1 in (3) , we have
∑ k = 0 m [ 6 k + 1 ] ( q ; q 2 ) k 3 ( q − 1 ; q 4 ) k ( q 4 ; q 2 ) k ( q 4 ; q 4 ) k 3 q k 2 + 3 k ≡ − [ n ] q ( n + 5 ) / 4 ( q − 2 ; q 4 ) ( n + 1 ) / 4 ( q 4 ; q 4 ) ( n + 1 ) / 4 ( m o d [ n ] Φ n ( q ) 2 ) . (4) \sum_{k=0}^{m}[6k+1]\frac{(q;q^2)_k^3(q^{-1};q^4)_k}{(q^4;q^2)_k(q^4;q^4)_k^3}q^{k^2+3k}\equiv-[n]q^{(n+5)/4}\frac{(q^{-2};q^4)_{(n+1)/4}}{(q^4;q^4)_{(n+1)/4}}\pmod{[n]\Phi_n(q)^2}. \tag*{(4)} k = 0 ∑ m [ 6 k + 1 ] ( q 4 ; q 2 ) k ( q 4 ; q 4 ) k 3 ( q ; q 2 ) k 3 ( q − 1 ; q 4 ) k q k 2 + 3 k ≡ − [ n ] q ( n + 5 ) /4 ( q 4 ; q 4 ) ( n + 1 ) /4 ( q − 2 ; q 4 ) ( n + 1 ) /4 ( mod [ n ] Φ n ( q ) 2 ) . (4)
More recently, Guo and Zhao [11 Theorem 1.3] gave a related q q q -supercongruences modulo [ n ] Φ n ( q ) 3 [n]\Phi_n(q)^3 [ n ] Φ n ( q ) 3 , that is, for any positive integer n n n with n ≡ 3 ( m o d 4 ) n\equiv3\pmod4 n ≡ 3 ( mod 4 ) ,
∑ k = 0 ( n − 1 ) / 2 [ 6 k + 1 ] ( q ; q 2 ) k 3 ( q − 1 ; q 4 ) k ( q 4 ; q 4 ) k 3 ( q 4 ; q 2 ) k q k 2 + 3 k ≡ − [ n ] q ( n + 5 ) / 4 ( q − 2 ; q 4 ) ( n + 1 ) / 4 ( q 4 ; q 4 ) ( n + 1 ) / 4 [ 1 − [ n ] 2 ∑ j = 1 ( n + 1 ) / 4 q 4 j [ 4 j ] 2 ] . (5) \sum_{k=0}^{(n-1)/2}[6k+1]\frac{(q;q^2)_k^3(q^{-1};q^4)_k}{(q^4;q^4)_k^3(q^4;q^2)_k}q^{k^2+3k}\equiv-[n]q^{(n+5)/4}\frac{(q^{-2};q^4)_{(n+1)/4}}{(q^4;q^4)_{(n+1)/4}}\left[1-[n]^2\sum_{j=1}^{(n+1)/4}\frac{q^{4j}}{[4j]^2}\right]. \tag*{(5)} k = 0 ∑ ( n − 1 ) /2 [ 6 k + 1 ] ( q 4 ; q 4 ) k 3 ( q 4 ; q 2 ) k ( q ; q 2 ) k 3 ( q − 1 ; q 4 ) k q k 2 + 3 k ≡ − [ n ] q ( n + 5 ) /4 ( q 4 ; q 4 ) ( n + 1 ) /4 ( q − 2 ; q 4 ) ( n + 1 ) /4 1 − [ n ] 2 j = 1 ∑ ( n + 1 ) /4 [ 4 j ] 2 q 4 j . (5)
In this paper, we aim to investigate parametric extensions of the q q q -supercongruences (4) and (5) under different moduli. More precisely, we first establish two q q q -supercongruences modulo Φ n ( q ) 3 \Phi_n(q)^3 Φ n ( q ) 3 and Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 , respectively, and then, building on these results, derive one-parameter generalizations of the q q q -supercongruences (4) and (5) .
We first establish an extension of (4) as follows.
Theorem 1.1. Let n > 1 n>1 n > 1 be an integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n − 1 6 0\le s\le\frac{n-1}{6} 0 ≤ s ≤ 6 n − 1 . Then, modulo Φ n ( q ) 3 \Phi_n(q)^3 Φ n ( q ) 3 ,
∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k q k 2 + 3 k ≡ − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 4 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) s q s 2 + 3 s . \sum_{k=s}^{\frac{n-1}{2}+2s}[6k+1]\frac{(q;q^2)_k(q;q^2)_{k-2s}(q;q^2)_{k+2s}(q^{-1};q^4)_k}{(q^4;q^4)_{k+s}(q^4;q^4)_k(q^4;q^4)_{k-s}(q^4;q^2)_k}q^{k^2+3k}
\equiv-[n]q^{\frac{n+5}{4}}\frac{(q^{-2};q^4)_{\frac{n+1}{4}}(q;q^2)_s(q;q^2)_{-s}(q^{-1};q^4)_s}{(q^4;q^4)_{\frac{n+1}{4}}(q^5;q^4)_s}q^{s^2+3s}. k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k q k 2 + 3 k ≡ − [ n ] q 4 n + 5 ( q 4 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) s ( q − 2 ; q 4 ) 4 n + 1 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s q s 2 + 3 s .
The following result provides a one-parameter extension of (5) modulo Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 .
Theorem 1.2. Let n > 1 n>1 n > 1 be an integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n − 1 6 0\le s\le\frac{n-1}{6} 0 ≤ s ≤ 6 n − 1 . Then, modulo Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 ,
∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k q k 2 + 3 k ≡ − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 4 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) s [ 1 − [ n ] 2 ∑ j = 1 n + 1 4 q 4 j [ 4 j ] 2 ] q s 2 + 3 s . \sum_{k=s}^{\frac{n-1}{2}+2s}[6k+1]\frac{(q;q^2)_k(q;q^2)_{k-2s}(q;q^2)_{k+2s}(q^{-1};q^4)_k}{(q^4;q^4)_{k+s}(q^4;q^4)_k(q^4;q^4)_{k-s}(q^4;q^2)_k}q^{k^2+3k}
\equiv-[n]q^{\frac{n+5}{4}}\frac{(q^{-2};q^4)_{\frac{n+1}{4}}(q;q^2)_s(q;q^2)_{-s}(q^{-1};q^4)_s}{(q^4;q^4)_{\frac{n+1}{4}}(q^5;q^4)_s}\left[1-[n]^2\sum_{j=1}^{\frac{n+1}{4}}\frac{q^{4j}}{[4j]^2}\right]q^{s^2+3s}. k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k q k 2 + 3 k ≡ − [ n ] q 4 n + 5 ( q 4 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) s ( q − 2 ; q 4 ) 4 n + 1 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s 1 − [ n ] 2 j = 1 ∑ 4 n + 1 [ 4 j ] 2 q 4 j q s 2 + 3 s .
Next, from Theorem 1.1 , we derive a generalization of (4) .
Theorem 1.3. Let n > 1 n>1 n > 1 be an integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n − 1 6 0\le s\le\frac{n-1}{6} 0 ≤ s ≤ 6 n − 1 . Then, modulo [ n ] Φ n ( q ) 2 [n]\Phi_n(q)^2 [ n ] Φ n ( q ) 2 ,
∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k q k 2 + 3 k ≡ − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 4 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) s q s 2 + 3 s . (6) \sum_{k=s}^{\frac{n-1}{2}+2s}[6k+1]\frac{(q;q^2)_k(q;q^2)_{k-2s}(q;q^2)_{k+2s}(q^{-1};q^4)_k}{(q^4;q^4)_{k+s}(q^4;q^4)_k(q^4;q^4)_{k-s}(q^4;q^2)_k}q^{k^2+3k}
\equiv-[n]q^{\frac{n+5}{4}}\frac{(q^{-2};q^4)_{\frac{n+1}{4}}(q;q^2)_s(q;q^2)_{-s}(q^{-1};q^4)_s}{(q^4;q^4)_{\frac{n+1}{4}}(q^5;q^4)_s}q^{s^2+3s}. \tag*{(6)} k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k q k 2 + 3 k ≡ − [ n ] q 4 n + 5 ( q 4 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) s ( q − 2 ; q 4 ) 4 n + 1 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s q s 2 + 3 s . (6)
Setting s = 0 s=0 s = 0 in (6) yields (4) . Moreover, letting n = p n=p n = p be an odd prime and taking the limit q → 1 q\to1 q → 1 in (6) , we obtain the following supercongruence.
Corollary 1.4. Let p > 1 p>1 p > 1 be an odd prime satisfying p ≡ 3 ( m o d 4 ) p\equiv3\pmod{4} p ≡ 3 ( mod 4 ) , and let s s s be an integer with 0 ≤ s ≤ p − 1 6 0\le s\le\frac{p-1}{6} 0 ≤ s ≤ 6 p − 1 . Then we have
∑ k = s p − 1 2 + 2 s ( 6 k + 1 ) ( 1 2 ) k ( 1 2 ) k − 2 s ( 1 2 ) k + 2 s ( − 1 4 ) k 4 k ( k + s ) ! k ! ( k − s ) ! ( k + 1 ) ! = − p ( − 1 ) s ( − 1 2 ) p + 1 4 ( − 1 4 ) s ( 1 ) p + 1 4 ( 5 4 ) s ( m o d p 3 ) . \sum_{k=s}^{\frac{p-1}{2}+2s}(6k+1)\frac{\left(\frac{1}{2}\right)_k\left(\frac{1}{2}\right)_{k-2s}\left(\frac{1}{2}\right)_{k+2s}\left(-\frac{1}{4}\right)_k}{4^k(k+s)!k!(k-s)!(k+1)!}
=-p\frac{(-1)^s\left(-\frac{1}{2}\right)_{\frac{p+1}{4}}\left(-\frac{1}{4}\right)_s}{(1)_{\frac{p+1}{4}}\left(\frac{5}{4}\right)_s}\pmod{p^3}. k = s ∑ 2 p − 1 + 2 s ( 6 k + 1 ) 4 k ( k + s )! k ! ( k − s )! ( k + 1 )! ( 2 1 ) k ( 2 1 ) k − 2 s ( 2 1 ) k + 2 s ( − 4 1 ) k = − p ( 1 ) 4 p + 1 ( 4 5 ) s ( − 1 ) s ( − 2 1 ) 4 p + 1 ( − 4 1 ) s ( mod p 3 ) .
Finally, with the aid of Theorem 1.2 , we obtain a generalization of (5) .
Theorem 1.5. Let n > 1 n > 1 n > 1 be an integer with n ≡ 3 ( m o d 4 ) n \equiv3 \pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n − 1 6 0 \le s \le\frac{n-1}{6} 0 ≤ s ≤ 6 n − 1 . Then, modulo [ n ] Φ n ( q ) 3 [n]\Phi_n(q)^3 [ n ] Φ n ( q ) 3 ,
∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k q k 2 + 3 k ≡ − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 4 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) s [ 1 − [ n ] 2 ∑ j = 1 n + 1 4 q 4 j [ 4 j ] 2 ] q s 2 + 3 s . (7) \sum_{k=s}^{\frac{n-1}{2}+2s} [6k+1]\frac{(q;q^2)_k(q;q^2)_{k-2s}(q;q^2)_{k+2s}(q^{-1};q^4)_k}{(q^4;q^4)_{k+s}(q^4;q^4)_k(q^4;q^4)_{k-s}(q^4;q^2)_k}q^{k^2+3k}
\equiv-[n]q^{\frac{n+5}{4}}\frac{(q^{-2};q^4)_{\frac{n+1}{4}}(q;q^2)_s(q;q^2)_{-s}(q^{-1};q^4)_s}{(q^4;q^4)_{\frac{n+1}{4}}(q^5;q^4)_s}\left[1-[n]^2\sum_{j=1}^{\frac{n+1}{4}}\frac{q^{4j}}{[4j]^2}\right]q^{s^2+3s}. \tag*{(7)} k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k q k 2 + 3 k ≡ − [ n ] q 4 n + 5 ( q 4 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) s ( q − 2 ; q 4 ) 4 n + 1 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s 1 − [ n ] 2 j = 1 ∑ 4 n + 1 [ 4 j ] 2 q 4 j q s 2 + 3 s . (7)
Putting s = 0 s=0 s = 0 in (7) gives (5) . Furthermore, for n = p n=p n = p an odd prime, taking the limit q → 1 q \to1 q → 1 in (7) yields the following supercongruence.
Corollary 1.6. Let p > 1 p > 1 p > 1 be an odd prime satisfying p ≡ 3 ( m o d 4 ) p \equiv3 \pmod{4} p ≡ 3 ( mod 4 ) , and let s s s be an integer satisfying 0 ≤ s ≤ p − 1 6 0 \le s \le\frac{p-1}{6} 0 ≤ s ≤ 6 p − 1 . Then we have
∑ k = s p − 1 2 + 2 s ( 6 k + 1 ) ( 1 2 ) k ( 1 2 ) k − 2 s ( 1 2 ) k + 2 s ( − 1 4 ) k 4 k ( k + s ) ! k ! ( k − s ) ! ( k + 1 ) ! = − p ( − 1 ) s ( − 1 2 ) p + 1 4 ( − 1 4 ) s ( 1 ) p + 1 4 ( 5 4 ) s ( 1 − p 2 16 ∑ j = 1 p + 1 4 1 j 2 ) ( m o d p 4 ) . \sum_{k=s}^{\frac{p-1}{2}+2s}(6k+1)\frac{\left(\frac{1}{2}\right)_k\left(\frac{1}{2}\right)_{k-2s}\left(\frac{1}{2}\right)_{k+2s}\left(-\frac{1}{4}\right)_k}{4^k(k+s)!k!(k-s)!(k+1)!}
=-p\frac{(-1)^s\left(-\frac{1}{2}\right)_{\frac{p+1}{4}}\left(-\frac{1}{4}\right)_s}{(1)_{\frac{p+1}{4}}\left(\frac{5}{4}\right)_s}\left(1-\frac{p^2}{16}\sum_{j=1}^{\frac{p+1}{4}}\frac{1}{j^2}\right)\pmod{p^4}. k = s ∑ 2 p − 1 + 2 s ( 6 k + 1 ) 4 k ( k + s )! k ! ( k − s )! ( k + 1 )! ( 2 1 ) k ( 2 1 ) k − 2 s ( 2 1 ) k + 2 s ( − 4 1 ) k = − p ( 1 ) 4 p + 1 ( 4 5 ) s ( − 1 ) s ( − 2 1 ) 4 p + 1 ( − 4 1 ) s 1 − 16 p 2 j = 1 ∑ 4 p + 1 j 2 1 ( mod p 4 ) .
The rest of the paper is organized as follows. In Section 2 we give some necessary lemmas on q q q -congruences. In Section 3, we prove Theorems 1.1 and 1.2 by the creative microscoping method. Finally, Section 4 is devoted to the proofs of Theorems 1.3 and 1.5 .
Some Lemmas
In order to prove our main results, we establish four lemmas concerning q q q -congruences. To this end, we need the following formula
∑ k = 0 ∞ 1 − a q 3 k 1 − a ( a , b , q / b ; q ) k ( f ; q 2 ) k q ( k 2 + k ) / 2 ( q 2 , a q 2 / b , a b q ; q 2 ) k ( a q / f ; q ) k ( a f ) k = ( a q , a q 2 , a q 2 / b f , a b q / f ; q 2 ) ∞ ( a q / f , a q 2 / f , a q 2 / b , a b q ; q 2 ) ∞ , (8) \sum_{k=0}^{\infty}\frac{1-aq^{3k}}{1-a}\frac{(a,b,q/b;q)_k(f;q^2)_kq^{(k^2+k)/2}}{(q^2,aq^2/b,abq;q^2)_k(aq/f;q)_k}\left(\frac{a}{f}\right)^k=\frac{(aq,aq^2,aq^2/bf,abq/f;q^2)_\infty}{(aq/f,aq^2/f,aq^2/b,abq;q^2)_\infty}, \tag*{(8)} k = 0 ∑ ∞ 1 − a 1 − a q 3 k ( q 2 , a q 2 / b , ab q ; q 2 ) k ( a q / f ; q ) k ( a , b , q / b ; q ) k ( f ; q 2 ) k q ( k 2 + k ) /2 ( f a ) k = ( a q / f , a q 2 / f , a q 2 / b , ab q ; q 2 ) ∞ ( a q , a q 2 , a q 2 / b f , ab q / f ; q 2 ) ∞ , (8)
which follows by putting d = q − 2 n d=q^{-2n} d = q − 2 n and taking n → ∞ n \to\infty n → ∞ in the quadratic summation of Gasper and Rahman [3 Eq. (3.8.12)]
∑ k = 0 ∞ 1 − a q 3 k 1 − a ( a , b , q / b ; q ) k ( d , f , a 2 q / d f ; q 2 ) k q k ( a q / d , a q / f , d f / a ; q ) k ( q 2 , a q 2 / b , a b q ; q 2 ) k + ( a q , f / a , b , q / b ; q ) ∞ ( d , d q 2 / d f , f q 2 / d , d f q 2 / a 2 ; q 2 ) ∞ ( a / f , f q / a , a q / d , d f / a ; q ) ∞ ( a q 2 / b , a b q , f q / a b , b f / a ; q 2 ) ∞ × ∑ k = 0 ∞ ( f , b f / a , f q / a b ; q 2 ) k q 2 k ( q 2 , f q 2 / d , d f 2 q / a 2 ; q 2 ) k = ( a q , f / a ; q ) ∞ ( a q 2 / b d , a b q / d , b d f / a , d f q / a b ; q 2 ) ∞ ( a q / d , d f / a ; q ) ∞ ( a q 2 / b , a b q , b f / a , f q / a b ; q 2 ) ∞ . \begin{aligned}
\sum_{k=0}^{\infty}\frac{1-aq^{3k}}{1-a}\frac{(a,b,q/b;q)_k(d,f,a^2q/df;q^2)_kq^k}{(aq/d,aq/f,df/a;q)_k(q^2,aq^2/b,abq;q^2)_k} \\
&+\frac{(aq,f/a,b,q/b;q)_\infty(d, d q^2/df, f q^2/d, d f q^2/a^2;q^2)_\infty}{(a/f,fq/a,aq/d,df/a;q)_\infty(aq^2/b,abq,fq/ab,bf/a;q^2)_\infty}
\times\sum_{k=0}^{\infty}\frac{(f,bf/a,fq/ab;q^2)_kq^{2k}}{(q^2,fq^2/d,df^2q/a^2;q^2)_k} \\
&=\frac{(aq,f/a;q)_\infty(aq^2/bd,abq/d,bdf/a,dfq/ab;q^2)_\infty}{(aq/d,df/a;q)_\infty(aq^2/b,abq,bf/a,fq/ab;q^2)_\infty}.
\end{aligned} k = 0 ∑ ∞ 1 − a 1 − a q 3 k ( a q / d , a q / f , df / a ; q ) k ( q 2 , a q 2 / b , ab q ; q 2 ) k ( a , b , q / b ; q ) k ( d , f , a 2 q / df ; q 2 ) k q k + ( a / f , f q / a , a q / d , df / a ; q ) ∞ ( a q 2 / b , ab q , f q / ab , b f / a ; q 2 ) ∞ ( a q , f / a , b , q / b ; q ) ∞ ( d , d q 2 / df , f q 2 / d , df q 2 / a 2 ; q 2 ) ∞ × k = 0 ∑ ∞ ( q 2 , f q 2 / d , d f 2 q / a 2 ; q 2 ) k ( f , b f / a , f q / ab ; q 2 ) k q 2 k = ( a q / d , df / a ; q ) ∞ ( a q 2 / b , ab q , b f / a , f q / ab ; q 2 ) ∞ ( a q , f / a ; q ) ∞ ( a q 2 / b d , ab q / d , b df / a , df q / ab ; q 2 ) ∞ .
Define
T n , s ( a , b ; q ) : = ∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( a q ; q 2 ) k ( q / a ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 / b ; q 4 ) k ( a q 4 ; q 4 ) k + s ( q 4 / a ; q 4 ) k ( q 4 ; q 4 ) k − s ( b q 4 ; q 2 ) k b k q k 2 + 3 k . (9) T_{n,s}(a,b;q):=\sum_{k=s}^{\frac{n-1}{2}+2s}[6k+1]\frac{(aq;q^2)_k(q/a;q^2)_{k-2s}(q;q^2)_{k+2s}(q^{-1}/b;q^4)_k}{(aq^4;q^4)_{k+s}(q^4/a;q^4)_k(q^4;q^4)_{k-s}(bq^4;q^2)_k}b^kq^{k^2+3k}. \tag*{(9)} T n , s ( a , b ; q ) := k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( a q 4 ; q 4 ) k + s ( q 4 / a ; q 4 ) k ( q 4 ; q 4 ) k − s ( b q 4 ; q 2 ) k ( a q ; q 2 ) k ( q / a ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 / b ; q 4 ) k b k q k 2 + 3 k . (9)
Lemma 2.1. Let n > 1 n>1 n > 1 be an odd integer, and s s s be an integer with 0 ≤ s ≤ n − 1 6 0\le s\le\frac{n-1}{6} 0 ≤ s ≤ 6 n − 1 . Then
T n , s ( a , b ; q ) ≡ 0 ( m o d Φ n ( q ) ) . (10) T_{n,s}(a,b;q)\equiv0\pmod{\Phi_n(q)}. \tag*{(10)} T n , s ( a , b ; q ) ≡ 0 ( mod Φ n ( q )) . (10)
Proof. Replacing k k k by k + s k+s k + s , a direct computation gives that T n , s ( a , b ; q ) T_{n,s}(a,b;q) T n , s ( a , b ; q ) is equal to
∑ k = 0 n − 1 2 + s [ 6 k + 6 s + 1 ] ( a q ; q 2 ) k + s ( q / a ; q 2 ) k − s ( q ; q 2 ) k + 3 s ( q − 1 / b ; q 4 ) k + s ( a q 4 ; q 4 ) k + 2 s ( q 4 / a ; q 4 ) k + s ( q 4 ; q 4 ) k + s ( b q 4 ; q 2 ) k + s q ( k + s ) 2 + 3 ( k + s ) b k + s = [ 6 s + 1 ] ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q ; q 2 ) 3 s ( q − 1 / b ; q 4 ) s ( a q 4 ; q 4 ) 2 s ( q 4 / a ; q 4 ) s ( b q 4 ; q 2 ) s b s q s 2 + 3 s × ∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 1 − q 6 s + 1 ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k ( a q 8 s + 4 , q 4 s + 4 / a , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k b k q k 2 + 2 k s + 3 k . (11) \begin{aligned}
\sum_{k=0}^{\frac{n-1}{2}+s}[6k+6s+1]\frac{(aq;q^2)_{k+s}(q/a;q^2)_{k-s}(q;q^2)_{k+3s}(q^{-1}/b;q^4)_{k+s}}{(aq^4;q^4)_{k+2s}(q^4/a;q^4)_{k+s}(q^4;q^4)_{k+s}(bq^4;q^2)_{k+s}}q^{(k+s)^2+3(k+s)}b^{k+s} \\
&=[6s+1]\frac{(aq;q^2)_s(q/a;q^2)_{-s}(q;q^2)_{3s}(q^{-1}/b;q^4)_s}{(aq^4;q^4)_{2s}(q^4/a;q^4)_s(bq^4;q^2)_s}b^sq^{s^2+3s}
\times\sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1}}{1-q^{6s+1}}\frac{(aq^{2s+1},q^{1-2s}/a,q^{6s+1};q^2)_k(q^{4s-1}/b;q^4)_k}{(aq^{8s+4},q^{4s+4}/a,q^4;q^4)_k(bq^{2s+4};q^2)_k}b^kq^{k^2+2ks+3k}. \tag*{(11)}
\end{aligned} k = 0 ∑ 2 n − 1 + s [ 6 k + 6 s + 1 ] ( a q 4 ; q 4 ) k + 2 s ( q 4 / a ; q 4 ) k + s ( q 4 ; q 4 ) k + s ( b q 4 ; q 2 ) k + s ( a q ; q 2 ) k + s ( q / a ; q 2 ) k − s ( q ; q 2 ) k + 3 s ( q − 1 / b ; q 4 ) k + s q ( k + s ) 2 + 3 ( k + s ) b k + s = [ 6 s + 1 ] ( a q 4 ; q 4 ) 2 s ( q 4 / a ; q 4 ) s ( b q 4 ; q 2 ) s ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q ; q 2 ) 3 s ( q − 1 / b ; q 4 ) s b s q s 2 + 3 s × k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 1 − q 6 k + 6 s + 1 ( a q 8 s + 4 , q 4 s + 4 / a , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k b k q k 2 + 2 k s + 3 k . (11)
If s = n − 1 6 s=\frac{n-1}{6} s = 6 n − 1 , then the right-hand side of (11) contains [ 6 s + 1 ] = [ n ] [6s+1]=[n] [ 6 s + 1 ] = [ n ] , whereas the summand equals 1 1 1 for k = 0 k=0 k = 0 and
( q 6 s + 1 ; q 2 ) k 1 − q 6 s + 1 = ( q n + 2 ; q 2 ) k − 1 , k ≥ 1. \frac{(q^{6s+1};q^2)_k}{1-q^{6s+1}}=(q^{n+2};q^2)_{k-1},\qquad k\ge1. 1 − q 6 s + 1 ( q 6 s + 1 ; q 2 ) k = ( q n + 2 ; q 2 ) k − 1 , k ≥ 1.
On the other hand, ( q 4 ; q 4 ) k (q^4;q^4)_k ( q 4 ; q 4 ) k is relatively prime to Φ n ( q ) \Phi_n(q) Φ n ( q ) since 0 ≤ k ≤ n − 1 2 + s 0\le k\le\frac{n-1}{2}+s 0 ≤ k ≤ 2 n − 1 + s . Hence the desired congruence follows.
Now suppose that 0 ≤ s < n − 1 6 0\le s<\frac{n-1}{6} 0 ≤ s < 6 n − 1 . Applying (8) with q ↦ q 2 q\mapsto q^2 q ↦ q 2 , a = q 6 s + 1 − n a=q^{6s+1-n} a = q 6 s + 1 − n , b = a q 2 s + 1 b=aq^{2s+1} b = a q 2 s + 1 and f = q 4 s − 1 / b f=q^{4s-1}/b f = q 4 s − 1 / b , and along with the fact that ( q 6 s + 1 − n ; q 2 ) k = 0 (q^{6s+1-n};q^2)_k=0 ( q 6 s + 1 − n ; q 2 ) k = 0 for k > n − 1 2 + s k>\frac{n-1}{2}+s k > 2 n − 1 + s , we have
∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 − n 1 − q 6 s + 1 − n ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 − n ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k ( a q 8 s + 4 − n , q 4 s + 4 − n / a , q 4 ; q 4 ) k ( b q 2 s + 4 − n ; q 2 ) k b k q k 2 + 2 k s + 3 k − n k = ( q 6 s + 3 − n , q 6 s + 5 − n , b q 5 − n / a , a b q 4 s + 5 − n ; q 4 ) ∞ ( b q 2 s + 4 − n , b q 2 s + 6 − n , q 4 s + 4 − n / a , a q 8 s + 4 − n ; q 4 ) ∞ = 0. \begin{aligned}
\sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1-n}}{1-q^{6s+1-n}}\frac{(aq^{2s+1},q^{1-2s}/a,q^{6s+1-n};q^2)_k(q^{4s-1}/b;q^4)_k}{(aq^{8s+4-n},q^{4s+4-n}/a,q^4;q^4)_k(bq^{2s+4-n};q^2)_k}b^kq^{k^2+2ks+3k-nk} \\
&=\frac{(q^{6s+3-n},q^{6s+5-n},bq^{5-n}/a,abq^{4s+5-n};q^4)_\infty}{(bq^{2s+4-n},bq^{2s+6-n},q^{4s+4-n}/a,aq^{8s+4-n};q^4)_\infty}=0.
\end{aligned} k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 − n 1 − q 6 k + 6 s + 1 − n ( a q 8 s + 4 − n , q 4 s + 4 − n / a , q 4 ; q 4 ) k ( b q 2 s + 4 − n ; q 2 ) k ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 − n ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k b k q k 2 + 2 k s + 3 k − nk = ( b q 2 s + 4 − n , b q 2 s + 6 − n , q 4 s + 4 − n / a , a q 8 s + 4 − n ; q 4 ) ∞ ( q 6 s + 3 − n , q 6 s + 5 − n , b q 5 − n / a , ab q 4 s + 5 − n ; q 4 ) ∞ = 0.
The last equality follows from
( q 6 s + 3 − n , q 6 s + 5 − n ; q 4 ) ∞ = ( q 6 s + 3 − n ; q 2 ) ∞ = 0 , \left(q^{6s+3-n},q^{6s+5-n};q^{4}\right)_{\infty}=\left(q^{6s+3-n};q^{2}\right)_{\infty}=0, ( q 6 s + 3 − n , q 6 s + 5 − n ; q 4 ) ∞ = ( q 6 s + 3 − n ; q 2 ) ∞ = 0 ,
because 6 s + 3 − n 6s+3-n 6 s + 3 − n is a nonpositive even integer. Using q n ≡ 1 ( m o d Φ n ( q ) ) q^{n}\equiv1\pmod{\Phi_{n}(q)} q n ≡ 1 ( mod Φ n ( q )) , we may therefore remove each shift by − n -n − n in the parameters and replace q − n k q^{-nk} q − nk by 1. It follows that modulo Φ n ( q ) \Phi_{n}(q) Φ n ( q ) ,
∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 1 − q 6 s + 1 ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k ( a q 8 s + 4 , q 4 s + 4 / a , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k b k q k 2 + 2 s k + 3 k ≡ 0. \sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1}}{1-q^{6s+1}}\frac{\left(aq^{2s+1},q^{1-2s}/a,q^{6s+1};q^{2}\right)_{k}\left(q^{4s-1}/b;q^{4}\right)_{k}}{\left(aq^{8s+4},q^{4s+4}/a,q^{4};q^{4}\right)_{k}\left(bq^{2s+4};q^{2}\right)_{k}}b^{k}q^{k^{2}+2sk+3k}\equiv0. k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 1 − q 6 k + 6 s + 1 ( a q 8 s + 4 , q 4 s + 4 / a , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k b k q k 2 + 2 s k + 3 k ≡ 0.
Plugging this into (11) , we complete the proof.
Lemma 2.2. Let n > 1 n>1 n > 1 be a positive integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be a non-negative integer. Then, modulo a − q n a-q^{n} a − q n ,
T n , s ( a , b ; q ) = ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( b q 5 / a ; q 4 ) n + 1 4 ( q 4 / a ; q 4 ) n + 1 4 ( b q 4 ; q 4 ) n + 1 4 ( a b q 5 ; q 4 ) s b s q s 2 + 3 s . (12) T_{n,s}(a,b;q)=\frac{(aq;q^{2})_{s}(q/a;q^{2})_{-s}(q^{-1}/b;q^{4})_{s}(q^{3};q^{4})_{\frac{n+1}{4}}(bq^{5}/a;q^{4})_{\frac{n+1}{4}}}{(q^{4}/a;q^{4})_{\frac{n+1}{4}}(bq^{4};q^{4})_{\frac{n+1}{4}}(abq^{5};q^{4})_{s}}b^{s}q^{s^{2}+3s}. \tag*{(12)} T n , s ( a , b ; q ) = ( q 4 / a ; q 4 ) 4 n + 1 ( b q 4 ; q 4 ) 4 n + 1 ( ab q 5 ; q 4 ) s ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 ( b q 5 / a ; q 4 ) 4 n + 1 b s q s 2 + 3 s . (12)
Proof. Letting a = q n a=q^{n} a = q n in (9) , we obtain that T n , s ( q n , b ; q ) T_{n,s}(q^{n},b;q) T n , s ( q n , b ; q ) is equal to
∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( q 1 + n ; q 2 ) k ( q 1 − n ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 / b ; q 4 ) k b k q k 2 + 3 k ( q 4 + n ; q 4 ) k + s ( q 4 − n ; q 4 ) k ( q 4 ; q 4 ) k − s ( b q 4 ; q 2 ) k = [ 6 s + 1 ] ( q 1 + n ; q 2 ) s ( q 1 − n ; q 2 ) − s ( q ; q 2 ) 3 s ( q − 1 / b ; q 4 ) s ( q 4 + n ; q 4 ) 2 s ( q 4 − n ; q 4 ) s ( b q 4 ; q 2 ) s b s q s 2 + 3 s × ∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 1 − q 6 s + 1 ( q 2 s + 1 + n , q 1 − 2 s − n , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k ( q 8 s + 4 + n , q 4 s + 4 − n , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k b k q k 2 + 2 k s + 3 k . (13) \begin{aligned}
&\sum_{k=s}^{\frac{n-1}{2}+2s}[6k+1]\frac{(q^{1+n};q^{2})_{k}(q^{1-n};q^{2})_{k-2s}(q;q^{2})_{k+2s}(q^{-1}/b;q^{4})_{k}b^{k}q^{k^{2}+3k}}{(q^{4+n};q^{4})_{k+s}(q^{4-n};q^{4})_{k}(q^{4};q^{4})_{k-s}(bq^{4};q^{2})_{k}}\\
&=[6s+1]\frac{(q^{1+n};q^{2})_{s}(q^{1-n};q^{2})_{-s}(q;q^{2})_{3s}(q^{-1}/b;q^{4})_{s}}{(q^{4+n};q^{4})_{2s}(q^{4-n};q^{4})_{s}(bq^{4};q^{2})_{s}}b^{s}q^{s^{2}+3s}\\
&\quad\times\sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1}}{1-q^{6s+1}}\frac{(q^{2s+1+n},q^{1-2s-n},q^{6s+1};q^{2})_{k}(q^{4s-1}/b;q^{4})_{k}}{(q^{8s+4+n},q^{4s+4-n},q^{4};q^{4})_{k}(bq^{2s+4};q^{2})_{k}}b^{k}q^{k^{2}+2ks+3k}. \tag*{(13)}
\end{aligned} k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( q 4 + n ; q 4 ) k + s ( q 4 − n ; q 4 ) k ( q 4 ; q 4 ) k − s ( b q 4 ; q 2 ) k ( q 1 + n ; q 2 ) k ( q 1 − n ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 / b ; q 4 ) k b k q k 2 + 3 k = [ 6 s + 1 ] ( q 4 + n ; q 4 ) 2 s ( q 4 − n ; q 4 ) s ( b q 4 ; q 2 ) s ( q 1 + n ; q 2 ) s ( q 1 − n ; q 2 ) − s ( q ; q 2 ) 3 s ( q − 1 / b ; q 4 ) s b s q s 2 + 3 s × k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 1 − q 6 k + 6 s + 1 ( q 8 s + 4 + n , q 4 s + 4 − n , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k ( q 2 s + 1 + n , q 1 − 2 s − n , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k b k q k 2 + 2 k s + 3 k . (13)
Setting q ↦ q 2 q\mapsto q^{2} q ↦ q 2 , a = q 6 s + 1 a=q^{6s+1} a = q 6 s + 1 , b = q 2 s + n + 1 b=q^{2s+n+1} b = q 2 s + n + 1 and f = q 4 s − 1 / b f=q^{4s-1}/b f = q 4 s − 1 / b in (8) , we have
∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 1 − q 6 s + 1 ( q 2 s + 1 + n , q 1 − 2 s − n , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k ( q 8 s + 4 + n , q 4 s + 4 − n , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k b k q k 2 + 2 k s + 3 k = ( q 6 s + 3 , q 6 s + 5 , b q 5 − n , b q 4 s + n + 5 ; q 4 ) ∞ ( b q 2 s + 4 , b q 2 s + 6 , q 4 s − n + 4 , q 8 s + n + 4 ; q 4 ) ∞ , \begin{aligned}
&\sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1}}{1-q^{6s+1}}\frac{(q^{2s+1+n},q^{1-2s-n},q^{6s+1};q^{2})_{k}(q^{4s-1}/b;q^{4})_{k}}{(q^{8s+4+n},q^{4s+4-n},q^{4};q^{4})_{k}(bq^{2s+4};q^{2})_{k}}b^{k}q^{k^{2}+2ks+3k}\\
&=\frac{(q^{6s+3},q^{6s+5},bq^{5-n},bq^{4s+n+5};q^{4})_{\infty}}{(bq^{2s+4},bq^{2s+6},q^{4s-n+4},q^{8s+n+4};q^{4})_{\infty}},
\end{aligned} k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 1 − q 6 k + 6 s + 1 ( q 8 s + 4 + n , q 4 s + 4 − n , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k ( q 2 s + 1 + n , q 1 − 2 s − n , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k b k q k 2 + 2 k s + 3 k = ( b q 2 s + 4 , b q 2 s + 6 , q 4 s − n + 4 , q 8 s + n + 4 ; q 4 ) ∞ ( q 6 s + 3 , q 6 s + 5 , b q 5 − n , b q 4 s + n + 5 ; q 4 ) ∞ ,
where we use that ( q 1 − 2 s − n ; q 2 ) k = 0 (q^{1-2s-n};q^{2})_{k}=0 ( q 1 − 2 s − n ; q 2 ) k = 0 for k > n − 1 2 + s k>\frac{n-1}{2}+s k > 2 n − 1 + s . Then we can express the right-hand side of (2.6) as
( q 1 + n ; q 2 ) s ( q 1 − n ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( b q 5 − n ; q 4 ) n + 1 4 ( q 4 − n ; q 4 ) n + 1 4 ( b q 4 ; q 4 ) n + 1 4 ( b q n + 5 ; q 4 ) s b s q s 2 + 3 s . \frac{(q^{1+n};q^{2})_{s}(q^{1-n};q^{2})_{-s}(q^{-1}/b;q^{4})_{s}(q^{3};q^{4})_{\frac{n+1}{4}}(bq^{5-n};q^{4})_{\frac{n+1}{4}}}{(q^{4-n};q^{4})_{\frac{n+1}{4}}(bq^{4};q^{4})_{\frac{n+1}{4}}(bq^{n+5};q^{4})_{s}}b^{s}q^{s^{2}+3s}. ( q 4 − n ; q 4 ) 4 n + 1 ( b q 4 ; q 4 ) 4 n + 1 ( b q n + 5 ; q 4 ) s ( q 1 + n ; q 2 ) s ( q 1 − n ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 ( b q 5 − n ; q 4 ) 4 n + 1 b s q s 2 + 3 s .
This is the a = q n a=q^{n} a = q n case of the right-hand side of (2.5). Namely, the q q q -congruence (2.5) holds.
Lemma 2.3. Let n > 1 n>1 n > 1 be a positive integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n − 1 2 0\le s\le\frac{n-1}{2} 0 ≤ s ≤ 2 n − 1 . Then, modulo 1 − a q n 1-aq^n 1 − a q n ,
T n , s ( a , b ; q ) ≡ ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( a b q 5 ; q 4 ) n + 1 4 ( a b q 5 ; q 4 ) s ( a q 4 ; q 4 ) n + 1 4 ( b q 4 ; q 4 ) n + 1 4 b s q s 2 + 3 s . (14) T_{n,s}(a,b;q)\equiv\frac{(aq;q^2)_s(q/a;q^2)_{-s}(q^{-1}/b;q^4)_s(q^3;q^4)_{\frac{n+1}{4}}(abq^5;q^4)_{\frac{n+1}{4}}}{(abq^5;q^4)_s(aq^4;q^4)_{\frac{n+1}{4}}(bq^4;q^4)_{\frac{n+1}{4}}}b^sq^{s^2+3s}. \tag*{(14)} T n , s ( a , b ; q ) ≡ ( ab q 5 ; q 4 ) s ( a q 4 ; q 4 ) 4 n + 1 ( b q 4 ; q 4 ) 4 n + 1 ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 ( ab q 5 ; q 4 ) 4 n + 1 b s q s 2 + 3 s . (14)
Proof. Setting a = q − n a=q^{-n} a = q − n in (9) , we have that T n , s ( q − n , b ; q ) T_{n,s}(q^{-n},b;q) T n , s ( q − n , b ; q ) is
∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( q 1 − n ; q 2 ) k ( q 1 + n ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 / b ; q 4 ) k ( q 4 − n ; q 4 ) k + s ( q 4 + n ; q 4 ) k ( q 4 ; q 4 ) k − s ( b q 4 ; q 2 ) k q k 2 + 3 k b k = [ 6 s + 1 ] ( q 1 − n ; q 2 ) s ( q 1 + n ; q 2 ) − s ( q ; q 2 ) 3 s ( q − 1 / b ; q 4 ) s ( q 4 − n ; q 4 ) 2 s ( q 4 + n ; q 4 ) s ( b q 4 ; q 2 ) s b s q s 2 + 3 s × ∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 1 − q 6 s + 1 ( q 2 s + 1 − n , q 1 − 2 s + n , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k ( q 8 s + 4 − n , q 4 s + 4 + n , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k b k q k 2 + 2 k s + 3 k . (15) \begin{aligned}
&\sum_{k=s}^{\frac{n-1}{2}+2s}[6k+1]\frac{(q^{1-n};q^2)_k(q^{1+n};q^2)_{k-2s}(q;q^2)_{k+2s}(q^{-1}/b;q^4)_k}{(q^{4-n};q^4)_{k+s}(q^{4+n};q^4)_k(q^4;q^4)_{k-s}(bq^4;q^2)_k}q^{k^2+3k}b^k \\
&=[6s+1]\frac{(q^{1-n};q^2)_s(q^{1+n};q^2)_{-s}(q;q^2)_{3s}(q^{-1}/b;q^4)_s}{(q^{4-n};q^4)_{2s}(q^{4+n};q^4)_s(bq^4;q^2)_s}b^sq^{s^2+3s} \\
&\quad\times\sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1}}{1-q^{6s+1}}\frac{(q^{2s+1-n},q^{1-2s+n},q^{6s+1};q^2)_k(q^{4s-1}/b;q^4)_k}{(q^{8s+4-n},q^{4s+4+n},q^4;q^4)_k(bq^{2s+4};q^2)_k}b^kq^{k^2+2ks+3k}. \tag*{(15)}
\end{aligned} k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( q 4 − n ; q 4 ) k + s ( q 4 + n ; q 4 ) k ( q 4 ; q 4 ) k − s ( b q 4 ; q 2 ) k ( q 1 − n ; q 2 ) k ( q 1 + n ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 / b ; q 4 ) k q k 2 + 3 k b k = [ 6 s + 1 ] ( q 4 − n ; q 4 ) 2 s ( q 4 + n ; q 4 ) s ( b q 4 ; q 2 ) s ( q 1 − n ; q 2 ) s ( q 1 + n ; q 2 ) − s ( q ; q 2 ) 3 s ( q − 1 / b ; q 4 ) s b s q s 2 + 3 s × k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 1 − q 6 k + 6 s + 1 ( q 8 s + 4 − n , q 4 s + 4 + n , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k ( q 2 s + 1 − n , q 1 − 2 s + n , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k b k q k 2 + 2 k s + 3 k . (15)
Because 0 ≤ s ≤ n − 1 2 0\le s\le\frac{n-1}{2} 0 ≤ s ≤ 2 n − 1 , one can verify that ( q 2 s + 1 − n ; q 2 ) k = 0 (q^{2s+1-n};q^2)_k=0 ( q 2 s + 1 − n ; q 2 ) k = 0 if k > n − 1 2 − s k>\frac{n-1}{2}-s k > 2 n − 1 − s . Then applying (8) with q ↦ q 2 q\mapsto q^2 q ↦ q 2 , a = q 6 s + 1 a=q^{6s+1} a = q 6 s + 1 , b = q 2 s − n + 1 b=q^{2s-n+1} b = q 2 s − n + 1 and f = q 4 s − 1 / b f=q^{4s-1}/b f = q 4 s − 1 / b , we have
∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 1 − q 6 s + 1 ( q 2 s + 1 − n , q 1 − 2 s + n , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k ( q 8 s + 4 − n , q 4 s + 4 + n , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k b k q k 2 + 2 k s + 3 k = ( q 6 s + 3 , q 6 s + 5 , b q 5 + n , b q 4 s − n + 5 ; q 4 ) ∞ ( b q 2 s + 4 , b q 2 s + 6 , q 4 s + n + 4 , q 8 s − n + 4 ; q 4 ) ∞ . \begin{aligned}
&\sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1}}{1-q^{6s+1}}\frac{(q^{2s+1-n},q^{1-2s+n},q^{6s+1};q^2)_k(q^{4s-1}/b;q^4)_k}{(q^{8s+4-n},q^{4s+4+n},q^4;q^4)_k(bq^{2s+4};q^2)_k}b^kq^{k^2+2ks+3k}\\
&=\frac{(q^{6s+3},q^{6s+5},bq^{5+n},bq^{4s-n+5};q^4)_\infty}{(bq^{2s+4},bq^{2s+6},q^{4s+n+4},q^{8s-n+4};q^4)_\infty}.
\end{aligned} k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 1 − q 6 k + 6 s + 1 ( q 8 s + 4 − n , q 4 s + 4 + n , q 4 ; q 4 ) k ( b q 2 s + 4 ; q 2 ) k ( q 2 s + 1 − n , q 1 − 2 s + n , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 / b ; q 4 ) k b k q k 2 + 2 k s + 3 k = ( b q 2 s + 4 , b q 2 s + 6 , q 4 s + n + 4 , q 8 s − n + 4 ; q 4 ) ∞ ( q 6 s + 3 , q 6 s + 5 , b q 5 + n , b q 4 s − n + 5 ; q 4 ) ∞ .
Hence, the right-hand side of (15) becomes
( q 1 − n ; q 2 ) s ( q 1 + n ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( b q − n + 5 ; q 4 ) n + 1 4 ( b q − n + 5 ; q 4 ) s ( q 4 − n ; q 4 ) n + 1 4 ( b q 4 ; q 4 ) n + 1 4 b s q s 2 + 3 s . \frac{(q^{1-n};q^2)_s(q^{1+n};q^2)_{-s}(q^{-1}/b;q^4)_s(q^3;q^4)_{\frac{n+1}{4}}(bq^{-n+5};q^4)_{\frac{n+1}{4}}}{(bq^{-n+5};q^4)_s(q^{4-n};q^4)_{\frac{n+1}{4}}(bq^4;q^4)_{\frac{n+1}{4}}}b^sq^{s^2+3s}. ( b q − n + 5 ; q 4 ) s ( q 4 − n ; q 4 ) 4 n + 1 ( b q 4 ; q 4 ) 4 n + 1 ( q 1 − n ; q 2 ) s ( q 1 + n ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 ( b q − n + 5 ; q 4 ) 4 n + 1 b s q s 2 + 3 s .
This implies our desired result.
Lemma 2.4. Let n > 1 n>1 n > 1 be a positive integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n + 1 4 0\le s\le\frac{n+1}{4} 0 ≤ s ≤ 4 n + 1 . Then, modulo b − q n b-q^n b − q n ,
T n , s ( a , b ; q ) ≡ ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) n + 1 4 ( a q 4 ; q 4 ) n + 1 4 ( a b q 5 ; q 4 ) s ( q 4 / a ; q 4 ) n + 1 4 b s q s 2 + 3 s . (16) T_{n,s}(a,b;q)\equiv\frac{(aq;q^2)_s(q/a;q^2)_{-s}(q^{-1}/b;q^4)_s(q^3;q^4)_{\frac{n+1}{4}}(q^5;q^4)_{\frac{n+1}{4}}}{(aq^4;q^4)_{\frac{n+1}{4}}(abq^5;q^4)_s(q^4/a;q^4)_{\frac{n+1}{4}}}b^sq^{s^2+3s}. \tag*{(16)} T n , s ( a , b ; q ) ≡ ( a q 4 ; q 4 ) 4 n + 1 ( ab q 5 ; q 4 ) s ( q 4 / a ; q 4 ) 4 n + 1 ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) 4 n + 1 b s q s 2 + 3 s . (16)
Proof. In view of (9) , we have that T n , s ( a , q n ; q ) T_{n,s}(a,q^n;q) T n , s ( a , q n ; q ) is equal to
∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( a q ; q 2 ) k ( q / a ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 − n ; q 4 ) k ( a q 4 ; q 4 ) k + s ( q 4 / a ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 + n ; q 2 ) k q k 2 + 3 k + n k = [ 6 s + 1 ] ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q ; q 2 ) 3 s ( q − 1 − n ; q 4 ) s ( a q 4 ; q 4 ) 2 s ( q 4 / a ; q 4 ) s ( q 4 + n ; q 2 ) s q s 2 + 3 s + n s × ∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 1 − q 6 s + 1 ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 − n ; q 4 ) k ( a q 8 s + 4 , q 4 s + 4 / a , q 4 ; q 4 ) k ( q 2 s + 4 + n ; q 2 ) k q k 2 + 2 k s + 3 k + n k . (17) \begin{aligned}
\sum_{k=s}^{\frac{n-1}{2}+2s}[6k+1]\frac{(aq;q^2)_k(q/a;q^2)_{k-2s}(q;q^2)_{k+2s}(q^{-1-n};q^4)_k}{(aq^4;q^4)_{k+s}(q^4/a;q^4)_k(q^4;q^4)_{k-s}(q^{4+n};q^2)_k}q^{k^2+3k+nk} \\
&= [6s+1]\frac{(aq;q^2)_s(q/a;q^2)_{-s}(q;q^2)_{3s}(q^{-1-n};q^4)_s}{(aq^4;q^4)_{2s}(q^4/a;q^4)_s(q^{4+n};q^2)_s}q^{s^2+3s+ns} \\
&\times\sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1}}{1-q^{6s+1}}\frac{(aq^{2s+1},q^{1-2s}/a,q^{6s+1};q^2)_k(q^{4s-1-n};q^4)_k}{(aq^{8s+4},q^{4s+4}/a,q^4;q^4)_k(q^{2s+4+n};q^2)_k}q^{k^2+2ks+3k+nk}. \tag*{(17)}
\end{aligned} k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( a q 4 ; q 4 ) k + s ( q 4 / a ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 + n ; q 2 ) k ( a q ; q 2 ) k ( q / a ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 − n ; q 4 ) k q k 2 + 3 k + nk = [ 6 s + 1 ] ( a q 4 ; q 4 ) 2 s ( q 4 / a ; q 4 ) s ( q 4 + n ; q 2 ) s ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q ; q 2 ) 3 s ( q − 1 − n ; q 4 ) s q s 2 + 3 s + n s × k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 1 − q 6 k + 6 s + 1 ( a q 8 s + 4 , q 4 s + 4 / a , q 4 ; q 4 ) k ( q 2 s + 4 + n ; q 2 ) k ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 − n ; q 4 ) k q k 2 + 2 k s + 3 k + nk . (17)
Since 0 ≤ s ≤ n + 1 4 0\le s\le\frac{n+1}{4} 0 ≤ s ≤ 4 n + 1 , we see that ( q 4 s − 1 − n ; q 4 ) k = 0 (q^{4s-1-n};q^4)_k=0 ( q 4 s − 1 − n ; q 4 ) k = 0 when k > n + 1 4 − s k>\frac{n+1}{4}-s k > 4 n + 1 − s . Then performing the parameter substitutions q ↦ q 2 q\mapsto q^2 q ↦ q 2 , a = q 6 s + 1 a=q^{6s+1} a = q 6 s + 1 , b = a q 2 s + 1 b=aq^{2s+1} b = a q 2 s + 1 and f = q 4 s − 1 − n f=q^{4s-1-n} f = q 4 s − 1 − n in (8) gives
∑ k = 0 n − 1 2 + s 1 − q 6 k + 6 s + 1 1 − q 6 s + 1 ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 − n ; q 4 ) k ( a q 8 s + 4 , q 4 s + 4 / a , q 4 ; q 4 ) k ( q 2 s + 4 + n ; q 2 ) k q k 2 + 2 k s + 3 k + n k = ( q 6 s + 3 , q 6 s + 5 , q 5 + n / a , a q 4 s + n + 5 ; q 4 ) ∞ ( q 2 s + 4 + n , q 2 s + 6 + n , q 4 s + 4 / a , a q 8 s + 4 ; q 4 ) ∞ . \begin{aligned}
\sum_{k=0}^{\frac{n-1}{2}+s}\frac{1-q^{6k+6s+1}}{1-q^{6s+1}}\frac{(aq^{2s+1},q^{1-2s}/a,q^{6s+1};q^2)_k(q^{4s-1-n};q^4)_k}{(aq^{8s+4},q^{4s+4}/a,q^4;q^4)_k(q^{2s+4+n};q^2)_k}q^{k^2+2ks+3k+nk} \\
&=\frac{(q^{6s+3},q^{6s+5},q^{5+n}/a,aq^{4s+n+5};q^4)_\infty}{(q^{2s+4+n},q^{2s+6+n},q^{4s+4}/a,aq^{8s+4};q^4)_\infty}.
\end{aligned} k = 0 ∑ 2 n − 1 + s 1 − q 6 s + 1 1 − q 6 k + 6 s + 1 ( a q 8 s + 4 , q 4 s + 4 / a , q 4 ; q 4 ) k ( q 2 s + 4 + n ; q 2 ) k ( a q 2 s + 1 , q 1 − 2 s / a , q 6 s + 1 ; q 2 ) k ( q 4 s − 1 − n ; q 4 ) k q k 2 + 2 k s + 3 k + nk = ( q 2 s + 4 + n , q 2 s + 6 + n , q 4 s + 4 / a , a q 8 s + 4 ; q 4 ) ∞ ( q 6 s + 3 , q 6 s + 5 , q 5 + n / a , a q 4 s + n + 5 ; q 4 ) ∞ .
Consequently, the right-hand side of (17) can be rewritten as
( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 − n ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) n + 1 4 ( a q 4 ; q 4 ) n + 1 4 ( a q 5 + n ; q 4 ) s ( q 4 / a ; q 4 ) n + 1 4 q s 2 + 3 s + n s , \frac{(aq;q^2)_s(q/a;q^2)_{-s}(q^{-1-n};q^4)_s(q^3;q^4)_{\frac{n+1}{4}}(q^5;q^4)_{\frac{n+1}{4}}}{(aq^4;q^4)_{\frac{n+1}{4}}(aq^{5+n};q^4)_s(q^4/a;q^4)_{\frac{n+1}{4}}}q^{s^2+3s+ns}, ( a q 4 ; q 4 ) 4 n + 1 ( a q 5 + n ; q 4 ) s ( q 4 / a ; q 4 ) 4 n + 1 ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 − n ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) 4 n + 1 q s 2 + 3 s + n s ,
which completes the proof.
Proofs of Theorems 1.1 and 1.2
In this section, we prove Theorems 1.1 and 1.2 by the creative microscoping method. To this end, we provide two parametric extensions. Building on the lemmas established in § 2 and the Chinese remainder theorem, we first derive the following parametric extension, which is used to prove Theorem 1.1.
Proposition 3.1. Let n > 1 n>1 n > 1 be a positive integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n − 1 6 0\le s\le\frac{n-1}{6} 0 ≤ s ≤ 6 n − 1 . Then, modulo Φ n ( q ) ( a − q n ) ( 1 − a q n ) \Phi_n(q)(a-q^n)(1-aq^n) Φ n ( q ) ( a − q n ) ( 1 − a q n ) ,
T n , s ( a , b ; q ) ≡ ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( a b q 5 ; q 4 ) s ( b q 4 ; q 4 ) n + 1 4 [ 1 − a q n 1 − a 2 ( b q 5 / a ; q 4 ) n + 1 4 ( q 4 / a ; q 4 ) n + 1 4 − a ( a − q n ) 1 − a 2 ( a b q 5 ; q 4 ) n + 1 4 ( a q 4 ; q 4 ) n + 1 4 ] b s q s 2 + 3 s . (18) T_{n,s}(a,b;q)\equiv\frac{(aq;q^2)_s(q/a;q^2)_{-s}(q^{-1}/b;q^4)_s(q^3;q^4)_{\frac{n+1}{4}}}{(abq^5;q^4)_s(bq^4;q^4)_{\frac{n+1}{4}}}
\left[\frac{1-aq^n}{1-a^2}\frac{(bq^5/a;q^4)_{\frac{n+1}{4}}}{(q^4/a;q^4)_{\frac{n+1}{4}}}-\frac{a(a-q^n)}{1-a^2}\frac{(abq^5;q^4)_{\frac{n+1}{4}}}{(aq^4;q^4)_{\frac{n+1}{4}}}\right]b^sq^{s^2+3s}. \tag*{(18)} T n , s ( a , b ; q ) ≡ ( ab q 5 ; q 4 ) s ( b q 4 ; q 4 ) 4 n + 1 ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 [ 1 − a 2 1 − a q n ( q 4 / a ; q 4 ) 4 n + 1 ( b q 5 / a ; q 4 ) 4 n + 1 − 1 − a 2 a ( a − q n ) ( a q 4 ; q 4 ) 4 n + 1 ( ab q 5 ; q 4 ) 4 n + 1 ] b s q s 2 + 3 s . (18) Proof. Note that 1 − a q n 1-aq^n 1 − a q n and a − q n a-q^n a − q n are coprime polynomials. Applying the Chinese remainder theorem for coprime polynomials, together with Lemmas 2.2 and 2.3, we can deduce the remainder of T n , s ( a , b ; q ) T_{n,s}(a,b;q) T n , s ( a , b ; q ) modulo ( 1 − a q n ) ( a − q n ) (1-aq^n)(a-q^n) ( 1 − a q n ) ( a − q n ) . Thus, using
1 − a q n 1 − a 2 ≡ 1 ( m o d ( a − q n ) ) and − a ( a − q n ) 1 − a 2 ≡ 1 ( m o d ( 1 − a q n ) ) , \frac{1-aq^n}{1-a^2}\equiv1\pmod{(a-q^n)}
\qquad\text{and}\qquad
\frac{-a(a-q^n)}{1-a^2}\equiv1\pmod{(1-aq^n)}, 1 − a 2 1 − a q n ≡ 1 ( mod ( a − q n )) and 1 − a 2 − a ( a − q n ) ≡ 1 ( mod ( 1 − a q n )) ,
we conclude that (18) holds modulo ( a − q n ) ( 1 − a q n ) (a-q^n)(1-aq^n) ( a − q n ) ( 1 − a q n ) .
Moreover, it is obvious that Φ n ( q ) \Phi_n(q) Φ n ( q ) and ( 1 − a q n ) ( a − q n ) (1-aq^n)(a-q^n) ( 1 − a q n ) ( a − q n ) are coprime polynomials. Since the factor ( q 3 ; q 4 ) n + 1 4 (q^3;q^4)_{\frac{n+1}{4}} ( q 3 ; q 4 ) 4 n + 1 on the right-hand side of (18) contains 1 − q n 1-q^n 1 − q n , the right-hand side of (18) vanishes modulo Φ n ( q ) \Phi_n(q) Φ n ( q ) . By Lemma 2.1 , we can deduce that (18) holds modulo Φ n ( q ) ( 1 − a q n ) ( a − q n ) \Phi_n(q)(1-aq^n)(a-q^n) Φ n ( q ) ( 1 − a q n ) ( a − q n ) . This completes the proof.
We next give a parametric congruence, which enables us to verify Theorem 1.2 .
Proposition 3.2. Let n > 1 n>1 n > 1 be a positive integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n − 1 6 0\leq s\leq\frac{n-1}{6} 0 ≤ s ≤ 6 n − 1 . Then, modulo Φ n ( q ) 2 ( a − q n ) ( 1 − a q n ) \Phi_n(q)^2(a-q^n)(1-aq^n) Φ n ( q ) 2 ( a − q n ) ( 1 − a q n ) ,
T n , s ( a , 1 ; q ) ≡ ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 ; q 4 ) s ( a q 5 ; q 4 ) s q s 2 + 3 s { ( q 3 , q 5 − n ; q 4 ) n + 1 4 ( q 4 − n , q 4 ; q 4 ) n + 1 4 + ( q 3 , q 5 ; q 4 ) n + 1 4 ( a q 4 , q 4 / a ; q 4 ) n + 1 4 − ( q 3 , q 5 ; q 4 ) n + 1 4 ( q 4 − n , q 4 + n ; q 4 ) n + 1 4 } . (19) T_{n,s}(a,1;q)\equiv\frac{(aq;q^2)_s(q/a;q^2)_{-s}(q^{-1};q^4)_s}{(aq^5;q^4)_s}q^{s^2+3s}\left\{\frac{(q^3,q^{5-n};q^4)_{\frac{n+1}{4}}}{(q^{4-n},q^4;q^4)_{\frac{n+1}{4}}}+\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(aq^4,q^4/a;q^4)_{\frac{n+1}{4}}}-\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(q^{4-n},q^{4+n};q^4)_{\frac{n+1}{4}}}\right\}. \tag*{(19)} T n , s ( a , 1 ; q ) ≡ ( a q 5 ; q 4 ) s ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 ; q 4 ) s q s 2 + 3 s { ( q 4 − n , q 4 ; q 4 ) 4 n + 1 ( q 3 , q 5 − n ; q 4 ) 4 n + 1 + ( a q 4 , q 4 / a ; q 4 ) 4 n + 1 ( q 3 , q 5 ; q 4 ) 4 n + 1 − ( q 4 − n , q 4 + n ; q 4 ) 4 n + 1 ( q 3 , q 5 ; q 4 ) 4 n + 1 } . (19)
Proof. We first prove the following two-parameter congruence, modulo Φ n ( q ) ( a − q n ) ( 1 − a q n ) ( b − q n ) \Phi_n(q)(a-q^n)(1-aq^n)(b-q^n) Φ n ( q ) ( a − q n ) ( 1 − a q n ) ( b − q n ) :
T n , s ( a , b ; q ) ≡ ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s ( a b q 5 ; q 4 ) s b s q s 2 + 3 s { ( q 3 , b q 5 − n ; q 4 ) n + 1 4 ( q 4 − n , b q 4 ; q 4 ) n + 1 4 + ( q 3 , q 5 ; q 4 ) n + 1 4 ( a q 4 , q 4 / a ; q 4 ) n + 1 4 − ( q 3 , q 5 ; q 4 ) n + 1 4 ( q 4 − n , q 4 + n ; q 4 ) n + 1 4 } . (20) T_{n,s}(a,b;q)\equiv\frac{(aq;q^2)_s(q/a;q^2)_{-s}(q^{-1}/b;q^4)_s}{(abq^5;q^4)_s}b^sq^{s^2+3s}\left\{\frac{(q^3,bq^{5-n};q^4)_{\frac{n+1}{4}}}{(q^{4-n},bq^4;q^4)_{\frac{n+1}{4}}}+\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(aq^4,q^4/a;q^4)_{\frac{n+1}{4}}}-\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(q^{4-n},q^{4+n};q^4)_{\frac{n+1}{4}}}\right\}. \tag*{(20)} T n , s ( a , b ; q ) ≡ ( ab q 5 ; q 4 ) s ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 / b ; q 4 ) s b s q s 2 + 3 s { ( q 4 − n , b q 4 ; q 4 ) 4 n + 1 ( q 3 , b q 5 − n ; q 4 ) 4 n + 1 + ( a q 4 , q 4 / a ; q 4 ) 4 n + 1 ( q 3 , q 5 ; q 4 ) 4 n + 1 − ( q 4 − n , q 4 + n ; q 4 ) 4 n + 1 ( q 3 , q 5 ; q 4 ) 4 n + 1 } . (20)
For a = q n a=q^n a = q n or a = q − n a=q^{-n} a = q − n , the second and third fractions in braces cancel exactly. The remaining expression agrees with the corresponding evaluation in Lemma 2.2 or Lemma 2.3 , respectively. Thus (20) holds modulo ( a − q n ) ( 1 − a q n ) (a-q^n)(1-aq^n) ( a − q n ) ( 1 − a q n ) . For b = q n b=q^n b = q n , the first and third fractions cancel exactly, and the remaining expression is the one in Lemma 2.4 . Hence (20) also holds modulo b − q n b-q^n b − q n .
Every fraction in braces contains ( q 3 ; q 4 ) n + 1 4 (q^3;q^4)_{\frac{n+1}{4}} ( q 3 ; q 4 ) 4 n + 1 in its numerator, and hence contains 1 − q n 1-q^n 1 − q n . Its denominator is relatively prime to Φ n ( q ) \Phi_n(q) Φ n ( q ) for generic a , b a,b a , b . Indeed, none of 4 j − n 4j-n 4 j − n and 4 j + n 4j+n 4 j + n , with 1 ≤ j ≤ ( n + 1 ) / 4 < n 1\leq j\leq(n+1)/4<n 1 ≤ j ≤ ( n + 1 ) /4 < n , is divisible by n n n . By Lemma 2.1 , both sides of (20) therefore vanish modulo Φ n ( q ) \Phi_n(q) Φ n ( q ) . The four polynomial factors Φ n ( q ) \Phi_n(q) Φ n ( q ) , a − q n a-q^n a − q n , 1 − a q n 1-aq^n 1 − a q n , and b − q n b-q^n b − q n are pairwise relatively prime, and all denominators are relatively prime to their product. Combining these congruences after clearing denominators proves (20) .
We may now set b = 1 b=1 b = 1 . All specialized denominators remain relatively prime to Φ n ( q ) ( a − q n ) ( 1 − a q n ) \Phi_n(q)(a-q^n)(1-aq^n) Φ n ( q ) ( a − q n ) ( 1 − a q n ) . In particular, in the summands of T n , s T_{n,s} T n , s we have
k − s ≤ n − 1 2 + s < n , k ≤ n − 1 2 + 2 s ≤ n − 2 , k-s\leq\frac{n-1}{2}+s<n,\qquad k\leq\frac{n-1}{2}+2s\leq n-2, k − s ≤ 2 n − 1 + s < n , k ≤ 2 n − 1 + 2 s ≤ n − 2 ,
so neither ( q 4 ; q 4 ) k − s (q^4;q^4)_{k-s} ( q 4 ; q 4 ) k − s nor ( q 4 ; q 2 ) k (q^4;q^2)_k ( q 4 ; q 2 ) k contains Φ n ( q ) \Phi_n(q) Φ n ( q ) . The modulus in (20) becomes Φ n ( q ) ( 1 − q n ) ( a − q n ) ( 1 − a q n ) \Phi_n(q)(1-q^n)(a-q^n)(1-aq^n) Φ n ( q ) ( 1 − q n ) ( a − q n ) ( 1 − a q n ) , which is divisible by Φ n ( q ) 2 ( a − q n ) ( 1 − a q n ) \Phi_n(q)^2(a-q^n)(1-aq^n) Φ n ( q ) 2 ( a − q n ) ( 1 − a q n ) . This proves (19) .
With the help of Propositions 3.1 and 3.2, we are now in a position to prove Theorems 1.1 and 1.2.
Proof of Theorem 1.1. Putting b ↦ 1 b\mapsto1 b ↦ 1 in Proposition 3.1, we conclude that, modulo Φ n ( q ) ( a − q n ) ( 1 − a q n ) \Phi_n(q)(a-q^n)(1-aq^n) Φ n ( q ) ( a − q n ) ( 1 − a q n ) ,
T n , s ( a , 1 ; q ) ≡ ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( a q 5 ; q 4 ) s ( q 4 ; q 4 ) n + 1 4 [ 1 − a q n 1 − a 2 ( q 5 / a ; q 4 ) n + 1 4 ( q 4 / a ; q 4 ) n + 1 4 − a ( a − q n ) 1 − a 2 ( a q 5 ; q 4 ) n + 1 4 ( a q 4 ; q 4 ) n + 1 4 ] q s 2 + 3 s . T_{n,s}(a,1;q)\equiv\frac{(aq;q^2)_s(q/a;q^2)_{-s}(q^{-1};q^4)_s(q^3;q^4)_{\frac{n+1}{4}}}{(aq^5;q^4)_s(q^4;q^4)_{\frac{n+1}{4}}}\left[\frac{1-aq^n}{1-a^2}\frac{(q^5/a;q^4)_{\frac{n+1}{4}}}{(q^4/a;q^4)_{\frac{n+1}{4}}}-\frac{a(a-q^n)}{1-a^2}\frac{(aq^5;q^4)_{\frac{n+1}{4}}}{(aq^4;q^4)_{\frac{n+1}{4}}}\right]q^{s^2+3s}. T n , s ( a , 1 ; q ) ≡ ( a q 5 ; q 4 ) s ( q 4 ; q 4 ) 4 n + 1 ( a q ; q 2 ) s ( q / a ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 [ 1 − a 2 1 − a q n ( q 4 / a ; q 4 ) 4 n + 1 ( q 5 / a ; q 4 ) 4 n + 1 − 1 − a 2 a ( a − q n ) ( a q 4 ; q 4 ) 4 n + 1 ( a q 5 ; q 4 ) 4 n + 1 ] q s 2 + 3 s .
We now specialize a ↦ 1 a\mapsto1 a ↦ 1 . It is clear that ( 1 − q n ) 2 (1-q^n)^2 ( 1 − q n ) 2 contains the factor Φ n ( q ) 2 \Phi_n(q)^2 Φ n ( q ) 2 . By the L’Hôpital’s rule, we have
lim a → 1 [ 1 − a q n 1 − a 2 ( q 5 / a ; q 4 ) n + 1 4 ( q 4 / a ; q 4 ) n + 1 4 − a ( a − q n ) 1 − a 2 ( a q 5 ; q 4 ) n + 1 4 ( a q 4 ; q 4 ) n + 1 4 ] = ( q 5 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 [ 1 − ( 1 − q n ) ∑ j = 0 n − 3 4 ( q 4 j + 5 1 − q 4 j + 5 − q 4 j + 4 1 − q 4 j + 4 ) ] . (21) \begin{aligned}
\lim_{a\to1}\left[\frac{1-aq^n}{1-a^2}\frac{(q^5/a;q^4)_{\frac{n+1}{4}}}{(q^4/a;q^4)_{\frac{n+1}{4}}}-\frac{a(a-q^n)}{1-a^2}\frac{(aq^5;q^4)_{\frac{n+1}{4}}}{(aq^4;q^4)_{\frac{n+1}{4}}}\right]
&=\frac{(q^5;q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}}\left[1-(1-q^n)\sum_{j=0}^{\frac{n-3}{4}}\left(\frac{q^{4j+5}}{1-q^{4j+5}}-\frac{q^{4j+4}}{1-q^{4j+4}}\right)\right]. \tag*{(21)}
\end{aligned} a → 1 lim [ 1 − a 2 1 − a q n ( q 4 / a ; q 4 ) 4 n + 1 ( q 5 / a ; q 4 ) 4 n + 1 − 1 − a 2 a ( a − q n ) ( a q 4 ; q 4 ) 4 n + 1 ( a q 5 ; q 4 ) 4 n + 1 ] = ( q 4 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) 4 n + 1 1 − ( 1 − q n ) j = 0 ∑ 4 n − 3 ( 1 − q 4 j + 5 q 4 j + 5 − 1 − q 4 j + 4 q 4 j + 4 ) . (21)
Therefore, modulo Φ n ( q ) 3 \Phi_n(q)^3 Φ n ( q ) 3 ,
T n , s ( 1 , 1 ; q ) ≡ ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 3 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) s ( q 4 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 q s 2 + 3 s × [ 1 − ( 1 − q n ) ∑ j = 0 n − 3 4 ( q 4 j + 5 1 − q 4 j + 5 − q 4 j + 4 1 − q 4 j + 4 ) ] . \begin{aligned}
T_{n,s}(1,1;q)&\equiv\frac{(q;q^2)_s(q;q^2)_{-s}(q^{-1};q^4)_s(q^3;q^4)_{\frac{n+1}{4}}(q^5;q^4)_{\frac{n+1}{4}}}{(q^5;q^4)_s(q^4;q^4)_{\frac{n+1}{4}}(q^4;q^4)_{\frac{n+1}{4}}}q^{s^2+3s}\\
&\quad\times\left[1-(1-q^n)\sum_{j=0}^{\frac{n-3}{4}}\left(\frac{q^{4j+5}}{1-q^{4j+5}}-\frac{q^{4j+4}}{1-q^{4j+4}}\right)\right].
\end{aligned} T n , s ( 1 , 1 ; q ) ≡ ( q 5 ; q 4 ) s ( q 4 ; q 4 ) 4 n + 1 ( q 4 ; q 4 ) 4 n + 1 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 3 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) 4 n + 1 q s 2 + 3 s × 1 − ( 1 − q n ) j = 0 ∑ 4 n − 3 ( 1 − q 4 j + 5 q 4 j + 5 − 1 − q 4 j + 4 q 4 j + 4 ) .
Then, from the definition of T n , s ( a , b ; q ) T_{n,s}(a,b;q) T n , s ( a , b ; q ) given in (9) , to prove Theorem 1.1, it suffices to justify that
( q 3 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 [ 1 − ( 1 − q n ) ∑ j = 0 n − 3 4 ( q 4 j + 5 1 − q 4 j + 5 − q 4 j + 4 1 − q 4 j + 4 ) ] ≡ − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 ( m o d Φ n ( q ) 3 ) . (22) \begin{aligned}
\frac{(q^3;q^4)_{\frac{n+1}{4}}(q^5;q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}(q^4;q^4)_{\frac{n+1}{4}}}\left[1-(1-q^n)\sum_{j=0}^{\frac{n-3}{4}}\left(\frac{q^{4j+5}}{1-q^{4j+5}}-\frac{q^{4j+4}}{1-q^{4j+4}}\right)\right]
&\equiv-[n]\frac{q^{\frac{n+5}{4}}(q^{-2};q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}}
\pmod{\Phi_n(q)^3}. \tag*{(22)}
\end{aligned} ( q 4 ; q 4 ) 4 n + 1 ( q 4 ; q 4 ) 4 n + 1 ( q 3 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) 4 n + 1 1 − ( 1 − q n ) j = 0 ∑ 4 n − 3 ( 1 − q 4 j + 5 q 4 j + 5 − 1 − q 4 j + 4 q 4 j + 4 ) ≡ − [ n ] ( q 4 ; q 4 ) 4 n + 1 q 4 n + 5 ( q − 2 ; q 4 ) 4 n + 1 ( mod Φ n ( q ) 3 ) . (22)
Note that
q − n ≡ 1 + ( 1 − q n ) ( m o d Φ n ( q ) 2 ) , q^{-n}\equiv1+(1-q^n)\pmod{\Phi_n(q)^2}, q − n ≡ 1 + ( 1 − q n ) ( mod Φ n ( q ) 2 ) ,
since
q − n − 1 − ( 1 − q n ) = ( 1 − q n ) 2 q n . q^{-n}-1-(1-q^n)=\frac{(1-q^n)^2}{q^n}. q − n − 1 − ( 1 − q n ) = q n ( 1 − q n ) 2 .
Consequently, for 0 ≤ j ≤ ( n − 3 ) / 4 0 \le j \le(n-3)/4 0 ≤ j ≤ ( n − 3 ) /4 ,
1 − q 4 j + 5 − n 1 − q 4 j + 4 − n ≡ 1 − q 4 j + 5 1 − q 4 j + 4 [ 1 − ( 1 − q n ) ( q 4 j + 5 1 − q 4 j + 5 − q 4 j + 4 1 − q 4 j + 4 ) ] ( m o d Φ n ( q ) 2 ) . \frac{1-q^{4j+5-n}}{1-q^{4j+4-n}} \equiv\frac{1-q^{4j+5}}{1-q^{4j+4}}\left[1-(1-q^n)\left(\frac{q^{4j+5}}{1-q^{4j+5}}-\frac{q^{4j+4}}{1-q^{4j+4}}\right)\right]\pmod{\Phi_n(q)^2}. 1 − q 4 j + 4 − n 1 − q 4 j + 5 − n ≡ 1 − q 4 j + 4 1 − q 4 j + 5 [ 1 − ( 1 − q n ) ( 1 − q 4 j + 5 q 4 j + 5 − 1 − q 4 j + 4 q 4 j + 4 ) ] ( mod Φ n ( q ) 2 ) .
All denominators occurring here are relatively prime to Φ n ( q ) \Phi_n(q) Φ n ( q ) . Multiplying these congruences gives
( q 5 − n ; q 4 ) n + 1 4 ( q 4 − n ; q 4 ) n + 1 4 ≡ ( q 5 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 [ 1 − ( 1 − q n ) ∑ j = 0 n − 3 4 ( q 4 j + 5 1 − q 4 j + 5 − q 4 j + 4 1 − q 4 j + 4 ) ] ( m o d Φ n ( q ) 2 ) . \frac{(q^{5-n};q^4)_{\frac{n+1}{4}}}{(q^{4-n};q^4)_{\frac{n+1}{4}}}\equiv\frac{(q^5;q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}}\left[1-(1-q^n)\sum_{j=0}^{\frac{n-3}{4}}\left(\frac{q^{4j+5}}{1-q^{4j+5}}-\frac{q^{4j+4}}{1-q^{4j+4}}\right)\right]\pmod{\Phi_n(q)^2}. ( q 4 − n ; q 4 ) 4 n + 1 ( q 5 − n ; q 4 ) 4 n + 1 ≡ ( q 4 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) 4 n + 1 1 − ( 1 − q n ) j = 0 ∑ 4 n − 3 ( 1 − q 4 j + 5 q 4 j + 5 − 1 − q 4 j + 4 q 4 j + 4 ) ( mod Φ n ( q ) 2 ) .
Since ( q 3 ; q 4 ) n + 1 4 (q^3;q^4)_{\frac{n+1}{4}} ( q 3 ; q 4 ) 4 n + 1 contains the factor 1 − q n 1-q^n 1 − q n , it follows that
( q 3 ; q 4 ) n + 1 4 ( q 5 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 2 [ 1 − ( 1 − q n ) ∑ j = 0 n − 3 4 ( q 4 j + 5 1 − q 4 j + 5 − q 4 j + 4 1 − q 4 j + 4 ) ] ≡ ( q 3 ; q 4 ) n + 1 4 ( q 5 − n ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 ( q 4 − n ; q 4 ) n + 1 4 ( m o d Φ n ( q ) 3 ) . (23) \begin{aligned}
\frac{(q^3;q^4)_{\frac{n+1}{4}}(q^5;q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}^2}\left[1-(1-q^n)\sum_{j=0}^{\frac{n-3}{4}}\left(\frac{q^{4j+5}}{1-q^{4j+5}}-\frac{q^{4j+4}}{1-q^{4j+4}}\right)\right] \\
&\equiv\frac{(q^3;q^4)_{\frac{n+1}{4}}(q^{5-n};q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}(q^{4-n};q^4)_{\frac{n+1}{4}}}\pmod{\Phi_n(q)^3}. \tag*{(23)}
\end{aligned} ( q 4 ; q 4 ) 4 n + 1 2 ( q 3 ; q 4 ) 4 n + 1 ( q 5 ; q 4 ) 4 n + 1 1 − ( 1 − q n ) j = 0 ∑ 4 n − 3 ( 1 − q 4 j + 5 q 4 j + 5 − 1 − q 4 j + 4 q 4 j + 4 ) ≡ ( q 4 ; q 4 ) 4 n + 1 ( q 4 − n ; q 4 ) 4 n + 1 ( q 3 ; q 4 ) 4 n + 1 ( q 5 − n ; q 4 ) 4 n + 1 ( mod Φ n ( q ) 3 ) . (23)
Reversing the order of the factors, we obtain
( q 5 − n ; q 4 ) n + 1 4 = ( − 1 ) n + 1 4 q − ( n + 1 ) ( n − 7 ) 8 ( q − 2 ; q 4 ) n + 1 4 (q^{5-n};q^4)_{\frac{n+1}{4}}=(-1)^{\frac{n+1}{4}}q^{-\frac{(n+1)(n-7)}{8}}(q^{-2};q^4)_{\frac{n+1}{4}} ( q 5 − n ; q 4 ) 4 n + 1 = ( − 1 ) 4 n + 1 q − 8 ( n + 1 ) ( n − 7 ) ( q − 2 ; q 4 ) 4 n + 1
and
( q 3 ; q 4 ) n + 1 4 ( q 4 − n ; q 4 ) n + 1 4 = ( − 1 ) n − 3 4 q ( n − 3 ) ( n − 1 ) 8 [ n ] . \frac{(q^3;q^4)_{\frac{n+1}{4}}}{(q^{4-n};q^4)_{\frac{n+1}{4}}}=(-1)^{\frac{n-3}{4}}q^{\frac{(n-3)(n-1)}{8}}[n]. ( q 4 − n ; q 4 ) 4 n + 1 ( q 3 ; q 4 ) 4 n + 1 = ( − 1 ) 4 n − 3 q 8 ( n − 3 ) ( n − 1 ) [ n ] .
Therefore,
( q 3 ; q 4 ) n + 1 4 ( q 5 − n ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 ( q 4 − n ; q 4 ) n + 1 4 = − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 . (24) \frac{(q^3;q^4)_{\frac{n+1}{4}}(q^{5-n};q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}(q^{4-n};q^4)_{\frac{n+1}{4}}}
=-[n]q^{\frac{n+5}{4}}\frac{(q^{-2};q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}}. \tag*{(24)} ( q 4 ; q 4 ) 4 n + 1 ( q 4 − n ; q 4 ) 4 n + 1 ( q 3 ; q 4 ) 4 n + 1 ( q 5 − n ; q 4 ) 4 n + 1 = − [ n ] q 4 n + 5 ( q 4 ; q 4 ) 4 n + 1 ( q − 2 ; q 4 ) 4 n + 1 . (24)
Substituting this into (23) , we obtain (3.5) as desired. □
Proof of Theorem 1.2. We specialize a = 1 a=1 a = 1 in Proposition 3.2 . This specialization is legitimate: the right-hand side has no pole at a = 1 a=1 a = 1 , and all specialized denominators are relatively prime to Φ n ( q ) \Phi_n(q) Φ n ( q ) . For the left-hand side T n , s ( a , b ; q ) T_{n,s}(a,b;q) T n , s ( a , b ; q ) given in (2.2), in addition to the bounds used in the proposition, we have
k + s ≤ n − 1 2 + 3 s ≤ n − 1. k+s\le\frac{n-1}{2}+3s\le n-1. k + s ≤ 2 n − 1 + 3 s ≤ n − 1.
The denominators arising from negative indices are also relatively prime to Φ n ( q ) \Phi_n(q) Φ n ( q ) , since their exponents have absolute value at most 2 s − 1 < n 2s-1<n 2 s − 1 < n . The modulus becomes Φ n ( q ) 2 ( 1 − q n ) 2 \Phi_n(q)^2(1-q^n)^2 Φ n ( q ) 2 ( 1 − q n ) 2 and thus contains Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 . By (24) , we obtain, modulo Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 ,
T n , s ( 1 , 1 ; q ) ≡ ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 5 ; q 4 ) s q s 2 + 3 s × { − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 + ( q 3 , q 5 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 2 − ( q 3 , q 5 ; q 4 ) n + 1 4 ( q 4 − n , q 4 + n ; q 4 ) n + 1 4 } (25) \begin{aligned}
T_{n,s}(1,1;q)\equiv\frac{(q;q^2)_s(q;q^2)_{-s}(q^{-1};q^4)_s}{(q^5;q^4)_s}q^{s^2+3s} \\
&\times\left\{- [n]q^{\frac{n+5}{4}}\frac{(q^{-2};q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}}+\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}^2}-\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(q^{4-n},q^{4+n};q^4)_{\frac{n+1}{4}}}\right\} \tag*{(25)}
\end{aligned} T n , s ( 1 , 1 ; q ) ≡ ( q 5 ; q 4 ) s ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s q s 2 + 3 s × { − [ n ] q 4 n + 5 ( q 4 ; q 4 ) 4 n + 1 ( q − 2 ; q 4 ) 4 n + 1 + ( q 4 ; q 4 ) 4 n + 1 2 ( q 3 , q 5 ; q 4 ) 4 n + 1 − ( q 4 − n , q 4 + n ; q 4 ) 4 n + 1 ( q 3 , q 5 ; q 4 ) 4 n + 1 } (25)
We now simplify the last two fractions, using a product expansion as in the proof of Theorem 1.1. For 1 ≤ j ≤ ( n + 1 ) / 4 1 \le j \le(n+1)/4 1 ≤ j ≤ ( n + 1 ) /4 , the exact identity
( 1 − q 4 j − n ) ( 1 − q 4 j + n ) = ( 1 − q 4 j ) 2 − q 4 j − n ( 1 − q n ) 2 (1-q^{4j-n})(1-q^{4j+n})=(1-q^{4j})^2-q^{4j-n}(1-q^n)^2 ( 1 − q 4 j − n ) ( 1 − q 4 j + n ) = ( 1 − q 4 j ) 2 − q 4 j − n ( 1 − q n ) 2
gives
( q 4 ; q 4 ) n + 1 4 2 ( q 4 − n , q 4 + n ; q 4 ) n + 1 4 = ∏ j = 1 n + 1 4 ( 1 − q 4 j − n ( 1 − q n ) 2 ( 1 − q 4 j ) 2 ) − 1 \frac{(q^4;q^4)_{\frac{n+1}{4}}^2}{(q^{4-n},q^{4+n};q^4)_{\frac{n+1}{4}}}=\prod_{j=1}^{\frac{n+1}{4}}\left(1-\frac{q^{4j-n}(1-q^n)^2}{(1-q^{4j})^2}\right)^{-1} ( q 4 − n , q 4 + n ; q 4 ) 4 n + 1 ( q 4 ; q 4 ) 4 n + 1 2 = j = 1 ∏ 4 n + 1 ( 1 − ( 1 − q 4 j ) 2 q 4 j − n ( 1 − q n ) 2 ) − 1
≡ 1 + ( 1 − q n ) 2 ∑ j = 1 n + 1 4 q 4 j ( 1 − q 4 j ) 2 ( m o d Φ n ( q ) 3 ) . \equiv1+(1-q^n)^2\sum_{j=1}^{\frac{n+1}{4}}\frac{q^{4j}}{(1-q^{4j})^2}\pmod{\Phi_n(q)^3}. ≡ 1 + ( 1 − q n ) 2 j = 1 ∑ 4 n + 1 ( 1 − q 4 j ) 2 q 4 j ( mod Φ n ( q ) 3 ) .
Here terms containing ( 1 − q n ) 4 (1-q^n)^4 ( 1 − q n ) 4 have been discarded, and q − n q^{-n} q − n may be replaced by 1 in the correction term because it is already multiplied by ( 1 − q n ) 2 (1-q^n)^2 ( 1 − q n ) 2 . Since ( q 3 ; q 4 ) n + 1 4 (q^3;q^4)_{\frac{n+1}{4}} ( q 3 ; q 4 ) 4 n + 1 contains 1 − q n 1-q^n 1 − q n , it follows that modulo Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 ,
( q 3 , q 5 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 2 − ( q 3 , q 5 ; q 4 ) n + 1 4 ( q 4 − n , q 4 + n ; q 4 ) n + 1 4 ≡ − [ n ] 2 ( q 3 , q 5 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 2 ∑ j = 1 n + 1 4 q 4 j [ 4 j ] 2 . (26) \frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}^2}-\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(q^{4-n},q^{4+n};q^4)_{\frac{n+1}{4}}}\equiv-[n]^2\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}^2}\sum_{j=1}^{\frac{n+1}{4}}\frac{q^{4j}}{[4j]^2}. \tag*{(26)} ( q 4 ; q 4 ) 4 n + 1 2 ( q 3 , q 5 ; q 4 ) 4 n + 1 − ( q 4 − n , q 4 + n ; q 4 ) 4 n + 1 ( q 3 , q 5 ; q 4 ) 4 n + 1 ≡ − [ n ] 2 ( q 4 ; q 4 ) 4 n + 1 2 ( q 3 , q 5 ; q 4 ) 4 n + 1 j = 1 ∑ 4 n + 1 [ 4 j ] 2 q 4 j . (26)
Moreover, reducing the shifted factors modulo Φ n ( q ) \Phi_n(q) Φ n ( q ) and again using the factor 1 − q n 1-q^n 1 − q n in ( q 3 ; q 4 ) n + 1 4 (q^3;q^4)_{\frac{n+1}{4}} ( q 3 ; q 4 ) 4 n + 1 , we have
( q 3 , q 5 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 2 = ( q 3 , q 5 − n ; q 4 ) n + 1 4 ( q 4 , q 4 − n ; q 4 ) n + 1 4 = − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 ( m o d Φ n ( q ) 2 ) . \begin{aligned}
\frac{(q^3,q^5;q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}^2}=\frac{(q^3,q^{5-n};q^4)_{\frac{n+1}{4}}}{(q^4,q^{4-n};q^4)_{\frac{n+1}{4}}} \\
&=-[n]q^{\frac{n+5}{4}}\frac{(q^{-2};q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}}\pmod{\Phi_n(q)^2}.
\end{aligned} ( q 4 ; q 4 ) 4 n + 1 2 ( q 3 , q 5 ; q 4 ) 4 n + 1 = ( q 4 , q 4 − n ; q 4 ) 4 n + 1 ( q 3 , q 5 − n ; q 4 ) 4 n + 1 = − [ n ] q 4 n + 5 ( q 4 ; q 4 ) 4 n + 1 ( q − 2 ; q 4 ) 4 n + 1 ( mod Φ n ( q ) 2 ) .
Because the correction term in (26) contains [ n ] 2 [n]^2 [ n ] 2 , this replacement is valid modulo Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 . Substituting into (25) , we conclude that modulo Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 ,
T n , s ( 1 , 1 ; q ) = − [ n ] q n + 5 4 ( q − 2 ; q 4 ) n + 1 4 ( q 4 ; q 4 ) n + 1 4 ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s ( q 4 ; q 4 ) s [ 1 − [ n ] 2 ∑ j = 1 n + 1 4 q 4 j [ 4 j ] 2 ] q s 2 + 3 s , T_{n,s}(1,1;q)=-[n]q^{\frac{n+5}{4}}\frac{(q^{-2};q^4)_{\frac{n+1}{4}}}{(q^4;q^4)_{\frac{n+1}{4}}}\frac{(q;q^2)_s(q;q^2)_{-s}(q^{-1};q^4)_s}{(q^4;q^4)_s}\left[1-[n]^2\sum_{j=1}^{\frac{n+1}{4}}\frac{q^{4j}}{[4j]^2}\right]q^{s^2+3s}, T n , s ( 1 , 1 ; q ) = − [ n ] q 4 n + 5 ( q 4 ; q 4 ) 4 n + 1 ( q − 2 ; q 4 ) 4 n + 1 ( q 4 ; q 4 ) s ( q ; q 2 ) s ( q ; q 2 ) − s ( q − 1 ; q 4 ) s 1 − [ n ] 2 j = 1 ∑ 4 n + 1 [ 4 j ] 2 q 4 j q s 2 + 3 s ,
Combining the definition of T n , s ( a , b ; q ) T_{n,s}(a,b;q) T n , s ( a , b ; q ) given in (9) , we finish the proof of Theorem 1.2 .
Proofs of Theorems 1.3 and 1.5
To prove Theorems 1.3 and 1.5, we first provide the following q q q -congruence.
Theorem 4.1. Let n > 1 n>1 n > 1 be an integer with n ≡ 3 ( m o d 4 ) n\equiv3\pmod{4} n ≡ 3 ( mod 4 ) , and s s s be an integer with 0 ≤ s ≤ n − 1 6 0\le s\le\frac{n-1}{6} 0 ≤ s ≤ 6 n − 1 . Then, modulo [ n ] [n] [ n ] ,
∑ k = s n − 1 2 + 2 s [ 6 k + 1 ] ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k q k 2 + 3 k ≡ 0. \sum_{k=s}^{\frac{n-1}{2}+2s}[6k+1]\frac{(q;q^2)_k(q;q^2)_{k-2s}(q;q^2)_{k+2s}(q^{-1};q^4)_k}{(q^4;q^4)_{k+s}(q^4;q^4)_k(q^4;q^4)_{k-s}(q^4;q^2)_k}q^{k^2+3k}\equiv0. k = s ∑ 2 n − 1 + 2 s [ 6 k + 1 ] ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 4 ) k − s ( q 4 ; q 2 ) k ( q ; q 2 ) k ( q ; q 2 ) k − 2 s ( q ; q 2 ) k + 2 s ( q − 1 ; q 4 ) k q k 2 + 3 k ≡ 0.
Proof. Replacing k k k by k + s k+s k + s , it is equivalent to proving that
∑ k = 0 n − 1 2 + s ω q ( k ; s ) ≡ 0 ( m o d [ n ] ) , (27) \sum_{k=0}^{\frac{n-1}{2}+s}\omega_q(k;s)\equiv0\pmod{[n]}, \tag*{(27)} k = 0 ∑ 2 n − 1 + s ω q ( k ; s ) ≡ 0 ( mod [ n ]) , (27)
where
ω q ( k ; s ) : = [ 6 k + 6 s + 1 ] ( q ; q 2 ) k + s ( q ; q 2 ) k − s ( q ; q 2 ) k + 3 s ( q − 1 ; q 4 ) k + s ( q 4 ; q 4 ) k + 2 s ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 2 ) k + s q ( k + s ) 2 + 3 ( k + s ) . \omega_q(k;s):=[6k+6s+1]\frac{(q;q^2)_{k+s}(q;q^2)_{k-s}(q;q^2)_{k+3s}(q^{-1};q^4)_{k+s}}{(q^4;q^4)_{k+2s}(q^4;q^4)_{k+s}(q^4;q^4)_k(q^4;q^2)_{k+s}}q^{(k+s)^2+3(k+s)}. ω q ( k ; s ) := [ 6 k + 6 s + 1 ] ( q 4 ; q 4 ) k + 2 s ( q 4 ; q 4 ) k + s ( q 4 ; q 4 ) k ( q 4 ; q 2 ) k + s ( q ; q 2 ) k + s ( q ; q 2 ) k − s ( q ; q 2 ) k + 3 s ( q − 1 ; q 4 ) k + s q ( k + s ) 2 + 3 ( k + s ) .
Let ζ \zeta ζ be a primitive root of unity of degree d d d with d ∣ n d\mid n d ∣ n and d > 1 d>1 d > 1 . It suffices to verify that for every divisor d > 1 d>1 d > 1 of n n n ,
∑ k = 0 n − 1 2 + s ω q ( k ; s ) ≡ 0 ( m o d Φ d ( q ) ) . (28) \sum_{k=0}^{\frac{n-1}{2}+s}\omega_q(k;s)\equiv0\pmod{\Phi_d(q)}. \tag*{(28)} k = 0 ∑ 2 n − 1 + s ω q ( k ; s ) ≡ 0 ( mod Φ d ( q )) . (28)
Write
s = t d ± r , t ∈ Z ≥ 0 , 0 ≤ r ≤ d − 1 2 . s=td\pm r,\qquad t\in\mathbb{Z}_{\ge0},\qquad0\le r\le\frac{d-1}{2}. s = t d ± r , t ∈ Z ≥ 0 , 0 ≤ r ≤ 2 d − 1 .
We first identify conditions under which ω q ( k ; s ) \omega_q(k;s) ω q ( k ; s ) tends to zero as q → ζ q\to\zeta q → ζ . Set
ρ d : = { ( d + 5 ) / 4 , d ≡ 3 ( m o d 4 ) , ( 3 d + 5 ) / 4 , d ≡ 1 ( m o d 4 ) . \rho_d:=
\begin{cases}
(d+5)/4, & d\equiv3\pmod{4},\\
(3d+5)/4, & d\equiv1\pmod{4}.
\end{cases} ρ d := { ( d + 5 ) /4 , ( 3 d + 5 ) /4 , d ≡ 3 ( mod 4 ) , d ≡ 1 ( mod 4 ) .
Thus ρ d \rho_d ρ d is the smallest length for which ( q − 1 ; q 4 ) ρ d (q^{-1};q^4)_{\rho_d} ( q − 1 ; q 4 ) ρ d contains a factor divisible by Φ d ( q ) \Phi_d(q) Φ d ( q ) . Let ν d \nu_d ν d count the factors 1 − q j d 1-q^{jd} 1 − q j d in the numerator minus those in the denominator, where j j j is a nonzero integer and repeated factors are counted separately. Each such factor contains exactly one factor Φ d ( q ) \Phi_d(q) Φ d ( q ) . For every integer v v v , including negative v v v , we have
ν d ( ( q ; q 2 ) v ) = ⌊ v + ( d − 1 ) / 2 d ⌋ . \nu_d((q;q^2)_v)=\left\lfloor\frac{v+(d-1)/2}{d}\right\rfloor. ν d (( q ; q 2 ) v ) = ⌊ d v + ( d − 1 ) /2 ⌋ .
Counting the corresponding factors in
F q ( k ; s ) : = ω q ( k ; s ) [ 6 k + 6 s + 1 ] , F_q(k;s):=\frac{\omega_q(k;s)}{[6k+6s+1]}, F q ( k ; s ) := [ 6 k + 6 s + 1 ] ω q ( k ; s ) ,
and writing u u u for the least nonnegative residue of k + s k+s k + s modulo d d d , gives
ν d ( F q ( k ; s ) ) = ⌊ u + ( d − 1 ) / 2 d ⌋ + ⌊ u − 2 r + ( d − 1 ) / 2 d ⌋ + ⌊ u + 2 r + ( d − 1 ) / 2 d ⌋ + ⌊ u + d − ρ d d ⌋ − ⌊ u + r d ⌋ − ⌊ u d ⌋ − ⌊ u − r d ⌋ − ⌊ u + 1 d ⌋ . \nu_d(F_q(k;s))=\left\lfloor\frac{u+(d-1)/2}{d}\right\rfloor+\left\lfloor\frac{u-2r+(d-1)/2}{d}\right\rfloor+\left\lfloor\frac{u+2r+(d-1)/2}{d}\right\rfloor+\left\lfloor\frac{u+d-\rho_d}{d}\right\rfloor-\left\lfloor\frac{u+r}{d}\right\rfloor-\left\lfloor\frac{u}{d}\right\rfloor-\left\lfloor\frac{u-r}{d}\right\rfloor-\left\lfloor\frac{u+1}{d}\right\rfloor. ν d ( F q ( k ; s )) = ⌊ d u + ( d − 1 ) /2 ⌋ + ⌊ d u − 2 r + ( d − 1 ) /2 ⌋ + ⌊ d u + 2 r + ( d − 1 ) /2 ⌋ + ⌊ d u + d − ρ d ⌋ − ⌊ d u + r ⌋ − ⌊ d u ⌋ − ⌊ d u − r ⌋ − ⌊ d u + 1 ⌋ .
The formula holds for both signs: replacing r r r by − r -r − r interchanges the terms involving u − 2 r u-2r u − 2 r and u + 2 r u+2r u + 2 r , and those involving u − r u-r u − r and u + r u+r u + r . Evaluating the floors shows that the expression is nonnegative. It is zero precisely when
r ≤ u ≤ d − 1 2 − 2 r , u < ρ d , r\le u\le\frac{d-1}{2}-2r,\qquad u<\rho_d, r ≤ u ≤ 2 d − 1 − 2 r , u < ρ d ,
apart from the exceptional case ( d , r , u ) = ( 5 , 1 , 4 ) (d,r,u)=(5,1,4) ( d , r , u ) = ( 5 , 1 , 4 ) . In that case, [ 6 k + 6 s + 1 ] [6k+6s+1] [ 6 k + 6 s + 1 ] is divisible by Φ 5 ( q ) \Phi_5(q) Φ 5 ( q ) , since 6 u + 1 = 25 6u+1=25 6 u + 1 = 25 .
Thus all the limits
ω ζ ( k ; s ) : = lim q → ζ ω q ( k ; s ) \omega_\zeta(k;s):=\lim_{q\to\zeta}\omega_q(k;s) ω ζ ( k ; s ) := q → ζ lim ω q ( k ; s )
exist, and a nonzero limit is possible only if
r ≤ u ≤ d − 1 2 − 2 r . (29) r\le u\le\frac{d-1}{2}-2r. \tag*{(29)} r ≤ u ≤ 2 d − 1 − 2 r . (29)
Indeed, if r > ( d − 1 ) / 6 r>(d-1)/6 r > ( d − 1 ) /6 , this interval is empty. If r = ( d − 1 ) / 6 r=(d-1)/6 r = ( d − 1 ) /6 , its only possible value is u = r u=r u = r , and [ 6 k + 6 s + 1 ] [6k+6s+1] [ 6 k + 6 s + 1 ] vanishes at q = ζ q=\zeta q = ζ because 6 r + 1 = d 6r+1=d 6 r + 1 = d . Consequently, all the limits vanish when r ≥ ( d − 1 ) / 6 r\ge(d-1)/6 r ≥ ( d − 1 ) /6 . The desired congruence (28) follows immediately in this case.
It remains to consider 0 ≤ r < ( d − 1 ) / 6 0\le r<(d-1)/6 0 ≤ r < ( d − 1 ) /6 . Applying Lemma 2.1 with n = d n=d n = d , s = r s=r s = r and a = b = 1 a=b=1 a = b = 1 , and then replacing k k k by k + r k+r k + r , gives
∑ k = 0 ( d − 1 ) / 2 + r ω ζ ( k ; r ) = 0. \sum_{k=0}^{(d-1)/2+r}\omega_\zeta(k;r)=0. k = 0 ∑ ( d − 1 ) /2 + r ω ζ ( k ; r ) = 0.
By (29) , ω ζ ( k ; r ) = 0 \omega_\zeta(k;r)=0 ω ζ ( k ; r ) = 0 for k > ( d − 1 ) / 2 − 3 r k>(d-1)/2-3r k > ( d − 1 ) /2 − 3 r . Therefore,
∑ k = 0 d − 1 ω ζ ( k ; r ) = ∑ k = 0 ( d − 1 ) / 2 ω ζ ( k ; r ) = ∑ k = 0 ( d − 1 ) / 2 − 3 r ω ζ ( k ; r ) = 0. (30) \sum_{k=0}^{d-1}\omega_\zeta(k;r)=\sum_{k=0}^{(d-1)/2}\omega_\zeta(k;r)=\sum_{k=0}^{(d-1)/2-3r}\omega_\zeta(k;r)=0. \tag*{(30)} k = 0 ∑ d − 1 ω ζ ( k ; r ) = k = 0 ∑ ( d − 1 ) /2 ω ζ ( k ; r ) = k = 0 ∑ ( d − 1 ) /2 − 3 r ω ζ ( k ; r ) = 0. (30)
If s = t d + r s=td+r s = t d + r with 0 ≤ r < ( d − 1 ) / 6 0\le r<(d-1)/6 0 ≤ r < ( d − 1 ) /6 , ω ζ ( ℓ d ; s ) \omega_\zeta(\ell d;s) ω ζ ( ℓ d ; s ) and ω ζ ( 0 ; r ) \omega_\zeta(0;r) ω ζ ( 0 ; r ) are nonzero. Considering the following relation
ω ζ ( ℓ d + k ; s ) ω ζ ( ℓ d ; s ) = lim q → ζ ω q ( ℓ d + k ; s ) ω q ( ℓ d ; s ) = ω ζ ( k ; r ) ω ζ ( 0 ; r ) , \frac{\omega_\zeta(\ell d+k;s)}{\omega_\zeta(\ell d;s)}
=\lim_{q\to\zeta}\frac{\omega_q(\ell d+k;s)}{\omega_q(\ell d;s)}
=\frac{\omega_\zeta(k;r)}{\omega_\zeta(0;r)}, ω ζ ( ℓ d ; s ) ω ζ ( ℓ d + k ; s ) = q → ζ lim ω q ( ℓ d ; s ) ω q ( ℓ d + k ; s ) = ω ζ ( 0 ; r ) ω ζ ( k ; r ) ,
it follows from (30) that
∑ k = 0 d − 1 ω ζ ( ℓ d + k ; s ) = ω ζ ( ℓ d ; s ) ω ζ ( 0 ; r ) ∑ k = 0 d − 1 ω ζ ( k ; r ) = 0. \sum_{k=0}^{d-1}\omega_\zeta(\ell d+k;s)=\frac{\omega_\zeta(\ell d;s)}{\omega_\zeta(0;r)}\sum_{k=0}^{d-1}\omega_\zeta(k;r)=0. k = 0 ∑ d − 1 ω ζ ( ℓ d + k ; s ) = ω ζ ( 0 ; r ) ω ζ ( ℓ d ; s ) k = 0 ∑ d − 1 ω ζ ( k ; r ) = 0.
If s = t d − r s=td-r s = t d − r , both ω ζ ( ℓ d + 2 r ; s ) \omega_{\zeta}(\ell d+2r;s) ω ζ ( ℓ d + 2 r ; s ) and ω ζ ( 0 ; r ) \omega_{\zeta}(0;r) ω ζ ( 0 ; r ) are nonzero. We obtain
ω ζ ( ℓ d + 2 r + k ; s ) ω ζ ( ℓ d + 2 r ; s ) = lim q → ζ ω q ( ℓ d + 2 r + k ; s ) ω q ( ℓ d + 2 r ; s ) = ω ζ ( k ; r ) ω ζ ( 0 ; r ) . \frac{\omega_{\zeta}(\ell d+2r+k;s)}{\omega_{\zeta}(\ell d+2r;s)}=\lim_{q\to\zeta}\frac{\omega_q(\ell d+2r+k;s)}{\omega_q(\ell d+2r;s)}=\frac{\omega_{\zeta}(k;r)}{\omega_{\zeta}(0;r)}. ω ζ ( ℓ d + 2 r ; s ) ω ζ ( ℓ d + 2 r + k ; s ) = q → ζ lim ω q ( ℓ d + 2 r ; s ) ω q ( ℓ d + 2 r + k ; s ) = ω ζ ( 0 ; r ) ω ζ ( k ; r ) .
Consequently, using (29) and (30) gives
∑ k = 0 d − 1 ω ζ ( ℓ d + k ; s ) = ∑ k = 2 r ( d − 1 ) / 2 − r ω ζ ( ℓ d + k ; s ) = ∑ k = 0 ( d − 1 ) / 2 − 3 r ω ζ ( ℓ d + 2 r + k ; s ) = ω ζ ( ℓ d + 2 r ; s ) ω ζ ( 0 ; r ) ∑ k = 0 ( d − 1 ) / 2 − 3 r ω ζ ( k ; r ) = 0. \begin{aligned}
\sum_{k=0}^{d-1}\omega_{\zeta}(\ell d+k;s)=\sum_{k=2r}^{(d-1)/2-r}\omega_{\zeta}(\ell d+k;s)=\sum_{k=0}^{(d-1)/2-3r}\omega_{\zeta}(\ell d+2r+k;s) \\
&=\frac{\omega_{\zeta}(\ell d+2r;s)}{\omega_{\zeta}(0;r)}\sum_{k=0}^{(d-1)/2-3r}\omega_{\zeta}(k;r)=0.
\end{aligned} k = 0 ∑ d − 1 ω ζ ( ℓ d + k ; s ) = k = 2 r ∑ ( d − 1 ) /2 − r ω ζ ( ℓ d + k ; s ) = k = 0 ∑ ( d − 1 ) /2 − 3 r ω ζ ( ℓ d + 2 r + k ; s ) = ω ζ ( 0 ; r ) ω ζ ( ℓ d + 2 r ; s ) k = 0 ∑ ( d − 1 ) /2 − 3 r ω ζ ( k ; r ) = 0.
Furthermore, the truncated block with upper limit ( d − 1 ) / 2 ± r (d-1)/2\pm r ( d − 1 ) /2 ± r contains all its possibly nonzero terms. Hence
∑ k = 0 ( d − 1 ) / 2 ± r ω ζ ( ℓ d + k ; s ) = ∑ k = 0 d − 1 ω ζ ( ℓ d + k ; s ) = 0 , \sum_{k=0}^{(d-1)/2\pm r}\omega_{\zeta}(\ell d+k;s)=\sum_{k=0}^{d-1}\omega_{\zeta}(\ell d+k;s)=0, k = 0 ∑ ( d − 1 ) /2 ± r ω ζ ( ℓ d + k ; s ) = k = 0 ∑ d − 1 ω ζ ( ℓ d + k ; s ) = 0 ,
where the sign agrees with that in s = t d ± r s=td\pm r s = t d ± r .
Finally, since
n − 1 2 + s = ( n − d 2 d + t ) d + d − 1 2 ± r , \frac{n-1}{2}+s=\left(\frac{n-d}{2d}+t\right)d+\frac{d-1}{2}\pm r, 2 n − 1 + s = ( 2 d n − d + t ) d + 2 d − 1 ± r ,
we obtain
∑ k = 0 ( n − 1 ) / 2 + s ω ζ ( k ; s ) = ∑ ℓ = 0 ( n − d ) / ( 2 d ) + t − 1 ∑ k = 0 d − 1 ω ζ ( ℓ d + k ; s ) + ∑ k = 0 ( d − 1 ) / 2 ± r ω ζ ( n − d 2 + t d + k ; s ) = 0 , \sum_{k=0}^{(n-1)/2+s}\omega_{\zeta}(k;s)=\sum_{\ell=0}^{(n-d)/(2d)+t-1}\sum_{k=0}^{d-1}\omega_{\zeta}(\ell d+k;s)+\sum_{k=0}^{(d-1)/2\pm r}\omega_{\zeta}\left(\frac{n-d}{2}+td+k;s\right)=0, k = 0 ∑ ( n − 1 ) /2 + s ω ζ ( k ; s ) = ℓ = 0 ∑ ( n − d ) / ( 2 d ) + t − 1 k = 0 ∑ d − 1 ω ζ ( ℓ d + k ; s ) + k = 0 ∑ ( d − 1 ) /2 ± r ω ζ ( 2 n − d + t d + k ; s ) = 0 ,
which yields that (28) is valid. This completes the proof.
According to Theorem 4.1 , we can finish the proof of Theorems 1.3 and 1.5 .
Proof of Theorem 1.3 . Combining Theorem 1.1 and Theorem 4.1 , the proof follows from the fact that the least common multiple of [ n ] [n] [ n ] and Φ n ( q ) 3 \Phi_n(q)^3 Φ n ( q ) 3 is [ n ] Φ n ( q ) 2 [n]\Phi_n(q)^2 [ n ] Φ n ( q ) 2 .
Proof of Theorem 1.5 . Since the least common multiple of [ n ] [n] [ n ] and Φ n ( q ) 4 \Phi_n(q)^4 Φ n ( q ) 4 is [ n ] Φ n ( q ) 3 [n]\Phi_n(q)^3 [ n ] Φ n ( q ) 3 , we complete the proof by using Theorem 1.2 and Theorem 4.1 .
Acknowledgements
The authors would like to thank their supervisor, Helen W. J. Zhang, for continuous guidance and support.
References