Next Article in Journal
Existence and Stability of Nonlinear Hybrid ABC-Fractional Differential Equations
Next Article in Special Issue
New Formulas of Bernoulli Polynomials of the Second Kind Using Several Approaches
Previous Article in Journal
Intelligent Visual Detection of Surrounding Personnel for Underground Load–Haul–Dump Vehicles in Complex Mining Environments
Previous Article in Special Issue
The Janjić–Petković Inset Counting Function: Riordan Array Properties and a Thermodynamic Application
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Reduction for a Terminating Bivariate Hypergeometric Appell Series ℱ1 (II)

by
Mohamed Jalel Attia
Department of Mathematics, College of Science, Qassim University, Buraidah 51452, Saudi Arabia
Mathematics 2026, 14(11), 2021; https://doi.org/10.3390/math14112021
Submission received: 7 March 2026 / Revised: 1 June 2026 / Accepted: 4 June 2026 / Published: 5 June 2026

Abstract

This paper studies a terminating (“modified”) Appell function F 1 ( α , β , β , β + β ; x , y ) , with α Z 1 and β , β Z 1 , together with the associated terminating Gauss function F 1 2 α , β β + β ; z . The reduction formula for the Appell function F 1 ( α , β , β , β + β ; x , y ) to 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y breaks down when ( β , β ) are integers less than or equal to 1 and it needs to be substituted with a revised identity that includes an explicit additional correction term CORR ( α , β , β ) ( x , y ) . This correction term is initially computed for specific cases (particularly for α = 1 , 2 , 3 ) and subsequently formulated and verified generally through mathematical induction on α . The final expression demonstrates a structured pattern reminiscent of binomial/Pascal coefficients and leads to various corollaries, including simplified boundary scenarios (such as when α = 1 ).

1. Introduction

In [1], we studied a terminating (“modified”) Appell function
F 1 ( α , β , β , 2 β ; x , y ) = m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( 2 β ) m + n x m y n m ! n ! ,
defined for α Z 1 and β Z 1 , jointly with the associated terminating Gauss function
F 1 2 α , β 2 β ; z = k = 0 β ( α ) k ( β ) k ( 2 β ) k z k k ! .
We demonstrated the failure of the classical Pfaff-type reduction for the non-terminating Appell function F 1
F 1 ( α , β , β , 2 β ; x , y ) = ( 1 y ) α F 1 2 α , β 2 β ; x y 1 y ,
and we have given the corrected identity, CORR ( α , β ) ( x , y ) , as an explicit additional term. The strongest contribution is the derivation of an explicit closed form for the correction term, first computed in low cases (notably a = 1, 2, 3) and then stated and proved, in general, by induction on a. The final formula exhibits a structured binomial/Pascal-type pattern in its coefficients and yields several corollaries, including simplified boundary cases (for example, α = 1 ).
Hypergeometric functions in mathematical analysis operate as a decisive device for comprehending many areas in pure and applied mathematics [2].
Appell [3] introduced this system of partial differential equations
u ( 1 u ) r + v ( 1 u ) s + ( γ ( α + β + 1 ) u ) p β v q α β f = 0 , v ( 1 v ) t + u ( 1 v ) s + ( γ ( α + β + 1 ) v ) q β u q α β f = 0 ,
in which u and v are independent variables, f is the unknown function of u and v, and p = f u , q = f v , r = 2 f u 2 , s = 2 f u v , t = 2 f v 2 . Monge’s well-known notation for partial derivatives has been investigated by many writers. The hypergeometric series in two variables
F 1 ( α , β , β , γ ; x , y ) = m = 0 n = 0 ( α ) m + n ( β ) m ( β ) n ( γ ) m + n x m y n m ! n ! , x < 1 , y < 1 ,
is a solution of (1).
Appell’s series are constituted by four double series F 1 , F 2 , F 3 , F 4 of two variables that were adressed by Paul Appell and that generalize Gauss’s hypergeometric series F 1 2 of one variable [4,5]. Appell established the set of partial differential equations, of which these functions are solutions, and found various reduction formulas and expressions of these series in terms of hypergeometric series of one variable or in terms of elementary functions, as shown on p. 1019 in [4]
F 1 ( α , β , β , β + β ; x , y ) = m = 0 n = 0 ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n m ! n ! = 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y .
For more information about all the hypergeometric functions of two variables, we refer the reader to Kimura’s book [5], starting from page 40.
In the case where α is a positive integer and β , β are negative integers, we define the modified hypergeometric function F 1 2 by [6]
F 1 2 ( α , β , β + β ; z ) = k = 0 β ( α ) k ( β ) k ( β + β ) k k ! z k , α Z > 0 , β , β Z < 0 ,
or the modified Appell function F 1 of two variables by
F 1 ( α , β , β , β + β ; x , y ) = m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n , α Z > 0 , β , β Z < 0 .
These two definitions are well-defined as both are two terminating, respectively, series and double series since the summations are only for m = 0 , . . , β , , n = 0 , . . , β , and the fact that β + β is also a negative integer does not cause any harm.
The most important question that we may ask is as follows: does F 1 fulfill the Equation (3)? In other words, does the following equation still hold true?
F 1 ( α , β , β , β + β ; x , y ) = m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n m ! n ! = 1 ( 1 y ) α F 1 2 ( α , β β + β ; x y 1 y ) ?
We prove that (6) is no longer true and we explicitly give, in the case where α is a positive integer and β , β are two negative integers, the correction term CORR ( α , β , β ) ( x , y ) , such that
m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y + CORR ( α , β , β ) ( x , y ) .
In fact, the main aim of this paper is to state and prove the following result for any α Z > 0
m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y k = 1 α α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) .
Remark 1.
As we deal with terminating sums, we only impose y 1 . The domain of validity of the corrected identity is reduced to singular loci such as y = 1 , with continuity extension when x = 1 ; since the sums are terminating, convergence is not an issue.
In the sequel, we will use the following equality:
F 1 2 α , β β + β ; 1 = ( β + β α ) α ( β α ) α .
Proposition 1.
For any positive integer α and any negative integers β and β , we have
F 1 ( α , β , β , β + β ; x , y ) = m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n m ! n ! 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y .
Proof. 
The left hand side of (6),
F 1 ( α , β , β , β + β ; x , y ) = m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n m ! n ! ,
is a polynomial on x and y. The right hand side of (6) is given by 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y . Let us denote by A k = ( α ) k ( β ) k k ! ( β + β ) k and by β = n , n N ; then,
1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y = 1 ( 1 y ) α 1 + A 1 x y 1 y + + A n x y 1 y n ,
then,
  • when x = 1 , using the continuity extension, we get
    1 ( 1 y ) α F 1 2 α , β β + β ; 1 = 1 ( 1 y ) α 1 + A 1 + + A n ,
    which is a rational function (which is not a polynomial),
  • when x 1 , we get
    1 ( 1 y ) α F 1 2 α , β β + β ; 1 = 1 ( 1 y ) α 1 + A 1 x y 1 y + + A n x y 1 y n = 1 ( 1 y ) α + n ( 1 y ) n + A 1 ( 1 y ) n 1 ( x y ) + + A n ( x y ) n ,
    which is also a rational function and cannot be a polynomial. In practice, the degree of y in the numerator is less than or equal to n, while the degree of y in the denominator is α + n > n , α 1 .
