Preprint
Article

This version is not peer-reviewed.

Formal Calculation of Q-Binomial

Peng Ji  *

Submitted:

15 August 2026

Posted:

18 August 2026

You are already at the latest version

Abstract
The classical theory of q-binomial coefficients is rich with celebrated identities, yet a unified framework for evaluating nested sums involving products of such coefficients has remained elusive. This paper provides such a framework. Our main result establishes that every nested sum of this type admits three equivalent q-binomial expansions, linked by explicit transformations that reveal inversion formulas, orthogonality relations, and other deep structural connections. The framework does much more than compute: it unifies the proofs of many classical q-binomial theorems—Rothe, MacMahon, Gauss, Jacobi, Cauchy—with remarkable brevity, revealing them as special cases of a single mechanism, while simultaneously serving as a systematic identity generator through arbitrary parameter specializations that yield vast families of new summation formulas. The method is algorithmic, widely applicable, and transforms q-analysis into a field where new results can be produced systematically rather than discovered case by case.
Keywords: 
;  ;  ;  

1. Introduction

The q-binomial coefficient is a fundamental object in combinatorics, appearing in partition theory, representation theory, and the study of quantum groups. Its classical identities—such as the q-binomial theorem, the q-Vandermonde convolution, and the summation formulas of Gauss, Cauchy, and Jacobi—are cornerstones of q-analysis. However, evaluating nested sums that involve products of q-binomial coefficients and q-integers [ n ] q often requires ad hoc techniques, and a unified computational framework has been lacking. Recent work has further explored q-binomial coefficients in various generalized settings, including q-binomial identities with nested sums and their applications in q-series [1,2]. Comprehensive surveys of classical q-identities can be found in [3].
While various methods exist for special cases, a unified framework for arbitrary nested q-binomial sums has remained elusive. We develop such a framework via a recursive operator S U M q that captures sums with arbitrary nesting depth and coefficients, together with a shift operator a p that handles the nesting structure uniformly. Our main result (Theorem 1) establishes that every such sum admits three equivalent q-binomial expansions, related by explicit transformations (Theorem 6) that not only provide computational flexibility but also reveal deep algebraic structures, including inversion formulas, orthogonality relations, and a closed-form expression for weighted infinite series that unifies many classical q-identities.
The power of our framework is demonstrated through a wide range of applications. On one hand, many classical theorems—including Rothe’s q-binomial theorem, MacMahon’s q-binomial theorem, Gauss’s q-binomial theorem, Jacobi’s q-binomial theorem, and Cauchy’s identity—follow directly from our three-form equivalence, with proofs that are remarkably short and uniform. Beyond unifying the proofs of numerous classical q-binomial theorems, the framework presented here serves as a systematic identity generator: arbitrary specializations of the free parameters yield a vast family of new summation formulas, of which only a representative sample is included. This dual nature—both a unifying principle and a discovery tool—distinguishes our approach from previous ad hoc treatments.
The paper is organized as follows. Section 2 (Calculation Formula) recalls the necessary definitions, proves a key summation lemma, introduces the recursive operator S U M q , and presents the main calculation theorem. Section 3 (Properties) establishes the relations among the three forms. Section 4 (Inferences) derives simple consequences of the framework that nevertheless reveal important results, including inversion formulas and orthogonality relations. Section 5 (Applications) then presents a wide range of applications, including numerous new results and finite summation identities. Section 6 (Unified Conversion Formulas) establishes a unified framework and demonstrates its utility.

2. Calculation Formula

