A \(q\)-analog of Euler's decomposition formula for the double zeta function (Q2368467)

Euler proved a decomposition formula, which expresses the product of two values of the Riemann zeta function as a finite sum of double zeta values involving binomial coefficients. Here the author establish a \(q\)-analog of Euler's decomposition formula. Let \([k]_q:=\sum_{j=0}^{k-1}q^j\). The \(q\)-analogs of the Riemann zeta-function and double zeta-function are given by \[ \zeta[s]=\sum_{n>0}\frac{q^{(s-1)n}}{[n]^s_q}, \qquad \zeta[s, t]=\sum_{n>k>0}\frac{q^{(s-1)n}q^{(t-1)k}}{[n]^s_q [k]^t_q}. \] For \(s-1\) and \(t-1\) are positive integers he proves that \[ \begin{split} \zeta[s]\zeta[t]= &\sum_{a=0}^{s-1}\sum_{b=0}^{s-1-a}\binom{a+t-1}{t-1}\binom{t-1}{b}(1-q)^b \zeta[t+a, s-a-b]\\ &+\sum_{a=0}^{t-1}\sum_{b=0}^{t-1-a}\binom{a+s-1}{s-1}\binom{s-1}{b}(1-q)^b \zeta[s+a, t-a-b]\\ &-\sum_{j=1}^{\min(s, t)}\frac{(s+t-j-1)!}{(s-j)!(t-j)!}\frac{(1-q)^j}{(j-1)!} \sum_{n>0}\frac{(n-1)q^{(s+t-j-1)n}}{[n]^{s+t-j}_q} .\end{split} \] Observe that the limiting case \(q=1\) of above formula reduces to Euler's decomposition formula. The product \(\zeta[s]\zeta[t]\) was also considered in [\textit{J. Zhao}, ''\(q\)-multiple zeta functions and \(q\)-multiple polylogarithms'', arXiv:math.QA/0304448].