Chapter 8

Some Special Functions

Note: This module is prepared from Chapter 8 of the text book (G.F. Simmons, Differential
Equations with Applications and Historical Notes, TMH, 2nd ed., 1991) just to help the students.
The study material is expected to be useful but not exhaustive. For detailed study, the students
are advised to attend the lecture/tutorial classes regularly, and consult the text book.

Dr. Suresh Kumar, Associate Professor,

Department of Mathematics, BITS Pilani, Pilani Campus, Rajasthan-333031, INDIA.
E-mail: suresh.kumar@pilani.bits-pilani.ac.in, sukuyd@gmail.com

Appeal: Please do not print this e-module unless it is really necessary.

1
Contents

8 Some Special Functions 1

8.1 Legendre Polynomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
8.1.1 Rodrigue’s Formula . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
8.1.2 Orthogonality of Legendre Polynomials . . . . . . . . . . . . . . . . . . . . . 4
8.1.3 Legendre Series . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
8.2 Gamma Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
8.3 Bessel Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
8.3.1 Second solution of Bessel’s DE . . . . . . . . . . . . . . . . . . . . . . . . . . 10
8.3.2 Properties of Bessel Functions . . . . . . . . . . . . . . . . . . . . . . . . . . 11
8.3.3 Orthogonal properties of Bessel functions . . . . . . . . . . . . . . . . . . . . 11
8.3.4 Fourier-Bessel Series . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13

2
8.1 Legendre Polynomials
A DE of the form

(1 − x2 )y 00 − 2xy 0 + n(n + 1)y = 0, (8.1)

where n is a constant, is called Legendre’s Equation. We observe that x = 0 is an ordinary point of

(8.1). However, the solutions most useful in the applications are those bounded near x = 1. Notice
that x = 1 is a regular singular point of the Legendre equation (8.1). We use the transformation
t = (1 − x)/2 so that x = 1 corresponds to t = 0, and (8.1) transforms to the hypergeometric DE

t(1 − t)y 00 + (1 − 2t)y 0 + n(n + 1)y = 0, (8.2)

where the prime denote derivative with respect to t. Here, a = −n, b = n + 1 and c = 1. So the
solution of (8.2) in the neighbourhood of t = 0 is given by

y1 = F (−n, n + 1, 1, t). (8.3)

The other LI solution can be found as

Z
1 − R P dt
y2 = y1 e dt = y1 (ln t + a1 t + ........). (8.4)
y12

However, this solution is not bounded near t = 0. So any solution of (8.2) bounded near t = 0 is
a constant multiple of y1 . Consequently, the constant multiples of F (−n, n + 1, 1, (1 − x)/2) are
the solutions of (8.1), which are bounded near x = 1.
If n is a non-negative integer, then F (−n, n + 1, 1, (1 − x)/2) defines a polynomial of degree n
known as Legendre polynomial, denoted by Pn (x). Therefore,

n(n + 1) n(n − 1)(n + 1)(n + 2) (2n)!

Pn (x) = F (−n, n+1, 1, (1−x)/2) = 1+ 2
(x−1)+ 2 2
(x−1)2 +....+ 2 n
(x−1)n .
(1!) 2 (2!) 2 (n!) 2

Notice that Pn (1) = 1 for all n. Next, after a sequence of algebraic manipulations, we can obtain
1 dn
Pn (x) = n n
[(x2 − 1)n ],
2 n! dx
known as Rodrigue’s formula. The following theorem provides the alternative approach to obtain
the Rodrigue’s formula.

8.1.1 Rodrigue’s Formula

1 dn
Prove that Pn (x) = [(x2 − 1)n ].
2n n! dxn
Proof. Let v = (x2 − 1)n . Then we have
dv
v1 = 2nx(x2 − 1)n−1 where v1 = .
dx
=⇒ (x2 − 1)v1 = 2nx(x2 − 1)n .

3
 =⇒ (1 − x2 )v1 + 2nxv = 0.
Differentiating it n + 1 times with respect to x using the Leibnitz theorem, we get