Therefore, we have to give the correction term CORR ( α , β , β ) ( x , y ) :
m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n m ! n ! = 1 ( 1 y ) α F 1 2 ( α , β β + β ; x y 1 y ) + CORR ( α , β , β ) ( x , y ) .
This paper will be organized as follows. First, we show how we found our first main result CORR ( 1 , β , β ) ( x , y ) . This result plays an important role in our second main result CORR ( 2 , β , β ) ( x , y ) . Then, with this later result, we give our third main result CORR ( 3 , β , β ) ( x , y ) . These three steps will lead us to deduce, by induction, our final main result CORR ( α , β , β ) ( x , y ) for any α N . The paper concludes with several remarks and corollaries, linking some double series to classical integer sequences.

2. The Correction Term CORR ( 1 , β , β ) ( x , y )

For α = 1 , we can write
m = 0 β n = 0 β ( 1 ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n m ! n ! = m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n .
The correction term CORR ( 1 , β , β ) ( x , y ) is given in the following theorem:
Theorem 1.
We have the following result
m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n = 1 ( 1 y ) F 1 2 1 , β β + β ; x y 1 y + CORR ( 1 , β , β ) ( x , y ) ,
where CORR ( 1 , β , β ) ( x , y ) = x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) , then we can write
m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n = 1 ( 1 y ) F 1 2 ( 1 , β β + β ; x y 1 y ) x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) .
Proof. 
Let us start from
m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n = 1 ( 1 y ) F 1 2 1 , β β + β ; x y 1 y + CORR ( 1 , β , β ) ( x , y ) ,
in such a way that we do NOT know CORR ( 1 , β , β ) ( x , y ) , then the proof will be carried out using, first, the change in variables x 1 x , y 1 y in (12), which is written as
m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n 1 x m 1 y n = 1 ( 1 1 y ) F 1 2 1 , β β + β ; 1 x 1 y 1 1 y + CORR ( 1 , β , β ) 1 x , 1 y ,
and, second, the following three steps:
  • The first step comes from the left hand side of (13):
    m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n 1 x m 1 y n = x β y β m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n ,
  • The second step comes from the right hand side of (13) and is given by the following equation
    1 ( 1 1 y ) F 1 2 1 , β β + β ; 1 x 1 y 1 1 y = y ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) ,
  • If we combine the first step and the second step, we get
    m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n = x β y 1 β ( y 1 ) F 1 2 1 , β β + β ; x y x ( 1 y ) + x β y β CORR ( 1 , β , β ) 1 x , 1 y ,
    and
    m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n = 1 ( 1 y ) F 1 2 1 , β β + β ; x y 1 y + CORR ( 1 , β , β ) ( x , y ) ,
    an identification gives:
    CORR ( 1 , β , β ) ( x , y ) = x β y 1 β ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) ,
    provided that
    x β y β CORR ( 1 , β , β ) 1 x , 1 y = 1 ( 1 y ) F 1 2 1 , β β + β ; x y 1 y ,
    which can be proven easily.
Remark 2.
Using the change IN variables x 1 x , y 1 y in 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y and multiplying by x β y β , we find x β y β ( 1 ) α y α ( 1 y ) α F 1 2 α , β β + β ; x y x ( 1 y ) .
  • In the sequel, we adopt the following notation:
W ( α , β , β ) ( x , y ) = ( 1 ) α x β y α β ( 1 y ) α F 1 2 α , β β + β ; x y x ( 1 y ) .
Corollary 1.
We have the following interesting particular cases:
m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m + n = m = 0 β β x m = x 1 β β 1 x 1 , m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n y n = ( 1 β β ) ( 1 β ) n = 0 β y n , m = 0 β m + 0 m ( β ) m ( β ) 0 ( β + β ) m + 0 x m y 0 = 1 ( 1 0 ) F 1 2 1 , β β + β ; x 0 1 0 , n = 0 β ( β ) n ( β + β ) n y n = 1 ( 1 y ) F 1 2 1 , β β + β ; y y 1 y β β + 1 ( 1 y ) 1 β ( β ) β ( β + β ) β .
Proof. 
• For x = y , Theorem (1) can be written as follows
m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m + n = 1 ( 1 x ) F 1 2 1 , β β + β ; 0 x β β + 1 ( 1 x ) F 1 2 1 , β β + β ; 0 = x 1 β β 1 x 1 = m = 0 β β x m .
  • For x = 1 , Theorem (1) can be written as follows
    m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n y n = 1 ( 1 y ) F 1 2 1 , β β + β ; 1 y β + 1 ( 1 y ) F 1 2 1 , β β + β ; 1 = 1 y 1 β ( 1 y ) F 1 2 1 , β β + β ; 1 = n = 0 β y n F 1 2 1 , β β + β ; 1 ,
    using (9) we get the result.
  • For y = 0 , Theorem (1) can be written as
    m = 0 β m + 0 m ( β ) m ( β ) 0 ( β + β ) m + 0 x m y 0 = 1 ( 1 0 ) F 1 2 1 , β β + β ; x 0 1 0 + 0 .
  • For x = 0 , Theorem (2) can be written as
    n = 0 β 0 + n 0 ( β ) 0 ( β ) n ( β + β ) 0 + n x 0 y n = 1 ( 1 y ) F 1 2 1 , β β + β ; 0 y 1 y y 1 β 1 y ( β ) β ( β + β ) β y y 1 β .
    This is equivalent to
    n = 0 β ( β ) n ( β + β ) n y n = 1 ( 1 y ) F 1 2 1 , β β + β ; y y 1 + y 1 β β ( y 1 ) 1 β ( β ) β ( β + β ) β .
    and this is given in [6].
