Next Article in Journal
Low-Cost Online Handwritten Symbol Recognition System in Virtual Reality Environment of Head-Mounted Display
Next Article in Special Issue
Laguerre-Type Exponentials, Laguerre Derivatives and Applications. A Survey
Previous Article in Journal
Characterizations, Potential, and an Implementation of the Shapley-Solidarity Value
Previous Article in Special Issue
Exact Values of the Gamma Function from Stirling’s Formula
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Transformations of the Hypergeometric 4F3 with One Unit Shift: A Group Theoretic Study

1
Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
2
School of Economics and Management, Far Eastern Federal University, Vladivostok 690950, Russia
3
Institute of Applied Mathematics, Far Eastern Branch of the Russian Academy of Sciences, Vladivostok 690041, Russia
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(11), 1966; https://doi.org/10.3390/math8111966
Submission received: 2 October 2020 / Revised: 31 October 2020 / Accepted: 2 November 2020 / Published: 5 November 2020
(This article belongs to the Special Issue Special Functions with Applications to Mathematical Physics)

Abstract

:
We study the group of transformations of 4 F 3 hypergeometric functions evaluated at unity with one unit shift in parameters. We reveal the general form of this family of transformations and its group property. Next, we use explicitly known transformations to generate a subgroup whose structure is then thoroughly studied. Using some known results for 3 F 2 transformation groups, we show that this subgroup is isomorphic to the direct product of the symmetric group of degree 5 and 5-dimensional integer lattice. We investigate the relation between two-term 4 F 3 transformations from our group and three-term 3 F 2 transformations and present a method for computing the coefficients of the contiguous relations for 3 F 2 functions evaluated at unity. We further furnish a class of summation formulas associated with the elements of our group. In the appendix to this paper, we give a collection of Wolfram Mathematica® routines facilitating the group calculations.

1. Introduction and Preliminaries