(n + 1)n
(1 − x2 )vn+2 + (n + 1)(−2x)vn+1 + (−2)vn + 2n[xvn+1 + (n + 1)vn ] = 0.
2!
=⇒ (1 − x2 )vn00 − 2xvn0 + n(n + 1)vn = 0.
This shows that cvn (c is an arbitrary constant) is a solution of the Legendre’s equation (8.1). Also
cvn is a polynomial of degree n. But we know that the nth degree polynomial Pn (x) is a solution
of the Legendre’s equation. It follows that
dn
Pn (x) = cvn = c [(x2 − 1)n ]. (8.5)
dxn
To find c, we put x = 1 into (8.5) to get
 n 
d 2 n
Pn (1) = c [(x − 1) ] .
dxn x=1
 n 
d n n
=⇒ 1=c n
[(x − 1) (x + 1) ] = c[n!(x+1)n +Terms containing the factor (x−1)]x=1 .
dx x=1
1
=⇒ 1 = c.n!2n or c = .
n!2n
Thus, (8.5) becomes

1 dn
Pn (x) = n n
[(x2 − 1)n ].
2 n! dx
This completes the proof.
Remark: Using Rodrigue’s formula, we get
P0 (x) = 1, P1 (x) = x, P2 (x) = 12 (3x2 − 1), P3 (x) = 12 (5x3 − 3x) , P4 (x) = 35 4
8
x − 15 2
4
x + 3
8
etc.

Ex. Express the polynomial x4 + 3x3 − x2 + 5x − 2 in terms of Legendre’s polynomials.

Sol. Since P4 (x) = 35 8
x4 − 154
x2 + 38 , so x4 = 35
8
P4 (x) + 76 x2 − 35
3
. Similarly, x3 = 25 P3 (x) + 35 x,
x2 = 32 P2 (x) + 13 , x = P1 (x), 1 = P0 (x). Using all these, we get

8 6 2 34 224
x4 + 3x3 − x2 + 5x − 2 = P4 (x) + P3 (x) − P2 (x) + P1 (x) − P0 (x).
35 5 21 5 105

8.1.2 Orthogonality of Legendre Polynomials

Z 1
Prove that (i) Pm (x)Pn (x)dx = 0 for m 6= n, and
Z 1 −1
2
(ii) Pn2 (x)dx = .
−1 2n + 1

4
Proof. We know that y = Pm (x) is a solution of
(1 − x2 )y 00 − 2xy 0 + m(m + 1)y = 0, (8.6)
and z = Pn (x) is a solution of
(1 − x2 )z 00 − 2xz 0 + n(n + 1)z = 0. (8.7)
Multiplying (8.6) by z and (8.7) by y, and subtracting, we get

(1 − x2 )(y 00 z − yz 00 ) − 2x(y 0 z − yz 0 ) + [m(m + 1) − n(n + 1)]yz = 0.

d
=⇒ [(1 − x2 )(y 0 z − yz 0 )] + (m − n)(m + n + 1)yz = 0. (8.8)
dx
Integrating (8.8) from −1 to 1, we have
Z 1
(m − n)(m + n + 1) yzdx = 0
−1

Also, m 6= n. So it gives
Z 1
Pm (x)Pn (x)dx = 0.
−1

This is known as the orthogonality property of Legendre polynomials.

(ii) The Rodrigue’s formula is

1 dn 1
Pn (x) = n n
[(x2 − 1)n ] = n Dn (x2 − 1)n .
2 n! dx 2 n!
Therefore, we have
Z 1 Z 1
n 2 2
(2 n!) Pn (x)dx = Dn (x2 − 1)n Dn (x2 − 1)n dx
−1 −1
Z 1
n x=1
 n 2 n n−1 2
Dn+1 (x2 − 1)n Dn−1 (x2 − 1)n dx

= D (x − 1) D (x − 1) x=−1 −
−1
Z 1
= 0− Dn+1 (x2 − 1)n Dn−1 (x2 − 1)n dx
−1
Z 1
n
= (−1) D2n (x2 − 1)n (x2 − 1)n dx (Integrating (n − 1) times more)
−1
Z 1
= (−1)n (2n)! (x2 − 1)n dx (Put x = sin θ)
−1
Z π/2
= 2(2n)! cos2n+1 θdθ
0
2n(2n − 2).......4.2
= 2(2n)!
(2n + 1)(2n − 1)........3.1
[2n(2n − 2).......4.2]2
= 2(2n)!
(2n + 1)!
2
= (2n n!)2
2n + 1

5
 Z 1
2
∴ Pn2 (x)dx = .
−1 2n + 1

8.1.3 Legendre Series