Corollary 2.
The previous equation can be written as follows:
m = 0 β n = 0 β ( 1 ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n m ! n ! = 1 ( 1 x ) F 1 2 1 , β β β ; x y x 1 + x β y 1 β ( y 1 ) F 1 2 1 , β β + β ; x y x ( 1 y ) + ( β ) β ( x y ) 1 β ( 1 + β β ) β ( 1 y ) 1 β ( x 1 ) 1 + β β .
Proof. 
Using the result given in [6]:
F 1 2 1 , N N N ; z = 1 1 z F 1 2 1 , N + N N N ; z 1 z + ( N ) N z N + 1 ( 1 ) N ( N N + 1 ) N ( z 1 ) N N + 1 ,
with N + N < 0 . If we substitute z with x y ( 1 y ) and multiply by 1 1 y , Theorem (1) gives the desired result. □
For example, for α = 1 , β + β = 5 = 4 1 , 3 2 , 2 3 , 1 4 , we obtain
x 4 y + 1 5 x 4 + 4 y x 3 + 2 x 3 + 3 x 2 y + 3 x 2 + 2 x y + 4 x + y + 1 = 1 5 ( x 1 ) 1 x y x 1 + 5 x 4 y 2 5 ( 1 y ) ( 1 x y x ( 1 y ) 4 + 2 x y x ( 1 y ) 3 + 3 x y x ( 1 y ) 2 + 4 x y x ( 1 y ) + 5 ) + 1 5 ( x y ) 6 ( x 1 ) 2 ( 1 y ) 5 ,
x 3 y 2 + 1 10 6 x + 3 x 2 + x 3 + 4 y + 6 x y + 6 x 2 y + 4 x 3 y + y 2 + 3 x y 2 + 6 x 2 y 2 + 1 = 1 10 ( x 1 ) 1 x y x 1 2 + 4 x y x 1 + 10 x 3 y 3 10 ( 1 y ) ( 1 x y x ( 1 y ) 3 + 3 x y x ( 1 y ) 2 + 6 x y x ( 1 y ) + 10 ) + 1 10 ( x y ) 6 ( x 1 ) 3 ( 1 y ) 4 ,
x 2 y 3 + 1 10 6 y + 3 y 2 + y 3 + 4 x + 6 x y + 6 x y 2 + 4 x y 3 + x 2 + 3 x 2 y + 6 x 2 y 2 + 1 = 1 10 ( x 1 ) 1 x y x 1 3 + 3 x y x 1 2 + 6 x y x 1 + 10 x 3 y 3 10 ( 1 y ) ( 1 x y x ( 1 y ) 2 + 4 x y x ( 1 y ) + 10 ) + 1 10 ( x y ) 6 ( x 1 ) 4 ( 1 y ) 3 ,
x y 4 + 1 5 y 4 + 4 y 3 x + 2 y 3 + 3 y 2 x + 3 y 2 + 2 x y + 4 y + x + 1 = 1 5 ( x 1 ) 1 x y x 1 ) 4 + 2 x y x 1 ) 3 + 3 x y x 1 ) 2 + 4 x y x 1 ) + 5 x 2 y 4 5 ( 1 y ) 1 x y x ( 1 y ) + 5 + 1 5 ( x y ) 6 ( x 1 ) 5 ( 1 y ) 2 ,
and finally, with
1 ( 1 x ) F 1 2 1 , 5 5 ; x y x 1 = k = 0 5 ( x y x 1 ) k
and
x 5 y 6 ( y 1 ) F 1 2 1 , 0 0 6 ; x y x ( 1 y ) = x 5 y 6 ( y 1 ) ,
for a = 1 , β + β = 5 = 5 0 , we obtain
x 4 + x 3 + x 2 + x + 1 = 1 ( x 1 ) 1 x 5 y ( 1 y ) ( 1 x y x ( 1 y ) 5 + 1 x y x ( 1 y ) 4 + 1 x y x ( 1 y ) 3 + 1 x y x ( 1 y ) 2 + 1 x y x ( 1 y ) + 1 ) + ( x y ) 6 ( x 1 ) ( 1 y ) 6 ,
same analysis for β + β = 5 = 5 0 . These colored coefficients can be found in Pascal’s triangle as shown below:
1
11
121
1331
14641
15101051
Remark 3.
(1) We are going to find CORR ( α , β , β ) ( x , y ) , α = 2 , 3 , such that
m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y + CORR ( α , β , β ) ( x , y ) .
We will prove that the new expression W ( α , β , β ) ( x , y ) given in (14) above will play an essential role in finding CORR ( α , β , β ) ( x , y ) , α = 2 , 3 , 4 , .
  • (2) Studying the problem for small values of (α) will help us to identify the pattern that will, subsequently, help to prove full generality.

3. The Correction Term CORR ( 2 , β , β ) ( x , y )

The aim of this paragraph is to give an explicit expression of the correction term CORR ( 2 , β , β ) ( x , y ) such that the following equation holds
m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n = 1 ( 1 y ) 2 F 1 2 2 , β β + β ; x y 1 y + CORR ( 2 , β , β ) ( x , y ) .
We need a relation between the contiguous functions of F 1 . In fact, we have the following proposition given in [5], p 54.
Proposition 2.
We Have
α F 1 ( α + 1 , β , β , γ ; x , y ) = α F 1 ( α , β , β , γ ; x , y ) + x d d x F 1 ( α , β , β , γ ; x , y ) + y d d y F 1 ( α , β , β , γ ; x , y ) .
The proof of this proposition is given in [5] as well. We use F 1 instead of F 1 . To give an explicit expression of the correction term CORR ( 2 , β , β ) ( x , y ) , we need the following steps.
  • With α = 1 and γ = β + β in (15), we obtain
    F 1 ( 2 , β , β , β + β ; x , y ) = F 1 ( 1 , β , β , β + β ; x , y ) + x d d x F 1 ( 1 , β , β , β + β ; x , y ) + y d d y F 1 ( 1 , β , β , β + β ; x , y ) .
  • Now, we use the result of our first main theorem (1):
    m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n = 1 ( 1 y ) F 1 2 1 , β β + β ; x y 1 y + CORR ( 1 , β , β ) ( x , y ) ; CORR ( 1 , β , β ) ( x , y ) = x β y 1 β ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) .