The q-binomial coefficient is defined for non-negative integers M , N by
[ M N ] q = ( q N 1 ) ( q N 1 1 ) ( q N M + 1 1 ) ( q M 1 ) ( q M 1 1 ) ( q 1 1 ) , q 0 , 1 .
For convenience, we write G M N = [ M N ] q and [ N ] q = G 1 N . The q-shifted factorial is given by
( a ; q ) n = 1 , n = 0 , ( 1 a ) ( 1 a q ) ( 1 a q n 1 ) , n > 0 .
The Kronecker delta δ i j is defined as usual: δ i j = 1 if i = j and 0 otherwise.
The following elementary identities are fundamental:
G 0 N = 1 , G M N = G N M N , G M N = 0 whenever M > N or M < 0 ,
G M N = q M G M N 1 + G M 1 N 1 = G M N 1 + q N M G M 1 N 1 ,
n = 0 N 1 q n G M n + K = q M K G M + 1 N + K , M K 0 ,
G K M = w Ω ( 0 M K , 1 K ) q inv ( w ) ,
where inv ( w ) denotes the inversion number of the binary word w (see [4]).
Lemma 1.
For integers M K 0 and N > 0 , the following three equivalent forms hold:
n = 0 N 1 q n [ n ] q G M n + K = q 2 ( M K ) + 1 G 1 M + 1 G M + 2 N + K + q M K G 1 M K G M + 1 N + K
= q M 2 K 1 G 1 M + 1 G M + 2 N + K + 1 + q M K G 1 M K q K 1 G 1 M + 1 G M + 1 N + K
= q 2 ( M K ) + 1 G 1 M + 1 q 2 M K + 2 G 1 M K G M + 2 N + K + q M K G 1 M K G M + 2 N + K + 1 .
Proof. 
We begin with the identity [ n ] q = q n 1 q 1 . Decompose it as
[ n ] q = q n q n M + K q 1 + q n M + K 1 q 1 = q n M + K q M K 1 q 1 + q n M + K 1 q 1 .
Using the identity ( q n M + K 1 ) G M n + K = ( q M + 1 1 ) G M + 1 n + K , then the sum becomes
n q n [ n ] q G M n + K = n q n q n M + K q M K 1 q 1 G M n + K + n q n q n M + K 1 q 1 G M n + K = n q n ( q n M + K 1 ) G 1 M K G M n + K + n q n G 1 M K G M n + K + n q n G 1 M + 1 G M + 1 n + K = G 1 M K ( q M + 1 1 ) n q n G M + 1 n + K + G 1 M K n q n G M n + K + G 1 M + 1 n q n G M + 1 n + K = G 1 M + 1 ( q M K 1 ) q M + 1 K G M + 2 N + K + G 1 M K q M K G M + 1 N + K + G 1 M + 1 q M + 1 K G M + 2 N + K = q 2 ( M K ) + 1 G 1 M + 1 G M + 2 N + K + q M K G 1 M K G M + 1 N + K .
This proves the first equation.
Next, from the recurrence relation G M N = q M G M N 1 + G M 1 N 1 , we have
G M + 2 N + K = q M 2 G M + 2 N + K + 1 G M + 1 N + K . G M + 1 N + K = G M + 2 N + K + 1 q M + 2 G M + 2 N + K .
Substituting this into the first equation yields the second and third equations. □
Definition 1.
We now introduce a recursive operator and a family of nested sums that will serve as our main objects.
For p Z , define the operator q p on functions f ( n ) by
q 0 f ( n ) = f ( n ) , n = 0 N 1 q n q 1 f ( n + 1 ) = f ( N ) , n = 0 N 1 q n f ( n + 1 ) = q 1 f ( N ) , q 1 = q .
Remark 1.
Equivalently, the operator q 1 can be written explicitly as
q 1 f ( N ) = q ( N 1 ) f ( N ) f ( N 1 ) ,
which is a normalized backward difference.
Let K i , D i C and T i N . Define the nested sum S U M q ( N ) = S U M q ( N , P S , P T ) recursively as follows:
S U M q ( N , [ K 1 : D 1 ] , [ T 1 = 1 ] ) = n = 0 N 1 q n ( K 1 + [ n ] q D 1 ) ,
and for M 2 ,
S U M q ( N , [ K 1 : D 1 , , K M : D M ] , [ T 1 , , T M ] )
= n = 0 N 1 q n ( K M + [ n ] q D M ) p S U M q ( n + 1 , [ K 1 : D 1 , , K M 1 : D M 1 ] , [ T 1 , , T M 1 ] ) ,
where T i = T i 1 + 2 p (with p Z ) and T i < T i + 1 . Thus, p is determined by the common difference of the T i ’s.
To simplify notation, we adopt the following abbreviations:
[ K 1 : D , K 2 : D , , K M : D ] = [ K 1 , K 2 , , K M ] : D ,
and if D = 1 , we simply write [ K 1 , K 2 , , K M ] . In this paper, unless otherwise stated, we assume
P S = [ K 1 : D 1 , K 2 : D 2 , , K M : D M ] , P T = [ T 1 , T 2 , , T M ] .
The following special cases are particularly useful:
S U M q ( N , P S , [ 1 , 2 , , M ] ) = n = 0 N 1 q n i = 1 M ( K i + [ n ] q D i ) , S U M q ( N , P S , [ 1 , 3 , , 2 M 1 ] ) = n M = 0 N 1 q n M ( K M + [ n M ] q D M ) n 2 = 0 n 3 q n 2 ( K 2 + [ n 2 ] q D 2 ) n 1 = 0 n 2 q n 1 ( K 1 + [ n 1 ] q D 1 ) , S U M q ( N , P S , [ 1 , 2 , 4 ] ) = n 3 = 0 N 1 q n 3 ( K 3 + [ n 3 ] q D 3 ) n = 0 n 3 q n ( K 1 + [ n ] q D 1 ) ( K 2 + [ n ] q D 2 ) , S U M q ( N , P S , [ 1 , 3 , 4 ] ) = n 3 = 0 N 1 q n 3 ( K 3 + [ n 3 ] q D 3 ) ( K 2 + [ n 3 ] q D 2 ) n = 0 n 3 q n ( K 1 + [ n ] q D 1 ) , S U M q ( N , P S , [ 1 , 4 ] ) = n 3 = 0 N 1 q n 3 ( K 2 + [ n 3 ] q D 2 ) n 2 = 0 n 3 q n 2 n 1 = 0 n 2 q n 1 ( K 1 + [ n 1 ] q D 1 ) .
Now, let K = { K i } and T = { T i } . For each i, we choose X i { T i , K i } . For all combinations in { X 1 , , X M } , define
X ( T ) = card { i : X i = T i } , X ( K ) = M X ( T ) .
For each i, write X T , X K for the counts of T-choices and K-choices among the first i variables, and X T 1 , X K 1 for those among the first i 1 variables. Then
X T 1 + X K 1 = i 1 , X T + X K = i , X T = X T 1 + 1 , X i = T i , X T 1 , X i = K i .
Using this notation, we can now state the main calculation theorem.
Theorem 1.
Let M = | { T i } | , H = T M M , and set T 0 = 0 , X T 1 = 0 for j = 1 . Then
S U M q ( N , P S , P T ) = F o r m 1 = F o r m 2 = F o r m 3 .
Where
F o r m 1 = g = 0 M H 1 q ( g ) G H + 1 + g N + H , F o r m 2 = g = 0 M H 2 q ( g ) G H + 1 + g N + H + g , F o r m 3 = g = 0 M H 3 q ( g ) G T M + 1 N + T M g ,
and H r q ( g ) = H r q ( g , P S , P T ) = H r q ( g , M ) = X ( T ) = g i = 1 M B i , with
H 1 q ( g ) : B i = q 1 + ( T i T i 1 ) X T 1 G 1 T i X K 1 D i , X i = T i , q ( T i T i 1 1 ) X T 1 ( K i + G 1 X T 1 D i ) , X i = K i , H 2 q ( g ) : B i = q ( T i X K 1 ) G 1 T i X K 1 D i , X i = T i , K i q ( T i X K 1 ) G 1 T i X K 1 D i , X i = K i , H 3 q ( g ) : B i = q 1 + ( T i T i 1 1 ) X T 1 ( q X T 1 G 1 T i q T i G 1 X T 1 ) D i K i q T i , X i = T i , q ( T i T i 1 1 ) X T 1 ( K i + G 1 X T 1 D i ) , X i = K i .
Proof. 
We prove the theorem by induction on M. Using the elementary summation formula (3):
n = 0 N 1 q n G M n + K = q M K G M + 1 N + K .
Indeed, for M = 1 , we have P S = [ K 1 : D 1 ] and P T = [ T 1 ] . Then
S U M q ( N ) = n = 0 N 1 q n ( K 1 + [ n ] q D 1 ) ,
and using [ n ] q = G 1 n together with (3), we obtain
S U M q ( N ) = q 1 D 1 G 2 N + K 1 G 1 N = q 1 D 1 G 2 N + 1 + ( K 1 q 1 D 1 ) G 1 N = ( q 1 D 1 K 1 q 2 ) G 2 N + K 1 G 2 N + 1 ,
which matches the three forms.
Assume now that the theorem holds for M variables. Consider the ( M + 1 ) -variable case with
P S 1 = [ P S , K M + 1 : D M + 1 ] , P T 1 = [ P T , T M + 1 ] ,
where T M + 1 = T M + 2 p . Set
X = T M M + 1 p = T M + 1 ( M + 1 ) .
By definition,
S U M q ( N , P S 1 , P T 1 ) = n = 0 N 1 q n ( K M + 1 + [ n ] q D M + 1 ) q p S U M q ( n + 1 , P S , P T ) .
By the induction hypothesis, S U M q ( n + 1 , P S , P T ) has the forms with H i q ( g ) ; applying (3) to q p gives
q p S U M q ( n + 1 , P S , P T ) = g = 0 M H 1 q ( g ) q p g G X + g n + X = g = 0 M H 2 q ( g ) G X + g n + X + g = g = 0 M H 3 q ( g ) q p g G X + M n + X + M g .
Now substitute the first form into the definition:
S U M q ( N , P S 1 , P T 1 ) = g = 0 M H 1 q ( g ) q p g n = 0 N 1 q n ( K M + 1 + [ n ] q D M + 1 ) G X + g n + X .
Using (3) and Lemma 1, we have
n = 0 N 1 q n G X + g n + X = q g G X + g + 1 N + X . n = 0 N 1 q n [ n ] q G X + g n + X = q 2 g + 1 G 1 X + g + 1 G X + g + 2 N + X + q g G 1 g G X + g + 1 N + X .
Therefore,
S U M q ( N , P S 1 , P T 1 ) = g = 0 M H 1 q ( g ) q ( 1 p ) g ( K M + 1 + G 1 g D M + 1 ) G X + g + 1 N + X + g = 0 M H 1 q ( g ) q ( 2 p ) g + 1 G 1 X + g + 1 D M + 1 G X + g + 2 N + X .
Since X + g + 1 = T M + 1 ( M + 1 ) + g + 1 and N + X = N + T M + 1 ( M + 1 ) , the first sum contributes to
G T M + 1 ( M + 1 ) + g + 1 N + T M + 1 ( M + 1 ) .
After shifting the index g to g + 1 in the second sum and re-indexing, we obtain
H 1 q ( g , M + 1 ) = H 1 q ( g ) q ( T M + 1 T M 1 ) g ( K M + 1 + G 1 g D M + 1 ) + H 1 q ( g 1 ) q 1 + ( T M + 1 T M ) ( g 1 ) G 1 T M + 1 ( M + 1 g ) D M + 1 ,
with the convention H 1 q ( 1 ) = H 1 q ( M + 1 ) = 0 . This matches the definition of B 1 , j for F o r m 1 in the theorem. Hence
S U M q ( N , P S 1 , P T 1 ) = g = 0 M + 1 H 1 q ( g , M + 1 ) G T M + 1 ( M + 1 ) + 1 + g N + T M + 1 ( M + 1 ) .
The proofs for F o r m 2 and F o r m 3 are analogous. □
Example 1.
For P S = [ A , B , C ] , P T = [ 1 , 3 , 5 ] , direct expansion yields explicit coefficient:
H 1 q ( 0 ) = A B C , H 1 q ( 1 ) = A B q 1 G 1 3 + A q 1 G 1 2 ( C + 1 ) + q 1 G 1 1 q 1 ( B + 1 ) q 1 ( C + 1 ) , H 1 q ( 2 ) = q 1 G 1 1 q 3 G 1 3 q 2 ( C + G 1 2 ) + q 1 G 1 1 q 1 ( B + 1 ) q 3 G 1 4 + A q 1 G 1 2 q 3 G 1 4 , H 1 q ( 3 ) = q 1 G 1 1 q 3 G 1 3 q 5 G 1 5 .
Here, A q 1 G 1 2 ( C + 1 ) in H 1 q ( 1 ) corresponds to K 1 T 2 K 3 , B 1 = A , B 2 = q 1 + X T 1 G 1 3 X K 1 = q 1 G 1 2 , B 3 = ( C + 1 ) .
H 2 q ( 0 ) = ( A q 1 G 1 1 ) ( B q 2 G 1 2 ) ( C q 3 G 1 3 ) , H 2 q ( 1 ) = ( A q 1 G 1 1 ) ( B q 2 G 1 2 ) q 3 G 1 3 + ( A q 1 G 1 1 ) q 2 G 1 2 ( C q 4 G 1 4 ) + q 1 G 1 1 ( B q 3 G 1 3 ) ( C q 4 G 1 4 ) , H 2 q ( 2 ) = q 1 G 1 1 q 3 G 1 3 ( C q 5 G 1 5 ) + q 1 G 1 1 ( B q 3 G 1 3 ) q 4 G 1 4 + ( A q 1 G 1 1 ) q 2 G 1 2 q 4 G 1 4 , H 2 q ( 3 ) = q 1 G 1 1 q 3 G 1 3 q 5 G 1 5 .
H 3 q ( 0 ) = A B C , H 3 q ( 1 ) = A B q 1 ( G 1 5 q 5 C ) + A q 2 ( G 1 3 q 3 B ) ( C + 1 ) + q 3 ( 1 q 1 A ) ( B + 1 ) ( C + 1 ) , H 3 q ( 2 ) = q 5 ( 1 q 1 A ) ( q 1 G 1 3 q 3 q 3 B ) ( C + G 1 2 ) + q 4 ( 1 q 1 A ) ( B + 1 ) ( q 1 G 1 5 q 5 q 5 C ) + A q 3 ( G 1 3 q 3 B ) ( q 1 G 1 5 q 5 q 5 C ) , H 3 q ( 3 ) = q 6 ( 1 q 1 A ) ( q 1 G 1 3 q 3 q 3 B ) ( q 2 G 1 5 q 5 G 1 2 q 5 C ) .
Specifically, we have
n = 0 N 1 q n i = 1 M ( K i + D i q n ) = S U M q ( N , [ K i + D i : D i ( q 1 ) ] , [ 1 , 2 , , M ] ) .
Proceeding analogously to the H 1 q ( g ) case, we obtain by induction:
Theorem 2.
For constants K i , D i ,
n = 0 N 1 i = 1 M ( K i + D i q n ) = g = 1 M X ( T ) = g j = 1 M B j G g N + N i = 1 M K i ,
where
ϵ j = 0 , X T 1 = 0 , 1 , X T 1 > 0 . , B j = K j + ϵ j q X T 1 1 D j , X j = K j , D j 1 + ϵ j ( q 2 X T 1 q X T 1 1 ) , X j = T j .
Now, taking the limit q 1 . We define
lim q 1 q p = p , lim q 1 H r q ( g ) = H r ( g ) , lim q 1 S U M q ( N ) = S U M ( N ) .
Since lim q 1 [ n ] q = n and lim q 1 G M N = N M , the nested summation formula for K i + n D i follows immediately.
Lemma 2
(Closed form for finite q-binomial sums). Let 0 A M , N > M A , a 0 , 1 , q 1 , q 2 , . Then
n = 0 N 1 a n G M n + A = a N g = 0 M q ( N + A M ) g G M g N + A 1 g ( a ; q ) g + 1 + a M A ( a ; q ) M + 1 .
Proof. 
We divide the proof into two parts.
  • Step 1: The case A = M .
It suffices to prove
n = 0 N 1 a n G M n + M = a N g = 0 M q N g G M g N + M 1 g ( a ; q ) g + 1 + 1 ( a ; q ) M + 1 .
We proceed by induction on M and, for each fixed M, by induction on N.
Base case N = 1 : The left-hand side is G M M = 1 . For the right-hand side, we need
a g = 0 M q g ( a ; q ) g + 1 + 1 ( a ; q ) M + 1 = 1 ,
which follows from the identity
g = 0 M q g ( a ; q ) g + 1 = 1 ( a ; q ) M + 1 a ( a ; q ) M + 1 ,
obtained by induction on M using 1 ( a ; q ) g + 1 = 1 ( a ; q ) g + a q g ( a ; q ) g + 1 .
Inductive step on N: Assume (2.0.0.1) holds for N 1 . Using G M n + M = q M G M n 1 + M + G M 1 n 1 + M for n 1 , we get
n = 0 N 1 a n G M n + M = 1 + a q M n = 0 N 2 a n G M n + M + a n = 0 N 2 a n G M 1 n + M 1 .
Using induction on N for the first sum and on M 1 for the second, then simplifying via the q-binomial recurrence, gives (2.0.0.1) for N, completing the case A = M .
  • Step 2: Reduction to general A < M .
