PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] orthogonality of Chebyshev polynomials from recursion (Proof)

In this entry, we shall demonstrate the orthogonality relation of the Chebyshev polynomials from their recursion relation. Recall that this relation reads as $$ T_{n+1} (x) - 2 x T_n (x) + T_{n-1} = 0 $$ with initial conditions $T_0 (x) = 1$ and $T_1 (x) = x$ . The relation we seek to demonstrate is $$ \int_{-1}^{+1} dx \, {T_m (x) T_n (x) \over \sqrt {1 - x^2}} = 0 $$ when $m \neq n$ .

We start with the observation that $T_n$ is an even function when $n$ is even and an odd function when $n$ is odd. That this is true for $T_0$ and $T_1$ follows immediately from their definitions. When $n > 1$ , we may induce this from the recursion. Suppose that $T_m (-x) = (-1)^m T_m (x)$ when $m < n$ . Then we have

$\displaystyle T_{n+1} (-x)$ $\displaystyle = 2 (-x) T_n (-x) - T_{n-1} (-x)$    
  $\displaystyle = - (-1)^{n} 2 x T_n (x) - (-1)^{n-1} T_{n-1} (x)$    
  $\displaystyle = (-1)^{n+1} (2 x T_n (x) - T_{n-1} (x))$    
  $\displaystyle = (-1)^{n+1} T_{n+1} (x) .$    

From this observation, we may immediately conclude half of orthogonality. Suppose that $m$ and $n$ are nonnegative integers whose difference is odd. Then $T_m (-x) T_n (-x) = - T_m (x) T_n (x)$ , so we have $$ \int_{-1}^{+1} dx \, {T_m (x) T_n (x) \over \sqrt {1 - x^2}} = 0 $$ because the integrand is an odd function of $x$ .

To cover the remaining cases, we shall proceed by induction. Assume that $T_k$ is orthogonal to $T_m$ whenever $m \le n$ and $k \le n$ and $m \neq k$ . By the conclusions of last paragraph, we know that $T_{n+1}$ is orthogonal to $T_n$ . Assume then that $m \le n-1$ . Using the recursion, we have

$\displaystyle \int_{-1}^{+1} dx \, {T_m (x) T_{n+1} (x) \over \sqrt {1 - x^2}}$ $\displaystyle = 2 \int_{-1}^{+1} dx \, {x T_m (x) T_{n} (x) \over \sqrt {1 - x^2}} - \int_{-1}^{+1} dx \, {T_m (x) T_{n-1} (x) \over \sqrt {1 - x^2}}$    
  $\displaystyle = \int_{-1}^{+1} dx \, {T_{m+1} (x) T_{n} (x) \over \sqrt {1 - x^... ...t {1 - x^2}} - \int_{-1}^{+1} dx \, {T_m (x) T_{n-1} (x) \over \sqrt {1 - x^2}}$    

By our assumption, each of the three integrals is zero, hence $T_{n+1}$ is orthogonal to $T_m$ , so we conclude that $T_k$ is orthogonal to $T_m$ when $m \le n+1$ and $k \le n+1$ and $m \neq k$ .




"orthogonality of Chebyshev polynomials from recursion" is owned by rspuzio.
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: integrals, conclusions, orthogonal, induction, cover, integrand, difference, integers, orthogonality, induce, definitions, odd, odd function, even, even function, initial conditions, relation, Chebyshev polynomials, orthogonality relation

This is version 3 of orthogonality of Chebyshev polynomials from recursion, born on 2009-05-05, modified 2009-05-06.
Object id is 11762, canonical name is OrthogonalityOfChebyshevPolynomialsFormRecursion.
Accessed 521 times total.

Classification:
AMS MSC42C05 (Fourier analysis :: Nontrigonometric Fourier analysis :: Orthogonal functions and polynomials, general theory)
 33D45 (Special functions :: Basic hypergeometric functions :: Basic orthogonal polynomials and functions )
 33C45 (Special functions :: Hypergeometric functions :: Orthogonal polynomials and functions of hypergeometric type )

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)