Remark 4.
Let us denote by ( 2 F 1 ) ( α , β , β ) = 1 ( 1 y ) α F 1 2 ( α , β β + β ; x y 1 y ) ; then,
m = 0 β n = 0 β m + n m ( β ) m ( β ) n ( β + β ) m + n x m y n = ( 2 F 1 ) ( 1 , β , β ) + CORR ( 1 , β , β ) ( x , y ) .
  • We combine these previous three steps to obtain
    F 1 ( 2 , β , β , β + β ; x , y ) = ( 2 F 1 ) ( 1 , β , β ) ( x , y ) + CORR ( 1 , β , β ) ( x , y ) + x d d x ( 2 F 1 ) ( 1 , β , β ) + CORR ( 1 , β , β ) ( x , y ) + y d d y ( ( 2 F 1 ) ( 1 , β , β )
    + CORR ( 1 , β , β ) ( x , y ) ) = ( 2 F 1 ) ( 1 , β , β ) ( x , y ) x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) + x d d x ( 2 F 1 ) ( 1 , β , β ) ( x , y ) x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) + y d d y ( 2 F 1 ) ( 1 , β , β ) ( x , y ) x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) = ( 2 F 1 ) ( 1 , β , β ) ( x , y ) x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y )
    + x [ β ( β + β ) ( 1 y ) 2 F 1 2 2 , β + 1 β + β + 1 ; x y 1 y + β x β 1 y 1 β ( 1 y ) × F 1 2 1 , β β + β ; x y x ( 1 y ) β x β 2 y 2 β ( β + β ) ( 1 y ) 2 F 1 2 2 , β + 1 β + β + 1 ; x y x ( 1 y ) ] + y [ 1 ( 1 y ) 2 F 1 2 1 , β β + β ; x y 1 y + β ( x 1 ) ( β + β ) ( 1 y ) 3 F 1 2 2 , β + 1 β + β + 1 ; x y 1 y ( 1 β ) x β y β ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) x β y 1 β ( 1 y ) 2 F 1 2 1 , β β + β ; x y x ( 1 y ) β ( x 1 ) x β 1 y 1 β ( β + β ) ( 1 y ) 3 F 1 2 2 , β + 1 β + β + 1 ; x y x ( 1 y ) ] .
    It is easy to prove that the terms with x y 1 y give
    ( 2 F 1 ) ( 1 , β , β ) + β x ( β + β ) ( 1 y ) 2 F 1 2 1 , β + 1 β + β + 1 ; x y 1 y + y ( 1 y ) 2 F 1 2 1 , β β + β ; x y 1 y + β y ( x 1 ) ( β + β ) ( 1 y ) 3 F 1 2 2 , β + 1 β + β + 1 ; x y 1 y = 1 ( 1 y ) 2 F 1 2 2 , β β + β ; x y 1 y = ( 2 F 1 ) ( 2 , β , β ) ,
    we prove that the remaining terms with x y x ( 1 y ) give
    x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) + x [ β x β 1 y 1 β ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) β x β 2 y 2 β ( β + β ) ( 1 y ) 2 F 1 2 2 , β + 1 β + β + 1 ; x y x ( 1 y ) ] + y [ ( 1 β ) x β y β ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) x β y 1 β ( 1 y ) 2 F 1 2 1 , β β + β ; x y x ( 1 y ) β ( x 1 ) x β 1 y 1 β ( β + β ) ( 1 y ) 3 F 1 2 2 , β + 1 β + β + 1 ; x y x ( 1 y ) ] = W 2 , β , β ( x , y ) ( β + β 2 ) 1 W 1 , β , β ( x , y ) = CORR ( 2 , β , β ) ( x , y ) .
We can state our second main result for α = 2 :
Theorem 2.
We have the following result
m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) 2 F 1 2 2 , β β + β ; x y 1 y + CORR ( 2 , β , β ) ( x , y ) , w h e r e CORR ( 2 , β , β ) ( x , y ) = W 2 , β , β ( x , y ) ( β + β 2 ) 1 W 1 , β , β ( x , y ) = x β y β + 2 ( y 1 ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) ( 2 β β ) x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) .
Equivalently,
m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) 2 F 1 2 2 , β β + β ; x y 1 y 2 β β 0 x β y β + 2 ( 1 y ) 2 × F 1 2 2 , β β + β ; x y x ( 1 y ) 2 β β 1 x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) ,
Corollary 3.
We have the following interesting particular cases:
m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! x m + n = k = 0 β β + 1 x k = x 2 β β 1 x 1 ,
m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! y n = 1 y β + 2 ( 1 y ) 2 F 1 2 2 , β β + β ; 1 ( 2 β β ) y β + 1 ( 1 y ) F 1 2 1 , β β + β ; 1 = 2 ( 1 β β ) ( β 1 ) y 2 β ( β 2 ) y 1 β 1 ( 2 β ) ( 1 y ) 2 , m = 0 β ( 2 ) m + n ( β ) m ( β ) 0 ( β + β ) m + 0 x m y 0 = 1 ( 1 0 ) F 1 2 2 , β β + β ; x 0 1 0 + 0 ( T r u e ) , n = 0 β ( 2 ) n ( β ) n ( β + β ) n n ! y n = F 1 2 2 , β β + β ; y y 1 y β β + 2 ( 1 y ) β + 2 ( 1 β ) ( β ) β ( β + β ) β + ( β + β 2 ) y β β + 1 ( 1 y ) β + 1 ( β ) β ( β + β ) β .
Proof. 
• For x = y , Theorem (2) can be written as
m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! x m + n = 1 ( 1 x ) 2 x 2 β β ( x 1 ) 2 + ( β + β 2 ) x 1 β β ( 1 x ) = 1 x 2 β β + ( 1 x ) ( β + β 2 ) x 1 β β ( 1 x ) 2 = k = 0 β β + 1 x k = x 2 β β 1 x 1 .
  • For x = 1 , Theorem (2) can be written as
    m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! y n = 1 y β + 2 ( 1 y ) 2 F 1 2 2 , β β + β ; 1 ( 2 β β ) y β + 1 ( 1 y ) F 1 2 1 , β β + β ; 1 ,
    taking into account (9), we get the desired result.
  • For y = 0 , Theorem (2) can be written as
    m = 0 β ( 2 ) m + n ( β ) m ( β ) 0 ( β + β ) m + 0 x m y 0 = 1 ( 1 0 ) F 1 2 2 , β β + β ; x 0 1 0 + 0 ( T r u e ) .
  • For x = 0 , Theorem (2) can be written as
    n = 0 β ( 2 ) n ( β ) n ( β + β ) n n ! y n = 1 ( 1 y ) 2 F 1 2 ( 2 , β β + β ; 0 y 1 y ) x β y β + 2 ( y 1 ) 2 × F 1 2 2 , β β + β ; 0 y x ( 1 y ) ( 2 β β ) x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; 0 y x ( 1 y ) = F 1 2 2 , β β + β ; y y 1 y β β + 2 ( 1 y ) β + 2 ( 1 β ) ( β ) β ( β + β ) β + ( β + β 2 ) y β β + 1 ( 1 y ) β + 1 ( β ) β ( β + β ) β .