Shifting m = n ( M A ) , we have
n = 0 N 1 a n G M n + A = a M A m = 0 N M + A 1 a m G M m + M .
Applying (2.0.0.1) (with N replaced by N M + A ) and simplifying the exponent of q yields the desired identity. □
Theorem 3.
Let X = T M M p 1 , Y { 0 , 1 } , and f ( g ) = ( a q 2 + X + g ; q ) M g . Then:
(1) 
The three coefficient forms share the common value
A a q ( P S , P T , p ) : = g = 0 M H 1 q ( g ) a g q p g f ( g ) = g = 0 M H 2 q ( g ) f ( g ) = g = 0 M H 3 q ( g ) a g q p g .
(2) 
For finite N,
n = 0 N 1 a n q p SUM q ( n + Y ) = a N k = 0 M q ( N + Y 1 ) k q p + k SUM q ( N + Y 1 ) ( a ; q ) k + 1 + a 1 Y A a q ( P S , P T , p ) ( a ; q ) T M + 2 p .
(3) 
If | a | , | q | < 1 , then
n = 0 a n q p SUM q ( n + Y ) = a 1 Y A a q ( P S , P T , p ) ( a ; q ) T M + 2 p , SUM q ( ) : = lim N SUM q ( N ) = A q q ( P S , P T , 1 ) ( q ; q ) T M + 1 .
Proof. 
We first record the three expansions from Theorem 1 with X = T M M p ,
q p SUM q ( n + Y ) = g = 0 M H 1 q ( g ) q p g G 1 + X + g n + Y + X = g = 0 M H 2 q ( g ) G 1 + X + g n + Y + X + g = g = 0 M H 3 q ( g ) q p g G 1 + X + M p n + Y + X + M g .
  • Proof of (2).
Apply Lemma 2 to F o r m 1 of SUM q ( n + Y ) . For fixed g, we have
n = 0 N 1 a n G 1 + X + g n + Y + X = a N k = 0 1 + X + g q ( N + Y 1 ) k G 1 + X + g k N + Y + X 1 k ( a ; q ) k + 1 + a 1 + g Y ( a ; q ) 2 + X + g .
Multiplying by H 1 q ( g ) q p g and summing over g, the first term on the right becomes
a N k = 0 M q ( N + Y 1 ) k ( a ; q ) k + 1 q p + k SUM q ( N + Y 1 )
The second term equals
a 1 Y g = 0 M H 1 q ( g ) a g q p g ( a q 2 + X + g ; q ) M g .
Define this quantity as a 1 Y A a q ( P S , P T , p ) ; this is a temporary definition. Thus (2) holds.
  • Proof of (1).
Now apply the same argument to F o r m 2 of SUM q ( n + Y ) . For each fixed g, Lemma 2 gives
n = 0 N 1 a n G 1 + X + g n + Y + X + g = a N k = 0 1 + X + g q ( N + Y 1 ) k G 1 + X + g k N + Y + X + g 1 k ( a ; q ) k + 1 + a 1 Y ( a ; q ) 2 + X + g .
After multiplying by H 2 q ( g ) and summing, the first term again becomes
a N k = 0 M q ( N + Y 1 ) k ( a ; q ) k + 1 q p + k SUM q ( N + Y 1 ) ,
because the same expression q p + k SUM q is obtained (with p shifted). The second term becomes
a 1 Y g = 0 M H 2 q ( g ) ( a q 2 + X + g ; q ) M g .
Since two identities are both equal to n = 0 N 1 a n q p SUM q ( n + Y ) , thus the second terms are equal:
g = 0 M H 1 q ( g ) a g q p g ( a q 2 + X + g ; q ) M g = g = 0 M H 2 q ( g ) ( a q 2 + X + g ; q ) M g .
Applying Lemma 2 to F o r m 3 similarly completes the proof of (1).
  • Proof of (3).
Taking N in (2) (with | a | < 1 ) gives
n = 0 a n q p SUM q ( n + Y ) = a 1 Y A a q ( P S , P T , p ) ( a ; q ) T M + 2 p .
Setting a = q and using the definition of SUM q (where the standard case is Y = 1 , p = 1 ) yields
S U M q ( ) = n = 0 q n q 1 SUM q ( n + 1 ) = A q q ( P S , P T , 1 ) ( q ; q ) T M + 1 .

3. Properties

