Special functions Orthogonal polynomials Theorem
Turán's inequalities
Builds on Legendre polynomials
Statement
Let be the Legendre polynomial of degree , and let . Then for every with ,
Remarks
At the left side is , since and ; so the strict inequality needs . Check for : for . The known proofs combine the three-term recurrence of the with their differential equation, and show that the left side cannot vanish inside . The left side is called the Turán determinant, since it is . Analogues hold for other families: for the Chebyshev polynomials, . This follows from with . For the Hermite polynomials one has for all real .
Going deeper
For a student
Turán found the inequality for Legendre polynomials, and Szegő published several proofs of it in 1948. Similar Turán-type inequalities hold for ultraspherical, Laguerre and Hermite polynomials, and for Bessel functions in the order variable. Such inequalities for the Taylor coefficients of entire functions are related to the Laguerre–Pólya class. This link is the reason they appear in work on the Riemann hypothesis through the Jensen polynomials of the Riemann function.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Legendre polynomials concept
- Turán's inequalities statement
Further reading
About this page
| Tag | 4K3D632K60 |
|---|---|
| URI | m2://4K3D632K60 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 33C45, 26D15 |
| Status | This copy of the site has no build data. Run m2 status 4K3D632K60. |
| About | Legendre polynomials |
| Uses | Legendre polynomials |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.