4. The Correction Term CORR ( 3 , β , β ) ( x , y )

In this paragraph, we follow the same steps as in the case when α = 2 to obtain the explicit expression of the correction term CORR ( 3 , β , β ) ( x , y ) such that the following equality holds,
m = 0 β n = 0 β ( 3 ) m + n ( β ) m ( β ) n ( β + β ) m + n x m y n = 1 ( 1 y ) 3 F 1 2 3 , β β + β ; x y 1 y + CORR ( 3 , β , β ) ( x , y ) .
For this matter, we follow the following steps.
  • With α = 2 and β = β in (15), we obtain
    2 F 1 ( 3 , β , β , β + β ; x , y ) = 2 F 1 ( 2 , β , β , β + β ; x , y ) + x d d x F 1 ( 2 , β , β , β + β ; x , y ) + y d d y F 1 ( 2 , β , β , β + β ; x , y ) .
  • Now, we use the result of our second main theorem (2):
    m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = ( 2 F 1 ) ( 2 , β , β ) ( x , y ) + CORR ( 2 , β , β ) ( x , y ) ,
    where
    CORR ( 2 , β , β ) ( x , y ) = x β y 2 β ( y 1 ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) ( 2 β β ) x β y 1 β ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) .
  • If we combine these previous three steps, we obtain
    2 F 1 ( 3 , β , β , β + β ; x , y ) = 2 ( 2 F 1 ) ( 2 , β , β ) ( x , y ) + 2 CORR ( 2 , β , β ) ( x , y ) + x d d x ( 2 F 1 ) ( 2 , β , β ) + 2 CORR ( 2 , β , β ) ( x , y ) + y d d y ( ( 2 F 1 ) ( 2 , β , β ) + CORR ( 2 , β , β ) ( x , y ) ) = 2 ( 1 y ) 2 F 1 2 2 , β β + β ; x y ( 1 y )
    2 x β y 2 β ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 2 2 β β x β y 1 β 1 y × F 1 2 1 , β β + β ; x y x ( 1 y ) + x ( 2 β ( β + β ) ( 1 y ) 3 F 1 2 3 , β + 1 β + β + 1 ; x y ( 1 y ) + β x β 1 β y 2 β ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 2 β x 2 β y 3 β ( β + β ) ( 1 y ) 3 × F 1 2 3 , β + 1 β + β + 1 ; x y x ( 1 y ) ( β + β 2 ) β x 1 β y 1 β 1 y F 1 2 1 , β β + β ; x y x ( 1 y ) ( 2 β β ) β x 2 β y 2 β ( 1 y ) 2 F 1 2 2 , β + 1 β + β + 1 ; x y x ( 1 y ) ) + y ( 2 ( 1 y ) 3 × F 1 2 2 , β β + β ; x y 1 y + 2 β ( x 1 ) ( β + β ) ( 1 y ) 4 F 1 2 3 , β + 1 β + β + 1 ; x y ( 1 y ) x β y β ( 1 β ) 2 β β ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) ( 2 β β ) x β y 1 β ( 1 y ) 2 F 1 2 1 , β β + β ; x y x ( 1 y ) ( 2 β β ) β ( x 1 ) x 1 β y 1 β ( β + β ) ( 1 y ) 3 × F 1 2 2 , β + 1 β + β + 1 ; x y x ( 1 y ) 2 ( β + 2 ) x β y 1 β ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 2 x β y 2 β ( 1 y ) 3 F 1 2 2 , β β + β ; x y x ( 1 y ) + 2 β ( x 1 ) x 1 β y 2 β ( β + β ) ( 1 y ) 4 F 1 2 3 , β + 1 β + β + 1 ; x y x ( 1 y ) ) .
  • The terms with the variable x y 1 y are
    2 ( 1 y ) 2 F 1 2 2 , β β + β ; x y ( 1 y ) + x 2 β ( β + β ) ( 1 y ) 3 F 1 2 3 , β + 1 β + β + 1 ; x y ( 1 y )
    + y 2 ( 1 y ) 3 F 1 2 2 , β β + β ; x y 1 y + 2 β ( x 1 ) ( β + β ) ( 1 y ) 4 2 F 1 3 , β + 1 β + β + 1 ; x y ( 1 y ) ) ,
    which is, exactly, 1 ( 1 y ) 3 F 1 2 ( 3 , β ; β + β ; x y 1 y ) ,
  • the remaining terms with the variable x y x ( 1 y ) are
    2 x β y 2 β ( 1 y ) 2 2 F 1 2 , β β + β ; x y x ( 1 y ) 2 2 β β x β y 1 β 1 y × F 1 2 1 , β β + β ; x y x ( 1 y ) + x ( β x β 1 β y 2 β ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 2 β x 2 β y 3 β ( β + β ) ( 1 y ) 3 F 1 2 3 , β + 1 β + β + 1 ; x y x ( 1 y )
    ( β + β 2 ) β x 1 β y 1 β 1 y F 1 2 1 , β β + β ; x y x ( 1 y ) ( 2 β β ) β x 2 β y 2 β ( 1 y ) 2 F 1 2 2 , β + 1 β + β + 1 ; x y x ( 1 y ) ) + y x β y β ( 1 β ) 2 β β ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) ( 2 β β ) x β y 1 β ( 1 y ) 2 F 1 2 1 , β β + β ; x y x ( 1 y )
    ( 2 β β ) β ( x 1 ) x 1 β y 1 β ( β + β ) ( 1 y ) 3 F 1 2 2 , β + 1 β + β + 1 ; x y x ( 1 y ) 2 ( 2 β ) x β y 1 β ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 2 x β y 2 β ( 1 y ) 3 F 1 2 2 , β β + β ; x y x ( 1 y ) + 2 β ( x 1 ) x 1 β y 2 β ( β + β ) ( 1 y ) 4 F 1 2 3 , β + 1 β + β + 1 ; x y x ( 1 y ) )
    = 3 β β 0 x β y β + 3 ( y 1 ) 3 F 1 2 3 , β β + β ; x y x ( 1 y ) 3 β β 1 × x β y β + 2 ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 3 β β 2 x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) .