In this section, we collect several useful properties of S U M q and the coefficients H i q ( g ) .
Definition 2.
Define the q-numbers
[ n ] q = q n G 1 n , [ n ] q + = q n G 1 n ,
and their factorials:
[ n ! ] q = [ n ] q [ n 1 ] q [ 1 ] q , [ n ! ] q + = [ n ] q + [ n 1 ] q + [ 1 ] q + , [ 0 ! ] q = [ 0 ! ] q + = 1 .
Theorem 4
(Basic Properties). The following properties hold.
(1) 
For P T = [ 1 , 2 , , M ] ,
q SUM q ( n + 1 ) = i = 1 M ( K i + [ n ] q D i ) .
(2) 
The pairs ( K i : D i ) may be permuted freely within each consecutive block of the T i ’s ( T i + 1 = T i + 1 ).
(3) 
For any integer p, with X = T M M p ,
q p SUM q ( N ) = g = 0 M H 1 q ( g ) q p g G X + 1 + g N + X = g = 0 M H 2 q ( g ) G X + 1 + g N + X + g = g = 0 M H 3 q ( g ) q p g G X + M + 1 N + X + M g .
(4) 
For any positive integers L 1 , , L Q ,
SUM q ( N , [ [ L 1 ] q , , [ L Q ] q , P S 1 ] , [ L 1 , , L Q , P T 1 ] ) = [ L i ] q SUM q ( N , P S 1 , P T 1 ) .
Thus T 1 can be greater than 1.
(5) 
In particular,
SUM q ( N , [ [ T 1 ] q , , [ T M ] q ] , [ T 1 , , T M ] ) = [ T i ] q G T M + 1 N + T M .
(6) 
For H r q ( g ) as defined in Theorem 1,
X ( T ) = g , X i K q X T = G M g M = G g M .
Proof. 
(1) Follows directly from the definition of q .
(2)
Follows directly from the definition of SUM q (factors within the same nesting level commute).
(3)
This was established during the proof of Theorem 1; included here only for reference.
(4)
Observe the F o r m 2 : when Q factors [ L 1 ] q , , [ L Q ] q are prepended to P S , we have H 2 q ( g ) = 0 for g < Q , and for g Q they equal i = 1 Q [ L i ] q H 2 q ( g Q , P S 1 , P T 1 ) . Hence the whole sum is multiplied by i = 1 Q [ L i ] q .
(5)
This is the special case of (4).
(6)
This is the combinatorial identity
G K M = w Ω ( 0 M K , 1 K ) q inv ( w ) ,
stated at the beginning of Section 1. With K = M g , this sum is precisely the generating function w q i n v ( w ) over binary words with M g zeros and g ones.
Using property (5) with P T = [ 1 , 3 2 M 1 ] , we obtain a nice closed form:
n M = 0 N 1 n 1 = 0 n 2 q n i [ 1 + n 1 ] q [ 3 + n 2 ] q [ 2 M 1 + n M ] q = [ 1 ] q [ 3 ] q [ 2 M 1 ] q G 2 M N + 2 M 1 .
Theorem 5
(Basic q-binomial identities). The following identities hold:
0 λ 1 λ M N q λ i = G M N + M ,
A λ 1 < < λ M B q λ i = q M 2 + A M G M B A + 1 , ( A B ) ,
i = 1 M ( a + q A + i z ) = g = 0 M q g 2 + ( A + 1 ) g G g M z g a M g .
Proof. 
(1) Take P S = [ 1 , , 1 ] : 0 and P T = [ 1 , 3 , , 2 M 1 ] . By definition,
SUM q ( N + 1 , P S , P T ) = 0 λ 1 λ M N q λ i .
Only H 1 q ( 0 ) = 1 is nonzero (all other H 1 q ( g ) = 0 since D i = 0 ). Hence the sum equals G M N + M .
(2) follows from (A1) by shifting λ i λ i ( A + i 1 ) .
(3) follows by expanding the product:
i = 1 M ( a + q A + i z ) = g = 0 M z g a M g 1 i 1 < < i g M q j = 1 g ( A + i j ) .
The inner sum is evaluated by (2) as q A g + g 2 + g G g M . □
Remark 2.
Part (1) is Cayley’s theorem:
n = 0 M N p ( n ; M , N ) q n = G M N + M ,
where p ( n ; M , N ) denotes the number of partitions of n into at most M parts, each at most N (see [5]). Part (3) is Rothe’s q-binomial theorem( A = 1 ): i = 1 M ( a + q i 1 z ) = g = 0 M q g 2 G g M z g a M g .
We show that MacMahon’s q-binomial theorem follows directly from (2).
i = 1 A ( a + q ( 2 i 1 ) D z ) = g = 0 A q g 2 D A g q 2 D z g a A g , i = 1 B ( a 1 + q ( 2 i 1 ) D z 1 ) = h = 0 B q h 2 D B h q 2 D z h a ( B h ) .
Multiplying these two expressions and extracting the coefficient of z k yields
f ( k ) = i = 0 A + B A i q 2 D B i k q 2 D q i 2 D + ( i k ) 2 D a A i a ( B i + k ) .
After simplification and application of the q-Vandermonde identity, this reduces to
f ( k ) = q k 2 D a A B k A + B A k q 2 D .
Thus we obtain the two-parameter identity
i = 1 A ( a + q ( 2 i 1 ) D z ) i = 1 B ( a 1 + q ( 2 i 1 ) D z 1 ) = k = B A q k 2 D a A B k A + B A k q 2 D z k .
Setting a = D = 1 gives MacMahon’s q-binomial theorem in its standard form:
( q z ; q 2 ) A ( q z 1 ; q 2 ) B = k = B A q k 2 A + B A k q 2 z k .
Two variations of the q-binomial theorem.
The following identities, which will be used later in this paper, can be proved by induction on M using the standard recurrence for G k M :
k = 0 M ( 1 ) k + g G k M G g k q k ( k 1 ) 2 g k + A k z k = q g ( g + 1 ) 2 + A g G g M ( z q A ; q ) M g z g ;
k = 0 M ( 1 ) k G k M G M g M k q k ( k 1 ) 2 + A k z k = G g M ( z q A ; q ) g .
In light of the above preparations, we now present one of the main theorems of this paper.
Theorem 6
(Mutual transformations). For P T = [ 1 , 2 , , M ] ,
H 1 q ( g ) = q g ( g + 1 ) k H 2 q ( k ) G g k ,
H 1 q ( g ) = k H 3 q ( k ) G M g M k q ( g + 1 ) ( g k ) ,
H 2 q ( g ) = k ( 1 ) k + g G g k q g ( g + 1 ) k ( k + 3 ) 2 k g H 1 q ( k ) ,
H 3 q ( g ) = k ( 1 ) k + g G M g M k q g ( g + 3 ) k ( k + 3 ) 2 H 1 q ( k ) ,
H 3 q ( g ) = ( 1 ) g q g ( g + 3 ) 2 k H 2 q ( k ) G g M k q g k ,
H 2 q ( g ) = ( 1 ) M g q ( M g ) ( M g 1 ) 2 k H 3 q ( k ) G M g k q ( M + 1 ) k .
Proof. 
We prove (1) in detail; the proofs of (2)–(4) are analogous.
Since the identities are homogeneous in each pair ( K i , D i ) , D i 0 , we may first set D i = 1 for all i by replacing K i with K i / D i ; the general case then follows by scaling back. Thus we prove (1) under the normalization D i = 1 .
For M = 1 , direct computation verifies the identity. Assume (1) holds for M. Append a new pair ( K M + 1 , 1 ) with T M + 1 = M + 2 p . Let H 1 q ( g ) and H 2 q ( g ) denote the coefficients for M variables. For M + 1 , by the definition of H 1 q ,
H 1 q ( g , M + 1 ) = H 1 q ( g 1 ) q 1 + X T G 1 1 + X T + H 1 q ( g ) ( K M + 1 + G 1 X T ) ,
Substituting the induction hypothesis for H 1 q ( g 1 ) and H 1 q ( g ) , we get
H 1 q ( g , M + 1 ) = q g G 1 g · q ( g 1 ) g k H 2 q ( k ) G g 1 k + ( K M + 1 + G 1 g ) q g ( g + 1 ) k H 2 q ( k ) G g k = q g ( g + 1 ) k H 2 q ( k ) q g G 1 g G g 1 k + ( K M + 1 + G 1 g ) G g k .
On the other hand, for M + 1 ,
H 2 q ( k , M + 1 ) = H 2 q ( k 1 ) q k G 1 k + H 2 q ( k ) ( K M + 1 q ( k + 1 ) G 1 k + 1 ) .
Hence
q g ( g + 1 ) k H 2 q ( k , M + 1 ) G g k = q g ( g + 1 ) k H 2 q ( k ) q ( k + 1 ) G 1 k + 1 G g k + 1 + ( K M + 1 q ( k + 1 ) G 1 k + 1 ) G g k .
The difference between the two expressions vanishes: after substituting G g 1 k = G g k + 1 q g G g k , the K M + 1 -terms cancel and the remaining terms reduce to zero by direct simplification of the q-binomial coefficients. Therefore H 1 q ( g , M + 1 ) = q g ( g + 1 ) k H 2 q ( k , M + 1 ) G g k , proving (1). The remaining identities (2)–(4) are obtained by the same induction.
In Theorem 3, take P T = [ 1 , 2 , , M ] and p = 0 . Define
f ( g ) = ( 1 a q 2 + g ) ( 1 a q 3 + g ) ( 1 a q M + 1 ) = ( a q 2 + g ; q ) M g .
By the standard Rothe identity,
( a q 2 + g ; q ) M g = k = 0 M g G k M g ( 1 ) k q k ( k 1 ) 2 ( a q 2 + g ) k = k = 0 M g G k M g ( 1 ) k q k ( k 1 ) 2 + ( 2 + g ) k a k .
and Theorem 3(1) ( p = 0 ), Thus
g = 0 M H 2 q ( g ) f ( g ) = g = 0 M H 2 q ( g ) k = 0 M g G k M g ( 1 ) k q k ( k 1 ) 2 + ( 2 + g ) k a k = g = 0 M H 3 q ( g ) a g .
Comparing coefficients of a g on both sides (interchanging the order of summation in the double sum) yields
H 3 q ( g ) = k = 0 M H 2 q ( k ) ( 1 ) g G g M k q g ( g 1 ) 2 + ( 2 + k ) g ,
which is (5).
From (5), replace g by r and set k M k to obtain
H 3 q ( r ) = ( 1 ) r q r ( r 1 ) 2 + ( M + 2 ) r k = 0 M H 2 q ( M k ) G r k q r k .
Multiply both sides by G g r q ( M + 1 ) r and sum over r:
r = 0 M H 3 q ( r ) G g r q ( M + 1 ) r = k = 0 M H 2 q ( M k ) r = 0 M ( 1 ) r G g r G r k q r ( r 1 ) 2 ( 1 k ) r .
By (8) (with z = 1 , A = g + 1 k , and M = k ),
r = 0 M ( 1 ) r G g r G r k q r ( r 1 ) 2 g r + ( g + 1 k ) r = ( 1 ) g q g ( g + 1 ) 2 + ( g + 1 k ) g G g k ( q g + 1 k , q ) k g = ( 1 ) g q g ( g 1 ) 2 δ g , k .
(For k > g , ( q g + 1 k , q ) k g = 0 ; the only non-zero term occurs when k = g , yielding ( 1 ) g q g ( g 1 ) 2 .)
Substituting this into the previous equation yields
H 2 q ( M g ) = ( 1 ) g q g ( g 1 ) 2 r = 0 M H 3 q ( r ) G g r q ( M + 1 ) r .
Applying the substitution g M g and relabelling r as k gives (6). □
We also define the symmetric functions
F g K = 1 λ 1 < < λ g M i = 1 g K λ i , E g K = 1 λ 1 λ g M i = 1 g K λ i ,
and their q-analogues
E g N , q = 1 λ 1 λ g N i = 1 g [ λ i ] q = S 2 q ( N + g , N ) , E g N , q = 1 λ 1 λ g N i = 1 g [ λ i ] q = S 2 q ( N + g , N ) .
Theorem 7.
Assume P T = [ 1 , 2 , , M ] and D i = 1 . Then, for H 1 q ( g ) ,
X ( T ) = g , X i = K i B i = F M g K E 0 g , q + F M g 1 K E 1 g , q + . . . + F 0 K E M g g , q .
Proof. 
Recall the general expression for B i in Form 1:
B i = q ( T i T i 1 1 ) X T 1 ( K i + G 1 X T 1 D i ) , X i = K i , q 1 + ( T i T i 1 ) X T 1 G 1 T i X K 1 D i , X i = T i .
Since T i + 1 = T i + 1 and D i = 1 , T i X K 1 = i ( ( i 1 ) X T 1 ) = 1 + X T 1 , the factor B i simplifies to
B i = K i + G 1 X T , X i = K i , q X T G 1 X T , X i = T i .
For a fixed choice of g indices with X i = T i , let their positions be τ 1 < < τ g . Then X T = j for the j-th such index, so
X i = T i B i = j = 1 g q j G 1 j = [ g ! ] q + .
Thus the T-terms contribute a common factor [ g ! ] q + independent of the specific positions. Therefore,
H 1 q ( g ) = [ g ! ] q + X i = K i B i .
Now let the K-term indices be λ 1 < < λ M g . For these indices, X T equals the number of T-terms preceding λ j . Expanding the product over the K-terms,
X i = K i ( K i + G 1 X T ) = r = 0 M g μ 1 < < μ r K μ 1 K μ r 1 ν 1 ν M g r ν j X T ( μ j ) G 1 ν 1 G 1 ν M g r .
The second sum is independent of the specific positions of the T-terms and equals E M g r g , q . Hence
X i = K i B i = r = 0 M g F r K E M g r g , q .
In this article we frequently use the following triple representation: for 1 + p 0 ,
g = 0 M a g G 1 + p + g X = g = 0 M b g G 1 + p + g X + g = g = 0 M c g G 1 + p + M X + M g ,
where we set a g * : = a g q p g and c g * : = c g q p g .
Now consider the special case D i = 1 and P T = [ 1 , 2 , , M ] . From Theorem 1 ( F o r m 1 ) we have
q p S U M q ( X p ) = g = 0 M H 1 q ( g ) q p g G 1 + p + g X , H 1 q ( M ) = [ M ! ] q + .
By Theorem 7, the values H 1 q ( g ) for 0 g < M are independent and can be assigned arbitrarily by choosing the parameters K i (since they are expressed as a convolution of elementary and complete homogeneous symmetric functions, whose Jacobian is non-singular). Therefore, given any sequence { a g } g = 0 M , we can choose K i and a constant c such that
a g * = c H 1 q ( g ) ( 0 g < M ) ,
and then the remaining coefficient a M * determines c via c = a M * / [ M ! ] q + (because H 1 q ( M ) = [ M ! ] q + ). Consequently,
g = 0 M a g G 1 + p + g X = a M * [ M ! ] q + q p S U M q ( X p ) .
Although this reduction is derived from F o r m 1 , it extends naturally to all three forms. We obtain
a g * = c H 1 q ( g ) , b g = c H 2 q ( g ) , c g * = c H 3 q ( g ) , P T = [ 1 , 2 , , M ]
for the same constant c. Since c is irrelevant in our applications, we identify a g * = H 1 q ( g ) , b g = H 2 q ( g ) , c g * = H 3 q ( g ) . Thus, for any sequences a g * , b g , c g * obtained in this way, the relations in Theorem 6 are universally valid.
For any admissible P T , we may choose a new set of parameters P S 1 = { K i } ,
S U M q ( N , P S , P T ) = C · q M T M S U M q ( N , P S 1 , [ 1 , 2 , , M ] ) ,
where C is a constant.
As a natural inference, we obtain the following necessary and sufficient condition for reducing the number of terms.
Theorem 8.
For a reduction by R terms ( 0 < R M ), the sum
g = 0 M a g G 1 + p + g X = g = 0 M R x g G 1 + p + R + g X + R
is possible iff,
k = 0 M ( 1 ) k G g k q k ( k + 3 ) 2 k g a k * = 0 ( 0 g < R ) , or k = 0 M ( 1 ) k G M g M k q k ( k + 3 ) 2 a k * = 0 ( 0 M g < R ) .
Here the conditions are equivalent to b g = 0 or c M g * = 0 . Analogous conditions hold for the other two forms.

4. Inferences

