Beruflich Dokumente
Kultur Dokumente
Indre Skripkauskaite
F10GP Project
supervised by
Dr. M. Dreher
March 31, 2016
CONTENTS
Contents
1 Introduction
2.1
Hermitian Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.2
3 Legendre Polynomials
10
3.1
Generating Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
10
3.2
Recurrence Relation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
14
3.3
15
3.4
Orthogonality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
17
4 Chebyshevs Polynomials
20
4.1
Generating Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
21
4.2
22
4.3
Recurrence Relation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
26
4.4
Orthogonality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
27
5 Conclusion
29
Introduction
In mathematics, a set of polynomials is said to be orthogonal under some inner product if any
two of the polynomials from the given set are orthogonal, i.e. their scalar product equals zero.
There are quite a few families of Orthogonal polynomials, but in this project we will be focusing
only on Legendre and Chebyshevs polynomials.
Legendre polynomials are widely used in physics and Chebyshevs polynomials are applicable
in finance. However, by the use of our knowledge of various topics from Complex Analysis,
Functional Analysis, Linear Algebra as well as Calculus, we will be focusing only on the mathematical, i.e. the theoretical part and understanding the behavior of such families of polynomials
in respective L2 Hilbert spaces, which is the aim of this project.
In this section we will be discussing properties of Hilbert spaces and Self-Adjoint Operators,
where the understanding of Hermitian which we will be recalling constantly in later chapters.
We will also mention the famous Fourier Series, which plays an important role in orthogonality
of functions.
2.1
Hermitian Matrices
n
X
uk vk .
(2.1)
k=1
n
X
(Au)k vk
k=1
n
X
n
X
akj uj vk
j=1
k=1
n
X
j=1
n
X
j=1
uj
n
X
k=1
AH v j
!
akj vk
2.1
Hermitian Matrices
Therefore if A = AH , then
(2.2)
hence
kuk2 = kuk2 .
then hu, vi = 0.
2.2
Definition 2.2.1. Let a, b R and let f (x),g(x) be two functions in L2 [a, b]. Then the scalar
product in L2 [a, b] [2] is defined as
Z
hf, gi =
f (x)g(x)dx.
(2.3)
d2
dx2
2.2
hAgn , gm i =
0
gn0 (x)gm
(x)dx
00
0
gn (x)gm (x)dx gn (x)gm (x)
= hgn , Agm i ,
hAgn , gm i = hgn , Agm i
(2.4)
for n, m N.
Remark: If compare this result to the Proposition 2.1.3 in the previous section, we can see
that in this example A acts as a differential operator rather than being a Hermitian matrix and
gn , gm are being treated as eigenfunctions rather than being eigenvectors of A.
Continuing from 2.4 we have that
n gn , gm = gn , m2 gm ,
n2 hgn , gm i = m2 hgn , gm i ,
(n2 m2 ) hgn , gm i = 0,
hgn , gm i = 0
(2.5)
for n 6= m.
Definition 2.2.3. The set of functions {f1 (x), f2 (x), . . .} is orthogonal in L2 [a, b] [2] if:
hfn (x), fm (x)i = 0
(2.6)
for n 6= m.
Proposition 2.2.4. The set {sin(nx), cos(mx)}, n N+ , m N0 } is an orthogonal set of
functions [2] in the Hilbert space L2 [, ].
PROOF:
By use of (2.3) we can see that
sin(nx)
cos(nx)dx =
h1, cos(nx)i =
= 0,
n
Z
cos(nx)
sin(nx)dx =
h1, sin(nx)i =
= 0.
n
Z
(2.7)
By (2.5)
hsin(nx), sin(mx)i = 0
(2.8)
hcos(nx), cos(mx)i = 0
f or n 6= m.
hcos(nx), sin(mx)i =
cos(nx) sin(mx)dx = 0
Theorem 2.2.5. Let n N and let f(t) be 2L-periodic function in Hilbert space L2 [L, L].
Then the Fourier Series expansion [4] of f(t) is represented as
f (t) = a0 +
an cos
n=1
nt
L
+
bn sin
n=1
nt
L
,
(2.9)
where
L
nt
f (t) cos
dt,
L
L
Z
1 L
nt
bn =
dt
f (t) sin
L L
L
Z L
1
a0 =
f (t)dt.
2L L
1
an =
L
Remark: We can make a comparison of the above to the Theorem 2.1.5, i.e. we can say that
nt
cos nt
are the eigen functions to the eigen values an , bn , a0 in the Hilbert space
L , sin L
L2 [L, L]. Although, we do not claim that we can span full L2 [L, L] space, since it requires
deeper analysis, so we will not be focusing on that in this project.
2.2
1
f (t) =
for
< t < 0
for
0 < t < .
(2.10)
Our function f(t) is 2 periodic and it can be approximated by the use of (2.9) as
f (t) =
4c
4c
4c
4c
sin(t) +
sin(3t) +
sin(5t) + +
sin((2n + 1)t) + . . .
3
5
(2n + 1)
(2.11)
n N.
We can now compare the original function with the approximated result where the blue line
indicates the Heaviside step function f(t) and the red line indicated the Fourier approximation
with n = 6.
Figure 1: Fourier series approximation of the Heaviside step function (2.10) with n = 6
10
3
3.1
LEGENDRE POLYNOMIALS
Legendre Polynomials
Generating Function
Legendre Polynomials were introduced by Legendre in the theory of potential, where they are
related to the expansion of the reciprocal of the distance
1
R,
points r and r0 .
Figure 2:
1
r0
r ,x
1
1
1
= (1 2xt + t2 ) 2
R
r
(3.1)
for 1 6 x 6 1. If we rewrite
1
(1 2xt + t2 ) 2
as
(t x
p
p
1
1
x2 1) 2 (t x + x2 1) 2
(3.2)
p
x2 1,
expansion:
(1 2xt + t2 ) 2 =
Pn (x)tn .
n=0
t C, is is called the generating function [3] for some function Pn (x) which will be discussed
now.
3.1
Generating Function
11
Definition 3.1.1. The Legendre polynomials are defined by Rodrigues formula [5]
Pn (x) =
1 dn 2
(x 1)n ,
2n n! dxn
n N,
(3.3)
Later we will see that these Pn s are the same as in section (3.3).
To obtain the general expression for the nth Legendre polynomial we will use the binomial
expression
(x2 1)n =
n
X
(1k n!) 2n2k
x
.
k!(n k)!
(3.4)
k=0
Pn (x) =
X
k=0
By the use of (3.5) we can see that the first eleven Legendre polynomials [8] are:
P0 (x) = 1,
P1 (x) = x,
1
P2 (x) = (3x2 1),
2
1
P3 (x) = (5x3 3x),
2
1
P4 (x) = (35x4 30x2 + 3),
8
1
P5 (x) = (63x5 70x3 5),
8
1
P6 (x) = (231x6 315x4 + 105x2 5),
16
1
P7 (x) = (429x7 693x5 + 315x3 35x),
16
1
P8 (x) =
(6435x8 12012x6 + 6930x4 1260x2 + 35),
128
1
P9 (x) =
(12155x9 25740x7 + 18018x5 4620x3 + 315x),
128
1
P10 (x) =
(46189x10 109395x8 + 90090x6 30030x4 + 3465x2 63).
256
(3.5)
12
LEGENDRE POLYNOMIALS
n!
2i
Z
C
Z
C
f ()
d = f (z).
z
f ()
dn
d
=
f (z)
( z)n+1
dz n
(3.6)
g(x, t) = (1 2xt + t2 ) 2
(3.7)
X
n=0
(3.8)
3.1
Generating Function
13
Replace Pn (x) by the Rodrigues formulas and use the Cauchy integral theorem (3.6) we obtain
Z
(1 z 2 )n
(1)n dn
(1)n 1
2 n
Pn (x) = n
(1
x
)
=
dz,
(3.9)
2 n! dxn
2n 2i C (z x)n+1
where C is any curve enclosing x, going in a counter-clockwise direction. Now inserting (3.9)
into (3.8) we get
X
n=0
X
(1 z 2 )n
(1)n 1 n
dz.
t
Pn (x)t =
n+1
2n 2i
C (z x)
n
(3.10)
n=0
X
n=0
1
Pn (x)t =
2i
n
Z
C
dz X (1)n n
t
zx
2n
n=0
(1 z 2 )
zx
n
.
(3.11)
The resulting series is a simple geometric series, which is readily summed. We then obtain the
following integral:
1
2i
Z
C
2
dz
.
t z 2 2t z 1 2t x
(3.12)
Now we evaluate this integral by using the familiar residue integration technique. We can clearly
see that the denominator of (3.12) has two roots:
r
1
2
1 1p
1
x
+
1
=
+
1 2xt + t2
z1 = +
t
t2
t
t
t
and
1
z2 =
t
1
2
1 1p
x
+
1
=
1 2xt + t2 .
t2
t
t
t
We can rewrite z2 as
z2 =
1
t2
1
t
1
x
t2
1
t2
+1
2t x + 1
=
1
t
qt
x1
1
t2
(3.13)
2t x + 1
.
Now if we multiply both numerator and denominator of (3.13) by t we obtain the following:
z2 =
2x t
x
1 + 1 2xt + t2
(3.14)
14
LEGENDRE POLYNOMIALS
for t 0.
We now choose C to be a path surrounding the point x and z2 and by applying Residue Theorem
we see that
2
lim
t zz2
2t x + 1
1
.
=
2
2
2
z tz 1 tx
1 2xt + t2
1
t
1
t2
Consequently,
Pn (x)tn =
n=0
1
.
1 2xt + t2
(3.15)
3.2
Recurrence Relation
(3.16)
for n N+ .
PROOF:
We are going to show it by first differentiating the generating function (3.7) with respect to t:
X
3
1
xt
g
= (1 + t2 2xt) 2 (2t 2x) =
Pn (x)tn1
3 =
2
t
2
(1 + t 2xt) 2
n=0
n=0
(1 + t2 2xt)
nPn (x)tn1 = (x t)
n=0
(1 + t2 2xt)
X
n=0
nPn (x)tn1 (x t)
X
n=0
X
n=0
Pn (x)tn = 0.
n=0
Pn (x)tn ,
Pn (x)tn ,
(3.17)
3.3
15
or equivalently
(n + 1)Pn+1 (x) (2n + 1)xPn (x) + nPn1 (x) = 0,
n N.
Legendre polynomials can be calculated step by step, starting from P0 (x) = 1, P1 (x) = x.
3.3
n N0 .
(3.18)
PROOF:
By the use of the generating function (3.15)
1
2t
t
X 0
:
Pn (x)tn =
3 =
3
x
2 (1 2xt + t2 ) 2
(1 2xt + t2 ) 2
n=0
X
1
2x + 2t
xt
:
nPn (x)tn1 =
(3.19)
3 =
3
t
2 (1 2xt + t2 ) 2
(1 2xt + t2 ) 2
n=0
1
3
2x + 2t
2 X
n2
:
n(n 1)Pn (x)t
=
3 + (x t)
2
t
2 (1 2xt + t2 ) 52
(1 2xt + t2 ) 2
n=0
1
(1 2xt + t2 )
3
2
3(x t)2
5
(1 2xt + t2 ) 2
(3.20)
X
t(1 x2 )
:
(1 x2 )Pn0 (x)tn =
3
x
1 2xt + t2 ) 2
n=0
0
0 X
2xt
3
2t
2
:
(1 x2 )Pn0 tn =
+
t(1
x
)
(1 x2 )
3
5
2
x
2
(1 2xt + t ) 2
(1 2xt + t2 ) 2
n=0
(1 x2 )
2xt
3
(1 2xt + t2 ) 2
3t2 (1 x2 )
5
(1 2xt + t2 ) 2
(3.21)
X
n=0
nPn (x)tn =
t(x t)
3
(1 2xt + t2 ) 2
(3.22)
16
LEGENDRE POLYNOMIALS
n=0
t2
(1 2xt + t2 )
3
2
3t2 (x t)2
(3.23)
(1 2xt + t2 ) 2
2nPn (x)t +
n=0
n=0
n=0
n=0
2t(x t)
(1 2xt + t2 )
3
2
2xt 3t2
(1 2xt + t2 ) 2
2xt 3t2
(1 2xt + t2 ) 2
t2
(1 2xt + t2 )
3
2
3t2 (x t)2
5
(1 2xt + t2 ) 2
3t2 (x t)2
5
(1 2xt + t2 ) 2
3t2 (x t)2
(3.24)
(1 2xt + t2 ) 2
X
0
(1 x2 )Pn0 (x) tn +
n(n + 1)Pn (x)tn =
n=0
n=0
X
n=0
2xt
3
(1 2xt + t2 ) 2
2xt 3t2
(1 2xt + t2 )
3
2
3t2 (1 x2 )
5
(1 2xt + t2 ) 2
3t2 (x t)2
5
(1 2xt + t2 ) 2
2xt + 2xt 3t2 3t2 ((1 x2 ) + (x t)2 )
+
(1 x2 )Pn0 (x)0 tn + n(n + 1)Pn (x)tn =
3
5
(1 2xt + t2 ) 2
(1 2xt + t2 ) 2
=
=
3t2
(1 2xt + t) 2
3t2 + 3t2
3
(1 2xt + t2 ) 2
3t2 (1 2xt + t2 )
5
(1 2xt + t2 ) 2
= 0.
Hence
0
(1 x2 )Pn0 (x) tn + n(n + 1)Pn (x)tn = 0.
n=0
n N,
(3.25)
Remark: Let us compare the above result to Theorem 2.1.5, which states the following:
Au = u
(3.26)
3.4
Orthogonality
17
for all u Cn .
We shal prove the following proposition first:
Proposition 3.3.2. A =
d
dx
d
(1 x2 ) dx
is a self-adjoint operator in Hilbert space L2 [1, 1],
i.e. hAu, vi = hu, Avi, for all twice differentiable functions u(x), v(x), x R.
PROOF: Using differentiation by parts we see that
Z 1
dx
(Au) v
hAu, vi =
1 x2
1
Z 1 p
d p
d
1
2
2
=
1x
( 1x
u(x)) v(x)
dx
dx
dx
1 x2
1
Z 1 p
0
1 x2 u0 vdx
=
1
p
1
Z
=0
x2 u0 v
Z
1
1
p
1 x2 u0 v 0 dx
0
p
1 x2 v 0 dx
u0
Z
p
1
= u 1 x2 v 0 +
1
0
p
1 x2 v 0 dx
1
=0+
u (Av)
dx
1 x2
1
= hu, Avi ,
(3.27)
Consequently,
((1 x2 )Pn0 (x))0 = n(n + 1)Pn (x)
(3.28)
3.4
Orthogonality
Proposition 3.4.1. Legendre polynomials are orthogonal in the Hilbert space L2 [(1, 1), dt].
18
LEGENDRE POLYNOMIALS
PROOF:
R1
We wish to show
1 Pn (x)Pm (x)dx
0
Pm (x) (1 x2 )Pn0 (x) dx
Pn (x)Pm (x) =
n(n + 1)
= Pm (x) (1 x
Z
)Pn0 (x)
1
+
1
0
Pm
(x) (1 x2 )Pn0 (x) dx
0
0
Pm
(x)(1 x2 ) Pn (x)dx
=
1
Pm (x)Pn (x)dx
= m(m + 1)
1
Pm (x)Pn (x)dx = 0
(3.29)
whenever n 6= m.
Proposition 3.4.2. If n = m, then the scalar product or two Legendre polynomials satisfy
PROOF:
Pn2 (x)dx =
2
.
2n + 1
We substitute (3.15) into L2 ([1, 1]) scalar product by the use of (2.3):
*
Pn (x)t
n=0
X
+
Pm (x)t
1
1
,
2
1 2xt + t
1 2xt + t2
m=0
n=0 m=0
n+m
=
1
1
dx.
1 2xt + t2
By use of (3.34) we drop the terms where n 6= m and consider only the cases where n = m
3.4
Orthogonality
19
2n
n=0
=
1
t2n
n=0
Pn2 (x)dx =
1
dx
1 2xt + t2
1
dx
1 2xt + t2
1
1
2
= ln(1 2xt + t )
2t
1
1
2
ln(1 2t + t ) ln(1 + 2t + t2 ) .
=
2t
X
n=0
2n
Pn2 (x)dx =
1
ln(1 t)2 ln(1 + t)2
2t
1
= (ln(1 t) ln(1 + t)) .
t
2n
n=0
1 1t
Pn2 (x)dx = ln
t 1+t
1
1
1 t 1
= ln
t
1+t
1 1+t
= ln
.
t 1t
ln
X 2t2n+1
1+t
2t3 2t5 2t7
2t2n+1
=2+
+
+
+ +
+ =
1t
3
5
7
2n + 1
2n + 1
(3.30)
n=1
and so
X 2t2n
2t2 2t4 2t6
2t2n
1 1+t
ln
=2+
+
+
+ +
+ =
.
t 1t
3
5
7
2n + 1
2n + 1
n=1
Finally
Z 1
X
X
2t2n
2n
=
t
Pn2 (x)dx,
2n + 1
1
n=0
n=0
(3.31)
20
CHEBYSHEVS POLYNOMIALS
hence
Z
Pn2 (x)dx =
2
2n + 1
Remark:
We have shown that Legendre polynomials are orthogonal, hence, linearly independent. We can
refer back to Theorem 2.1.6. and make a comparison. We can say that in the Hilbert space
L2 [(1, 1), dt], Legendre polynomials act as eigen functions. However, we do not claim that Pn0 s
span full L2 [(1, 1), dt] space, because proving it would require much deeper understanding so
we will not be focusing on that in this project.
Chebyshevs Polynomials
n N+ , 1 x 1.
(4.1)
4.1
Generating Function
21
4.1
Generating Function
Proposition 4.1.1. Let x = cos() and Tn (x) = cos(n). Then the generating function [5] for
Chebyshevs polynomials is
X
1 xt
=
Tn (x)tn
2
1 2xt + t
n=0
for t C, |t| 1, n N0 .
PROOF:
Let |t| < 1, then
X
n=0
Tn (x)t =
cos(n)tn .
(4.2)
n=0
(4.3)
(4.4)
(4.5)
22
CHEBYSHEVS POLYNOMIALS
Tn (x)tn =
n=0
i
1 X h i n
(te ) + (tei )n
2
1
=
2
Note that
n=0 (te
i )n
1
1tei
X
n=0
and
n=0
1
Tn (x)t =
2
(te ) +
n=0
n=0 (te
i n
!
(te
i n
n=0
i )n
1
,
1tei
so
1
1
+
i
1 te
1 tei
1 1 tei + 1 tei
=
2 (1 tei )(1 tei )
1 2 2t(ei + ei )
=
2 1 (ei + ei ) + t2
1 t cos()
=
.
1 2t cos() + t2
Tn (x)tn =
n=0
1 xt
.
1 2xt + t2
(4.6)
4.2
PROOF:
1 x 1
(4.7)
4.2
23
X 0
2t(1 tx)
t
:
Tn (x)tn =
2
2
x
(1 2xt + t )
1 2xt + t2
n=0
t(1 t2 )
(1 2xt + t2 )2
(4.8)
2 X 00
4t2 (1 t2 )
n
:
T
(x)t
=
n
x2
(1 2xt + t2 )3
(4.9)
n=0
X
(2t 2x)(1 xt)
x
:
nTn (x)tn1 =
2
t
1 2xt + t
(t2 2xt + 1)2
n=0
xt2 2t + x
(1 2xt + t2 )2
(4.10)
2 X
2(2t 2x)(xt2 2t + x)
2xt 2
n2
:
n(n
1)T
(x)t
=
n
t2
(t2 2xt + 1)2
(1 2xt + t2 )3
n=0
(1 x2 )Tn00 (x)tn =
n=0
xTn0 (x)tn =
n=0
(4.11)
4t2 (1 x2 )(1 t2 )
(1 2xt + t2 )3
(4.12)
xt(1 t2 )
.
(1 2xt + t2 )2
(4.13)
nTn (x)tn =
n=0
t(xt2 2t + x)
,
(1 2xt + t2 )2
(4.14)
n=0
(4.15)
X
n=0
n2 Tn (x)tn =
(1 2xt + t2 )2
(1 2xt + t2 )3
(4.16)
24
CHEBYSHEVS POLYNOMIALS
Adding (4.12), subtracting (4.14) and then adding (4.16) we see that
X
n=0
4t2 (1 x2 )(1 t2 )
(1 x2 )Tn00 (x) xTn0 (x) + n2 Tn (x) tn =
(1 2xt + t2 )3
(4.17)
xt(1 t2 )
t(xt2 2t + x)
+
(1 2xt + t2 )2 (1 2xt + t2 )2
2t2 (xt3 3t2 + 3xt 2x2 + 1)
(1 2xt + t2 )3
X
n=0
4t2 (1 t2 x2 + x2 t2 )
(1 x2 )Tn00 (x) xTn0 (x) + n2 Tn (x) tn =
(1 2xt + t2 )3
xt(1 t2 )(1 2xt + t2 )
(1 t2 + x2 t2 )3
2
t(xt 2t + x)(1 2xt + t2 )
+
(1 2xt + t2 )3
2t2 (xt3 3t2 + 3xt + 2x2 + 1)
(1 2xt + t2 )3
(4.18)
= (4t2 4t4 4t2 x2 + 4x2t4 xt + 2x2 t2 xt3 xt3 2x2 t4 + xt5 + xt3 3x2 t4 + xt5 2t2 + 4xt3
2t4 + tx 2x2 t2 + t3 x 2xt5 t4 6xt3 + 4x2 t2 2t2 )/(1 2xt + 2x2 + 1)3
0/(1 2xt + 2x2 + 1) = 0
Hence
(1 x2 )Tn00 (x) xTn0 (x) + n2 Tn (x) tn = 0
n=0
x2
d
dx
p
d
2
1x
.
dx
Then
hAu, vi = hu, Avi ,
dx
in L2 [1, 1], 1x
2
i.e. A is self-adjoint.
4.2
25
PROOF:
dx
(Au(x)) v(x)
1 x2
1
Z 1 p
d p
d
dx
2
2
1x
( 1x
u(x) v(x)
=
dx
dx
1 x2
1
Z 1 p
0
=
1 x2 u0 (x) v(x)dx
hAu, vi =
Z 1p
1
p
0
2
1 x u (x)v(x)
1 x2 u0 (x)v 0 (x)dx
=
1
1
Z 1
p
0
=0
u0 (x)
1 x2 v 0 (x) dx
1
1
Z
=0+
u(x) (Av(x))
dx
1 x2
= hu, Avi
i.e. A is self-adjoint.
Remark:
If we divide (4.7) by
p
x
n2
1 x2 Tn00 (x)
Tn0 (x) +
Tn (x) = 0
1 x2
1 x2
(4.19)
(4.20)
PROOF:
If we multiply (4.20) by
(x) = n2 , we obtain
T (x)
n
1x2
and
26
CHEBYSHEVS POLYNOMIALS
Au = u,
p
d
d
n2
2
1x
Tn (x)
Tn (x) =
dx
dx
1 x2
p
0
n2
Tn (x),
1 x2 Tn0 (x) =
1 x2
(4.21)
Remark: We compare the above to Theorem 2.1.5 and see that the same idea repeats
once again, but instead of having an eigenvector u, we have an eigenfunction u(x) and an
eigenvalue = n2 R.
4.3
Recurrence Relation
Proposition 4.3.1. Chebyshevs Polynomials satisfy the following recurrence relation [7]:
Tn+1 (x) = 2xTn (x) Tn1 (x)
PROOF:
Lets introduce the notation = arccos(x).
Then (4.1) becomes Tn ((x)) = Tn () = cos(n), where 0 6 6 2.
We observe that replacing n by n + 1
(4.22)
(4.23)
4.4
Orthogonality
27
or equivalently
Tn+1 (x) = 2xTn (x) Tn1 (x),
(4.24)
4.4
Orthogonality
1
Proposition 4.4.1. Chebyshevs Polynomials are orthogonal in L2 [1, 1], 1x
.
2
PROOF:
We shall prove this by using (4.20) for
o
d np
n2
1 x2 Tn0 +
Tn = 0
dx
1 x2
o
d np
m2
0
+
1 x2 Tm
Tm = 0
dx
1 x2
(4.25)
(4.26)
Multiplying (4.25) by Tm and (4.26) by Tn and then subtracting the results we obtain
o
o
d np
d np
1 x2 Tn0 Tm
1 x2 Tm Tn +
dx
dx
n
o
p
d
0
1 x2 (Tn0 Tm Tm
Tn )
dx
n2 m2
Tm Tn = 0
1 x2
n2 m2
Tm Tn = 0
1 x2
(4.27)
Now if we integrate (4.27) over the interval [1, 1] with respect to x we get
Z
Tm Tn
1 x2
0
0
dx = 2
T
T
T
T
m
n
m
n m2 n
1 x2
1
Z 1
Tm Tn
dx = 0
1 x2
1
for n 6= m.
(4.28)
28
CHEBYSHEVS POLYNOMIALS
Let
= arccos(x)
d =
dx
.
1 x2
(4.29)
(4.30)
where [0, ], n, m N.
Now if we take a scalar product in L2 [0, ] of (4.29) and (4.30) we obtain the following:
Z
cos(n) cos(m)d
(4.31)
hTn (x), Tm (x)i =
0
Z
cos(n + m) cos(n m)
=
d
(4.32)
2
0
(cos((2n) cos(0)) d =
=
2 0
2
2n
2
0
and if n = m = 0 we have
Z
1 sin()
1
(cos((2n) cos(0)) d =
2x =
2 0
2
2n
0
for
0,
Z 1
Tn (x)Tm (x)
=
for
2,
1 x2
1
,
for
(4.33)
(4.34)
m 6= n,
m = n 6= 0,
m=n=0
Remark:
We can refer back to Theorem 2.1.6 once again and and to summarize the above we can say that
Tn s are eigen functions, since they are orthogonal, i.e. linearly independent. However, similarly
dx
, since
as for Legendre polynomials, we do not claim that they span entire L2 [1, 1], 1x
2
showing it would require much further analysis and we shall not be focusing on that in this
project.
29
Conclusion
We can see that we have been following the same pattern through out the paper. Either we are
examining Hermite matrices, Legendre polynomials or Chebyshevs polynomials, in each case we
have some scalar product and orthogonality in some Hilbert space. We have also noticed a strong
connection between Hermite matrices and Orthogonal polynomials in general, where Hermmite
matrices are self-adjoint and Orthogonal polynomials can be also expressed in their self adjoint
form. It is also important to stress that the Spectral Theorem plays an important role in the
analysis of Orthogonal polynomials.
30
REFERENCES
References
[1] Wikipedia, Spectral Theorem, (https://en.wikipedia.org/wiki/Spectraltheorem), (Accessed
on 30/03/2016).
[2] M. Youngson, Functional Analysis Lecture Notes, Heriot Watt University, Edinburgh, 2015.
[3] Z. X. Wang, D. R. Guo. Special Functions, chapter 4. Hypergeometric Function, page 176.
Singapore.
[4] H. D. Sterck, Week 4 - Discrete Fourier Methods, Introduction to Computational Mathematics Course Notes, University of Waterloo, Waterloo, 2015.
[5] Holt, Rinehart and Winston, Special Functions of Mathematical Physics, New York, 1961.
[6] G. Szego, American Mathematical Society. Orthogonal Polynomials. Colloquium Publication.
Volume XXIII. Chapter II. Definition of Orthogonal Polynomials; Principal Examples, pages
23-29. Providence, Rhode Island, 1939.
[7] R. A. Silverman (ed.). Special Functions and Their Applications, chapter 4, Orthogonal
Polynomials, pages 43-50. PRENTICE-HALL, INC. Englewood Cliffs, N.J., 1965.
[8] Wikipedia, Legendre Polynomials (https://en.wikipedia.org/wiki/Legendrepolynomials),
(Accessed on 17/03/2016)
[9] Wikipecia, Chebyshev Polynomials, (https://en.wikipedia.org/wiki/Chebyshevpolynomials),
(Accessed on 21/03/2016).
[10] M. Dreher, Mathematics for Physics III, (https://sites.google.com/site/michaeldreher7/home/
lecture-notes), (Accessed on 15/03/2016).