We can state our third main result for α = 3 :
Theorem 3.
We have the following result
m = 0 β n = 0 β ( 3 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) 3 F 1 2 3 , β β + β ; x y 1 y 3 β β 0 x β y β + 3 ( 1 y ) 3 F 1 2 3 , β β + β ; x y x ( 1 y ) 3 β β 1 x β y β + 2 ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 3 β β 2 x β y β + 1 ( 1 y ) × F 1 2 1 , β β + β ; x y x ( 1 y ) .
Corollary 4.
We have the following interesting particular cases:
m = 0 β n = 0 β ( 3 ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! x m + n = 1 2 k = 0 β β + 2 x k = 1 2 x 3 β β 1 x 1 ,
m = 0 β n = 0 β ( 3 ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! y n = 1 y β + 3 ( 1 y ) 3 F 1 2 3 , β β + β ; 1 + ( β + β 3 ) 1 ! y β + 2 ( 1 y ) 2 F 1 2 2 , β β + β ; 1 ( β + β 3 ) ( β + β 2 ) 2 ! y 1 β ( 1 y ) F 1 2 1 , β β + β ; 1
= 1 β β 3 β β 3 β 2 β × ( y 3 β 2 β 1 β 2 y 2 β 3 β 1 β + y 1 β 3 β 2 β 2 ) 1 + y 3 ;
m = 0 β ( 3 ) m + n ( β ) m ( β ) 0 ( β + β ) m + 0 x m y 0 = 1 ( 1 0 ) 3 F 1 2 3 , β β + β ; x 0 1 0 + 0 ( T r u e ) ,
n = 0 β ( 3 ) n ( β ) n ( β + β ) n n ! y n = F 1 2 3 , β β + β ; y y 1 y 2 ( 1 y ) 2 + ( 3 β β ) y ( 1 y ) + ( 3 β β ) ( 2 β β ) y 2 ! ( 1 y ) ) ( 1 ) β y 1 2 β ( β ) β ( 1 y ) 1 β ( 2 β ) β .
Proof. 
• For x = y , Theorem (3) can be written as
m = 0 β n = 0 β ( 3 ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! x m + n = 1 ( 1 x ) 2 x 2 β β ( x 1 ) 2 + ( β + β 2 ) x 1 β β ( 1 x ) = 1 x 2 β β + ( 1 x ) ( β + β 2 ) x 1 β β ( 1 x ) 2 = k = 0 β β + 1 x k = x 2 β β 1 x 1 .
  • For x = 1 , Theorem (3) can be written as
    m = 0 β n = 0 β ( 3 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! y n = 1 ( 1 y ) 3 F 1 2 3 , β β + β ; 1 = y β + 2 ( y 1 ) 2 F 1 2 2 , β β + β ; 1 + ( β + β 2 ) y β + 1 ( 1 y ) F 1 2 1 , β β + β ; 1 ,
    taking into account (9), we get the desired result.
  • For y = 0 , Theorem (3) can be written as
    m = 0 β ( 3 ) m + n ( β ) m ( β ) 0 ( β + β ) m + 0 x m y 0 = 1 ( 1 0 ) 3 F 1 2 3 , β β + β ; x 0 1 0 + 0 ( T r u e ) .
  • For x = 0 , Theorem (3) can be written as
    n = 0 β ( 3 ) n ( β ) n ( β + β ) n n ! y n = 1 ( 1 y ) 3 F 1 2 3 , β β + β ; 0 y 1 y x β y β + 2 ( y 1 ) 2 × F 1 2 2 , β β + β ; 0 y x ( 1 y ) ( 2 β β ) x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; 0 y x ( 1 y ) = F 1 2 3 , β β + β ; y y 1 y 2 ( 1 y ) 2 + ( 3 β β ) y ( 1 y ) + ( 3 β β ) ( 2 β β ) y 2 ! ( 1 y ) × ( 1 ) β y 1 2 β ( β ) β ( 1 y ) 1 β ( 2 β ) β .

5. The Correction Term CORR ( α , β , β ) ( x , y ) , α Z > 0

Let us summarize. In paragraph 2, paragraph 3, and paragraph 4, we, respectively, found the following:
  • for α = 1 , we got
    m = 0 β n = 0 β ( 1 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) F 1 2 1 , β β + β ; x y 1 y x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) ,
  • for α = 2 , we got
    m = 0 β n = 0 β ( 2 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) 2 F 1 2 2 , β β + β ; x y 1 y x β y β + 2 ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 2 β β 1 x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) ,
  • for α = 3 , we got
    m = 0 β n = 0 β ( 3 ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) 3 F 1 2 3 , β β + β ; x y 1 y x β y β + 3 ( 1 y ) 3 F 1 2 3 , β β + β ; x y x ( 1 y ) 3 β β 1 x β y β + 2 ( 1 y ) 2 F 1 2 2 , β β + β ; x y x ( 1 y ) 3 β β 2 x β y β + 1 ( 1 y ) F 1 2 1 , β β + β ; x y x ( 1 y ) .
  • Then, by induction, we can deduce the following theorem:
Theorem 4.
For any α Z > 0 , we have the following result
m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y k = 1 α α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) .
The change in the notations ( n , m , β , β ) to ( i , j , n , m ) , respectively, gives the following
j = 0 n i = 0 m ( α ) m + n ( n ) j ( m ) i ( n m ) i + j i ! j ! x j y i = 1 ( 1 y ) α F 1 2 α , n n m ; x y 1 y k = 1 α α + n + m α k x n y m + k ( 1 y ) k F 1 2 k , n n m ; x y x ( 1 y ) .
Please see the Appendix A below.
Proof. 
The proof will be done by induction on α 1 .
-
The case α = 1 is done in paragraph 1.
-
We suppose that (17) is true for any k , 1 k α , and we prove it for α + 1 .
-
We use (2), we take γ = β + β :
α F 1 ( α + 1 , β , β , β + β ; x , y ) = α F 1 ( α , β , β , β + β ; x , y ) + x d d x F 1 ( α , β , β , β + β ; x , y ) + y d d y F 1 ( α , β , β , β + β ; x , y ) .
-
These two later facts give
α F 1 ( α + 1 , β , β , β + β ; x , y ) = α ( 1 y ) α F 1 2 α , β β + β ; x y 1 y α k = 1 α α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) + x d d x ( 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y k = 1 α α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) ) + y d d y ( 1 ( 1 y ) α F 1 2 ( α , β β + β ; x y 1 y ) k = 1 α α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) ) ,
equivalently
α F 1 ( α + 1 , β , β , β + β ; x , y ) = α ( 1 y ) α F 1 2 α , β β + β ; x y 1 y α k = 1 α α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) + x ( α β ( β + β ) ( 1 y ) α + 1 F 1 2 α + 1 , β + 1 β + β + 1 ; x y 1 y
+ k = 1 α [ β α β β α k x β 1 y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y )
k β α β β α k x β 2 y β + k + 1 ( β + β ) ( 1 y ) k + 1 F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ] )
+ y ( α ( 1 y ) α + 1 F 1 2 α , β β + β ; x y 1 y + α β ( x 1 ) ( β + β ) ( 1 y ) α + 2 F 1 2 α + 1 , β + 1 β + β + 1 ; x y 1 y k = 1 α [ ( k β ) α β β α k x β y β + k 1 ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) + k α β β α k x β y β + k ( 1 y ) k + 1 F 1 2 k , β β + β ; x y x ( 1 y ) + k β ( x 1 ) ( β + β ) α β β α k x β 1 y β + k ( 1 y ) k + 2 F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ] ) .
The terms, which are outside the three summations, give:
α ( 1 y ) α + 1 F 1 2 α , β β + β ; x y 1 y + α ( x y ) 2 ( 1 y ) α + 2 F 1 2 α + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ,
this is, exactly,
α ( 1 y ) α + 1 F 1 2 ( α + 1 , β β + β ; x y 1 y ) .
The terms, inside the three summations, are given by:
α k = 1 α α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) + x ( k = 1 α [ β α β β α k x β 1 y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) k β α β β α k x β 2 y β + k + 1 ( 1 y ) k + 1 F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ] ) + y ( k = 1 α [ ( k β ) α β β α k x β y β + k 1 ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) + k α β β α k x β y β + k ( 1 y ) k + 1 F 1 2 k , β β + β ; x y x ( 1 y ) + k β ( x 1 ) ( β + β ) α β β α k x β 1 y β + k ( 1 y ) k + 2 F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ] ) .
Equal to
α k = 1 α α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y )
+ k = 1 α [ β α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) k β α β β α k x β 1 y β + k + 1 ( 1 y ) k + 1 F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ] k = 1 α [ ( k β ) α β β α k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y )
+ k α β β α k x β y β + k + 1 ( 1 y ) k + 1 F 1 2 k , β β + β ; x y x ( 1 y ) + k β ( x 1 ) ( β + β ) α β β α k x β 1 y β + k + 1 ( 1 y ) k + 2 F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ] .
Equal to
k = 1 α α β β α k x β y β + k ( 1 y ) k [ α F 1 2 k , β β + β ; x y x ( 1 y ) β F 1 2 k , β β + β ; x y x ( 1 y ) k y 2 ( 1 y ) F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ( k β ) F 1 2 k , β β + β ; x y x ( 1 y ) k 1 y F 1 2 k , β β + β ; x y x ( 1 y ) + k ( x 1 ) 2 x ( 1 y ) 2 F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) ] k = 1 α α β β α k x β y β + k ( α β β ) ( 1 y ) + k ( 1 y ) k + 1 ( k + 1 y ) F 1 2 k , β β + β ; x y x ( 1 y ) k = 1 α α β β α k x β 1 y β + k + 1 ( 1 y ) k + 2 ( x y ) 2 F 1 2 k + 1 , β + 1 β + β + 1 ; x y x ( 1 y ) .
This leads to
α k = 1 α + 1 α + 1 β β α + 1 k x β y β + k ( 1 y ) k F 1 2 k , β β + β ; x y x ( 1 y ) .
Corollary 5.
We have the following interesting particular cases:
m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! x m + n = 1 ( α 1 ) ! x α β β 1 x 1 ( α 1 ) , ( α 1 ) t h d e r i v a t i v e ,
m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! y n = 1 ( 1 y ) α F 1 2 α , β β + β ; 1 k = 1 α α β β α k y β + k ( 1 y ) k × F 1 2 k , β β + β ; 1 = 1 ( 1 y ) α ( β + β α ) α ( β α ) α k = 1 α α β β α k y β + k ( 1 y ) k 1 ( 1 y ) α ( β + β k ) k ( β k ) k .
m = 0 β ( α ) m + n ( β ) m ( β ) 0 ( β + β ) m + 0 x m y 0 = 1 ( 1 0 ) α F 1 2 α , β β + β ; x 0 1 0 + 0 ( T r u e ) ,
n = 0 β ( α ) n ( β ) n ( β + β ) n n ! y n = 1 ( 1 y ) α F 1 2 α , β β + β ; y y 1 k = 1 α α β β α k y β β + k ( 1 y ) k β ( k ) β ( β + β ) β .
Proof. 
• We use Theorem (4) with x = y , and we proceed by induction.
  • For x = 1 , the above Theorem and (9) give
    m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n m ! n ! y n = 1 ( 1 y ) α F 1 2 α , β β + β ; 1 k = 1 α α β β α k y β + k ( 1 y ) k × F 1 2 k , β β + β ; 1 = 1 ( 1 y ) α ( β + β α ) α ( β α ) α k = 1 α α β β α k y β + k ( 1 y ) k + α ( β + β k ) k ( β k ) k .
  • For y = 0 , Theorem (4) can be written as
    m = 0 β ( α ) m + n ( β ) m ( β ) 0 ( β + β ) m + 0 x m y 0 = 1 ( 1 0 ) α F 1 2 α , β β + β ; x 0 1 0 + 0 ( T r u e ) .
  • For x = 0 , Theorem (4) can be written as
    n = 0 β ( α ) n ( β ) n ( β + β ) n n ! y n = 1 ( 1 y ) α F 1 2 α , β β + β ; y y 1 k = 1 α α β β α k y β β + k ( 1 y ) k β ( k ) β ( β + β ) β .