The following theorems are direct algebraic consequences of Theorem 6. They are self-contained structural results of the three-form framework, revealing the algebraic duality among the coefficient spaces and of independent interest.
Simplifying the mutual expressions yields the inversion formulas.
Theorem 9
(Inversion formula). The following inversion relations hold; equivalently, in dual form:
1. 
a g = k = 0 M b k G g k . Then
b g = k = 0 M ( 1 ) k + g G g k q k ( k 1 ) + g ( g + 1 ) 2 g k a k .
2. 
a g = k = 0 M c k G M g M k q g k . Then
c g = k = 0 M ( 1 ) k + g G M g M k q k ( k 1 ) + g ( g + 1 ) 2 a k .
3. 
c g = k = 0 M b k G g M k q g k . Then
b g = k = 0 M ( 1 ) M g k c k G M g k q M 2 + k 2 + g 2 M + k + g 2 M g M k .
The inversions are not equivalent to these standard formulas, (see [6]).
a n = k = 0 n G k n b k , b n = k = 0 n ( 1 ) n k q n k 2 G k n a k .
Set a g , b g , or c g to δ r g and applying the inversion formulas in Theorem 9 and Theorem 6 to get:
Theorem 10
(Orthogonality relations). For 0 r , g M , the following identities hold:
k ( 1 ) k + r G g k G k r q r ( r 1 ) + k ( k + 1 ) 2 r k = δ r g . k ( 1 ) k + r G M g M k G M k M r q r ( r 1 ) + k ( k + 1 ) 2 g k = δ r g . k ( 1 ) M g k G M g k G k M r q M 2 + g 2 + k 2 M + g + k 2 M g M k + r k = δ r g .
Using the three-form equivalence and setting a g , b g , or c g to δ g k and Theorem 6 to get:
Theorem 11
(Generalized q-Vandermonde identities). For 0 k M and p 1 :
g q g ( g + 1 + p ) G g k G 1 + p + g N = G 1 + p + k N + k ,
g q g ( g + 1 + p ) k ( g + 1 + p ) G M g M k G 1 + p + g N = G 1 + p + M N + M k ,
g ( 1 ) k + g q g ( g + 1 ) k ( k + 3 ) 2 g k p k G g k G 1 + p + g N + g = G 1 + p + k N ,
g ( 1 ) M g q M g 2 ( M + 1 + p ) k G M g k G 1 + p + g N + g = G 1 + p + M N + M k ,
g ( 1 ) k + g q g ( g + 3 ) k ( k + 3 ) 2 p k + p g G M g M k G 1 + p + M N + M g = G 1 + p + k N ,
g ( 1 ) g q g ( g + 3 ) 2 + g k + p g G g M k G 1 + p + M N + M g = G 1 + p + k N + k .
Binomial coefficient relations.
Taking q 1 . If
g a g X Y + g = g b g X + g Y + g = g c g X + M g Y + M ,
Applying Theorem 11 together with Theorem 6, we obtain:
g ( 1 ) g a g X + g Y + g = g ( 1 ) g b g X Y + g = ( 1 ) M g c M g X + M g Y + M . g ( 1 ) g a g X + M g Y + M = g b M g X + g Y + g = g ( 1 ) g c g X Y + g . g b g ( Y + M X + M g ) = ( 1 ) M g a M g ( Y + g X + g ) = ( 1 ) M g c M g ( Y + g X ) . g c g ( Y + g X + g ) = ( 1 ) g a M g ( Y + M X + M g ) = ( 1 ) g b M g ( Y + g X ) .
Theorem 3(1) gives, for a 0 , 1 ,
g = 0 M a g a g ( 1 a ) M g = g = 0 M b g ( 1 a ) M g = g = 0 M c g a g .
Under the substitution a z / x and multiply by x M , it becomes
g a g ( x z ) M g z g = g b g ( x z ) M g x g = g c g x M g z g .
In (*), ( 1 ) g a g is paired with X + g Y + g (role of F o r m 2 ), while ( 1 ) g b g is paired with X Y + g (role of F o r m 1 ). Thus
g ( 1 ) g a g ( x z ) M g x g = g ( 1 ) g b g ( x z ) M g z g = ( 1 ) M g c M g x M g z g .
Other formulas also have such substitutions.

5. Applications

  • Illustration of the computational technique.
As an application of Theorem 5 (1), consider the sum
SUM q ( N + 1 , [ 1 , , 1 ] : q 1 , [ 1 , 3 , , 2 M 1 ] ) = 0 λ 1 λ M N q 2 λ i = N + M M q 2 ,
Form 1 (detailed computation).
Recall the general expression for B i in Form 1:
B i = q ( T i T i 1 1 ) X T 1 ( K i + G 1 X T 1 D i ) , X i = K i , q 1 + ( T i T i 1 ) X T 1 G 1 T i X K 1 D i , X i = T i .
Substituting K i = 1 , D i = q 1 , T i = 2 i 1 :
  • Case X i = K i :
B i = q X T 1 · 1 + G 1 X T 1 ( q 1 ) = q X T 1 · q X T 1 = q 2 X T 1 .
Since X i = K i implies X T = X T 1 , we have B i = q 2 X T .
  • Case X i = T i :
B i = q 1 + 2 X T 1 G 1 T i X K 1 ( q 1 ) = q 1 + 2 X T 1 ( q T i X K 1 1 ) .
Now T i X K 1 = ( 2 i 1 ) ( ( i 1 ) X T 1 ) = i + X T 1 , X i = T i implies X T = X T 1 + 1 . Hence
B i = q 1 + 2 X T 1 ( q i + X T 1 1 ) = q 2 X T 1 ( q i + X T 1 1 ) ,
Therefore, Form 1 gives
B i = q 2 X T , X i = K i , q 2 X T 1 ( q i + X T 1 1 ) , X i = T i .
The second branch contains i and X T 1 coupled, so summing over all choices of T-positions is nontrivial and a closed form for H 1 q ( g ) is not easily obtained. The same complication occurs in F o r m 2 .
  • Form 3 (detailed computation).
The general expression for B i in Form 3 is
B i = q 2 X T , X i = K i , q 2 X T 1 , X i = T i .
For a fixed choice of g indices assigned to T , say i 1 < < i g , we have X T = j at position i j . The product over all i is
i = 1 M B i = ( 1 ) g q X i = T i ( 2 X T 1 ) q X i = K i 2 X T .
Now
X i = T i ( 2 X T 1 ) = 2 X i = T i X T g = 2 ( 1 + 2 + + g ) g = g 2 .
Thus, by Theorem 4(6),
H 3 q ( g ) = X ( T ) = g i = 1 M B i = ( 1 ) g q g 2 X ( T ) = g , X i K q 2 X T = ( 1 ) g q g 2 M g q 2 .
Substituting this into Form 3, where T M + 1 = 2 M , gives
N + M M q 2 = g = 0 M ( 1 ) g q g 2 M g q 2 G 2 M N + 2 M g .
Compared to Theorem 5 (1).
SUM q ( N + 1 , [ 1 , , 1 ] : 0 , [ 1 , 3 , , 2 M 1 ] ) = 0 λ 1 λ M N q λ i = G M N + M .
The Form 3 B i factors are
B i = q X T 1 = q X T = q i X K , X i = K i , q X T ( q 2 i 1 ) = q 2 i + X T 1 , X i = T i , = q i q X K , X i = K i , q i + X T 1 , X i = T i . .
The product of the extracted factors q i over all i = 1 , , M gives q M + 1 2 . The remaining factors contribute as follows:
  • X i = K i q X K gives q M g + 1 2 ;
  • X i = T i ( q X T 1 ) gives ( 1 ) g q g + 1 2 g ;
  • X i = T i q i , summed over all choices of g indices, gives 1 λ 1 < < λ g M q λ i .
