Jacobi Polynomials
   HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, Jacobi polynomials (occasionally called hypergeometric polynomials) P_n^(x) are a class of classical
orthogonal polynomials In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal In mathematics, orthogonality (mathematics), orthogonality is the generalization of the geom ...
. They are orthogonal with respect to the weight (1-x)^\alpha(1+x)^\beta on the interval 1,1/math>. The Gegenbauer polynomials, and thus also the Legendre, Zernike and
Chebyshev polynomials The Chebyshev polynomials are two sequences of orthogonal polynomials related to the cosine and sine functions, notated as T_n(x) and U_n(x). They can be defined in several equivalent ways, one of which starts with trigonometric functions: ...
, are special cases of the Jacobi polynomials. The Jacobi polynomials were introduced by
Carl Gustav Jacob Jacobi Carl Gustav Jacob Jacobi (; ; 10 December 1804 – 18 February 1851) was a German mathematician who made fundamental contributions to elliptic functions, dynamics, differential equations, determinants and number theory. Biography Jacobi was ...
.


Definitions


Via the hypergeometric function

The Jacobi polynomials are defined via the
hypergeometric function In mathematics, the Gaussian or ordinary hypergeometric function 2''F''1(''a'',''b'';''c'';''z'') is a special function represented by the hypergeometric series, that includes many other special functions as specific or limiting cases. It is ...
as follows: :P_n^(z)=\frac\,_2F_1\left(-n,1+\alpha+\beta+n;\alpha+1;\tfrac(1-z)\right), where (\alpha+1)_n is Pochhammer's symbol (for the rising factorial). In this case, the series for the hypergeometric function is finite, therefore one obtains the following equivalent expression: :P_n^ (z) = \frac \sum_^n \frac \left(\frac\right)^m.


Rodrigues' formula

An equivalent definition is given by
Rodrigues' formula In mathematics, Rodrigues' formula (formerly called the Ivory–Jacobi formula) generates the Legendre polynomials. It was independently introduced by , and . The name "Rodrigues formula" was introduced by Heine in 1878, after Hermite pointed ou ...
: :P_n^(z) = \frac (1-z)^ (1+z)^ \frac \left\. If \alpha = \beta = 0 , then it reduces to the
Legendre polynomials In mathematics, Legendre polynomials, named after Adrien-Marie Legendre (1782), are a system of complete and orthogonal polynomials with a wide number of mathematical properties and numerous applications. They can be defined in many ways, and t ...
: : P_(z) = \frac \frac ( z^2 - 1 )^n \; .


Alternate expression for real argument

For real x the Jacobi polynomial can alternatively be written as :P_n^(x)= \sum_^n \left(\frac\right)^ \left(\frac\right)^ and for integer n : = \begin \frac & n \geq 0 \\ 0 & n < 0 \end where \Gamma(z) is the
gamma function In mathematics, the gamma function (represented by Γ, capital Greek alphabet, Greek letter gamma) is the most common extension of the factorial function to complex numbers. Derived by Daniel Bernoulli, the gamma function \Gamma(z) is defined ...
. In the special case that the four quantities n, n+\alpha, n+\beta, n+\alpha+\beta are nonnegative integers, the Jacobi polynomial can be written as The sum extends over all integer values of s for which the arguments of the factorials are nonnegative.


Special cases

:P_0^(z)= 1, :P_1^(z)= (\alpha+1) + (\alpha+\beta+2)\frac, :P_2^(z)= \frac + (\alpha+2)(\alpha+\beta+3)\frac + \frac\left(\frac\right)^2.


Basic properties


Orthogonality

The Jacobi polynomials satisfy the orthogonality condition :\int_^1 (1-x)^ (1+x)^ P_m^ (x)P_n^ (x)\,dx =\frac \frac \delta_, \qquad \alpha,\ \beta > -1. As defined, they do not have unit norm with respect to the weight. This can be corrected by dividing by the square root of the right hand side of the equation above, when n=m. Although it does not yield an orthonormal basis, an alternative normalization is sometimes preferred due to its simplicity: :P_n^ (1) = .


Symmetry relation

The polynomials have the symmetry relation :P_n^ (-z) = (-1)^n P_n^ (z); thus the other terminal value is :P_n^ (-1) = (-1)^n .


Derivatives

The kth derivative of the explicit expression leads to :\frac P_n^ (z) = \frac P_^ (z).


Differential equation

The Jacobi polynomial P_n^ is a solution of the second order
linear homogeneous differential equation In mathematics, a linear differential equation is a differential equation that is linear in the unknown function and its derivatives, so it can be written in the form a_0(x)y + a_1(x)y' + a_2(x)y'' \cdots + a_n(x)y^ = b(x) where and are arbi ...
: \left (1-x^2 \right )y'' + ( \beta-\alpha - (\alpha + \beta + 2)x )y' + n(n+\alpha+\beta+1) y = 0.


Recurrence relations