Groups comprising transformation of the generalized hypergeometric functions that preserve their value at unity can be traced back to Kummer’s formula ([1], Corollary 3.3.5), see (2) below. These groups play an important role in mathematical physics. In particular, the group theoretic properties of hypergeometric transformations constitute the key ingredient of a succinct description of the symmetries of Clebsh-Gordon’s and Wigner’s 3 j , 6 j and 9 j coefficients from the angular momentum theory [2,3,4,5]. The Karlsson-Minton summation formula for the generalized hypergeometric function with integral parameter differences (IPD) was largely motivated by a computation of a Feymann’s path integral. Furthermore, IPD hypergeometric functions appear in calculation of several integrals in high energy field theories and statistical physics [6]. See also introduction and references in [7] for further applications in mathematical physics and relation to Coxeter groups.
The generalized hypergeometric function ([1], Section 2.1.2), ([8], Chapter 16) is defined by the series
p + 1 F p a 1 , , a p + 1 b 1 , , b p z = n = 0 ( a 1 ) n ( a p + 1 ) n n ! ( b 1 ) n ( b p ) n z n
whenever it converges. When evaluated at the unit argument, z = 1 , it represents a function of 2 p + 1 complex parameters with obvious symmetry with respect to separate permutation of the p + 1 top and the p bottom parameters. As the above series diverges at z = 1 if the parametric excess satisfies k = 1 p ( b k a k ) a p + 1 < 0 , the first problem that arises is to construct an analytic continuation to the values of parameters in this domain. For 3 F 2 function this problem is partially solved by the transformation ([1], Corollary 3.3.5)
3 F 2 a , b , c d , e = Γ ( e ) Γ ( d + e a b c ) Γ ( e c ) Γ ( d + e b a ) 3 F 2 d b , d a , c d , d + e b a
discovered by Kummer in 1836. In the above formula we have omitted the argument 1 from the notation of the hypergeometric series and this convention will be adopted throughout the paper. The series the right hand side of (2) converges when ( e c ) > 0 so that we get the analytic continuation to this domain. An important aspect of the above formula is that it can be applied to itself directly or after permuting some of the top and/or bottom parameters. This leads to a family of transformations which can can be studied by group theoretic methods. A notable member of this family is Thomae’s (1879) transformation ([1], Corollary 3.3.6)
3 F 2 a , b , c d , e = Γ ( d ) Γ ( e ) Γ ( s ) Γ ( c ) Γ ( s + b ) Γ ( s + a ) 3 F 2 d c , e c , s s + a , s + b ,
where s = d + e a b c , which gave the name to the whole family of 3 F 2 transformations generated by the algorithm described above. In an important work [9] the authors undertook a detailed group theoretic study of Thomae’s transformations as well as transformations for the terminating 4 F 3 series and Bailey’s three-term relations for 3 F 2 . In particular, they have shown ([9], Theorem 3.2) that the function
f ( x , y , z , u , v ) = 3 F 2 x + u + v , y + u + v , z + u + v x + y + z + 2 u + v , x + y + z + u + 2 v Γ ( x + y + z + 2 u + v ) Γ ( x + y + z + u + 2 v ) Γ ( x + y + z ) ,
is invariant with respect to the entire symmetric group P 5 acting on its 5 arguments (note that another, simpler version of this symmetry is given by ([2], Equation (7)). This symmetry was, in fact, first observed by Hardy in his 1940 lectures ([10], Notes on Lecture VII). The work [9] initiated the whole stream of papers on group-theoretic interpretations of hypergeometric and q-hypergeometric transformations. See, for instance, Refs. [2,4,7,11,12,13,14] and references therein.
We note in passing that the analytic continuation problem for general p was solved by Nørlund [15] and Olsson [16] with later rediscovery by Bühring [17] without resorting to group-theoretic methods. More recently, Kim, Rathie and Paris derived ([18], p. 116) the following transformation
4 F 3 a , b , c , f + 1 d , e , f = Γ ( e ) Γ ( ψ ) Γ ( e c ) Γ ( ψ + c ) 4 F 3 d a 1 , d b 1 , c , η + 1 d , d + e a b 1 , η ,
with ψ = d + e a b c 1 and
η = ( d a 1 ) ( d b 1 ) f a b + ( d a b 1 ) f .
This transformation can be iterated, but it is not immediately obvious what is the general form of the transformations obtained by such iterations. In our recent paper ([19], p. 14, above Theorem 2) we found another identity of a similar flavor which can be viewed as a generalization of (2):
4 F 3 a , b , c , f + 1 d , e , f = ( ψ f c ( d a b ) ) Γ ( e ) Γ ( ψ ) f Γ ( e + d a b ) Γ ( e c ) 4 F 3 d a , d b , c , ξ + 1 d , e + d a b , ξ ,
where ξ = f + ( d a b ) ( f c ) / ( e c 1 ) . The main purpose of this paper is to present a general form of the family of transformations of which the above two identities are particular cases, demonstrate that this family forms a group and analyze the structure of the subgroup generated by explicitly known transformations (5)–(8). Before we delve into this analysis let us now record two more transformations generating this subgroup. A proof will be given in Section 6.
Lemma 1.
The following identities hold
4 F 3 a , b , c , f + 1 d , e , f = ( f ψ + b c ) Γ ( ψ ) Γ ( d ) Γ ( e ) f Γ ( a ) Γ ( ψ + b + 1 ) Γ ( ψ + c + 1 ) 4 F 3 ψ , d a , e a , ζ + 1 d + e a c , d + e a b , ζ ,
where ζ = ψ + b c / f , ψ = d + e a b c 1 ; and
4 F 3 a , b , c , f + 1 d , e , f = ( a b c + f d ψ ) Γ ( ψ ) Γ ( e ) f d Γ ( e a ) Γ ( ψ + a + 1 ) 4 F 3 a , d b , d c , ν + 1 d + 1 , ψ + a + 1 , ν ,
where ν = ( a b c + f d ψ ) / ( b c + f ψ ) .
Please note that each 4 F 3 function containing a parameter pair f + 1 f can be decomposed into a sum of two 3 F 2 functions (and we will demonstrate that there are numerous different decompositions of this type). Hence, each of the identities (5)–(8) can be written as a four-term relation for 3 F 2 . However, it will be seen from the subsequent considerations that, in fact, all such relations reduce to three or even two terms, and, moreover, the structure seems to be more transparent if we keep the 4 F 3 function as the basic building block of our analysis. It will be revealed that the group structure of our transformations is closely related to that of the Thomae group generated by two-term transformations (2) and (3) and with contiguous three terms relations for 3 F 2 . We believe that our subgroup generated by (5)–(8) covers all possible two-term transformations for 4 F 3 with one unit shift (more precisely all transformations of the form (10) below), but we were unable to prove this claim and leave it as a conjecture.
The paper is organized as follows. In the following section we give a general form of the transformations exemplified above and prove that they form a group. We further demonstrate that this group is isomorphic to a subgroup of SL ( Z ) (integer matrices with unit determinant). In Section 3, we give a comprehensive analysis of the structure of the subgroup generated by the transformations (5)–(8) by showing that it is isomorphic to a direct product of the symmetric group P 5 and the integer lattice Z 5 . In Section 4 we explore the relation between our transformations and three-term relations for 3 F 2 hypergeometric function. In particular, we show that the contiguous relations for 3 F 2 functions studied recently in [20] can also be computed from the elements of our group. Section 5 provides a method of deducing summation formulas for 4 F 3 with non-linearly restricted parameters while Section 6 contains the proof of Lemma 1. Finally, the Appendix A contains explicit forms of some key elements of our subgroup and several Wolfram Mathematica® routines facilitating the group calculations.

2. The Group Structure of the Unit Shift 4 F 3 Transformations

Inspecting the 4 F 3 transformations presented in Section 1 we see that they share a common structure that we will present below. To this end, let r = ( a , b , c , d , e , 1 ) T be the column vector and define
F ( r , f ) = 4 F 3 a , b , c , f + 1 d , e , f .
All transformations found in Section 1 have the following general form
F ( r , f ) = C ( r , f ) F ( D r , η ) ,
where D is a unit determinant 6 × 6 matrix with integer entries and the bottom row ( 0 , 0 , 0 , 0 , 0 , 1 ) ;
η = ε f + λ ( r ) α ( r ) f + β ( r ) ,
where ε { 0 , 1 } , λ ( r ) , α ( r ) and β ( r ) are rational functions of the arguments a , b , c , d , e (some of them may vanish identically, but λ = 1 if ε = 0 ). The coefficient C ( r , f ) has the form
C ( r , f ) = N ( r ) f + P ( r ) K ( r ) f + L ( r )
where N ( r ) , P ( r ) , K ( r ) , L ( r ) are (possibly vanishing) functions of Γ -type by which we mean ratios of products of gamma functions whose arguments are integer linear combinations of the components of ( a , b , c , d , e , 1 ) . When N ( r ) 0 we will additionally require that the ratio P ( r ) / N ( r ) be a rational function of parameters. In fact, this last requirements is redundant, but in order to avoid it the following claim is needed: the ratio F 2 ( r ) / F 1 ( r ) with F i , i = 1 , 2 , defined in (14), is not a function of gamma type for general parameters. We were unable to find a proof of this claim in the literature although it seems to be generally accepted to be true.
Formula (10) defines a transformation T characterized by the matrix D and the functions C ( r , f ) , η = η ( r , f ) . Two such transformations T 1 , T 2 will be considered equal if D 1 = D 2 , C 1 ( r , f ) C 2 ( r , f ) and η 1 ( r , f ) η 2 ( r , f ) .
According to the elementary relation ( f + 1 ) n = ( f ) n ( 1 + n / f ) , we have
F ( r , f ) = F 1 ( r ) + 1 f F 2 ( r ) ,
where
F 1 ( r ) = 3 F 2 a , b , c d , e , F 2 ( r ) = a b c d e 3 F 2 a + 1 , b + 1 , c + 1 d + 1 , e + 1 .
It is not immediately obvious if the composition of two transformations (10) with η and C having the forms (11) and (12), respectively, should have the same form. The following theorem shows that it is indeed the case and these transformations form a group.
Theorem 1.
Each transformation (10) necessarily has the form
F ( r , f ) = M ( r ) ε f + λ ( r ) f F ( D r , η ) , w h e r e η = ε f + λ ( r ) α ( r ) f + β ( r ) ,
M ( r ) is a function of Γ-type, ε { 0 , 1 } , λ ( r ) , α ( r ) , β ( r ) are rational functions of the arguments a , b , c , d , e (possibly vanishing but with λ = 1 if ε = 0 ).
The collection T of transformations (15) forms a group with respect to composition. More explicitly, if  T 1 , T 2 T with parameters indexed correspondingly, then T = T 2 T 1 is given by
(I) If ε 1 ε 2 + α 1 ( r ) λ 2 ( D 1 r ) 0 , then ε = 1 , M ( r ) = M 1 ( r ) M 2 ( D 1 r ) ( ε 1 ε 2 + α 1 ( r ) λ 2 ( D 1 r ) ) ,
λ ( r ) = ε 2 λ 1 ( r ) + λ 2 ( D 1 r ) β 1 ( r ) ε 1 ε 2 + α 1 ( r ) λ 2 ( D 1 r ) , α ( r ) = ε 1 α 2 ( D 1 r ) + α 1 ( r ) β 2 ( D 1 r ) ε 1 ε 2 + α 1 ( r ) λ 2 ( D 1 r ) ,
β ( r ) = λ 1 ( r ) α 2 ( D 1 r ) + β 1 ( r ) β 2 ( D 1 r ) ε 1 ε 2 + α 1 ( r ) λ 2 ( D 1 r ) , D = D 2 D 1 .
(II) If ε 1 ε 2 + α 1 ( r ) λ 2 ( D 1 r ) = 0 , then ε = 0 , M ( r ) = M 1 ( r ) M 2 ( D 1 r ) ( ε 2 λ 1 ( r ) + λ 2 ( D 1 r ) β 1 ( r ) ) ,
λ ( r ) = 1 , α ( r ) = ε 1 α 2 ( D 1 r ) + α 1 ( r ) β 2 ( D 1 r ) ε 2 λ 1 ( r ) + λ 2 ( D 1 r ) β 1 ( r ) ,
β ( r ) = λ 1 ( r ) α 2 ( D 1 r ) + β 1 ( r ) β 2 ( D 1 r ) ε 2 λ 1 ( r ) + λ 2 ( D 1 r ) β 1 ( r ) , D = D 2 D 1 .
Each T T of the form (15) has an inverse T 1 determined by the parameters ε ^ , M ^ ( r ) , λ ^ ( r ) , α ^ ( r ) , β ^ ( r ) , D ^ given by:
(III) If β ( r ) 0 , then ε ^ = 1 and
M ^ ( r ) = β ( D 1 r ) M ( D 1 r ) ( ε β ( D 1 r ) α ( D 1 r ) λ ( D 1 r ) , λ ^ ( r ) = λ ( D 1 r ) β ( D 1 r ) ,
α ^ ( r ) = α ( D 1 r ) β ( D 1 r ) , β ^ ( r ) = ε β ( D 1 r ) , D ^ = D 1 .
(IV) If β ( r ) = 0 , then ε ^ = 0 and
M ^ ( r ) = 1 M ( D 1 r ) α ( D 1 r ) , λ ^ ( r ) = 1 , α ^ ( r ) = α ( D 1 r ) λ ( D 1 r ) , β ^ ( r ) = ε λ ( D 1 r ) , D ^ = D 1 .
Proof of Theorem 1.
We start by showing that the form of the coefficient C ( r , f ) = ( N f + P ) / ( K f + L ) defined in (12) is restricted to
C ( r , f ) = M + W / f ,
where M = M ( r ) , W = W ( r ) are some functions of Γ -type, possibly one of them vanishing. It follows from (12) and (13) that transformation (10) is equivalent to
F 1 ( r ) f + F 2 ( r ) f = ( N f + P ) ( F 1 ( D r ) η + F 2 ( D r ) ) ( K f + L ) η ,
where N = N ( r ) , P = P ( r ) , K = K ( r ) , L = L ( r ) . Solving this equation we get
η = f ( f N + P ) F 2 ( D r ) L F 2 ( r ) + f K F 2 ( r ) f 2 N F 1 ( D r ) f P F 1 ( D r ) + f 2 K F 1 ( r ) + f L F 1 ( r ) .
In order that η had the form (11) the following identity must hold
f ( f N + P ) F 2 ( D r ) ( α f + β ) = ( ε f + λ ) ( L F 2 ( r ) + f K F 2 ( r ) f 2 N F 1 ( D r ) f P F 1 ( D r ) + f 2 K F 1 ( r ) + f L F 1 ( r ) ) .
The free term of the cubic on the right hand side equals λ L F 2 ( r ) while it vanishes on the left hand side, so that λ L = 0 . If L = 0 we obtain (16). Otherwise, if λ = 0 identity (18) takes the form
( f N + P ) F 2 ( D r ) ( α f + β ) = L F 2 ( r ) + f K F 2 ( r ) f 2 N F 1 ( D r ) f P F 1 ( D r ) + f 2 K F 1 ( r ) + f L F 1 ( r ) .
If N = 0 , then K = 0 and we again arrive at (16). If N 0 the value f = P / N must be a root of the quadratic on the right hand side of (19). In other words, we must have
L F 2 ( r ) P N K F 2 ( r ) P 2 N 2 N F 1 ( D r ) + P N P F 1 ( D r ) + P 2 N 2 K F 1 ( r ) P N L F 1 ( r ) = 0
or
L P N K F 2 ( r ) P N F 1 ( r ) = 0 .
Equality L = P K / N again leads to (16). The equality F 2 ( r ) = P F 1 ( r ) / N is impossible for rational P / N , as demonstrated by Ebisu and Iwasaki in ([20], Theorem 1.1) which proves our claim (16). If P / N is a function of gamma type then so is F 2 ( r ) / F 1 ( r ) which would contradict the claim made before the theorem, but as we could not find a proof of this claim we explicitly prohibit this situation in the definition of C ( r , f ) .
Substituting ( N f + P ) / ( K f + L ) by M + W / f in (17) we can now express η as follows:
η = ( M f + W ) F 2 ( D r ) ( M F 1 ( D r ) F 1 ( r ) ) f + F 1 ( D r ) W F 2 ( r ) .
Next suppose M 0 . Then C ( r , f ) = M ( ε f + W / M ) / f with ε = 1 . Comparison of (20) with (11) yields W / M = λ which proves that the transformation (10) must have the form (15). Moreover,
α = M ε F 1 ( D r ) F 1 ( r ) M F 2 ( D r ) , β = F 1 ( D r ) λ M F 2 ( r ) M F 2 ( D r ) .
These equalities can be rewritten as the system
F 1 ( r ) = M ( ε F 1 ( D r ) + α F 2 ( D r ) ) , F 2 ( r ) = M ( λ F 1 ( D r ) + β F 2 ( D r ) ) .
Suppose now that M = 0 , W 0 . Then C ( r , f ) = W ( ε f + λ ) / f with ε = 0 , λ = 1 . From (20) we have
η = ε f + λ α f + β ,
where again ε = 0 , λ = 1 , and α = F 1 ( r ) / ( W F 2 ( D r ) ) , β = ( W F 1 ( D r ) F 2 ( r ) ) / ( W F 2 ( D r ) ) or
F 1 ( r ) = W α F 2 ( D r ) = W ( ε F 1 ( D r ) + α F 2 ( D r ) ) , F 2 ( r ) = W ( F 1 ( D r ) + β F 2 ( D r ) ) = W ( λ F 1 ( D r ) + β F 2 ( D r ) ) .
Renaming W into M we have thus proved that the transformation again has the form (15) and the system (21) is satisfied.
The computation of composition is straightforward:
T = T 2 T 1 T : F ( r , f ) = M 1 ( r ) ε 1 f + λ 1 ( r ) f F ( D 1 r , η 1 ) = M 1 ( r ) M 2 ( D 1 r ) ε 1 f + λ 1 ( r ) f ε 2 ( ε 1 f + λ 1 ( r ) ) / ( α 1 ( r ) f + β 1 ( r ) ) + λ 2 ( D 1 r ) ( ε 1 f + λ 1 ( r ) ) / ( α 1 ( r ) f + β 1 ( r ) ) F ( D 2 D 1 r , η 2 ) = M 1 ( r ) M 2 ( D 1 r ) ε 2 ( ε 1 f + λ 1 ( r ) ) + λ 2 ( D 1 r ) ( α 1 ( r ) f + β 1 ( r ) ) f F ( D 2 D 1 r , η 2 ) = M 1 ( r ) M 2 ( D 1 r ) [ ε 1 ε 2 + α 1 ( r ) λ 2 ( D 1 r ) ] f + ε 2 λ 1 ( r ) + β 1 ( r ) λ 2 ( D 1 r ) f F ( D 2 D 1 r , η ) .
If ε 1 ε 2 + α 1 ( r ) λ 2 ( D 1 r ) 0 , we can divide by this quantity leading to case (I). If it vanishes we get case (II). Given a transformation T T of the from (15) it is rather straightforward to compute its inverse. We omit the details. □
Remark 1.
Theorem 1 implies that each transformation t T is uniquely characterized by the collection { ε , M ( r ) , λ ( r ) , α ( r ) , β ( r ) , D } , where ε { 0 , 1 } , M ( r ) is a function of gamma type, λ ( r ) , α ( r ) and β ( r ) are rational functions of parameters a , b , c , d , e and D is 6 × 6 unit determinant integer matrix with bottom row ( 0 , , 0 , 1 ) . We will express this fact by writing T { ε , M ( r ) , λ ( r ) , α ( r ) , β ( r ) , D } . Occasionally, we will omit the dependence on r in the notation of the functions M ( r ) , λ ( r ) , α ( r ) , β ( r ) for brevity.
Please note that for ε = 1 and non-vanishing α , β and λ the system (21) takes the form of 4 F 3 3 F 2 reduction formulas
F ( D r , α ( r ) 1 ) = M ( r ) 1 F 1 ( r ) , F ( D r , λ ( r ) / β ( r ) ) = ( M ( r ) λ ( r ) ) 1 F 2 ( r ) .
Next, we clarify the structure of the group T further. The composition rule involves all the parameters M ( r ) , λ ( r ) , α ( r ) , β ( r ) and D. The following theorem implies that the matrix D determines all other parameters uniquely. Denote by SL ^ ( n , Z ) the subgroup of the special linear group SL ( n , Z ) of n × n integer matrices with unit determinant comprising matrices whose last row has the form ( 0 , , 0 , 1 ) .
Theorem 2.
The mapping T { ε , M ( r ) , λ ( r ) , α ( r ) , β ( r ) , D T } D T is isomorphism, so that the group ( T , ) is isomorphic to a subgroup of SL ^ ( 6 , Z ) which we denote by ( D T , · ) .
Proof of Theorem 2.
One direction is clear: each transformation T T by construction defines a matrix D T SL ^ ( 6 , Z ) and the composition rule (I), (II) in Theorem 1 involves the product of matrices. Hence, to establish our claim it remains to prove that the kernel of the homomorphism T D T is trivial. Assume the opposite: there exists a transformation T T with the identity matrix D = I and non-trivial parameters ε , M, λ , α , β . The system (21) then takes the form
( 1 M ε ) F 1 ( r ) = M α F 2 ( r ) , M λ F 1 ( r ) = ( 1 M β ) F 2 ( r ) .
If α = λ = 0 we get M = ε = 1 from the first equation and β = 1 from the second equation, which amounts to the trivial identity transformation. We will show that all other cases are impossible. Indeed, Ebisu and Iwasaki demonstrated in ([20], Theorem 1.1) that the functions F 1 ( r ) and F 2 ( r ) are linearly independent over the field of rational functions of parameters. If α = 0 and λ 0 , then M = ε = 1 from the first equation and F 1 ( r ) / F 2 ( r ) = ( 1 β ) / λ from the second equation contradicting linear independence. Similarly, if  α 0 and λ = 0 , then M = 1 / β from the second equation, so that F 2 ( r ) / F 1 ( r ) = ( 1 ε / β ) / ( α / β ) is rational from the first equation leading again to contradiction. Finally, if both α 0 and λ 0 we arrive at the identities
F 2 ( r ) F 1 ( r ) = 1 M ε α M = λ M 1 M β ( 1 M β ) ( 1 M ε ) = α λ M 2 .
Linear independence of the functions F 1 ( r ) , F 2 ( r ) over rational functions implies that the function M = M ( r ) must be a ratio of products of gamma functions irreducible to a rational function. On the other hand, by the ultimate equality M ( r ) solves the quadratic equation with rational coefficients:
M = M ( r ) = μ ( r ) ± ν ( r )
with rational μ , ν . It is easy to see that this is not possible as Γ is meromorphic with infinite number of poles and no branch points, while μ ( r ) ± ν ( r ) may only have a finite number of poles and zeros and has branch points. □

3. The Subgroup of T Generated by Known Transformations

We can now rewrite the transformations (5)–(8) in the standard form (15). Denote by ψ = d + e a b c 1 the parametric excess of the function on the left hand side of (15). Identity (7) is determined by the following set of parameters
M 1 = Γ ( ψ + 1 ) Γ ( d ) Γ ( e ) Γ ( a ) Γ ( d + e a c ) Γ ( d + e a b ) , ε 1 = 1 , λ 1 = b c ψ ,
D 1 = 1 1 1 1 1 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 1 0 1 1 0 1 1 0 0 0 0 0 0 1 , α 1 = 1 ψ , β 1 = 0 .
We will call this transformation T 1 .
The standard form (15) of identity (6) is characterized by the following parameters:
M 2 = Γ ( e ) Γ ( ψ + 1 ) Γ ( e + d a b ) Γ ( e c ) , ε 2 = 1 , λ 2 = c ( d + a + b ) ψ ,
D 2 = 1 0 0 1 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 1 0 1 1 0 0 0 0 0 0 1 , α 2 = 0 , β 2 = e c 1 ψ .
We will call this transformation T 2 .
The standard parameters of transformation (8) are given by
M 3 = Γ ( ψ + 1 ) Γ ( e ) Γ ( e a ) Γ ( e + d b c ) , ε 3 = 1 , λ 3 = a b c d ψ ,
D 3 = 1 0 0 0 0 0 0 1 0 1 0 0 0 0 1 1 0 0 0 0 0 1 0 1 0 1 1 1 1 0 0 0 0 0 0 1 , α 3 = 1 d , β 3 = b c d ψ .
We will call this transformation T 3 .
Finally, transformation (5) in the standard form (15) is parameterized by
M 4 = Γ ( e ) Γ ( ψ ) Γ ( e c ) Γ ( ψ + c ) , ε 4 = 1 , λ 4 = 0 , α 4 = d a b 1 ( d a 1 ) ( d b 1 ) ,
D 4 = 1 0 0 1 0 1 0 1 0 1 0 1 0 0 1 0 0 0 0 0 0 1 0 0 1 1 0 1 1 1 0 0 0 0 0 1 , β 4 = a b ( d a 1 ) ( d b 1 ) .
We will call this transformation T 4 . It is easy to see that it is of order 2, i.e., T 4 2 = I .
The four transformations T 1 , T 2 , T 3 , T 4 (or, equivalently, (5)–(8)) combined with permutations of the upper and lower parameters generate a subgroup of T which we will call T ^ . Isomorphism established in Theorem 2 induces an isomorphism between T ^ and a subgroup of SL ^ ( 6 , Z ) which we denote by D T ^ .
A complete characterization of T ^ and D T ^ will follow. Before we turn to it, we remark that to our belief, the complete group T contains no elements other than those in T ^ . We were unable, however, to prove this claim. Let us thus state it as a conjecture.
Conjecture. The subgroup T ^ generated by the transformations (24)–(27) coincides with the entire group T of all transformations of the form (10) or, equivalently, of the form (15).
Denote by S j , j = 1 , , 5 , the transformation shifting the j-th component of the parameter vector r by + 1 , i.e., S j is characterized by the matrix S ^ j such that S ^ 1 r = ( a + 1 , b , c , d , e , 1 ) , S ^ 2 r = ( a , b + 1 , c , d , e , 1 ) , etc. It is not a priori obvious that such transformations should exist among the elements of T ^ . The following theorem shows that it is indeed the case.
Theorem 3.
The group T ^ contains the transformations S j , j = 1 , , 5 .
Proof of Theorem 3.
Due to permutation symmetry it is clearly sufficient to display the transformations S 1 and S 4 . We will need the inverse of the transformation T 1 defined in (24). Using Theorem 1 we calculate
4 F 3 a , b , c , f + 1 d , e , f = M ^ 1 f 4 F 3 d + e a b c 1 , d a 1 , e a 1 , η ^ 1 + 1 d + e a c 1 , d + e a b 1 , η ^ 1 ,
where
M ^ 1 = Γ ( d ) Γ ( e ) Γ ( ψ ) Γ ( ψ + b ) Γ ( ψ + c ) Γ ( a ) , ε ^ 1 = 0 , λ ^ 1 = 1 , α ^ 1 = 1 ( d a 1 ) ( e a 1 ) ,
β ^ 1 = a ( d a 1 ) ( e a 1 ) , so that η ^ 1 = ( d a 1 ) ( e a 1 ) f a .
Next, exchanging the roles of d + e a b 1 and d and the roles of d a 1 and c in (5) or, equivalently, post-composing T 4 with permutation (13) (45) we will obtain a transformation that we call T ^ 4 . Then T ^ 4 T ^ 4 takes the form
4 F 3 a , b , c , f + 1 d , e , f = Γ ( e ) Γ ( d ) Γ ( ψ ) Γ ( b + ψ ) Γ ( c + ψ ) Γ ( a + 1 ) 4 F 3 ψ 1 , e a 1 , d a 1 , η ˜ 4 + 1 c + ψ , b + ψ , η ˜ 4
with
η ˜ 4 = ( ψ 1 ) ( e a 1 ) ( d a 1 ) f a b c + ( 1 + 2 a + a 2 b c d a d e a e + d e ) f .
Applying T 1 1 to the right hand side of (29) we obtain the transformation S 1 :
4 F 3 a , b , c , f + 1 d , e , f = M ε f + λ f 4 F 3 a + 1 , b , c , η + 1 d , e , η ,
where ε = 1 , and
M = 1 b c ( d a 1 ) ( e a 1 ) , λ = a b c a 2 b c + ( d 1 ) ( e 1 ) a ( d + e 2 ) ,
α = d + e a b c 2 a 2 b c + ( d 1 ) ( e 1 ) a ( d + e 2 ) , β = a ( d + e a b c 2 ) a 2 b c + ( d 1 ) ( e 1 ) a ( d + e 2 ) .
According to (15) we thus obtain the following expression for η
η = a b c + ( 1 + 2 a + a 2 b c d a d e a e + d e ) f a ( 2 + a + b + c d e ) ( 2 + a + b + c d e ) f .
Application of the transformation T 3 given by (26) to itself yields T 3 T 3 in the form:
4 F 3 a , b , c , f + 1 d , e , f = a ( d b ) ( d c ) ( b c + f ψ ) + ( d + 1 ) ( e a ) ( a b c + f d ψ ) f d ( d + 1 ) e ψ 4 F 3 a , b + 1 , c + 1 , η ˜ 3 + 1 d + 2 , e + 1 , η ˜ 3 ,
where
η ˜ 3 = a ( d b ) ( d c ) ( b c + f ψ ) + ( d + 1 ) ( e a ) ( a b c + f d ψ ) ( d b ) ( d c ) ( b c + f ψ ) + ( e a ) ( a b c + f d ψ ) .
On the other hand, using (28) we compute T 1 2 as follows:
4 F 3 a , b , c , f + 1 d , e , f = ( d 1 ) ( e 1 ) ( f a ) f ( d a 1 ) ( e a 1 ) 4 F 3 a , b 1 , c 1 , η ^ 1 + 1 d 1 , e 1 , η ^ 1
with
η ^ 1 = ( b 1 ) ( c 1 ) ( f a ) ( d a 1 ) ( e a 1 ) ψ ( f a ) .
Comparing these formulas we see that the composition T 1 2 T 3 2 gives the transformation S 4 shifting d d + 1 while a , b , c , e remain intact:
4 F 3 a , b , c , f + 1 d , e , f = f + λ f 4 F 3 a , b , c , η + 1 d + 1 , e , η ,
so that ε = 1 , M = 1 ,
λ = a b c d ( d + e a b c 1 ) , α = 1 d , β = ( b d ) ( c d ) + a ( b + c d ) d ( d + e a b c 1 ) , η = ε f + λ α f + β .
Each transformation S j , j = 1 , , 5 , obviously generates a subgroup of T ^ isomorphic to Z —the additive group of integers. Hence, in the parlance of group theory, the above theorem can be restated and enhanced as follows.
Corollary 1.
The group T ^ contains a subgroup S isomorphic to the 5-dimensional integer lattice Z 5 . Furthermore, this subgroup is normal.
Proof of Corollary 1.
By the previous theorem we only need to prove normality. Denote by S the subgroup of the matrix group D T ^ generated by the shift matrices S ^ j , j = 1 , , 5 . Clearly, S comprises 6 × 6 matrices whose principal 5 × 5 sub-matrix equals the identity matrix I 5 , the 6-th row is ( 0 , , 0 , 1 ) and the 6-th column is ( k 1 , , k 5 , 1 ) for some k i Z . As all elements of D T ^ have integer entries and the bottom row ( 0 , , 0 , 1 ) it is easy to see that for any shift matrix S S and any matrix D D T ^ both products D S and S D have the principal 5 × 5 sub-matrix equal to that of D and the last column of the form ( k 1 , , k 5 , 1 ) for some k i Z . Running over all elements of S while keeping D fixed we see that the left and right conjugacy classes of the element D with respect to S coincide. □
The above corollary implies that we can take the factor group D T ^ / S . Each element in D T ^ / S is a conjugacy class containing a representative with the last column ( 0 , , 0 , 1 ) T . Next, we note that the principal 5 × 5 sub-matrix of the matrix D 2 from (25b) of the transformation (6) is equal to that of the Kummer’s transformation (2). This transformation together with the permutation group P 3 × P 2 representing the obvious invariance with respect to separate permutations of the upper and lower parameters generate the entire group of Thomae transformations [9]. Next, comparing the principal 5 × 5 sub-matrices of the further generators D 1 , D 3 , D 4 with the matrices of the Thomae transformations found, for instance in ([4], Appendix 1), we see that all of them occur among the elements of the group of the Thomae transformations. Hence, it remains to apply Theorem 3.2 from [9] asserting that the group of the Thomae transformations is isomorphic the 120-element symmetric group P 5 of permutations on five symbols. Isomorphism is given by a linear change of variables seen in (4). Hence, our final result is the following theorem.
Theorem 4.
The group T ^ is isomorphic to P 5 × Z 5 .
As the entire group of the Thomae transformations for 3 F 2 can be generated by the identity (2) and the permutation group P 3 × P 2 , the above theorem implies that our entire group T ^ can be generated by the identity (6) (transformation T 2 ) and the top parameter shift transformation S 1 together with the obvious symmetries P 3 × P 2 . For example, the bottom parameter shift transformation can be obtained as follows:
( d c , e c , ψ , ψ + a , ψ + b ) T 2 2 ( a , b , c , d , e ) S 1 S 3 1 ( a + 1 , b , c 1 , d , e ) T 2 2 ( d c + 1 , e c + 1 , ψ , ψ + a + 1 , ψ + b ) S 1 S 2 ( d c , e c , ψ , ψ + a + 1 , ψ + b ) .
Comparing the first and the last terms in this chain we see that we got the bottom parameter shift transformation S 4 using only T 2 and top shift transformations S 1 , S 2 , S 3 obtained from S 1 by permuting top parameters.
Theorem 4 further implies that there is a straightforward algorithm for computing any transformation from the group T ^ . Details are given in the Appendix A to this paper.

4. Related 3 F 2 Transformation

The proof of Theorem 1 shows that each transformation T T is associated with the system (21) of two 3 F 2 transformations. This system leads immediately to the following corollary.
Proposition 1.
Each transformation T { ε , M ( r ) , λ ( r ) , α ( r ) , β ( r ) } T induces a transformation for the ratio
Ψ ( r ) : = F 2 ( r ) F 1 ( r ) = a b c d e 3 F 2 a + 1 , b + 1 , c + 1 d + 1 , e + 1 3 F 2 a , b , c d , e = d d x log 3 F 2 a , b , c d , e x | x = 1
of the form
Ψ ( r ) = β ( r ) Ψ ( D r ) + λ ( r ) α ( r ) Ψ ( D r ) + ε .
Next, we observe that any two elements of T generate a three-term relation for 3 F 2 .
Proposition 2.
For any two transformations from the group T : T 1 { ε 1 , M 1 ( r ) , λ 1 ( r ) , α 1 ( r ) , β 1 ( r ) , D 1 } and T 2 { ε 2 , M 2 ( r ) , λ 2 ( r ) , α 2 ( r ) , β 2 ( r ) , D 2 } satisfying the condition α 2 β 1 α 1 β 2 0 , the following identities hold
F 1 ( r ) = M 1 α 2 β 1 ε 1 α 1 α 2 λ 1 α 2 β 1 α 1 β 2 F 1 ( D 1 r ) + M 2 α 1 α 2 λ 2 α 1 β 2 ε 2 α 2 β 1 α 1 β 2 F 1 ( D 2 r )
(the dependence on r is omitted for brevity) and
F 2 ( r ) = M 1 β 1 β 2 ε 1 α 1 β 2 λ 1 α 2 β 1 α 1 β 2 F 1 ( D 1 r ) + M 2 α 2 β 1 λ 2 β 1 β 2 ε 2 α 2 β 1 α 1 β 2 F 1 ( D 2 r ) ,
where as before, F 1 ( r ) = 3 F 2 a , b , c d , e , F 2 ( r ) = ( a b c ) / ( d e ) 3 F 2 a + 1 , b + 1 , c + 1 d + 1 , e + 1 .
Proof of Proposition 2.
Solving (21) for each transformation we, in particular, get the system of equations:
F 1 ( D 1 r ) = ( β 1 F 1 ( r ) α 1 F 2 ( r ) ) / ( M 1 ( β 1 ε 1 α 1 λ 1 ) ) , F 1 ( D 2 r ) = ( β 2 F 1 ( r ) α 2 F 2 ( r ) ) / ( M 2 ( β 2 ε 2 α 2 λ 2 ) ) .
Solving the above system for F 1 ( r ) , F 2 ( r ) we arrive at (32) and (33). □
If the matrices D 1 , D 2 contain no shifts (i.e., the last column is ( 0 , 0 , 0 , 0 , 0 , 1 ) T ), then they correspond to Thomae’s relations, so that F 1 ( D 1 r ) , F 1 ( D 2 r ) are equal to each other up to a factor of gamma type. In this case, identities (32) and (33) become two-term transformations. However, for non-zero shifts Proposition 2 generates genuine three-term relations for 3 F 2 a , b , c ; d , e . For example, we obtain
3 F 2 a , b , c d , e = Γ ( d + 1 ) Γ ( e ) Γ ( d + e a b c ) Γ ( a + 1 ) Γ ( d + e a b ) Γ ( d + e a c ) 3 F 2 d + e a b c 1 , d a , e a d + e a c , e + d a b + ( a d ) ( d b ) ( d c ) d ( 1 + d ) e 3 F 2 a + 1 , b + 1 , c + 1 d + 2 , e + 1 .
An important subclass of these transformations are pure shifts (the principal 5 × 5 submatrices of D 1 , D 2 are identity matrices). This subclass comprises the so-called contiguous relations, studied recently in detail in [20]. In particular, Theorem 1.1 from [20] claims the existence of the unique rational functions u ( r ) , v ( r ) such that
3 F 2 a , b , c d , e = u ( r ) 3 F 2 a + k 1 , b + k 2 , c + k 1 d + k 4 , e + k 5 + v ( r ) 3 F 2 a + m 1 , b + m 2 , c + m 3 d + m 4 , e + m 5
for any two distinct non-zero integer vectors ( k 1 , k 2 , k 3 , k 4 , k 5 ) , ( m 1 , m 2 , m 3 , m 4 , m 5 ) . Furthermore, Ebisu and Iwasaki presented a rather explicit algorithm in [20] for computing the functions u ( r ) , v ( r ) for given shifts. Proposition 2 furnishes an alternative method for computing these functions. For its realization we provide a collection of Mathematica routines in the Appendix A to this paper. Our algorithm works as follows: first step is to calculate transformations T 1 , T 2 T ^ associated with the matrices
D 1 = 1 0 0 0 0 k 1 0 1 0 0 0 k 2 0 0 1 0 0 k 3 0 0 0 1 0 k 4 0 0 0 0 1 k 5 0 0 0 0 0 1 , D 2 = 1 0 0 0 0 m 1 0 1 0 0 0 m 2 0 0 1 0 0 m 3 0 0 0 1 0 m 4 0 0 0 0 1 m 5 0 0 0 0 0 1 .
To this end we simply iterate transformations S ± , S ± realizing the shifts by ± 1 of the first and forth parameters, respectively, combining them with the necessary permutations of the upper and lower parameters. To calculate the resulting λ , α and β the composition rule from Theorem 1 is used with the help of Mathematica routine. Then it remains to apply formula (32). For example, we get:
3 F 2 a , b , c d , e = d + e a b c 1 e 3 F 2 a + 1 , b + 1 , c + 1 d + 1 , e + 1 + ( a d ) ( d b ) ( d c ) d ( d + 1 ) e 3 F 2 a + 1 , b + 1 , c + 1 d + 2 , e + 1 .
Please note that identity (34) is obtained from (36) by an application of a Thomae relation to the first term on the right hand side. In a similar fashion, contiguous relations and Thomae transformations generate all three-term relations from Proposition 2, induced by the elements of the the group T ^ . We note that the relations covered by Proposition 2 are different from the three-term relations for 3 F 2 summarized by Bailey in ([21], Section 3.7) and studied from group-theoretic viewpoint in ([9], Section IV). This can be seen for example by comparing the matrices ([9], Equation (2.6c)) with the matrices D associated with T ^ .
The system (21) follows from the representation (13) of 4 F 3 with one unit shift as a linear combination of two 3 F 2 functions. However, Formula (13) is just one example of such decomposition. The two propositions below give many more ways to expand the 4 F 3 with unit shift into linear combination of 3 F 2 . Proposition 3 is proved directly in terms of hypergeometric series manipulations as its results will be used below in Section 6 to prove Lemma 1 used to generate the group T ^ .
Proposition 3.
The following identities hold true:
3 F 2 ( α , b , c d , e ) + γ 3 F 2 ( α 1 , b , c d , e ) = ( γ + 1 ) 4 F 3 ( α 1 , b , c , ξ + 1 d , e , ξ ) ,
where ξ = ( γ + 1 ) ( α 1 ) ;
3 F 2 α , b , c d , e + γ 3 F 2 α + 1 , b , c d + 1 , e = ( γ + 1 ) 4 F 3 α , b , c , ν + 1 d + 1 , e , ν ,
where ν = ( γ + 1 ) α d / ( γ d + α ) ; and
3 F 2 α , b , c d , e + γ 3 F 2 α , b + 1 , c + 1 d + 1 , e + 1 = 4 F 3 α 1 , b , c , λ + 1 d , e , λ ,
where λ = ( α 1 ) b c / ( b c + γ d e ) .
Proof of Proposition 3.
We have
3 F 2 α , b , c d , e + γ 3 F 2 α 1 , b , c d , e = 1 + γ + n = 1 ( α ) n ( b ) n ( c ) n + γ ( α 1 ) n ( b ) n ( c ) n ( d ) n ( e ) n n ! = ( 1 + γ ) 1 + n = 1 ( α 1 ) n ( b ) n ( c ) n ( d ) n ( e ) n n ! 1 + n ( α 1 ) ( γ + 1 ) = ( γ + 1 ) 4 F 3 α 1 , b , c , ξ + 1 d , e , ξ ,
where ξ = ( γ + 1 ) ( α 1 ) and we used ( α ) n = ( α 1 ) n ( 1 + n / ( α 1 ) ) . Next,
3 F 2 α , b , c d , e + γ 3 F 2 α + 1 , b , c d + 1 , e = 1 + γ + n = 1 ( α ) n ( b ) n ( c ) n ( d + 1 ) n ( e ) n n ! 1 + n d + γ + γ n α = ( γ + 1 ) 4 F 3 α , b , c , ν + 1 d + 1 , e , ν ,
where ν = ( γ + 1 ) α d / ( γ d + α ) and we used ( α + 1 ) n = ( α ) n ( 1 + n / α ) .
Finally, using the obvious identities ( b ) n = b ( b + 1 ) n 1 and ( α ) n = ( α 1 ) n + 1 / ( α 1 ) we get
3 F 2 α , b , c d , e + γ 3 F 2 α , b + 1 , c + 1 d + 1 , e + 1 = 1 + n = 1 b c ( α ) n 1 ( b + 1 ) n 1 ( c + 1 ) n 1 ( α + n 1 ) d e ( d + 1 ) n 1 ( e + 1 ) n 1 n ! + γ 3 F 2 α , b + 1 , c + 1 d + 1 , e + 1 = 1 + n = 0 ( α ) n ( b + 1 ) n ( c + 1 ) n ( d + 1 ) n ( e + 1 ) n n ! b c ( α + n ) d e ( n + 1 ) + γ = 1 + n = 0 ( α 1 ) n + 1 ( b ) n + 1 ( c ) n + 1 ( d ) n + 1 ( e ) n + 1 ( n + 1 ) ! d e b c ( α 1 ) b c ( α + n ) d e + γ ( n + 1 ) = 1 + n = 1 ( α 1 ) n ( b ) n ( c ) n ( d ) n ( e ) n n ! 1 + n b c + γ d e ( α 1 ) b c = 4 F 3 α 1 , b , c , λ + 1 d , e , λ ,
where λ = ( α 1 ) b c / ( b c + γ d e ) . □
Other ways to represent 4 F 3 with one unit shift as a linear combination of 3 F 2 are found by substituting (32) and (33) into (13). This is done in the following proposition.
Proposition 4.
Any two transformations from the group T : T 1 { ε 1 , M 1 ( r ) , λ 1 ( r ) , α 1 ( r ) , β 1 ( r ) , D 1 } and T 2 { ε 2 , M 2 ( r ) , λ 2 ( r ) , α 2 ( r ) , β 2 ( r ) , D 2 } satisfying the condition α 2 β 1 α 1 β 2 0 (for brevity we omit the dependence on r in the parameters)induce the decomposition
4 F 3 a , b , c , f + 1 d , e , f = M 1 β 1 ε 1 α 1 λ 1 α 2 β 1 α 1 β 2 α 2 + β 2 f F 1 ( D 1 r ) + M 2 α 2 λ 2 β 2 ε 2 α 2 β 1 α 1 β 2 α 1 + β 1 f F 1 ( D 2 r ) ,
where F 1 ( r ) = 3 F 2 a , b , c d , e .
Let us exemplify (40) with the following two decompositions:
4 F 3 a , b , c , f + 1 d , e , f = d + e a b c 1 e + a b c d e f 3 F 2 a + 1 , b + 1 , c + 1 d + 1 , e + 1 + ( a d ) ( d b ) ( d c ) e d ( 1 + d ) 3 F 2 a + 1 , b + 1 , c + 1 d + 2 , e + 1
and
4 F 3 a , b , c , f + 1 d , e , f = A 3 F 2 a + 1 , b , c d , e + B 3 F 2 a + 1 , b + 1 , c + 1 d + 2 , e + 1 ,
where
A = 1 + b c ( f a ) f ( b ( d c ) d ( d + e a c 1 ) ) , B = b c ( a d ) ( b d ) ( c d ) ( f a ) d e f ( 1 + d ) ( b ( c d ) + d ( d + e a c 1 ) ) .

5. Summation Formulas

In ([22], Equation (45)) we established the following summation formula
4 F 3 a , b , c , f + 1 d , e , f = Γ ( d ) Γ ( e ) Γ ( a + 1 ) Γ ( b + 1 ) Γ ( c + 1 ) ,
valid if
e 1 ( d , e ) e 1 ( a , b , c ) = 2 and f = e 3 ( a , b , c ) e 2 ( a , b , c ) e 2 ( 1 d , 1 e ) ,
where e k ( · ) denotes the k-th elementary symmetric polynomial. Now, if we apply any transformation of the form (15) and impose the above restrictions on the parameters on the right hand side, we obtain
4 F 3 a , b , c , f + 1 d , e , f = M ( r ) ε f + λ ( r ) f F ( q , η ) = M ( r ) ( ε f + λ ( r ) ) Γ ( q 4 ) Γ ( q 5 ) f Γ ( q 1 + 1 ) Γ ( q 2 + 1 ) Γ ( q 3 + 1 ) ,
where ( q 1 , q 2 , q 3 , q 4 , q 5 , 1 ) = D r , and the conditions e 1 ( q 4 , q 5 ) e 1 ( q 1 , q 2 , q 3 ) = 2 and
η = ε f + λ ( r ) α ( r ) f + β ( r ) = e 3 ( q 1 , q 2 , q 3 ) e 2 ( q 1 , q 2 , q 3 ) e 2 ( 1 q 4 , 1 q 5 )
must hold. Expressing f they are equivalent to
e 1 ( q 4 , q 5 ) e 1 ( q 1 , q 2 , q 3 ) = 2 and f = λ ( r ) ( e 2 ( q 1 , q 2 , q 3 ) e 2 ( 1 q 4 , 1 q 5 ) ) β ( r ) e 3 ( q 1 , q 2 , q 3 ) α ( r ) e 3 ( q 1 , q 2 , q 3 ) ε ( e 2 ( q 1 , q 2 , q 3 ) e 2 ( 1 q 4 , 1 q 5 ) ) .
As q i = q i ( a , b , c , d , e ) , i = 1 , , 5 , are linear functions we arrive at the following proposition:
Proposition 5.
Each transformation T T as characterized by the collection { ε , M ( r ) , λ ( r ) , α ( r ) , β ( r ) , D } corresponds to a summation formula (42a) valid under restrictions (42b) with ( q 1 , , q 5 , 1 ) = D r .
We will illustrate Proposition 5 by applying it to transformation (25). First condition in (42b) becomes e = c + 2 . In view of this condition formula (42a) takes the form
4 F 3 a , b , c , f + 1 d , c + 2 , f = ( c + 1 ) Γ ( d ) Γ ( d a b + 2 ) ( f ψ + c ( a + b d ) ) Γ ( d a + 1 ) Γ ( d b + 1 ) f ψ ,
where ψ = d a b + 1 and, by the second condition in (42b),
f = c ( a + b d ) ψ + ( d a ) ( d b ) c ψ ( ( d a ) ( d b + c ) + ( d b ) c + ( d 1 ) ( a + b d c 1 ) ) .
Further examples will be given in [23].

6. Proof of Lemma 1

Write identity (13) in expanded form
4 F 3 a , b , c , f + 1 d , e , f = 3 F 2 a , b , c d , e + a b c f d e 3 F 2 a + 1 , b + 1 , c + 1 d + 1 , e + 1 .
Applying Thomae’s transformation (3) to both 3 F 2 functions on the right hand side, we get ( ψ = d + e a b c 1 ):
4 F 3 a , b , c , f + 1 d , e , f = Γ ( ψ + 1 ) Γ ( d ) Γ ( e ) Γ ( a ) Γ ( ψ + b + 1 ) Γ ( ψ + c + 1 ) × 3 F 2 ψ + 1 , d a , e a ψ + b + 1 , ψ + c + 1 + b c f ψ 3 F 2 ψ , d a , e a ψ + b + 1 , ψ + c + 1 .
Now we employ Proposition 3. Application of formula (37) to the linear combination in brackets yields
4 F 3 a , b , c , f + 1 d , e , f = ( f ψ + b c ) Γ ( ψ ) Γ ( d ) Γ ( e ) f Γ ( a ) Γ ( ψ + b + 1 ) Γ ( ψ + c + 1 ) 4 F 3 ψ , d a , e a , η + 1 ψ + b + 1 , ψ + c + 1 , η ,
where η = ψ + b c / f . This proves transformation given by (7).
In a similar fashion, if we apply the Kummer transformation (2) to 3 F 2 on the right hand side of (43) we get:
4 F 3 a , b , c , f + 1 d , e , f = Γ ( ψ + 1 ) Γ ( d ) Γ ( d a ) Γ ( ψ + a + 1 ) 3 F 2 a , e b , e c e , ψ + a + 1 + a b c f e ψ 3 F 2 a + 1 , e b , e c e + 1 , ψ + a + 1 .
Applying the relation (38) to the linear combination in brackets we then obtain
4 F 3 a , b , c , f + 1 d , e , f = ( a b c + f e ψ ) Γ ( ψ ) Γ ( d ) f e Γ ( d a ) Γ ( ψ + a + 1 ) 4 F 3 a , e b , e c , λ + 1 e + 1 , ψ + a + 1 , λ ,
where
λ = a b c + f e ψ b c + f ψ .
This proves transformation (8).

Author Contributions

The authors contributed equally to this work. Both authors have read and agreed to the published version of the manuscript.

Funding

The second author was funded by the Ministry of Science and Higher Education of the Russian Federation (supplementary agreement No. 075-02-2020-1482-1 of 21 April 2020).

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

In this appendix we will display the explicit form of the main building blocks needed for calculating the elements of the group T ^ . Just as it stands for Thomae’s transformations ([4], Appendix 1), we have ten different identities with zero shifts. They are obtained as follows: permuting a b and a c in formula (7) we get three transformations, while a b , a c and d e in (6) leads to six more transformations. Adding the identity transformation we arrive at ten ”Thomae-like” zero-shift transformations for 4 F 3 containing the parameter pair f + 1 f . The entire 120 element subgroup of ”Thomae-like” zero-shift transformations is obtained by the obvious 12 permutations of three top and two bottom parameters on the right hand side of each of the ten transformations described above.
All further transformations are obtained by consecutive application of the four shifting transformations S ± , S ± and permutations of top and bottom parameters to the 120 transformations described above. Transformation S + shifting the top parameter a by + 1 (denoted by S 1 in Section 3) is given by (30). Combining parameters it can be written as:
4 F 3 a , b , c , f + 1 d , e , f = 1 b c ( d a 1 ) ( e a 1 ) 1 + λ f 4 F 3 a + 1 , b , c , η + 1 d , e , η ,
where
λ = a b c a ( 2 + a d e ) b c + ( d 1 ) ( e 1 ) , η = a b c + ( ( a + 1 ) ( a + 1 d e ) b c + d e ) f ( a f ) ( 2 + a + b + c d e ) .
Its inverse S is given by:
4 F 3 a , b , c , f + 1 d , e , f = 1 + b c ψ f 4 F 3 a 1 , b , c , η + 1 d , e , η ,
where
η = ( a 1 ) ( b c + ψ f ) a ( d + e a ) + b c d e + ψ f .
The transformation S + shifting the bottom parameter d by + 1 (denoted by S 4 in Section 3) is given by (31). It can be written more compactly as
4 F 3 a , b , c , f + 1 d , e , f = a b c + ψ d f ψ d f 4 F 3 a , b , c , η + 1 d + 1 , e , η ,
where ψ = e + d a b c 1 and
η = a b c + ψ d f d ( d a b c ) + a b + a c + b c + ψ f .
Finally, its inverse transformation S shifting a bottom parameter by 1 has the form
4 F 3 a , b , c , f + 1 d , e , f = [ ( ( d b 1 ) ( d c 1 ) a ( d b c 1 ) ) f a b c ] ( d 1 ) ( d a 1 ) ( d b 1 ) ( d c 1 ) f 4 F 3 a , b , c , η + 1 d 1 , e , η ,
where
η = a b c + [ ( 1 d ) ( d a b c 1 ) a b a c b c ] f ( d + e a b c 2 ) ( f d + 1 ) .
In the remaining part of the Appendix we present several Wolfram Mathematica® routines intended for dealing with the group T together with an example of their use. Listing A1 contains the function CMPS [ T 1 , T 2 ] that takes as input two transformations T 1 , T 2 and computes their composition T 2 T 1 . The form in which the parameters ε i , M i , λ i , α i , β i and D i , i = 1 , 2 , should be supplied can be seen from the example in Listing A5. Similarly, Listing A2 contains the function INV [ T ] that computes the inverse of a given transformation T. The output provided by CMPS and INV can be printed in an easily readable form using the function PRN [ T ] given in Listing A3. The same Listing A3 contains the function INPT [ T ] that converts the output form of the functions CMPS and INV into the input form of the same functions, so that further compositions or inverses could be computed from such output. For numerical verification of the outputs of CMPS and INV the function RHS [ T ] presented in Listing A4 converts these outputs into an expression that can be evaluated by the Mathematica function N [ ] after the parameters have been assigned some numerical values, see an example at the end of Listing A5.
Listing A1. Composition.
Listing A1. Composition.
1
   CMPS[T1_, T2_]:=Module[{eps1=T1[[1]], M1=T1[[2]], lam1=T1[[3]], alpha1=T1[[4]],
2
   beta1=T1[[5]], D1=T1[[6]], eps2=T2[[1]], M2=T2[[2]], lam2=T2[[3]], alpha2=T2[[4]], beta2=T2[[5]],
3
   D2=T2[[6]], R={{a},{b},{c},{d},{e},{1}}}, RR=Flatten[Drop[R,{6}]];
4
   If [Simplify[eps1*eps2+alpha1@@RR*lam2@@Flatten[Drop[D1.R,{6}]]]===0,
5
   {0, FullSimplify[M1@@RR*M2@@Flatten[Drop[D1.R,{6}]]*(eps2*lam1@@RR+lam2@@Flatten[Drop[D1.R,  {6}]]*beta1@@RR)], 1,
6
   Simplify[(eps1*alpha2 @@ Flatten[Drop[D1.R,{6}]]+alpha1@@RR*beta2@@Flatten[Drop[D1.R, {6}]])/
7
   (eps2*lam1@@RR+lam2@@Flatten[Drop[D1.R,{6}]]*beta1@@RR)], Simplify[(lam1@@RR*alpha2@@Flatten[Drop[D1.R,{6}]]
8
   +beta1@@RR*beta2@@Flatten[Drop[D1.R, {6}]])/(eps2*lam1@@RR+lam2@@Flatten[Drop[D1.R,{6}]]*beta1@@RR)], D2.D1},
9
   {1, FullSimplify[M1@@RR*M2@@Flatten[Drop[D1.R,{6}]]*(eps1*eps2+alpha1@@RR*lam2@@Flatten[Drop[D1.R, {6}]])],
10
   Simplify[(eps2*lam1@@RR+lam2@@Flatten[Drop[D1.R,{6}]]*beta1@@RR)/
11
   (eps1*eps2+alpha1@@RR*lam2@@Flatten[Drop[D1.R,{6}]])], Simplify[(eps1*alpha2@@Flatten[Drop[D1.R, {6}]]
12
   +alpha1@@RR*beta2@@Flatten[Drop[D1.R, {6}]])/(eps1*eps2+alpha1@@RR*lam2@@Flatten[Drop[D1.R, {6}]])],
13
   Simplify[(lam1@@RR*alpha2@@Flatten[Drop[D1.R,{6}]]+beta1@@RR*beta2 @@Flatten[Drop[D1.R, {6}]])/
14
   (eps1*eps2+alpha1@@RR*lam2@@Flatten[Drop[D1.R,{6}]])], D2.D1}]]
Listing A2. Inversion.
Listing A2. Inversion.
1
INV[TT_]:=Module[{eps=TT[[1]], M=TT[[2]], lam=TT[[3]], alpha=TT[[4]], beta=TT[[5]], D=TT[[6]],
2
   R={{a}, {b}, {c}, {d}, {e}, {1}}}, RR=Flatten[Drop[R, {6}]];
3
   If[Simplify[beta@@RR]===0, {0,FullSimplify[1/M@@Flatten[Drop[Inverse[D].R,{6}]]/
4
   alpha@@Flatten[Drop[Inverse[D].R, {6}]]], 1, Simplify[alpha@@Flatten[Drop[Inverse[D].R,{6}]]/
5
   lam@@Flatten[Drop[Inverse[D].R, {6}]]], −eps/lam@@Flatten[Drop[Inverse[D].R, {6}]], Inverse[D]},
6
   {1, FullSimplify[beta@@Flatten[Drop[Inverse[D].R, {6}]]/(M@@Flatten[Drop[Inverse[D].R,{6}]]*
7
   (eps*beta@@Flatten[Drop[Inverse[D].R, {6}]]−lam@@Flatten[Drop[Inverse[D].R, {6}]]*
8
   alpha@@Flatten[Drop[Inverse[D].R, {6}]]))], Simplify[−lam@@Flatten[Drop[Inverse[D].R,{6}]]/
9
   beta@@Flatten[Drop[Inverse[D].R, {6}]]], Simplify[−alpha@@Flatten[Drop[Inverse[D].R,{6}]]/
10
   beta@@Flatten[Drop[Inverse[D].R, {6}]]], Simplify [eps/beta @@ Flatten[Drop[Inverse[D].R,{6}]]], Inverse[D]}]]
Listing A3. Conversion into input form and printing.
Listing A3. Conversion into input form and printing.
1
exprToFunction[expr_, vars_]:=ToExpression[ToString[FullForm[expr]/.MapIndexed[#1 −> Slot @@ #2 &, vars]]<>"&"];
2
 
3
INPT[TT_]:=List[TT[[1]], exprToFunction[TT[[2]], {a, b, c, d, e}],
4
   exprToFunction[TT[[3]], {a, b, c, d, e}], exprToFunction[TT[[4]], {a, b, c, d, e}],
5
   exprToFunction[TT[[5]], {a, b, c, d, e}], TT[[6]]]
6
 
7
ETA[TT_]:=Collect[Numerator[Together[(TT[[1]]*f+TT[[3]])/(TT[[4]]*f+TT[[5]])]], f]/
8
   Collect[Denominator[Together[(TT[[1]]*f + TT[[3]])/(TT[[4]]*f + TT[[5]])]], f]
9
 
10
PRN[TT_]:=Module[{}, Print["epsilon=", TT[[1]]];
11
    Print["M=", FullSimplify[TT[[2]]]];
12
    Print["Lambda=", FullSimplify[TT[[3]]]]; Print["alpha=", TT[[4]]];
13
    Print["Beta=", TT[[5]]];
14
    Print["Parameters=", Flatten[Drop[TT[[6]].{{a}, {b}, {c}, {d}, {e}, {1}}, {6}]]];
15
    Print["eta=", ETA[TT]]];
Listing A4. Conversion into computable form.
Listing A4. Conversion into computable form.
1
 RHS[TT_]:=Simplify[TT[[2]]*(TT[[1]]*f + TT[[3]])/f]*
2
 HypergeometricPFQ[Join[Flatten[Drop[TT[[6]].{{a},{b},{c},{d},{e},{1}},{6}]][[1;;3]], {ETA[TT]+1}],
3
   Join[Flatten[Drop[TT[[6]].{{a},{b},{c},{d},{e},{1}},{6}]][[4;;5]], {ETA[TT]}],1]
Listing A5. Example of use.
Listing A5. Example of use.
1
(*Definition of the first transformation*)
2
eps1=1; M1[a_,b_,c_,d_,e_]:=Gamma[d+e−a−b−c]*Gamma[d]*Gamma[e]/Gamma[a]/Gamma[d+e−a−c]/Gamma[d+e−a−b];
3
lam1[a_,b_,c_,d_,e_]:=b*c/(d+e−a−b−c−1); alpha1[a_,b_,c_,d_,e_]:=1/(d+e−a−b−c−1);
4
beta1[a_, b_, c_, d_,e_]:=0; D1={{−1,−1,−1,1,1,−1}, {−1,0,0,1,0,0}, {−1,0,0,0,1,0}, {−1,0,−1,1,1,0},
5
  {−1,−1,0,1,1,0}, {0,0,0,0,0,1}};
6
 
7
(*Definition of the second transformation*)
8
eps2=1; M2[a_,b_,c_,d_,e_]:=Gamma[d+e−a−b−c]*Gamma[e]/Gamma[d+e−a−b]/Gamma[e−c];
9
lam2[a_,b_,c_,d_,e_]:=(a+b−d)*c/(d+e−a−b−c−1); alpha2[a_,b_,c_,d_,e_]:=0;
10
beta2[a_,b_,c_,d_,e_]:=(e−c−1)/(d+e−a−b−c−1); D2={{−1,0,0,1,0,0}, {0,−1,0,1,0,0}, {0,0,1,0,0,0},
11
  {0,0,0,1,0,0}, {−1,−1,0,1,1,0}, {0,0,0,0,0,1}};
12
 
13
(*composition T2T1*)
14
T1T2=CMPS[{eps1, M1, lam1, alpha1, beta1, D1}, {eps2, M2, lam2, alpha2, beta2, D2}];
15
 
16
(*Inverse of T1*)
17
T1INV = INV[{eps1, M1, lam1, alpha1, beta1, D1}];
18
 
19
(*Printing the parameters of T2T1*)
20
PRN[T1T2]
21
epsilon=1
22
M=−(((a c+(1+b−d) e) Gamma[d] Gamma[−1−a−b−c+d+e])/(e Gamma[−b+d] Gamma[−a−c+d+e]))
23
Lambda=−((a b c)/(a c+(1+b−d)e))
24
alpha=(1+b−d)/(a c+e+b e−d e)
25
Beta=0
26
Parameters={1+b,−c+e,−a+e,−a−c+d+e,1+e}
27
eta=(−abc+(ac+e+be−de)f)/((1+b−d)f)
28
 
29
(*Computing composition of the results of previous operations*)
30
NEW=CMPS[INPT[T1T2], INPT[T1INV]];
31
 
32
(*Numerical verification of the transformation NEW usin RHS[…]*)
33
a=1+2/3; b=−13/17+2; c=3/7; d=5/11; e=5+44/17; f=12/13;
34
In[51]:= N[HypergeometricPFQ[{a, b, c, f + 1}, {d, e, f}, 1], 15]
35
Out[51]= 2.22268615827388
36
In[52]:= N[RHS[NEW], 15]
37
Out[52]= 2.22268615827388

References

  1. Andrews, G.E.; Askey, R.; Roy, R. Special Functions; Cambridge University Press: Cambridge, UK, 1999. [Google Scholar]
  2. Krattenthaler, C.; Srinivasa Rao, K. On group theoretical aspects, hypergeometric transformations and symmetries of angular momentum coefficients. In Symmetries in Science XI; Kluwer Acad. Publ.: Dordrecht, The Netherlands, 2005; pp. 355–375. [Google Scholar]
  3. Rao, K.S. Hypergeometric series and Quantum Theory of Angular Momentum. In Selected Topics in Special Functions; Agarwal, R.P., Manocha, H.L., Srinivasa Rao, K., Eds.; Allied Publishers Ltd.: New Delhi, India, 2001; pp. 93–134. [Google Scholar]
  4. Rao, K.S.; Doebner, H.D.; Natterman, P. Generalized hypergeometric series and the symmetries of 3 − j and 6 − j coefficients. In Number Theoretic Methods. Developments in Mathematics; Kanemitsu, S., Jia, C., Eds.; Springer: Boston, MA, USA, 2002; Volume 8, pp. 381–403. [Google Scholar]
  5. Rao, K.S.; Lakshminarayanan, V. Generalized Hypergeometric Functions, Transformations and Group Theoretical Aspects; IOP Science: Bristol, UK, 2018. [Google Scholar]
  6. Shpot, M.A.; Srivastava, H.M. The Clausenian hypergeometric function 3F2 with unit argument and negative integral parameter differences. Appl. Math. Comput. 2015, 259, 819–827. [Google Scholar]
  7. Formichella, M.; Green, R.M.; Stade, E. Coxeter group actions on 4F3(1) hypergeometric series. Ramanujan J. 2011, 24, 93–128. [Google Scholar] [CrossRef] [Green Version]
  8. Olver, F.W.J.; Lozier, D.W.; Boisvert, R.F.; Clark, C.W. (Eds.) NIST Handbook of Mathematical Functions; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  9. Beyer, W.A.; Louck, J.D.; Stein, P.R. Group theoretical basis of some identities for thegeneralized hypergeometric series. J. Math. Phys. 1987, 28, 497–508. [Google Scholar] [CrossRef]
  10. Hardy, G.H. Ramanujan: Twelve Lectures on Subjects Suggested by His Life and Work; AMS Chelsea Pub.: Providence, RI, USA, 1999; p. 111. [Google Scholar]
  11. Green, R.M.; Mishev, I.D.; Stade, E. Coxeter group actions and limits of hypergeometric series. Ramanujan J. 2020. [Google Scholar] [CrossRef]
  12. Mishev, I.D. Coxeter group actions on Saalschützian 4F3(1) series and very-well-poised 7F6(1) series. J. Math. Anal. Appl. 2012, 385, 1119–1133. [Google Scholar] [CrossRef] [Green Version]
  13. Rao, K.S.; Van der Jeugt, J.; Raynal, J.; Jagannathan, R.; Rajeswari, V. Group theoretical basis for the terminating 3F2(1) series. J. Phys. A Math. Gen. 1992, 25, 861–876. [Google Scholar] [CrossRef]
  14. Van der Jeugt, J.; Rao, K.S. Invariance groups of transformations of basic hypergeometric series. J. Math. Phys. 1999, 40, 6692–6700. [Google Scholar] [CrossRef]
  15. Nørlund, N.E. Hypergeometric functions. Acta Math. 1955, 94, 289–349. [Google Scholar] [CrossRef]
  16. Olsson, P.O.M. Analytic continuation of higher-order hypergeometric functions. J. Math. Phys. 1966, 7, 702–710. [Google Scholar] [CrossRef]
  17. Bühring, W. Generalized hypergeometric functions at unit argument. Proc. Am. Math. Soc. 1992, 114, 145–153. [Google Scholar] [CrossRef] [Green Version]
  18. Kim, Y.S.; Rathie, A.K.; Paris, R.B. On two Thomae-type transformations for hypergeometric series with integral parameter differences. Math. Commun. 2014, 19, 111–118. [Google Scholar]
  19. Karp, D.B.; Prilepkina, E.G. Beyond the beta integral method: transformation formulas for hypergeometric functions via Meijer’s G function. arXiv 2019, arXiv:1912.11266. [Google Scholar]
  20. Ebisu, A.; Iwasaki, K. Three-term relations for 3F2(1). J. Math. Anal. Appl. 2018, 463, 593–610. [Google Scholar] [CrossRef]
  21. Bailey, W.N. Generalized Hypergeometric Series; Stecherthafner Service Agency: New York, NY, USA; London, UK, 1964; Reprinted from: Cambridge Tracts in Mathematics and Mathematical Physics, 1935, Volume 32. [Google Scholar]
  22. Karp, D.B.; Prilepkina, E.G. Degenerate Miller-Paris transformations. Results Math. 2019, 74. [Google Scholar] [CrossRef] [Green Version]
  23. Çetinkaya, A.; Karp, D. Summation formulas for some hypergeometric and some digamma series. Commun. Korean Math. Soc. 2020. in preparation. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Karp, D.; Prilepkina, E. Transformations of the Hypergeometric 4F3 with One Unit Shift: A Group Theoretic Study. Mathematics 2020, 8, 1966. https://doi.org/10.3390/math8111966

AMA Style

Karp D, Prilepkina E. Transformations of the Hypergeometric 4F3 with One Unit Shift: A Group Theoretic Study. Mathematics. 2020; 8(11):1966. https://doi.org/10.3390/math8111966

Chicago/Turabian Style

Karp, Dmitrii, and Elena Prilepkina. 2020. "Transformations of the Hypergeometric 4F3 with One Unit Shift: A Group Theoretic Study" Mathematics 8, no. 11: 1966. https://doi.org/10.3390/math8111966

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