Hence(Theorem 5 (2)),
H 3 q ( g ) = q M + 1 2 M g + 1 2 ( 1 ) g q g + 1 2 g 1 λ 1 < < λ g M q λ i = ( 1 ) g q M + 1 2 M g + 1 2 + g + 1 2 g q g 2 + g G g M .
Using M + 1 2 M g + 1 2 + g + 1 2 + g 2 = M g + g ( g + 1 ) 2 , we obtain
G M N + M = g = 0 M ( 1 ) g q M g + g ( g + 1 ) 2 M g q G 2 M N + 2 M g .
The classical q-Vandermonde identity.
P S = [ M ] q , [ M 1 ] q , , [ 1 ] q , P T = [ 1 , 2 , , M ] .
By Theorem 4 (2) (4),
S U M q ( N , P S , P T ) = S U M q ( N , [ [ 1 ] q , [ 2 ] q , , [ M ] q ] , P T ) = [ M ! ] q G M + 1 N + M = g = 0 M H 1 q ( g ) G 1 + g N .
We now compute H 1 q ( g ) . For the i-th factor, K i = [ M + 1 i ] q . When X i = K i ,
B i = [ M + 1 i ] q + G 1 X T 1 = q ( M + 1 i ) G 1 M + 1 i + X T 1 .
By Theorem 5 (2),
X i K B i = q ( M + 1 ) ( M g ) i = g + 1 M G 1 i 1 λ 1 < < λ M g M q λ i = q ( M + 1 ) ( M g ) i = g + 1 M G 1 i q M g + 1 2 G M g M ,
and multiplying by the contribution from the gT-terms, which is [ g ! ] q + , we obtain
H 1 q ( g ) = [ g ! ] q + · q ( M + 1 ) ( M g ) + M g + 1 2 i = g + 1 M G 1 i G M g M .
Since [ M ! ] q = q M + 1 2 i = 1 M G 1 i and G M g M = G g M , a direct simplification of the exponents gives
H 1 q ( g ) [ M ! ] q = q g ( g + 1 ) G g M .
Therefore,
G M + 1 N + M = g = 0 M q g ( g + 1 ) G g M G 1 + g N .
Now apply q p to both sides. By Theorem 4 (3), q p G M + 1 N + M = G M + 1 + p N + M + p and q p q g ( g + 1 ) G g M G 1 + g N = q ( 1 + p + g ) g G g M G 1 + p + g N + p . and replacing M with M + p in the above identity, we obtain
G M + 1 + p N + M + p = g = 0 M q ( 1 + p + g ) g G g M G 1 + p + g N + p = g = 0 M + p q g ( g + 1 ) G g M + p G 1 + g N .
Extension of Classical Theorems.
In view of the recurring occurrence of products such as G k M G g k in the preceding sections, we obtain the following generalizations.
k = 0 M ( 1 ) k + g G k M G g k = 0 , M + g odd , G g M ( q ; q 2 ) M g 2 , M + g even . . k = 0 M ( 1 ) k + g G k M G M g M k = 0 , g odd , G g M ( q ; q 2 ) g 2 , g even . . k = 0 M ( 1 ) k + g G k M G g k q k = q g G g M ( q ; q 2 ) M g + 1 2 , M + g odd , q g G g M ( q ; q 2 ) M g 2 , M + g even . . k = 0 M ( 1 ) k + g G k M G g k q k = ( 1 ) M g q M G g M ( q ; q 2 ) M g + 1 2 , M + g odd , ( 1 ) M g q M G g M ( q ; q 2 ) M g 2 , M + g even . . k = 0 M [ k M ] q 2 [ g k ] q 2 q k = q g [ g M ] q 2 ( q ; q ) M g . k = 0 M [ k M ] q 2 [ g k ] q 2 q k = q M [ g M ] q 2 ( q ; q ) M g .
The first equation extends the Gauss q-binomial theorem [5]: k = 0 M ( 1 ) k G k M = 0 , M odd , ( q ; q 2 ) M 2 , M even . .
The fifth equation extend another Gauss identity [5]: k = 0 M [ k M ] q 2 q k = ( q ; q ) M .
All identities above are derived by elementary induction and are presented here for reference.
Proposition 1.
The following identities hold:
1. 
For P S = [ [ T 1 ] q , [ T 2 ] q , , [ T M ] q ] and P T = [ T 1 , T 2 , , T M ] ,
H 1 q ( g ) = i = 1 M [ T i ] q q ( g + 1 + p ) g G g M , p = T M M .
2. 
For P S = [ [ K ] q , [ K + 1 ] q , , [ K + M 1 ] q ] and P T = [ T , T + 1 , , T + M 1 ] ,
H 1 q ( g ) = q g + 1 2 i = 1 g [ T 1 + i ] q i = 1 M g [ K + M i ] q G g M .
3. 
With the same K as above,
r = 0 M g F M g r K E r g , q = i = 1 M g [ K + M i ] q G g M .
4. 
For general P S and P T , if we prepend a factor [ T ] q with a new T, we have
H 1 q ( g , [ [ T ] q , P S ] , [ T , P T ] ) = [ T ] q H 1 q ( g ) + q p + g H 1 q ( g 1 ) , p = T M M .
Proof. 
For (1), from Theorem 4(3), we have
S U M q ( N , P S , P T ) = i = 1 M [ T i ] q G T M + 1 N + T M = i = 1 M [ T i ] q G M + p + 1 N + M + p = g = 0 M H 1 q ( g ) G 1 + p + g N + p .
Using G M + p + 1 N + M + p = g q ( g + 1 + p ) g G g M G 1 + p + g N + p (22) , yields (1).
For (2), the proof is analogous to that of (22).
For (3), it follows directly from Theorem 7 and (2) ( T 1 1 does not affect the result).
For (4), by Theorem 4 (4), S U M q ( N , [ [ T ] q , P S ] , [ T , P T ] ) = [ T ] q S U M q ( N , P S , P T ) . Expanding both sides in F o r m 1 and comparing the coefficients of G 1 + p + g N + p . □
Definition 3.
We define a new number,
M M q = 0 , g M q = λ 1 + + λ g + 1 = M g 1 i = 1 g + 1 [ i ] q λ i [ 1 + λ 1 ] q [ 1 + λ 1 + λ 2 ] q [ 1 + λ 1 + λ 2 + + λ g ] q ,
with all λ i 0 . They satisfy
g M q = [ M g ] q g 1 M 1 q + [ g + 1 ] q g M 1 q , g M q = M g 1 M q .
Proposition 2
(Three expansions of [ N ] q M ). 
[ N ] q M = g = 1 M [ g ! ] q + S 2 q ( M , g ) q g G g N = g = 1 M ( 1 ) M g [ g ! ] q S 2 q ( M , g ) q g G g N + g 1 = g = 0 M 1 g M q q M g 2 G M N + g .
Proof. 
Take
P S = [ 1 ] q , [ 1 ] q , , [ 1 ] q , P T = [ 2 , 3 , , M ] ,
with K i = [ 1 ] q = q 1 , D i = 1 , and note that here c a r d { T i } = M 1 , H = M ( M 1 ) = 1 .
First, by Theorem 4(1)(4),
q 1 S U M q ( N , [ [ 1 ] q , [ 1 ] q , , [ 1 ] q ] , [ 1 , 2 , 3 , , M ] ) = i = 1 M ( q 1 + [ N 1 ] q ) = q M [ N ] q M .
= q 1 q 1 S U M q ( N , P S , P T ) = q 1 g = 0 M 1 H 1 q ( g ) q g G 1 + g N = q 1 g = 0 M 1 H 2 q ( g ) G 1 + g N + g .
We now compute H 1 q ( g ) . The B i factors are
B i = q 1 G 1 1 + X T , X i = K i , q X T G 1 1 + X T = q 1 q 1 + X T G 1 1 + X T , X i = T i .
The product over the T-terms is independent of their positions and equals
X i = T i B i = [ ( g + 1 ) ! ] q + q g [ 1 ] q + 1 = [ ( g + 1 ) ! ] q + q g 1 .
Thus
H 1 q ( g ) = [ ( g + 1 ) ! ] q + q g 1 X i = K i B i = [ ( g + 1 ) ! ] q + q g 1 q ( M 1 g ) E M 1 g g + 1 , q ,
E r g , q = 1 ν 1 ν r g [ ν 1 ] q [ ν r ] q = S 2 q ( r + g , g ) . Substituting it into S U M q gives
[ N ] q M = q 1 g = 0 M 1 [ ( g + 1 ) ! ] q + S 2 q ( M , g + 1 ) q g G 1 + g N
The substitution g g + 1 gives the first identity; the proof of the second is identical.
Now Set
P S = [ 1 ] q , [ 1 ] q , , [ 1 ] q , P T = [ 1 , 2 , 3 , , M ] ,
Thus
q 1 S U M q ( N ) = q M [ N ] q M = g = 0 M H 3 q ( g ) q g G M N + M 1 g .
the B i factors are
B i = q 1 G 1 1 + X T , X i = K i , q X T G 1 i X T = q X T G 1 X K , X i = T i .
X i = K i q 1 gives q ( M g ) , X i = T i q X T gives q g ( g + 1 ) 2 , X i = K i G 1 1 + X T gives E M g g + 1 , q .
When X j = K j , j λ 1 , the factor T λ 1 + 1 first appears in B i . All leading G 1 1 + X T are G 1 1 , and all 1 + X T ( X i = K i ) after it are greater than 1. Thus
G 1 1 + X T G 1 X K = ( G 1 1 ) λ 1 [ 0 + λ 1 ] q .
When T λ 1 + 1 + λ 2 + 1 appears for the second time, G 1 1 + X T = G 1 2 for X j K with λ 1 + 1 < j < λ 1 + 1 + λ 2 + 1 , and all later 1 + X T ( X i = K i ) are greater than 2. At this point, X K = λ 1 + λ 2 , so
G 1 1 + X T G 1 X K = ( G 1 1 ) λ 1 ( G 1 2 ) λ 2 [ 0 + λ 1 ] q [ 0 + λ 1 + λ 2 ] q .
Continuing this way yields
G 1 1 + X T G 1 X K = ( G 1 1 ) λ 1 ( G 1 2 ) λ 2 ( G 1 1 + g ) λ 1 + g [ 0 + λ 1 ] q [ 0 + λ 1 + λ 2 ] q [ 0 + λ 1 + λ 2 + + λ g ] q , λ i = M g .
Since the term vanishes when λ 1 = 0 , we may assume λ 1 > 0 and set λ 1 : = λ 1 1 ,
G 1 1 + X T G 1 X K = ( G 1 1 ) λ 1 ( G 1 2 ) λ 2 ( G 1 1 + g ) λ 1 + g [ 1 + λ 1 ] q [ 1 + λ 1 + λ 2 ] q [ 1 + λ 1 + λ 2 + + λ g ] q = g M q , λ i = M g 1 .
Thus
H 3 q ( g ) = q ( M g ) + g ( g + 1 ) 2 g M q .
Substituting it into S U M q gives
q M [ N ] q M = g = 0 M q ( M g ) + g ( g + 1 ) 2 g M q q g G M N + M 1 + g .
H 3 q ( M ) = 0 , thus
[ N ] q M = g = 0 M 1 q g ( g + 1 ) 2 g M q G M N + M 1 g .
Substituting g M 1 g and M g 1 M q = g M q , gives the third identity. □
The first and third expansions correspond, respectively, to the classical q-Stirling numbers of the second kind and the q-Eulerian numbers (Carlitz [6,7,8]). The second expansion, however, appears less common in the literature.
Take the limit q 1 ,
lim q 1 g M q = g M = λ 1 + + λ g + 1 = M g 1 i = 1 g + 1 i λ i ( 1 + λ 1 ) ( 1 + λ 1 + λ 2 ) ( 1 + λ 1 + λ 2 + + λ g )
N M = g = 1 M g ! S 2 ( M , g ) N g = g = 1 M ( 1 ) M g g ! S 2 ( M , g ) N + g 1 g = g = 0 M 1 g M N + g M .
Here S 2 ( M , g ) and g M denoting Stirling and Eulerian numbers (the expression of the latter is the main result of [9]), Theorem 3(1) gives three expressions for the Eulerian polynomial.
Proposition 3.
For nonnegative integers satisfying the stated conditions, the following identities hold:
1. 
If 0 A < M and T 0 , then
g = 0 M G g M G A A + T + g G A + T + 1 + g N + A + T q g ( g + 1 + T ) = k = 0 A G k + T A + T G M + T M + T + k G M + T + 1 + k N + M + T q k ( k + 1 + T ) .
2. 
If A , B , T 0 and A + B < M , then
g = 0 M ( 1 ) g G g M G A A + T + g G B g q g 2 g ( A + B ) = 0 .
3. 
If K , T 0 , then
g = 0 M ( 1 ) g G g M G M + K M + K + T + g q M + 1 g 2 + ( M g ) K = ( 1 ) M G K T + M + K .
Proof. 
(1) Take
P S = [ T + 1 ] q , [ T + 2 ] q , , [ T + M ] q , P T = [ T + A + 1 , T + A + 2 , , T + A + M ] .
Applying Proposition 1(2) gives
S U M q ( N ) = g = 0 M G A + T + 1 + g N + A + T i = 1 g [ T + A + i ] q i = 1 M g [ T + g + i ] q q g + 1 2 G g M = g = 0 M G A + T + 1 + g N + A + T i = 1 g [ T + A + i ] q i = 1 M g [ T + g + i ] q q g + 1 2 ( T + M + 1 ) ( M g ) + M + 1 g 2 G g M = ( q ; q ) A ( q T + A + 1 ; q ) M A ( 1 q ) M g = 0 M G A + T + 1 + g N + A + T q g + 1 2 ( T + M + 1 ) ( M g ) + M + 1 g 2 G A A + T + g G g M .
On the other hand, using Theorem 4(2)(4), the same S U M q ( N ) can be rewritten as
S U M q ( N ) = i = 1 M A [ T + A + i ] q · S U M q N , [ [ T + 1 ] q , , [ T + A ] q ] , [ T + M + 1 , , T + M + A ] .
Applying Proposition 1(2) again yields
S U M q ( N ) = q ( M A ) ( 2 T + A + M + 1 ) 2 k = 0 A G M + T + 1 + k N + M + T q k + 1 2 ( T + A + 1 ) ( A k ) + A + 1 k 2 i = 1 M [ T + k + i ] q G k A .
Comparing (*) and (**), and simplifying the q-factorial factors, gives exactly (1).
(2) follows from (1) by applying Theorem 8.
(3) Take
P S = [ T + 1 ] q , [ T + 2 ] q , , [ T + M ] q , P T = [ T + K + M + 1 , T + K + M + 2 , , T + K + 2 M ] .
By (1), the H 1 q ( g ) coefficients are
a g = H 1 q ( g ) = q g + 1 2 ( T + M + 1 ) ( M g ) + M + 1 g 2 i = 1 g [ T + K + M + i ] q i = 1 M g [ T + M + 1 i ] q G g M .
Using the transformation formula in Theorem 6(3), which states
b g = H 2 q ( g ) = k ( 1 ) k + g H 1 q ( k ) q g ( g + 1 ) k ( k + 3 ) 2 k g ,
and taking g = 0 , we obtain
b 0 = k ( 1 ) k a k * q k ( k + 3 ) 2 = k ( 1 ) k H 1 q ( k ) q k ( k + 3 ) 2 ( T + K + M ) k = g ( 1 ) g H 1 q ( g ) q g ( g + 3 ) 2 ( T + K + M ) g .
On the other hand, from the definition of H 2 q ( 0 ) , a direct computation gives
b 0 = H 2 q ( 0 ) = ( 1 ) M q M ( T + K + M + 1 ) i = 1 M [ K + i ] q .
Therefore,
( 1 ) M q M ( T + K + M + 1 ) i = 1 M [ K + i ] q = g ( 1 ) g H 1 q ( g ) q g ( g + 3 ) 2 ( T + K + M ) g .
Substituting the expression for H 1 q ( g ) and simplifying the product gives
( 1 ) M i = 1 M [ K + i ] q = g ( 1 ) g q M + 1 g 2 + ( M g ) K i = 1 g [ T + K + M + i ] q i = 1 M g [ T + M + 1 i ] q G g M .
Simplifying the product
i = 1 g [ T + K + M + i ] q i = 1 M g [ T + M + 1 i ] q = i = 1 K + M [ T + g + i ] q / i = 1 K [ T + M + i ] q
Thus,
( 1 ) M i = 1 K [ T + M + i ] q = g ( 1 ) g q M + 1 g 2 + ( M g ) K i = 1 K + M [ T + g + i ] q / i = 1 M [ K + i ] q G g M .
Multiply both sides by ( q ; q ) K 1 ( 1 q ) K , we arrive at
( 1 ) M G K T + M + K = g = 0 M ( 1 ) g q M + 1 g 2 + ( M g ) K G g M G M + K T + M + K + g ,
which is exactly (3). □
Proposition 4
(A nested summation identity with step size 2). 
n M = 0 N 1 n 1 = 0 n 2 [ K + 2 n 1 ] q [ K + 1 + 2 n 2 ] q [ K + M 1 + 2 n M ] q q j = 1 M n j = q ( N 1 ) M i = 1 M [ K + N 2 + i ] q G M M + N 1 .
Proof. 
Take
P S = [ K ] q , [ K + 1 ] q , , [ K + M 1 ] q , P T = [ 1 , 2 , , M ] .
By Proposition 1(2), the coefficients H 1 q ( g ) for this S U M q ( N ) satisfy
X i = K i B i = q ( K + M ) ( M g ) + M g + 1 2 i = 1 M g [ K + g 1 + i ] q G g M .
And the definition of B i is
B i = q ( K 1 + i ) G 1 K 1 + i + G X T = q ( K 1 ) i G 1 K 1 + i + X T , X i = K i .
Thus for a choice of M g indices from K (say, λ 1 < < λ M g ), the product of the corresponding B i ’s is
t = 1 M g q ( K 1 ) λ t G 1 K 1 + λ t + X T ,
This leads, after summing over all such choices and relabelling, to the multinomial expansion
X i = K i B i = 0 n 1 n M g g q ( K 1 ) ( M g ) t = 1 M g t t = 1 M g n t t = 1 M g G 1 K 1 + t + 2 n t .
This follows because the inversion statistic for the K-choices produces q n t after the standard reduction; details are routine.
Comparing the two expressions yields
0 n 1 n M g g t = 1 M g G 1 K 1 + t + 2 n t q g ( M g ) t = 1 M g n t = t = 1 M g G 1 K + g 1 + t G g M .
Now set g = N 1 and replace M g by M (i.e., take g = N 1 and reindex the sum). We get
0 n 1 n M N 1 t = 1 M G 1 K 1 + t + 2 n t q ( N 1 ) M t = 1 M n t = t = 1 M G 1 K + N 2 + t G N 1 M + N 1 .
Multiplying both sides by q ( N 1 ) M and noting that G 1 a = [ a ] q , G N 1 M + N 1 = G M M + N 1 , we obtain
n M = 0 N 1 n 1 = 0 n 2 i = 1 M [ K 1 + i + 2 n i ] q q i = 1 M n i = q ( N 1 ) M i = 1 M [ K + N 2 + i ] q G M M + N 1 .
which is exactly the claimed identity. □
In particular,
S U M ( N , [ 1 , 2 , , M ] : 2 , [ 1 , 3 , , 2 M 1 ] ) = M ! N + M 1 M 2 ,
and for M = 1 ,
1 + 3 + + ( 2 N 1 ) = N 2 .

