Chebyshev polynomials of the first kind
The Chebyshev polynomials of the first kind are defined recursively by or equivalently by
Contents
Proof of equivalence of the two definitions
In the proof below, will refer to the recursive definition.
For the base case, for the base case,
Now for the inductive step, let , so that . We then assume that and , and we wish to prove that .
From the cosine sum and difference identities we have and The sum of these equations is rearranging, Substituting our assumptions yields as desired.
Composition identity
For nonnegative integers and , the identity holds.
First proof
By the trigonometric definition, .
As before, let . We have for some integer . Multiplying by and distributing gives ; taking the cosine gives .
For now this proof only applies where the trigonometric definition is defined; that is, for . However, is a degree- polynomial, and so is , so the fact that for some distinct is sufficient to guarantee that the two polynomials are equal over all real numbers.