The
recurrence relation In mathematics, a recurrence relation is an equation according to which the nth term of a sequence of numbers is equal to some combination of the previous terms. Often, only k previous terms of the sequence appear in the equation, for a parameter ...
for the Jacobi polynomials of fixed \alpha, \beta is: : \begin &2n (n + \alpha + \beta) (2n + \alpha + \beta - 2) P_n^(z) \\ &\qquad= (2n+\alpha + \beta-1) \Big\ P_^(z) - 2 (n+\alpha - 1) (n + \beta-1) (2n+\alpha + \beta) P_^(z), \end for n=2,3,\ldots. Writing for brevity a:=n + \alpha , b:=n + \beta and c:=a+b=2n + \alpha+ \beta, this becomes in terms of a,b,c : 2n (c-n)(c-2) P_n^(z) =(c-1) \Big\ P_^(z)-2 (a-1)(b-1) c\; P_^(z). Since the Jacobi polynomials can be described in terms of the hypergeometric function, recurrences of the hypergeometric function give equivalent recurrences of the Jacobi polynomials. In particular, Gauss' contiguous relations correspond to the identities : \begin (z-1) \frac P_n^(z) & = \frac (z-1)(1+\alpha+\beta+n)P_^ \\ & = n P_n^ - (\alpha+n) P_^ \\ & =(1+\alpha+\beta+n) \left( P_n^ - P_^ \right) \\ & =(\alpha+n) P_n^ - \alpha P_n^ \\ & =\frac \\ & =\frac \\ & =\frac \left( \beta P_n^ - (\beta+n) P_^ \right) \, . \end


Generating function

The
generating function In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Generating functions are often expressed in closed form (rather than as a series), by some expression invo ...
of the Jacobi polynomials is given by : \sum_^\infty P_n^(z) t^n = 2^ R^ (1 - t + R)^ (1 + t + R)^, where : R = R(z, t) = \left(1 - 2zt + t^2\right)^~, and the
branch A branch, also called a ramus in botany, is a stem that grows off from another stem, or when structures like veins in leaves are divided into smaller veins. History and etymology In Old English, there are numerous words for branch, includ ...
of square root is chosen so that R(z, 0) = 1.


Asymptotics of Jacobi polynomials

For x in the interior of 1,1/math>, the asymptotics of P_n^ for large n is given by the Darboux formula :P_n^(\cos \theta) = n^k(\theta)\cos (N\theta + \gamma) + O \left (n^ \right ), where : \begin k(\theta) &= \pi^ \sin^ \tfrac \cos^ \tfrac,\\ N &= n + \tfrac (\alpha+\beta+1),\\ \gamma &= - \tfrac \left (\alpha + \tfrac \right ), \\ 0 < \theta &< \pi \end and the "O" term is uniform on the interval varepsilon,\pi-\varepsilon/math> for every \varepsilon>0. The asymptotics of the Jacobi polynomials near the points \pm 1 is given by the Mehler–Heine formula : \begin \lim_ n^P_n^\left(\cos \left ( \tfrac \right ) \right) &= \left(\tfrac\right)^ J_\alpha(z)\\ \lim_ n^P_n^\left(\cos \left (\pi - \tfrac \right) \right) &= \left(\tfrac\right)^ J_\beta(z) \end where the limits are uniform for z in a bounded
domain A domain is a geographic area controlled by a single person or organization. Domain may also refer to: Law and human geography * Demesne, in English common law and other Medieval European contexts, lands directly managed by their holder rather ...
. The asymptotics outside 1,1/math> is less explicit.


Applications


Wigner d-matrix

The expression () allows the expression of the
Wigner d-matrix The Wigner D-matrix is a unitary matrix in an irreducible representation of the groups SU(2) and SO(3). It was introduced in 1927 by Eugene Wigner, and plays a fundamental role in the quantum mechanical theory of angular momentum. The complex conju ...
d^j_(\phi) (for 0\leq \phi\leq 4\pi) in terms of Jacobi polynomials: d^j_(\phi) =(-1)^\left \frac\right \left(\sin\tfrac\right)^ \left(\cos\tfrac\right)^ P_^(\cos \phi), where M = \max(, m, ,, m', ), N = \min(, m, ,, m', ).


See also

*
Askey–Gasper inequality In mathematics, the Askey–Gasper inequality is an inequality for Jacobi polynomials proved by and used in the proof of the Bieberbach conjecture. Statement It states that if \beta\geq 0, \alpha+\beta\geq -2, and -1\leq x\leq 1 then :\sum_^n \fr ...
* Big q-Jacobi polynomials *
Continuous q-Jacobi polynomials In mathematics, the continuous ''q''-Jacobi polynomials ''P''(''x'', ''q''), introduced by , are a family of basic hypergeometric orthogonal polynomials in the basic Askey scheme. give a detailed list of their properties. Definition The polyn ...
* Little q-Jacobi polynomials *
Pseudo Jacobi polynomials In mathematics, the term Pseudo Jacobi polynomials was introduced by Lesky for one of three finite sequences of orthogonal polynomials y. Since they form an orthogonal subset of Routh polynomials it seems consistent to refer to them as Romanovsk ...
* Jacobi process * Gegenbauer polynomials *
Romanovski polynomials In mathematics, the Romanovski polynomials are one of three finite subsets of real orthogonal polynomials discovered by Vsevolod Romanovsky (Romanovski in French transcription) within the context of probability distribution functions in statistics ...


Notes


Further reading

* *


External links

*
{{Authority control Special hypergeometric functions Orthogonal polynomials