Let f (x) be a function defined from x = −1 to x = 1. Then we can write,
∞
X
f (x) = cn Pn (x), (8.9)
n=0

where cn ’s are constants to be determined. Multiplying both sides of (8.9) by Pn (x) and integrating
from −1 to 1, we get
Z 1 Z 1
2
f (x)Pn (x)dx = cn Pn2 (x)dx = cn .
−1 −1 2n + 1
Z 1
2n + 1
=⇒ cn = f (x)Pn (x)dx.
2 −1

Using the values of cn into (8.9), we get the expansion of f (x) in terms of Legendre polynomials,
known as the Legendre series of f (x).

Ex. If f (x) = x for 0 < x < 1 otherwise 0, then show that f (x) = 14 P0 (x)+ 21 P1 (x)+ 16
5
P2 (x)+.......
Z 1 Z 1
1 1 1
Sol. c0 = f (x)P0 (x)dx = x.1dx = , etc.
2 −1 2 0 4
∞
X
Ex. Prove that (1 − 2xt + t2 )−1/2 = tn Pn (x), and
n=0
hence prove the recurrence relation nPn (x) = (2n − 1)xPn−1 (x) − (n − 1)Pn−2 (x).
Sol. Please try yourself.
∞
X Z 1
2 −1/2 n
Ex. Use (1 − 2xt + t ) = t Pn (x), and Pm (x)Pn (x)dx = 0 to show that
n=0 −1
Z 1
2
Pn2 (x)dx = .
−1 2n + 1
Sol. Please try yourself.

Note: The function (1 − 2xt + t2 )−1/2 is called generating function of the Legendre polynomials.
Note that the Legendre polynomials Pn (x) appear as coefficients of tn in the expansion of the
function
(1 − 2xt + t2 )−1/2 .

6
8.2 Gamma Function
The gamma function is defined as
Z ∞
Γ(n) = e−x xn−1 dx, (n > 0) (8.10)
0

The condition n >Z0 is necessary in order to guarantee the convergence of the integral.
∞
Note that Γ(1) = e−x dx = 1.
0
Next, we have
Z ∞ ∞
Z ∞ Z ∞
−x n n −x n−1 −x
e−x xn−1 dx.

Γ(n + 1) = e x dx = x e (−1) 0 − n nx e (−1)dx = n
0 0 0

∴ Γ(n + 1) = nΓ(n).
It is the recurrence relation for gamma function. Using this relation recursively, we have

Γ(2) = 1.Γ(1) = 1,

Γ(3) = 2.Γ(2) = 2.1 = 2!,

Γ(4) = 3.Γ(3) = 3.2! = 3!,
......
Γ(n + 1) = n.Γ(n) = n.(n − 1)! = n!.
Thus, Γ(n)√ takes positive integer values for positive integer values of n. It can be proved that
Γ( 21 ) = π. For,
  Z ∞ Z ∞
1 −t −1/2 2
Γ = e t dx = 2 e−x dx, where t1/2 = x.
2 0 0

  2  Z ∞  Z ∞ 
1 −x2 −y 2
Γ = 2 e dx 2 e dy
2 0 0
Z ∞Z ∞
2 2
= e−(x +y ) dxdy
Z0 2π Z0 ∞
2
= e−r rdrdθ, x = r cos θ, y = r sin θ
0 0
= π

Having known the precise value of Γ 21 , we can calculate the values of gamma function at positive

fractions with denominator 2. For instance,

5 3 1√
   
7 5 3 1 1
Γ = . . Γ = . . π.
2 2 2 2 2 2 2 2

For values of gamma function at positive fractions with denominator different from 2, we have to
rely upon the numerically approximated value of the integral arising in gamma function.

7
 Note that Γ(n) given by (8.10) is not defined for n ≤ 0. We extend the definition of gamma
function by the relation

Γ(n + 1)
Γ(n) = . (8.11)
n
Then Γ(n) is defined for all n except when n is any non-positive integer. If we agree Γ(n) to be ∞
for non-positive integer values of n, then 1/Γ(n) is defined for all n. Such an agreement is useful
while dealing with Bessel functions. The Gamma function is, thus, defined as

 Z ∞


 e−x xn−1 dx , n>0
0





Γ(n) = Γ(n + 1)
 , n < 0 but not an integer


 n



∞, n = 0, −1, −2, .......