6. Unified Conversion Formulas

The following theorem is a direct consequence of Theorem 6 and Theorem 5(3); it also generalizes Theorem 3(1).
Theorem 12.
For any integer A, the following hold:
1. 
g = 0 M a g * q g ( g + 1 ) 2 + A g z g = g = 0 M b g ( q A + 1 z ; q ) g = g = 0 M c g * q g ( g + 1 ) 2 + A g z g ( q A + 1 z ; q ) M g .
2. 
g = 0 M b g q A g z g = g = 0 M ( 1 ) g a g * q g ( g + 3 ) 2 ( q A g + 1 z ; q ) g = q A M z M g = 0 M c g * q ( M + 1 ) g ( q A z 1 ; q ) g .
3. 
g = 0 M c g * q A g z g = g = 0 M a g * q A g z g ( q A + 2 + g z ; q ) M g = g = 0 M b g ( q A + 2 + g z ; q ) M g .
Thus, any one of the three coefficient sequences determines the other two; the parameters A , z , a g , b g , c g may be chosen freely to produce further relations.
  • Three-form equivalence from special coefficients.
Taking the special choices
a g * , 1 = q g ( g + 1 ) + A g G g M , a g * , 2 = a g * , 1 z g
Using Theorem 6 and (5)–(6), we obtain
b g * , 1 = q A g G g M ( q A ; q ) M g , b g * , 2 = q A g G g M ( z q A ; q ) M g z g ,
c g * , 1 = ( 1 ) g q g ( g + 3 ) 2 G g M ( q A ; q ) g , c g * , 2 = ( 1 ) g q g ( g + 3 ) 2 G g M ( z q A ; q ) g .
Substituting these into the three-form equivalence gives
g q g ( g + 1 + A + p ) G g M z g G 1 + p + g N = g q A g ( z q A ; q ) M g G g M G 1 + p + g N + g = g ( 1 ) g q g ( g + 3 ) 2 + p g G g M ( z q A ; q ) g G 1 + p + M N + M g .
Generating function identities and consequences.
Applying the first identity in Theorem 4(3), we obtain
g a g * , 1 q g ( g + 1 ) 2 z g = g a g * , 2 q g ( g + 1 ) 2 = ( z q 1 + A ; q ) M .
This yields the equivalent expressions (Theorem 12(1))
( z q 1 + A ; q ) M = g q A g G g M ( q A ; q ) M g ( z q ; q ) g = g q A g z g G g M ( z q A ; q ) M g ( q ; q ) g = g ( 1 ) g q g z g G g M ( q A ; q ) g ( z q ; q ) M g = g ( 1 ) g q g G g M ( z q A ; q ) g ( q ; q ) M g .
Setting A = 1 and replacing z q by z in the starred equation gives
( z q ; q ) ( q ; q ) = g q g ( z ; q ) g ( q ; q ) g .
When A = 0 , we have
a g * , 2 = q g ( g + 1 ) G g M z g , b g * , 2 = G g M ( z ; q ) M g z g .
Computing a g * , 2 from b g * , 2 yields
g ( z ; q ) M g z g G g M G k g = z k G k M ,
which is equivalent to ( z = q )
g q g ( q ; q ) g k = q k ( q ; q ) M k ,
and hence ( k = 0 ), gives a known formula [5]
g q g ( q ; q ) g = 1 ( q ; q ) M .
Jacobi’s q-binomial theorem.
Applying Theorem 12(1) to a g * , 2 = q g ( g + 1 ) G g M z g , b g * , 2 = G g M ( z ; q ) M g z g , we get
g a g * , 2 q g ( g + 1 ) 2 g z g x g ( 1 ) g = g b g * , 2 ( x / z ; q ) g .
Thus
( 1 x ) ( 1 x q ) ( 1 x q M 1 ) = g G g M ( 1 z ) ( 1 z q ) ( 1 z q M g 1 ) ( z x ) ( z x q ) ( z x q g 1 ) .
Replacing x by a / b and z by c / b , then multiplying through by b M , recovers Jacobi’s q-binomial theorem (see [5], p. 71):
( b a ) ( b a q ) ( b a q M 1 ) = g G g M ( b c ) ( b c q ) ( b c q M g 1 ) ( c a ) ( c a q ) ( c a q g 1 ) .
Finite form of Jacobi’s Durfee square identity.
Take c g * , 1 = ( 1 ) g q g ( g + 3 ) 2 G g M ( q 0 ; q ) g = δ g 0 , Theorem 12(3) gives
g a g * , 1 q ( r 1 ) g a g ( a q 1 + r + g ; q ) M g = 1 ,
or equivalently( a g * , 1 = q g ( g + 1 ) G g M ),
g G g M q g 2 + g r a g ( a q 1 + r + g ; q ) M g ( a q ; q ) M = 1 ( a q ; q ) M .
Letting M , this becomes the finite form of Jacobi’s Durfee square identity (see [5], pp. 158–159):
g q g 2 + g r a g ( q ; q ) g ( a q ; q ) g + r = 1 ( a q ; q ) .
Special case b g = q g .
Taking b g = q g and using the identity
k = 0 M G g k q k g = G g + 1 M + 1 ,
we obtain
a g * = q g ( g + 2 ) G g + 1 M + 1 .
Similarly, applying (see [5], p. 22)
k G g M k q ( g + 1 ) k = G g + 1 M + 1
yields
c g * = ( 1 ) g q g ( g + 3 ) 2 G g + 1 M + 1 .
Substituting these into the three-form equivalence gives
g q g ( g + 2 + p ) G g + 1 M + 1 G 1 + p + g N = g q g G 1 + p + g N + g = g ( 1 ) g q g ( g + 3 ) 2 + p g G g + 1 M + 1 G 1 + p + M N + M g .
Consequences of the conversion formulas.
Computing b g from a g * and c g * gives
k ( 1 ) k + g G g k q g ( g + 1 ) k ( k + 1 ) 2 g k G k + 1 M + 1 = q M g 2 k ( 1 ) M + k + g G M g k q k ( k + 3 ) 2 ( M + 1 ) k G k + 1 M + 1 = q g .
Conversely, computing a g * and c g * from b g yields
G g + 1 M + 1 = k ( 1 ) k G M g M k G k + 1 M + 1 q k ( k + 1 ) 2 = k ( 1 ) k G M g M k G k + 1 M + 1 q k ( k + 1 ) 2 g ( k + 1 ) .
Application of Theorem 12(3).
From Theorem 12(3) and Theorem 5(3), we have
g q g ( q 1 + g ; q ) M g = g q g ( g + 1 ) G g + 1 M + 1 ( q 1 + g ; q ) M g = g ( 1 ) g q g ( g + 1 ) 2 G g + 1 M + 1 = 1 ( 1 ; q ) M + 1 = 1 .
Also,
g c g * q g z g = z 1 z 1 ( z ; q ) M + 1 = g q g ( z q 1 + g ; q ) M g ,
which is equivalent to
( z ; q ) M + 1 + g = 0 M z q g ( z q 1 + g ; q ) M g = 1 1 + g = 0 M z q g ( z ; q ) g + 1 = 1 ( z ; q ) M + 1 ,
a generalization of the identity g q g ( q ; q ) g = 1 ( q ; q ) M (see [5], p. 113).
  • Euler’s identity.
