## You are here

HomeChebyshev equation

## Primary tabs

# Chebyshev equation

Chebyshev’s equation is the second order linear differential equation

$(1-x^{2})\frac{d^{2}y}{dx^{2}}-x\frac{dy}{dx}+p^{2}y=0$ |

There are two independent solutions which are given as series by:

$y_{1}(x)=1-\tfrac{p^{2}}{2!}x^{2}+\tfrac{(p-2)p^{2}(p+2)}{4!}x^{4}-\tfrac{(p-4% )(p-2)p^{2}(p+2)(p+4)}{6!}x^{6}+\cdots$ |

and

$y_{2}(x)=x-\tfrac{(p-1)(p+1)}{3!}x^{3}+\tfrac{(p-3)(p-1)(p+1)(p+3)}{5!}x^{5}-\cdots$ |

In each case, the coefficients are given by the recursion

$a_{{n+2}}=\frac{(n-p)(n+p)}{(n+1)(n+2)}a_{n}$ |

with $y_{1}$ arising from the choice $a_{0}=1$, $a_{1}=0$, and $y_{2}$ arising from the choice $a_{0}=0$, $a_{1}=1$.

The series converge for $|x|<1$; this is easy to see from the ratio test and the recursion formula above.

When $p$ is a non-negative integer, one of these series will terminate, giving a polynomial solution. If $p\geq 0$ is even, then the series for $y_{1}$ terminates at $x^{p}$. If $p$ is odd, then the series for $y_{2}$ terminates at $x^{p}$.

These polynomials are, up to multiplication by a constant, the Chebyshev polynomials. These are the only polynomial solutions of the Chebyshev equation.

(In fact, polynomial solutions are also obtained when $p$ is a negative integer, but these are not new solutions, since the Chebyshev equation is invariant under the substitution of $p$ by $-p$.)

## Mathematics Subject Classification

34A30*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz

Mar 26

new correction: Misspelled name by DavidSteinsaltz

Mar 21

new correction: underline-typo by Filipe

Mar 19

new correction: cocycle pro cocyle by pahio

Mar 7

new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier

new image: expected waiting time by robert_dodier

new image: plot W(t) = P(waiting time <= t) by robert_dodier