Kalpana Kalpana (Editor)

Askey–Gasper inequality

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, the Askey–Gasper inequality is an inequality for Jacobi polynomials proved by Richard Askey and George Gasper (1976) and used in the proof of the Bieberbach conjecture.

Contents

Statement

It states that if β ≥ 0, α + β ≥ −2, and −1 ≤ x ≤ 1 then

k = 0 n P k ( α , β ) ( x ) P k ( β , α ) ( 1 ) 0

where

P k ( α , β ) ( x )

is a Jacobi polynomial.

The case when β = 0 can also be written as

3 F 2 ( n , n + α + 2 , 1 2 ( α + 1 ) ; 1 2 ( α + 3 ) , α + 1 ; t ) > 0 , 0 t < 1 , α > 1.

In this form, with α a non-negative integer, the inequality was used by Louis de Branges in his proof of the Bieberbach conjecture.

Proof

Ekhad (1993) gave a short proof of this inequality, by combining the identity

( α + 2 ) n n ! × 3 F 2 ( n , n + α + 2 , 1 2 ( α + 1 ) ; 1 2 ( α + 3 ) , α + 1 ; t ) = = ( 1 2 ) j ( α 2 + 1 ) n j ( α 2 + 3 2 ) n 2 j ( α + 1 ) n 2 j j ! ( α 2 + 3 2 ) n j ( α 2 + 1 2 ) n 2 j ( n 2 j ) ! × 3 F 2 ( n + 2 j , n 2 j + α + 1 , 1 2 ( α + 1 ) ; 1 2 ( α + 2 ) , α + 1 ; t )

with the Clausen inequality.

Generalizations

Gasper & Rahman (2004, 8.9) give some generalizations of the Askey–Gasper inequality to basic hypergeometric series.

References

Askey–Gasper inequality Wikipedia