Note that the gamma function generalizes the concept of factorial from non-negative integers
to any real number via the formula

n! = Γ(n + 1).

8.3 Bessel Functions

The DE

x2 y 00 + xy 0 + (x2 − p2 )y = 0, (8.12)

where p is a non-negative constant, is called Bessel’s DE. We see that x = 0 is a regular singular
point of (8.12). So there exists at least one Frobenious series solution of the form
∞
X
y= an xn+r , (a0 6= 0). (8.13)
n=0

Using (8.13) into (8.12), we get

∞
X ∞
X
2 2 n+r
an [(n + r) − p ]x + an xn+r+2 = 0. (8.14)
n=0 n=0

Equating to 0 the coefficient of xr , the lowest degree term in x, we obtain

a0 (r2 − p2 ) = 0 or r2 − p2 = 0.

Therefore, roots of the indicial equation are r = p, −p.

Next equating to 0 the coefficient of xr+1 , we find

a1 [(r + 1)2 − p2 ] = 0 or a1 = 0 for r = p.

8
Now equating to 0 the coefficient of xn+r , we have the recurrence relation
an−2
an = − , (8.15)
(n + r)2 − p2
where n = 2, 3, 4....
For r = p, we get the solution in the form
∞
X (−1)n (x/2)2n
y = a0 x p . (8.16)
n=0
n!(p + 1)(p + 2)....(p + n)
1
The Bessel function of first kind of order p, denoted by Jp (x) is defined by putting a0 = 2p p!
into
(8.16) so that
∞
X (−1)n (x/2)2n+p
Jp (x) = , (8.17)
n=0
n!Γ(n + p + 1)

which is well defined for all real values of p in accordance with the definition of gamma function.
1.0

0.8

0.6

0.4

0.2

x
2 4 6 8 10
- 0.2

- 0.4

Figure 8.1: Plots of J0 (x) (Blue curve) and J1 (x) (Red curve).

From applications point of view, the most useful Bessel functions are of order 0 and 1, given
by
x2 x4 x6
J0 (x) = 1 − + − + ..........
22 22 .42 22 .42 .62
x 1  x 3 1  x 5
J1 (x) = − + − ..........
2 1!2! 2 2!3! 2
Plots of J0 (x) (Blue curve) and J1 (x) (Red curve) are shown in Figure 8.1. It may be seen that
J0 (x) and J1 (x) vanish alternatively, and have infinitely many zeros on positive x-axis, as expected,
since J0 (x) and J1 (x) are two particular LI solutions of the Bessel’s DE (8.12). Later, we shall
show that J00 (x) = −J1 (x). Thus, J0 (x) and J1 (x) behave just like cos x and sin x. This analogy
may also be observed by the fact that the normal form of Bessel’s DE (8.12) given by
1 − 4p2
 
00
u + 1+ u = 0,
4x2
behaves as
u00 + u = 0,
for large values of x, with solutions cos x and sin x. It means J0 (x) and J1 (x) behave more precisely
like cos x and sin x for larger values of x.

9
8.3.1 Second solution of Bessel’s DE
To obtain second solution it is natural to try the second root r = −p of the indicial equation. We
assume that p is not an integer otherwise the difference of the indicial equation roots p and −p
would be the integer 2p. For r = −p, the equation a1 [(r + 1)2 − p2 ] = 0 becomes a1 (1 − 2p) = 0,
which lets a1 arbitrary for p = 1/2. So there is no compulsion to choose a1 = 0. However, we fix
a1 = 0 after all we are interested in a particular solution. Also, for r = −p, the recurrence relation
(8.15) reduces to
an−2 an−2
an = − = − ,
(n − p)2 − p2 n(n − 2p)
where n = 2, 3, 4....
For n = 3, we get 3(3 − 2p)a3 = a1 = 0. This lets a3 arbitrary for p = 3/2. We choose a3 = 0.
Likewise, we choose a5 = 0, a7 = 0, ........ for the sake of particular solution, and thus obtain the
following particular solution of (8.12):
∞
X (−1)n (x/2)2n−p
J−p (x) = , (8.18)
n=0
n!Γ(n − p + 1)

which is same as if we replace p by −p in (8.17).

Notice that Jp (x) and J−p (x) are LI since Jp (x) is bounded near x = 0 but J−p (x) is not so.
Thus, when p is not an integer, the general solution of Bessel’s equation (8.12) is