6. Conclusions and Open Problems

In the case where α is a positive integer and β , β are negative integers, we found an explicit expression of the correction term CORR ( α , β , β ) ( x , y ) , such that the following result holds true,
m = 0 β n = 0 β ( α ) m + n ( β ) m ( β ) n ( β + β ) m + n n ! m ! x m y n = 1 ( 1 y ) α F 1 2 α , β β + β ; x y 1 y + CORR ( α , β , β ) ( x , y ) .
The question is what is the correction term when α Q Z ?
I considered the formula in [4], pp. 1018–1019. The very next section 9.183 starts with six equal F1-functions, and generally there are ten such groups of six F1-solutions (similarly to 4 × 6 Kummer’s 2F1 solutions to the classical hypergeometric equation). One can examine the generation of “corrections” for the 6 × 10 structure of F1-solutions similarly as in [6].

Funding

This research received no external funding. The APC was funded by Qassim univeristy, Saudi Arabia.

Data Availability Statement

No new data were created or analyzed in this study.

Acknowledgments

The author would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2026).

Conflicts of Interest

The author declares no conflicts of interest.

Appendix A

In this appendix, we give a small MAPLE program in order to assure the reader of the correctness of our result.
  • > restart;
  • > G 1 : = ( a , b 1 , b 2 , x , y ) > l o c a l j , i ; a d d ( a d d ( p o c h h a m m e r ( a , i + j ) p o c h h a m m e r ( b 1 , j ) p o c h h a m m e r ( b 2 , i ) y i x j / ( i ! j ! p o c h h a m m e r ( b 1 + b 2 , i + j ) ) , i = 0 . . b 2 ) , j = 0 . . b 1 ) ;
    •  
  • > F 11 : = ( a , b 1 , b 2 , x , y ) > ( 1 y ) ( a ) h y p e r g e o m ( [ a , b 1 ] , [ b 1 + b 2 ] , ( x y ) / ( 1 y ) ) ;
    •  
  • > F 12 : = ( a , b 1 , b 2 , x , y ) > ( 1 ) a x ( b 1 ) y ( b 2 + a ) ( 1 y ) ( a ) h y p e r g e o m ( [ a , b 1 ] , [ b 1 + b 2 ] , ( x y ) / ( x ( 1 y ) ) ) ;
  • > A a b 1 b 2 : = ( a , b 1 , b 2 ) > l o c a l k ; ( 1 y ) ( a ) h y p e r g e o m ( [ a , b 1 ] , [ b 1 + b 2 ] , ( x y ) / ( 1 y ) ) a d d ( b i n o m i a l ( a b 1 b 2 , a k ) x ( b 1 ) y ( b 2 + k ) ( 1 y ) ( k )
  • h y p e r g e o m ( [ k , b 1 ] , [ b 1 + b 2 ] , ( x y ) / ( x ( 1 y ) ) ) , k = 1 . . a ) ;
    •  
  • > B a b 1 b 2 : = ( a , b 1 , b 2 ) > l o c a l k ; ( 1 / ( 1 x ) ) a h y p e r g e o m ( [ a , b 2 ] , [ b 1 + b 2 ] , ( x y ) / ( 1 + x ) ) + ( x y ) ( a b 1 b 2 ) ( 1 y ) ( b 1 a ) p o c h h a m m e r ( a , b 1 ) ( 1 + x ) ( a + b 2 ) h y p e r g e o m ( [ 1 a , a + b 1 + b 2 ] , [ 1 a + b 1 ] , ( 1 y ) / ( x y ) ) / p o c h h a m m e r ( b 2 + 1 , b 1 ) a d d ( b i n o m i a l ( a b 1 b 2 , a k ) x ( b 1 ) y ( b 2 + k ) ( 1 y ) ( k ) h y p e r g e o m ( [ k , b 1 ] , [ b 1 + b 2 ] , ( x y ) / ( x ( 1 y ) ) ) , k = 1 . . a ) ;
    •  
  • > s i m p l i f y ( G 1 ( 2 , 3 , 5 , x , y ) s i m p l i f y ( A a b 1 b 2 ( 2 , 3 , 5 ) , h y p e r g e o m ) ) ; s i m p l i f y ( G 1 ( 2 , 3 , 5 , x , y ) s i m p l i f y ( B a b 1 b 2 ( 2 , 3 , 5 ) , h y p e r g e o m ) ) ;