Finally, by Theorem 12(2),
g b g q g = M + 1 = q M g c g * q ( M + 1 ) g ( q ; q ) g = g ( 1 ) g G g + 1 M + 1 q g ( g + 1 ) 2 M ( g + 1 ) ( q ; q ) g .
Replacing q by q 1 recovers Euler’s identity (see [5], p. 83): g = 1 M G g M ( q ; q ) g 1 = M .
  • Parallel derivation from c g * .
Starting from
c g * , 1 = ( 1 ) g q g ( g + 1 ) 2 + B g G g M , c g * , 2 = c g * , 1 z g ,
(6) gives
a g * , 1 = q g ( g + 1 ) G g M ( q B g ; q ) g , a g * , 2 = q g ( g + 1 ) G g M ( q B g z ; q ) g .
Substituting these into Theorem 12(1)(2) yields:
g ( 1 ) g q A g + B g G g M z g ( q A + 1 z ; q ) M g = g q g ( g + 1 ) 2 + A g G g M ( q B g ; q ) g z g ,
g ( 1 ) g q A g + B g G g M z g ( q A + 1 ; q ) M g = g q g ( g + 1 ) 2 + A g G g M ( q B g z ; q ) g ,
q A M z M g ( 1 ) g q g ( g + 1 ) 2 + B g ( M + 1 ) g G g M ( q A z 1 ; q ) g = g ( 1 ) g q g ( g 1 ) 2 G g M ( q B g ; q ) g ( q A + 1 g z ; q ) g ,
q A M g ( 1 ) g q g ( g + 1 ) 2 + B g ( M + 1 ) g G g M z g ( q A ; q ) g = g ( 1 ) g q g ( g 1 ) 2 G g M ( q B g z ; q ) g ( q A + 1 g ; q ) g .
B = 1 , A = 1 , (1) yields
g ( 1 ) g G g M z g ( z ; q ) M g = 1 . z = q g q g ( q ; q ) g = 1 ( q ; q ) M .
B = 1 , A = 0 , (3) yields
z M g ( 1 ) g q g ( g + 1 ) 2 M g G g M ( z 1 ; q ) g = 1 .
Set z = q 1 , replace g by M g yields
q M g ( 1 ) M g q ( M g ) ( M g + 1 ) 2 M ( M g ) G g M ( q ; q ) M g = q M ( M + 1 ) 2 g ( 1 ) M g q g ( g 1 ) 2 G g M ( q ; q ) M g = 1 .
Thus
g = 0 M ( 1 ) g q g ( g 1 ) 2 ( q ; q ) g = ( 1 ) M q M ( M + 1 ) 2 ( q ; q ) M .
Generalization to arbitrary T i and Cauchy’s identity.
In the preceding discussion we assumed T i N . However, apart from the combinatorial interpretation of S U M q ( N ) , T i may be arbitrary numbers. To illustrate this flexibility, set
a = b q T , P S = [ a , a , , a ] : a ( q 1 ) , P T = [ T , T + 1 , , T + M 1 ] .
Here a and b are independent by virtue of the free parameter T.
A direct computation using Theorem 1 gives the H 1 q ( g ) and H 3 q ( g ) coefficients:
H 1 q ( g ) = G g M q g ( g + 1 ) 2 ( b a ) ( b q a ) ( b q g 1 a ) a M g ,
and
H 3 q ( g ) = G g M ( 1 ) g q g ( g + 1 ) 2 a M .
With a g * = H 1 q ( g ) q ( T 1 ) g and c g * = H 3 q ( g ) q ( T 1 ) g , Thus
g c g * ( b x ) g q ( T 1 ) g ( T + 1 ) g = g H 3 q ( g ) ( b x ) g q ( T + 1 ) g = a M g G g M ( 1 ) g q g ( g 1 ) 2 ( b q T x ) g = a M ( a x ; q ) M .
On the other hand (Theorem 12(3)), expressing the same sum in terms of a g * gives ( b g q T g = a g )
g a g * ( b x ) g q ( T 1 ) g ( T + 1 ) g ( b x q g ; q ) M g = g H 1 q ( g ) ( b x ) g q ( T + 1 ) g ( b x q g ; q ) M g = a M g G g M q g ( g 1 ) 2 ( b a ) ( b q a ) ( b q g 1 a ) x g ( b x q g ; q ) M g .
Equating the two expressions and dividing by ( b x ; q ) M , we obtain
( a x ; q ) M ( b x ; q ) M = g G g M q g ( g 1 ) 2 ( b a ) ( b q a ) ( b q g 1 a ) x g ( b x q g ; q ) M g ( b x ; q ) M .
Letting M and using the standard limiting argument recovers Cauchy’s identity (see [5], p. 260):
( a x ; q ) ( b x ; q ) = g = 0 q g ( g 1 ) 2 x g ( b a ) ( b q a ) ( b q g 1 a ) ( q ; q ) g ( b x ; q ) g .
The case M = .
Letting M , | x | < 1 and taking b g = x g then (Lemma 2)
a g * = q g ( g + 1 ) k = 0 x k G g k = q g ( g + 1 ) x g ( x ; q ) g + 1 .
we obtain from Theorem 12(1):
g = 0 q g ( g + 1 ) 2 A g x g z g ( x ; q ) g + 1 = g = 0 x g ( q A + 1 z ; q ) g .
For A 0 , z = q 1 , the right-hand side collapses to a finite sum:
g = 0 ( 1 ) g q g ( g 1 ) 2 A g x g ( x ; q ) g + 1 = g = 0 A x g ( q A ; q ) g .
Theorem 12(2):
g = 0 x g z g q A g = 1 1 x z q A = g = 0 ( 1 ) g q g ( g 1 ) 2 x g ( x ; q ) g + 1 ( q A + 1 g z ; q ) g
For A 0 , z = 1 , the right-hand side collapses to a finite sum:
1 1 x q A = g = 0 A ( 1 ) g q g ( g 1 ) 2 x g ( x ; q ) g + 1 ( q A ; q 1 ) g .
In summary, the framework above not only provides short proofs of classical q-binomial theorems (and their finite extensions), but also yields a substantial collection of apparently new identities. Moreover, by freely specializing the free parameters, one can systematically generate a vast further family of such identities, of which only a few representative examples are given here.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Y. Wang and Y. Li, Some identities on q-binomial coefficients, J. Math. Anal. Appl. 529 (2024), no. 1, Article 127594.
  2. V.J.W. Guo and H. Zhang, q-binomial identities revisited, Ramanujan J. 62 (2023), 1123–1142.
  3. S.O. Warnaar, q-hypergeometric and related identities, in: J.-P. Françoise, G.L. Naber, and T.S. Tsun (eds.), Encyclopedia of Mathematical Physics, vol. 4, Elsevier, Oxford, 2006, pp. 260–268.
  4. P.A. MacMahon, The indices of permutations and the derivation therefrom of functions of a single variable associated with the permutations of any assemblage of objects, Amer. J. Math. 35 (1913), 281–322. [CrossRef]
  5. W.P. Johnson, An Introduction to q-Analysis, American Mathematical Society, Providence, RI, 2020.
  6. L. Carlitz, q-Bernoulli and Eulerian numbers, Trans. Amer. Math. Soc. 76 (1954), 332–350.
  7. L. Carlitz, A combinatorial property of q-Eulerian numbers, Amer. Math. Monthly 82 (1975), 51–54.
  8. L. Carlitz, A note on q-Eulerian numbers, J. Combin. Theory Ser. A 25 (1978), 90–94. [CrossRef]
  9. D.-J. Qi, A new explicit expression for the Eulerian numbers, J. Qingdao Univ. Sci. Technol. Nat. Sci. Ed. 4 (2012), 33.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.