y = c1 Jp (x) + c2 J−p (x). (8.19)

Now let us see what happens when p is a non-negative integer say m. We have
∞
X (−1)n (x/2)2n−m
J−m (x) =
n=0
n!(−m + n)!
∞
(−1)n (x/2)2n−m
 
X 1
= = 0, n = 0, 1, 2, ...., m − 1
n=m
n!(−m + n)! (−m + n)!
∞
X (−1)n+m (x/2)2(n+m)−m
= (Replacing the dummy variable n by n + m)
n=0
(n + m)!(−m + n + m)!
∞
X (−1)n (x/2)2n+m
= (−1)m
n=0
n!(m + n)!
= (−1)m Jm (x)

This shows that Jp (x) and J−p (x) are not LI when p is an integer.
When p is not an integer, any function of the form (8.19) with c2 6= 0 is a Bessel function of
second kind. The standard Bessel function of second kind is defined as
Jp (x) cos pπ − J−p (x)
Yp (x) = . (8.20)
sin pπ
One can write (8.19) in the equivalent form

y = c1 Jp (x) + c2 Yp (x), (8.21)

10
which is general solution of (8.12) when p is not an integer. One may observe that Yp (x) is not
defined when p is an integer say m. However, it can be shown that

Ym (x) = lim Yp (x)

p→m

exists, and it is taken as the Bessel function of second kind. Thus, it follows that (8.21) is general
solution of Bessel’s equation (8.12) in all cases. It is found that Yp (x) is not bounded near x = 0
for p ≥ 0. Accordingly, if we are interested in solutions of Bessel’s equation near x = 0, which is
often the case in applications, then we must take c2 = 0 in (8.21).

8.3.2 Properties of Bessel Functions

It is easy to prove the following:
d p
(1) [x Jp (x)] = xp Jp−1 (x).
dx
d  −p
x Jp (x) = −x−p Jp+1 (x).

(2)
dx
1
(3) Jp0 (x) = [Jp−1 (x) − Jp+1 (x)].
2
2p
(4) Jp+1 (x) = Jp (x) − Jp−1 (x).
x
Z
From (1), we have xp Jp−1 (x)dx = xp Jp (x) + C.
Z
Similarly, (2) gives x−p Jp+1 (x)dx = −x−p Jp (x) + C.
Also, notice that (4) is the recurrence relation for Bessel functions. By definition of Bessel function,
it can be shown that
r r
2 2
J1/2 (x) = sin x, J−1/2 (x) = cos x.
πx πx
So by property (4)
r  
1 2 sin x
J3/2 (x) = J1/2 (x) − J−1/2 (x) = − cos x .
x πx x

Again, by property (4)

r
1 2  cos x 
J−3/2 (x) = − J−1/2 (x) − J1/2 (x) = − − sin x .
x πx x
Thus, every Bessel function Jm+ 1 (x), where m is any integer, is elementary as it is expressible in
2
terms of elementary functions.

8.3.3 Orthogonal properties of Bessel functions

If λm and λn are positive zeros of Jp (x), then
Z 1 
0, m 6= n
xJp (λm x)Jp (λn x)dx = 1 2
0 J (λ ) ,
2 p+1 m
m = n.

11
Proof. Since y = Jp (x) is a solution of
p2
 
00 1 0
y + y + 1 − 2 y = 0,
x x
it follows that u(x) = Jp (λm x) and v(x) = Jp (λn x) satisfy the equations
p2
 
00 1 0 2
u + u + λm − 2 u = 0, (8.22)
x x

p2
 
001 0 2
v + v + λn − 2 v = 0, (8.23)
x x
Multiplying (8.22) by v and (8.23) by u, and subtracting the resulting equations, we obtain
d 0 1
(u v − v 0 u) + (u0 v − v 0 u) = (λ2n − λ2m )uv.
dx x
After multiplication by x, it becomes
d
[x(u0 v − v 0 u)] = (λ2n − λ2m )xuv.
dx
Now, integrating with respect to x from 0 to 1, we have
Z 1
1
2 2
(λn − λm ) uv = [x(u0 v − v 0 u)]0 = 0,
0

since u(1) = Jp (λm ) = 0 and v(1) = Jp (λn ) = 0.

Z 1
∴ xJp (λm x)Jp (λn x)dx = 0, (m 6= n).
0