References

  1. Attia, M.J. Reduction for a terminating bivariate hypergeometric polynomial. AIMS Math. 2026, 11, 11239–11257. [Google Scholar] [CrossRef]
  2. Brychkov, Y.; Savischenko, N. Application of Hypergeometric Functions of Two Variables in Wireless, Communication Theory. Lobachevskii J. Math. 2019, 40, 938–953. [Google Scholar] [CrossRef]
  3. Appell, P. Sur les fonctions hypergéométriques de plusieurs variables. In Mémorial des Sciences Mathématiques; Gauthier-Villars: Paris, France, 1925. [Google Scholar]
  4. Gradshteyn, I.S.; Ryzhik, I.M. Tables of Integrals, 6th ed.; Series and Products; Academic Press: San Diego, CA, USA, 2000. [Google Scholar]
  5. Kimura, T. The Hypergeometric Functions of Two Variables; University of Tokyo: Tokyo, Japan, 1973. [Google Scholar]
  6. Vidunas, R. Degenerate Gauss Hypergeomtric Functions, J-STAGE home. Kyushu J. Math. 2007, 61, 109–135. [Google Scholar] [CrossRef]
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.

Share and Cite

MDPI and ACS Style

Attia, M.J. Reduction for a Terminating Bivariate Hypergeometric Appell Series ℱ1 (II). Mathematics 2026, 14, 2021. https://doi.org/10.3390/math14112021

AMA Style

Attia MJ. Reduction for a Terminating Bivariate Hypergeometric Appell Series ℱ1 (II). Mathematics. 2026; 14(11):2021. https://doi.org/10.3390/math14112021

Chicago/Turabian Style

Attia, Mohamed Jalel. 2026. "Reduction for a Terminating Bivariate Hypergeometric Appell Series ℱ1 (II)" Mathematics 14, no. 11: 2021. https://doi.org/10.3390/math14112021

APA Style

Attia, M. J. (2026). Reduction for a Terminating Bivariate Hypergeometric Appell Series ℱ1 (II). Mathematics, 14(11), 2021. https://doi.org/10.3390/math14112021

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop