<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Clearing_factor</id>
	<title>Clearing factor - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Clearing_factor"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Clearing_factor&amp;action=history"/>
	<updated>2026-04-11T07:01:37Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Clearing_factor&amp;diff=22847&amp;oldid=prev</id>
		<title>en&gt;Izno: /* References */ add section</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Clearing_factor&amp;diff=22847&amp;oldid=prev"/>
		<updated>2012-04-21T15:34:57Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;References: &lt;/span&gt; add section&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In mathematics, the &amp;#039;&amp;#039;&amp;#039;Askey–Gasper inequality&amp;#039;&amp;#039;&amp;#039; is an inequality for [[Jacobi polynomial]]s proved by {{harvs|txt|first=Richard|last=Askey|authorlink=Richard Askey|first2=George|last2=Gasper|author2-link=George Gasper|year=1976}} and used in the proof of the [[Bieberbach conjecture]].&lt;br /&gt;
&lt;br /&gt;
==Statement==&lt;br /&gt;
&lt;br /&gt;
It states that if &amp;#039;&amp;#039;&amp;amp;beta;&amp;#039;&amp;#039;&amp;amp;nbsp;≥&amp;amp;nbsp;0, &amp;#039;&amp;#039;&amp;amp;alpha;&amp;#039;&amp;#039;&amp;amp;nbsp;+&amp;amp;nbsp;&amp;#039;&amp;#039;&amp;amp;beta;&amp;#039;&amp;#039;&amp;amp;nbsp;≥&amp;amp;nbsp;&amp;amp;minus;2, and &amp;amp;minus;1&amp;amp;nbsp;≤&amp;amp;nbsp;&amp;#039;&amp;#039;x&amp;#039;&amp;#039;&amp;amp;nbsp;≤&amp;amp;nbsp;1 then&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\sum_{k=0}^n \frac{P_k^{(\alpha,\beta)}(x)}{P_k^{(\beta,\alpha)}(1)} \ge 0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;P_k^{(\alpha,\beta)}(x)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is a Jacobi polynomial.&lt;br /&gt;
&lt;br /&gt;
The case when β=0 can also be written as&lt;br /&gt;
:&amp;lt;math&amp;gt;\displaystyle {}_3F_2(-n,n+\alpha+2,(\alpha+1)/2;(\alpha+3)/2,\alpha+1;t)&amp;gt;0\mbox{ for }0\leq t&amp;lt;1,\;\alpha&amp;gt;-1.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In this form, with α a non-negative integer, the inequality was used by [[Louis de Branges]] in his proof of the [[de Branges&amp;#039;s theorem|Bieberbach conjecture]].&lt;br /&gt;
&lt;br /&gt;
==Proof==&lt;br /&gt;
&lt;br /&gt;
{{harvs|txt|authorlink=Shalosh B. Ekhad|last=Ekhad|year=1993}} gave a short proof of this inequality, by combining the  identity&lt;br /&gt;
:&amp;lt;math&amp;gt;\displaystyle \frac{(\alpha+2)_n}{n!}{}_3F_2(-n,n+\alpha+2,(\alpha+1)/2;(\alpha+3)/2,\alpha+1;t)&amp;lt;/math&amp;gt;&lt;br /&gt;
:&amp;lt;math&amp;gt;\displaystyle =\frac{(1/2)_j(\alpha/2+1)_{n-j}(\alpha/2+3/2)_{n-2j}(\alpha+1)_{n-2j}}&lt;br /&gt;
{j!((\alpha/2+3/2)_{n-j}(\alpha/2+1/2)_{n-2j}(n-2j)!}  &amp;lt;/math&amp;gt;&lt;br /&gt;
:&amp;lt;math&amp;gt;\displaystyle \times{}_3F_2(-n+2j,n-2j+\alpha+1,(\alpha+1)/2;(\alpha+2)/2,\alpha+1;t)&amp;lt;/math&amp;gt;&lt;br /&gt;
with the [[Clausen inequality]].&lt;br /&gt;
&lt;br /&gt;
==Generalizations==&lt;br /&gt;
&lt;br /&gt;
{{harvtxt|Gasper|Rahman|2004|loc=8.9}} give some generalizations of the Askey–Gasper inequality to [[basic hypergeometric series]].&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
&lt;br /&gt;
*[[Turán&amp;#039;s inequalities]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
*{{Citation | author1-link=Richard Askey | last1=Askey | first1=Richard | last2=Gasper | first2=George | title=Positive Jacobi polynomial sums. II | jstor=2373813 | mr=0430358 | year=1976 | journal=[[American Journal of Mathematics]] | issn=0002-9327 | volume=98 | issue=3 | pages=709–737 | doi=10.2307/2373813 | publisher=American Journal of Mathematics, Vol. 98, No. 3}}&lt;br /&gt;
*{{Citation | last1=Askey | first1=Richard | last2=Gasper | first2=George | editor1-last=Baernstein | editor1-first=Albert | editor2-last=Drasin | editor2-first=David | editor3-last=Duren | editor3-first=Peter | editor4-last=Marden | editor4-first=Albert | title=The Bieberbach conjecture (West Lafayette, Ind., 1985) | url=http://books.google.com/books?id=HcDl0D4Y6WoC&amp;amp;pg=PA7 | publisher=[[American Mathematical Society]] | location=Providence, R.I. | series=Math. Surveys Monogr. | isbn=978-0-8218-1521-2  | mr=875228 | year=1986 | volume=21 | chapter=Inequalities for polynomials | pages=7–32}}&lt;br /&gt;
*{{Citation | last1=Ekhad | first1=Shalosh B. | editor1-last=Delest | editor1-first=M. | editor2-last=Jacob | editor2-first=G. | editor3-last=Leroux | editor3-first=P. | title=A short, elementary, and easy, WZ proof of the Askey-Gasper inequality that was used by de Branges in his proof of the Bieberbach conjecture | series=Conference on Formal Power Series and Algebraic Combinatorics (Bordeaux, 1991) | doi=10.1016/0304-3975(93)90313-I | mr=1235178 | year=1993 | journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]] | issn=0304-3975 | volume=117 | issue=1 | pages=199–202}}&lt;br /&gt;
*{{Citation | last1=Gasper | first1=George | first2=Mizan | title=Basic hypergeometric series | publisher=[[Cambridge University Press]] | edition=2nd | series=Encyclopedia of Mathematics and its Applications | isbn=978-0-521-83357-8 | doi=10.2277/0521833574 | mr=2128719 | year=2004 | volume=96}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Askey-Gasper inequality}}&lt;br /&gt;
[[Category:Inequalities]]&lt;br /&gt;
[[Category:Special functions]]&lt;br /&gt;
[[Category:Orthogonal polynomials]]&lt;/div&gt;</summary>
		<author><name>en&gt;Izno</name></author>
	</entry>
</feed>