Next, we consider the case m = n. Multiplying (8.22) by 2x2 u0 , we get

2x2 u0 u00 + 2xu02 + 2λ2m x2 uu0 − 2p2 uu0 = 0.
d
x2 u02 + λ2m x2 u2 − p2 u2 = 2λ2m xu2 .


=⇒
dx
Integrating from 0 to 1 with respect to x, we get
Z 1
1
2
xu2 dx = x2 u02 + λ2m x2 u2 − p2 u2 0 = λ2m Jp02 (λm ) + (λ2m − p2 )Jp2 (λm ).

2λm
0

(Notice that u(0) = Jp (0) = 0 for p > 0. So p2 u2 (0) = 0 for p ≥ 0).

Z 1
1 1 2
∴ xJp2 (λm x)dx = Jp02 (λm ) = Jp+1 (λm ).
0 2 2
d  −p
x Jp (x) = −x−p Jp+1 (x) leads to

For,
dx
p
Jp0 (x) = Jp (x) − Jp+1 (x),
x
p
∴ Jp0 (λm ) = Jp (λm ) − Jp+1 (λm ) = −Jp+1 (λm ).
λm

12
8.3.4 Fourier-Bessel Series
In mathematical physics, it is often necessary to expand a given function in terms of Bessel func-
tions. The simplest and most useful expansions are of the form
∞
X
f (x) = an Jp (λn x) = a1 Jp (λ1 x) + a2 Jp (λ2 x) + ..........., (8.24)
n=1

where f (x) is defined on the interval 0 ≤ x ≤ 1 and λn are positive zeros of some fixed Bessel
function Jp (x) with p ≥ 0. Now multiplying (8.24) by xJp (λn x) and integrating from x = 0 to
x = 1, we get
Z 1
1 2
xf (x)Jp (λn x)dx = an Jp+1 (λn ),
0 2
which gives
Z 1
2
an = 2 xf (x)Jp (λn x)dx.
Jp+1 (λn ) 0

Ex. Express f (x) = 1 in terms of the functions J0 (λn x)

Sol. We have
Z 1
2
an = xf (x)J0 (λn x)dx
J12 (λn ) 0
 1  
2 1 d
= xJ1 (λn x) , ∵ [xJ1 (x)] = xJ0 (x)
J12 (λn ) λn 0 dx
2 J1 (λn )
= 2
×
J1 (λn ) λn
2
=
λn J1 (λn )
So the required Fourier-Bessel series is
∞
X 2
1= J0 (λn x).
n=1
λn J1 (λn )

Convergence of Fourier-Bessel Series

Assume that f (x) and f 0 (x) have at most finite number of jump discontinuities on [0, 1]. If
x ∈ (0, 1), then the Bessel series converges to f (x) when x is a point of continuity of f (x), and
converges to 12 [f (x−) + f (x+)] when x is a point of discontinuity. At x = 1, the series converges
to 0 regardless of the nature of f (x) because every Jp (λn ) = 0. The series converges to 0 if p > 0
and to f (0+) if p = 0.

13
 x−1 J2 dx = −x−1 J1 + C.
R
Ex.
R
Ex. x2 J1 dx = x2 J2 + C.
R R R R
Ex. x3 J0 dx = x2 (xJ0 )dx = x2 (xJ1 ) − (xJ1 )(2x)dx = x3 J1 − 2 x2 J1 dx = x3 J1 − 2x2 J2 + C.

1 2 2 0
R R 1 2 1 2 2
R 2
Ex. xJ02 dx = 2
x J0 − 2
x (2J0 J0 )dx = 2
x J0 + x (J0 J1 )dx
1 2 2 0 1 2 2 1 1 2
R
= 2 x J0 + (xJ1 )(xJ1 ) dx = 2 x J0 + 2 (xJ1 ) = 2 x (J02 + J12 ).
2

Ex. Show that 4J0000 + 3J00 + J3 = 0.

Sol. We know that Jp0 = 12 (Jp−1 − Jp+1 ) and J00 = −J1 .
So J000 = −J10 = − 21 (J0 − J2 ). It follows that
J0000 = − 21 (J00 − J20 ) = − 12 J00 − 21 (J1 − J3 ) = − 21 J00 − 21 (−J00 − J3 ) .
  

It then follows 4J0000 + 3J00 + J3 = 0.

14