Positivity of certain sums over Jacobi kernel polynomials (Q950413)

The author considers sums of the form \[ S_n^{\alpha}(x,y):=\frac{1}{x-y}\sum_{j=0}^nc_j^{\alpha}\left[P_{j+1}^{(\alpha,\alpha)}(x)P_j^{(\alpha,\alpha)}(y)-P_j^{(\alpha,\alpha)}(x)P_{j+1}^{(\alpha,\alpha)}(y)\right], \] where \(-\frac{1}{2}\leq\alpha\leq\frac{1}{2}\), \(-1\leq x\leq 1\), \(n\in\{0,1,2,\dots\}\) and \[ c_j^{\alpha}:=\frac{\Gamma(j+2)\Gamma(j+2\alpha+2)}{2^{2\alpha+1}\Gamma(j+\alpha+1)\Gamma(j+\alpha+2)}. \] Here \(P_n^{(\alpha,\beta)}(x)\) denotes the \(n\)th order Jacobi polynomial which is orthogonal on the interval \([-1,1]\) with respect to the weight function \((1-x)^{\alpha}(1+x)^{\beta}\). For \(\beta=\alpha\) these polynomials are also called Gegenbauer or ultraspherical polynomials. For \(\beta=\alpha=\pm\frac{1}{2}\) these polynomials reduce to Chebyshev polynomials (of the first and second kind). The main result of the paper is the proof of the positivity of \(S_{2n}^{\alpha}(x,0)\). This proof is a computer-assisted proof based on the \texttt{ProveInequality} command of the Mathematica package \texttt{SumCracker} [\textit{M. Kauers}, J. Symbolic Comput. 41, No.~9, 1039--1057 (2006; Zbl 1122.68746)]. The author ends with an obvious open problem to give a ``human'' proof of the positivity of this sum.