# Di erential Equations 1

DE. At each point on this curve, the tangent must have the slope f(x;y). Thus, the DE prescribes a direction at each point on the integral curve y= ’(...

Differential Equations

1

M.T.Nair Department of Mathematics, IIT Madras

CONTENTS PART I: Ordinary Differential Equations

Page Number

1. First order ODE

2

1.1 Introduction

2

1.2 Direction Field and Isoclines

3

1.3 Initial Value Problem

3

1.4 Linear ODE

4

1.5 Equations with Variables Separated

6

1.6 Homogeneous equations

7

1.7 Exact Equations

7

1.8 Equations reducible to homogeneous or variable separable or linear or exact form

9

2. Second and higher order linear ODE 2.1 Second order linear homogeneous ODE

13

2.2 Second order linear homogeneous ODE with constant coefficients

17

2.3 Second order linear non-homogeneous ODE

18

3. System of first order linear homogeneous ODE

25

4. Power series method

28

4.1 The method and some examples

28

4.2 Legendre’s equation and Legendre polynomials

30

4.3 Power series solution around singular points

36

4.4 Orthogonality of functions

45

5. Sturm–Liouville problem (SLP)

52

6. References

56

1 Lectures

for the course MA2020, July-November 2012.

1

1

First order ODE

1.1

Introduction

An Ordinary differential equation (ODE) is an equation involving an unknown function and its derivatives with respect to an independent variable x: F (x, y, y (1) , . . . y (k) ) = 0. Here, y is the unknown function, x is the independent variable and y (j) represents the j-th derivative of y. We shall also denote y 0 = y (1) ,

y 00 = y (2) ,

y 000 = y (3) .

Thus, a first order ODE is of the form F (x, y, y 0 ) = 0.

(∗)

Sometimes the above equation can be put in the form: y 0 = f (x, y).

(1)

By a solution of (∗) we mean a function y = ϕ(x) defined on an interval I := (a, b) which is differentiable and satisfies (∗), i.e., F (x, ϕ(x), ϕ0 (x)) = 0,

x ∈ I.

Example 1.1. y 0 = x. Note that, for every constant C, y = x2 /2 + C satisfies the DE for every x ∈ R.

The above simple example shows that a DE can have more than one solution. In fact, we obtain a family of parabolas as solution curves. But, if we require the solution curve to pass through certain specified point then we may get a unique solution. In the above example, if we demand that y(x0 ) = y0 for some given x0 , y0 , then we must have y0 =

x20 +C 2

so that the constant C must be C = y0 −

x20 . 2

Thus, the solution, in this case, must be y=

x2 x2 + y0 − 0 . 2 2 2

1.2

Direction Field and Isoclines

Suppose y = ϕ(x) is a solution of DE (1). Then this curve is also called an integral curve of the DE. At each point on this curve, the tangent must have the slope f (x, y). Thus, the DE prescribes a direction at each point on the integral curve y = ϕ(x). Such directions can be represented by small line segments with arrows pointing to the direction. The set of all such directed line segments is called the direction field of the DE. The set of all points in the plane where f (x, y) is a constant is called an isocline. Thus, the family of isoclines would help us locating integral curves geometrically. Isoclines for the DE: y 0 = x + y are the straight lines x + y = C.

1.3

Initial Value Problem

An equation of the form y 0 = f (x, y)

(1)

together with a condition of the form the form y(x0 ) = y0

(2)

is called an initial value problem. The condition (2) is called an initial condition. THEOREM 1.2. Suppose f is defined in an open rectangle R = I × J, where I and J are open intervals, say I = (a, b), J = (c, d): R := {(x, y) : a < x < b,

c < y < d}.

∂f in R, then for every (x0 , y0 ) ∈ R, there ∂y exists a unique function y = ϕ(x) defined in an interval (x0 −h, x0 +h) ⊆ (a, b) which satisfies (1)−(2). If f is continuous and has continuous partial derivative

Remark 1.3. The conditions prescribed are sufficient conditions that guarantee the existence and uniqueness of a solution for the initial value problem. They are not necessary conditions. A unique solution for the initial value problem can exist without the prescribed conditions on f as in the above ♦

theorem.

• The condition (2) in Theorem 1.2 is called an initial condition, the equation (1) together with (2) is called an initial value problem. • A solution of (1) the form y = ϕ(x, C), where C is an arbitrary constant varying in some subset of R, is called a general solution of (1). 3

• A solution y for a particular value of C is called a particular solution of (1). • If general solutions of (1) are given implicitly in the form u(x, y, C) = 0 arbitrary constant C, then the above equation is called the complete integral of (1). • A complete integral for a particular value of C is called a particular integral of (1). Remark 1.4. Under the assumptions of Theorem 1.2, if x0 ∈ I, then existence of a solution y for (1) is guaranteed in some neighbourhood I0 ⊆ I of x0 , and it satisfies the integral equation Z x y(x) = y0 + f (t, y(t))dt. x0

A natural question would be: Is the family of all solutions of (1) defined on I0 a one-parameter family, so that any two solutions in that family differ only by a constant? It is known that for a general nonlinear equation (1), the answer is nt in affirmative. However, for ♦

linear equations the answer is in affirmative.

1.4

Linear ODE

If f depends of y in a linear fashion, then the equation (1) is called a linear DE. A general form of the linear first order DE is: y 0 + p(x)y = q(x).

(3)

Here is a procedure to arrive at a solution of (3): Assume first that there is a solution for (3) and that after multiplying both sides of (3) by a differentiable function µ(x), the LHS is of the (µ(x)y)0 . Then(3) will be converted into: (µ(x)y)0 = µ(x)q(x) so that

Z µ(x)y =

q(x)dx + C.

Thus, µ must be chosen in such a manner that µ0 y + µy 0 = µ(y 0 + py). Therefore, we must have µ0 y = µpy,

i.e., µ0 = µp,

4

i.e.,

dµ = pdx, µ

i.e., µ(x) := e

R

p(x)dx

.

Thus, y takes the form 1 y= µ(x)



Z

µ(x)q(x)dx + C ,

µ(x) := e

R

p(x)dx

.

(4)

It can be easily seen that the function y defined by (4) satisfies the DE (3). Thus existence of a solution for (3) is proved for continuous functions p and q. Suppose there are two functions ϕ and ψ which satisfy (3). Then χ(x) := ϕ(x) − ψ(x) would satisfy χ0 (x) + p(x)χ(x) = 0. Hence, using the arguments in the previous paragraph, we obtain χ(x) = Cµ(x)−1 for some constant C. Now, if ϕ(x0 ) = y0 = ψ(x0 ), then we must have χ(x0 ) = 0 so that Cµ(x)−1 = 0. Hence, we obtain C = 0 and hence, ϕ = ψ. Thus, we have proved the existence and uniqueness for the linear DE only by assuming that p and q are continuous. Example 1.5. y 0 = x + y. Then, µ = e−

R

dx

= e−x and hence, Z    Z x −x x −x −x y=e e xdx + C = e −xe + e dx + C .

Thus,   y = ex −xe−x − e−x + C = −x − 1 + Cex . y(0) = 0

=⇒ 0 = −1 + C

=⇒ C = 1.

Hence, y = −x − 1 + ex . Note that y 0 = −1 + ex = −1 + (x + y + 1) = x + y. ♦

5

1.5

Equations with Variables Separated

If f (x, y) in (1) is of the form f (x, y) = f1 (x)f2 (y) for some functions f1 , f2 , then we say that (3) is an equation with separated variables. In this case (3) takes the form: y 0 = f1 (x)f2 (y); equivalently,

y0 = f1 (x), f2 (y)

assuming that f2 (y) is not zero at all points in the interval of interest. Hence, in this case, a general solution is given implicitly by Z

dy = f2 (y)

Z f1 (x)dx + C.

Example 1.6. y 0 = xy. Equivalently, dy = xdx. y Hence, log |y| =

x2 + C, 2

i.e., y = C1 ex

2

/2

.

Note that y = C 1 ex

2

/2

=⇒

 2  y 0 = C1 ex /2 x = xy. ♦

An equation with separated variables can also be written as M (x)dx + N (y)dy = 0. In this case, solution is implicitly defined by Z Z M (x)dx + N (y)dy = 0.

(5)

Equation of the form M1 (x)N1 (y)dx + M2 (x)N2 (y)dy = 0 can be brought to the form (5): After dividing (6) by N1 (y)M2 (x) we obtain N2 (y) M1 (x) dx + dy = 0. M2 (x) N1 (y) 6

(6)

1.6

Homogeneous equations

A function f : R → R is said to be homogeneous of degree n if f (λx, λy) = λn f (x, y) ∀ λ ∈ R for some n ∈ N. The differential equation (1) is called a homogeneous equation if f is homogeneous of degree 0, i.e., if f (λx, λy) = f (x, y) ∀ λ ∈ R. Suppose (1) is a homogeneous equation. Then we have x y y 0 = f (x, y) = f ( , ) = f (1, u), x x

u :=

y . x

Now, u=

y x

=⇒

ux = y =⇒ u + x

du = y 0 = f (1, u). dx

Thus, du dx = f (1, u) − u x and hence, u and therefore, y is implicitly defined by Z Z du dx = + C. f (1, u) − u x

1.7

Exact Equations

Suppose (1) is of the form M (x, y)dx + N (x, y)dy = 0,

(7)

where M and N are such that there exists u(x, y) with continuous first partial derivatives satisfying M (x, y) =

∂u , ∂x

N (x, y) =

∂u . ∂y

Then (7) takes the form ∂u ∂u dx + dy = 0; ∂x ∂y equivalently, du = 0. Then the general solution is implicitly defined by u(x, y) = C. Equation (7) with M and N satisfying (8) is called an exact differential equation. 7

(8)

Note that, in the above, if there exists u(x, y) with continuous second partial derivatives and

∂2u ∂x∂y

∂2u , then ∂y∂x ∂M ∂N = . ∂y ∂x

In fact it is a sufficient condition of (7) to be an exact differential equation. THEOREM 1.7. Suppose M and N are continuous and have continuous first partial derivatives ∂N ∂M and in I × J, and ∂y ∂x ∂N ∂M = . ∂y ∂x Then the equation (7) is exact, and in that case the complete integral of (7) is given by Z y Z x N (x0 , y)dy = C. M (x, y)dx + y0

x0

Proof. Note that for any differentiable function g(y), Z x u(x, y) := M (x, y)dx + g(y) x0

satisfies

∂u = M (x, y). Then ∂x Z x Z x ∂u ∂M ∂N 0 = dx + g (y) = dx + g 0 (y) = N (x, y) − N (x0 , y) + g 0 (y). ∂y ∂y ∂x x0 x0

Thus, ∂u = N ⇐⇒ g 0 (y) = N (x0 , y) ⇐⇒ g(y) = ∂y Thus, taking Z

y

g(y) =

Z N (x0 , y)dy

y

N (x0 , y)dy. y0

x

and u(x, y) :=

y0

Z

M (x, y)dx + g(y) x0

we obtain (8), and the complete integral of (7) is given by Z y Z x M (x, y)dx + N (x0 , y)dy = C. x0

y0

Example 1.8. y cos xydx + x cos xydy = 0. ∂ϕ ∂ϕ ϕ(x, y) = sin xy =⇒ = x cos xy and = x cos xy. ∂x ∂y Hence, sin xy = C. Also, y cos xydx + x cos xydy = 0 ⇐⇒ y 0 = − Hence, log |xy| = C.

y dx dy ⇐⇒ + = 0. x x y ♦

8

Example 1.9. y 2 − 3x2 2x dx + dy = 0. y3 y4 In this case

∂M ∂N 6x =− 4 = . ∂y y ∂x

Hence, the given DE is exact, and u is give by Z Z 1 x2 u(x, y) = M dx + N (0, y)dy = 3 − , y y so that the complete integral is given by u(x, y) = C.

1.8

1.8.1

Equations reducible to homogeneous or variable separable or linear or exact form Reducible to homogeneous or variable separable form

Note that the function f (x, y) =

ax + by + c a1 x + b1 y + c1

is not homogeneous if either c 6= 0 or c1 6= 0, and in such case, dy = f (x, y) dx

(1)

is not homogeneous. We shall convert this equation into a homogenous equation in terms a variables: Consider the change of variables: X = x − h,

Y = y − k.

Then ax + by + c = a(X + h) + b(Y + k) + c = aX + bY + (ah + bk + c), a1 x + b1 y + c1 = a1 (X + h) + b1 (Y + k) + c1 = a1 X + b2 Y + (a1 h + b1 k + c1 ). There are two cases: Case(i): det

a

b

a1

b1

! 6= 0.

In this case there exists a unique pair (h, k) such that ah + bk + c = 0

(2)

a 1 h + b1 k + c 1

(3)

are satisfied. Hence, observing that dY dy dx dy dY = = , dX dy dx dX dx 9

the equation (1) takes the form dY aX + bY = . dX a 1 X + b1 Y This is a homogeneous equation. If Y = ϕ(X) is a solution of this homogeneous equation, then a solution of (1) is given by y = k + ϕ(x − h).

Case(ii): det

a

b

a1

b1

! = 0. In this case either a1 = αa,

b1 = αb

for some α ∈ R

or a1 = βa1 , b = βb1 for some β ∈ R. Assume that a1 = αa and b1 = αb for some α ∈ R. Then, (1) takes the form ax + by + c ax + by + c dy = = . dx a1 x + b1 y + c1 α(ax + by) + c1 Taking z = ax + by, we obtain dy dz =a+b =a+b dx dx



z+c α(z + c1

 .

This is an equation in variable separable form. Example 1.10. 2x + y − 1 dy = . dx 4x + 2y + 5 Taking z = 2x + y, dz dy z−1 dz 5z + 9 =2+ =2+ ⇐⇒ = , dx dx 2z + 5 dx 2z + 5 i.e., 2z + 5 dz = dx. 5z + 9 Note that 2z + 5 = 5z + 9 Z

        1 10z + 25 1 2(5z + 9) + 7 2 7 1 = = + 5 5z + 9 5 5z + 9 5 5 5z + 9 2z + 5 2z 7 dz = inf dx ⇐⇒ + log |5z + 9| = x + 9 5z + 9 5 25 ⇐⇒

2(2x + y) 7 + log |5(2x + y) + 9| = x + 9 5 25

Thus, the solution y is given by 7 4x + 2y + log |10x + 5y + 9| = x + 9. 5 25 ♦ 10

1.8.2

Reducible to linear form

Bernauli’s equation: y 0 + p(x)y = q(x)y n . Write it as y −n y 0 + p(x)y −n+1 = q(x). Taking z = y −n+1 , dy dz = (−n + 1)y −n = (−n + 1)[−p(x)z + q(x)], dx dx i.e., dz − (−n + 1)p(x)z = (−n + 1)q(x). dx Hence, z=

1 µ(x)

Z

 µ(x)(−n + 1)q(x)dx + C ,

µ(x) = e(−n+1)

R

p(x)dx

.

Example 1.11. dy + xy = x3 y 3 . dx Here, n = 3 so that −n + 1 = −2 and µ(x) = e(−n+1)

z

=

1 µ(x)

R

p(x)dx

= e−2

Z



µ(x)(−n + 1)q(x)dx + C Z  2 2 = −2ex e−x x3 dx − C/2 .

R

xdx

= ex

2

2

= e−x . Z

2

−2e−x x3 dx + C



Gives: 2

(x2 + 1 + Cex )y 2 = 1. ♦

1.8.3

Reducible to exact equations

Suppose M (x, y) and N (x, y) are functions with continuous partial derivatives

∂M ∂N ∂M ∂N , , , . ∂x ∂x ∂y ∂x

Consider the differential equation M (x, y)dx + N (x, y)dy = 0. Recall that it is an exact equation if and only if ∂M ∂N = . ∂y ∂x Suppose the equation is not exact. Then we look for a function µ := µ(x) such that µ(x)[M (x, y)dx + N (x, y)dy] = 0 11

(∗)

is exact. So, requirement on µ should be ∂ ∂ ∂M ∂N (µM ) = (µN ), i.e., µ =µ + µ0 N ∂y ∂x ∂y ∂x   µ0 1 ∂M ∂N ⇐⇒ = − . µ N ∂y ∂x Thus:   ∂N 1 ∂M − is a function of x alone, then the above differential equation If ϕ := N ∂y ∂x R for µ can be solved and with the resulting µ := e ϕdx the equation (∗) is exact equation. Similarly, looking for a function µ ˜=µ ˜(y) such that µ ˜(x)[M (x, y)dx + N (x, y)dy] = 0

(∗∗)

becomes exact, we arrive at the equation 1 µ ˜0 (y) = µ ˜(y) M



∂N ∂M − ∂x ∂y

 .

Hence, we can make the following statement:   ∂M 1 ∂N − is a function of y alone, then the above differential equation for M ∂x ∂y R µ can be solved and with the resulting µ := e ψdx the equation (∗∗) is exact equation.

If ψ :=

Definition 1.12. Each of the functions µ(x) and µ ˜(y) in the above discussion, if exists, is called an ♦

integrating factor. Example 1.13. (y + xy 2 )dx − xdy = 0. Note that

∂M ∂y

∂N ∂x

= −1,   1 ∂M ∂N (1 + 2xy) + 1 2(1 + xy) ϕ := − = = . N ∂y ∂x −x −x   ∂M −2(1 + xy) 2 1 ∂N − = =− . ψ= M ∂x ∂y y(1 + xy) y

= 1 + 2xy,

Thus, µ ˜ := e

R

−2 y dy

=−

1 y2

is an integrating factor, i.e., −

1 [(y + xy 2 )dx − xdy] = 0 ⇐⇒ y2

  1 x − − x dx − 2 dy = 0 y y

is an exact equation. Then  Z Z Z  1 x x2 u = M dx + N (0, y)dy = − − x dx = − − . y y 2 Thus the complete integral is given by

x y

+

x2 2

= C.

12

2

Second and higher order linear ODE

Second order linear ODE is of the form y 00 + a(x)y 0 + b(x)y = f (x)

(1)

where a(x), b(x), f (x) are functions defined on some interval I. The equation (1) is said to be 1. homogeneous if f (x) = 0 for all x ∈ I, and 2. non-homogeneous of f (x) = 0 for some x ∈ I. THEOREM 2.1. (Existence and uniqueness) Suppose a(x), b(x), f (x) are continuous functions (defined on some interval I). Then for every x0 ∈ I, y0 ∈ R, z0 ∈ R, there exists a unique solution y for (1) such that y(x0 ) = y0 ,

2.1

y 0 (x0 ) = z0 .

Second order linear homogeneous ODE

Consider second order linear homogeneous ODE: y 00 + a(x)y 0 + b(x)y = 0.

(2)

Note that: • If y1 and y2 are solutions of (2), then for any α, β ∈ R, the function αy1 + βy2 is also a solution of (2). Definition 2.2. Let y1 and y2 be functions defined on an interval I. 1. y1 and y2 are said to be linearly dependent if there exists λ ∈ R such that either y1 (x) = λy2 (x) or y2 (x) = λy1 (x); equivalently, there exists α, β ∈ R with atleast one of them nonzero, such that αy1 (x) + βy2 (x) = 0 ∀ x ∈ I. 2. y1 and y2 are said to be linearly independent if they are not linearly dependent, i.e. for α, β ∈ R, αy1 (x) + βy2 (x) = 0

∀x ∈ I

=⇒ α = 0, β = 0. ♦

We shall prove: THEOREM 2.3. The following hold. 13

1. The differential equation (2) has two linearly independent solutions. 2. If y1 and y2 are linearly independent solutions of (2), then every solution y of (2) can be expressed as y = αy1 + βy2 for some α, β ∈ R. Definition 2.4. Let y1 and y2 be differentiable functions (on an interval I). Then the function ! y1 y2 W (y1 , y2 )(x) := det 0 y1 y20 ♦

is called the Wronskian of y1 , y2 .

Once the functions y1 , y2 are fixed, we shall denote W (y1 , y2 )(x) by W (x). Note that: • If y1 and y2 are linearly dependent, then W (x) = 0 for all x ∈ I. Equivalently: • If W (x0 ) 6= 0 for some x0 ∈ I, then y1 and y2 are linearly independent. " # a1 b1 THEOREM 2.5. Consider a nonsingular matrix A = . Let x0 ∈ I. Let y1 and y2 be a2 b2 unique solutions of (2) satisfying the conditions y1 (x0 ) = a1

y2 (x0 ) = b1

y10 (x0 )

y20 (x0 ) = b2

= a2

.

Then y1 and y2 are linearly independent solutions of (2). Proof. Since A = W (x0 ) and det(A) 6= 0, the proof follows from the earlier observation. LEMMA 2.6. Let y1 and y2 be solutions of (2) and x0 ∈ I. Then W (x) = W (x0 )e

Rx x0

a(t)dt

.

In particular, if y1 and y2 are solutions of (2), then W (x0 ) = 0 at some point x0 ⇐⇒ W (x) = 0 at every point x ∈ I. Proof. Since y1 and y2 are solutions of (2), we have y100 + a(x)y10 + b(x)y1 = 0, 14

y200 + a(x)y20 + b(x)y2 = 0. Hence, (y1 y200 − y2 y100 ) + a(x)(y1 y20 − y2 y10 ) = 0. Note that W = y1 y20 − y2 y10 ,

W 0 = y1 y200 − y2 y100 .

Hence W 0 + a(x)W = 0. Therefore, W (x) = W (x0 )e

Rx x0

a(t)dt

.

THEOREM 2.7. Let y1 and y2 be solutions of (2) and x0 ∈ I. Then y1 and y2 are linearly independent, ⇐⇒ W (x) 6= 0 for every x ∈ I. Proof. We have already observed that if W (x0 ) = 0 for some x0 ∈ I, then y1 and y2 are linearly independent. Hence, it remains to prove that if y1 and y2 are linearly independent, then W (x) 6= 0 for every x ∈ I. Suppose W (x0 ) = 0 for some x0 ∈ I. Then by the Lemma 2.6, W (x) = 0 for every x ∈ I,i.e., y1 y20 − y2 y10 = 0

on I.

Let I0 = {x ∈ I : y1 (x) 6= 0}. Then we have y1 y20 − y2 y10 =0 y12

on I0 ,

i.e., d dx Hence, there exists λ ∈ R such that



y2 y1

 =0

y2 =λ y1

on I0 .

on I0 .

Hence, y2 = λy1 on I, showing that y1 and y2 are linearly dependent. THEOREM 2.8. Let y1 and y2 be linearly independent solutions of (2). Then every solution y of (2) can be expressed as y = αy1 + βy2 for some α, β ∈ R.

15

Proof. Let y be a solution of (2), and for x0 ∈ I, let z0 := y 0 (x0 ).

y0 := y(x0 ),

Let W (x) be the Wronskian of y1 , y2 . Since y1 and y2 are linearly independent solutions of (2), by Theorem 2.5, W (x0 ) 6= 0. Hence, there exists a unique pair α, β) of real numbers such that " #" #" # y1 (x0 ) y2 (x0 ) α y0 . y10 (x0 ) y20 (x0 ) β z0 Let ϕ(x) = αy1 (x) + βy2 (x),

x ∈ I.

Then ϕ is a solution of (2) satisfying ϕ0 (x0 ) = αy10 (x0 ) + βy20 (x0 ) = z0 .

ϕ(x0 ) = αy1 (x0 ) + βy2 (x0 ) = y0 ,

By the existence and uniqueness theorem, we obtain ϕ(x) = y(x) for all x ∈ I, i.e., y = αy1 + βy2 .

Theorem 2.5 and Theorem 2.8 give Theorem 2.3. Now, the question is how to get linearly independent solutions for (2). THEOREM 2.9. Let y1 be a nonzero solution of (2). Then Z R ψ(x) − xx a(t)dt 0 y2 (x) := y1 (x) dx, ψ(x) := e , y1 (x)2 is a solution of (2), and y1 , y2 are linearly independent. Proof. Let y2 (x) = y1 (x)ϕ(x),where Z ϕ(x) :=

ψ(x) dx, y1 (x)2

ψ(x) := e

Rx x0

a(t)dt

.

Then y20 = y1 ϕ0 + y10 ϕ,

y200 = y1 ϕ00 + y10 ϕ0 + y10 ϕ0 + y100 ϕ = y1 ϕ00 + 2y10 ϕ0 + y100 ϕ.

Hence, y200 + ay 0 + by2

= y1 ϕ00 + 2y10 ϕ0 + y100 ϕ + a(y1 ϕ0 + y10 ϕ) + by1 ϕ = y1 ϕ00 + 2y10 ϕ0 + (y100 + ay10 + by1 ϕ)ϕ + ay1 ϕ0 = y1 ϕ00 + 2y10 ϕ0 + ay1 ϕ0

16

Note that ϕ0 =

ψ(x) , y1 (x)2

i.e., y12 ϕ0 = ψ.

Hence y12 ϕ00 + 2y1 y10 ϕ0 = ψ 0

i.e., y1 (y1 ϕ00 + 2y10 ϕ0 ) = ψ 0

so that y200 + ay 0 + by2 = y1 ϕ00 + 2y10 ϕ0 + ay1 ϕ0 =

ψ0 aψ ψ 0 + aψ + = = 0. y1 y1 y1

Clearly, y1 and y2 are linearly independent.

Motivation for the above expression for y2 : If y1 and y2 are solutions of (2), then we know that d dx



y2 y1



W (x) Ce y1 y20 − y2 y10 = = = y12 y12

Rx x0

a(t)dt

y12

.

Hence, Z y2 = y1

2.2

Ce

Rx x0

a(t)dt

!

y12

dx.

Second order linear homogeneous ODE with constant coefficients

The DE in this case is of the form y 00 + py 0 + qy = 0,

(1)

where p, q are real constants. Let us look for a solution (1) in the form y = eλx for some λ, real or complex. Assuming that such a solution exists, from (1) we have (λ2 + pλ + q)eλx = 0 so that λ must satisfy the auxiliary equation: λ2 + pλ + q = 0. We have the following cases: 1. (2) has two distinct real roots λ1 , λ2 , 2. (2) has two distinct complex roots λ1 = α + iβ, λ2 = α − iβ, 3. (2) has a multiple root λ. • In case 1, eλ1 x , eλ2 x are linearly independent solutions. • In case 2, eαx cos βx, eαx sin βx are linearly independent solutions. 17

(2)

• In case 1, eλx , xeλx are linearly independent solutions. Example 2.10. y 00 + y 0 − 2y = 0 Auxiliary equation:

λ2 + λ − 2 = 0 has two distinct real roots: λ1 = 1, x

−2x

General solution: y = C1 e + C2 e

λ2 = −2. ♦

.

Example 2.11. y 00 + 2y 0 + 5y = 0 Auxiliary equation:

λ2 + 2λ + 5 = 0 has two complex roots: −1 + i2,

= −1 − i2.

General solution: y = e−x [C1 cos 2x + C2 sin 2x].

Example 2.12. y 00 − 4y 0 + 4y = 0 Auxiliary equation:

λ2 − 4λ + 4 = 0 has a multiple root: λ0 = 2.

General solution: y = e2x [C1 + C2 e2x ].

2.3

Second order linear non-homogeneous ODE

Consider the nonhomogeneous ODE: y 00 + a(x)y 0 + b(x)y = f (x),

(1)

We observe that if y0 is a solution of the homogeneous equation y 00 + a(x)y 0 + b(x)y = 0

(2)

and y ∗ is a particular solution of the nonhomogeneous equation (1), then y = y0 + y ∗ is a solution of the nonhomogeneous equation (1). Also, if y ∗ is a particular solution of the nonhomogeneous equation (1) and if y is any solution of the nonhomogeneous equation (1), then y − y ∗ is a solution of the homogeneous equation (2). Thus, knowing a particular solution y ∗ of the nonhomogeneous equation (1) and a general solution y¯ of homogeneous equation (2), we obtain a general solution of the nonhomogeneous equation (1) as y = y¯ + y ∗ . If the coefficients are constants, then we know a method of obtaining two linearly independent solutions for the homogeneous equation (2), and thus we obtain a general solution for the homogeneous equation (2). How to get a particular solution for the nonhomogeneous equation (1)? 18

2.3.1

Method of variation of parameters

Suppose y1 and y2 are linearly independent solutions of the homogeneous ode: y 00 + a(x)y 0 + b(x)y = 0.

(2)

The, look for a solution of (1) in the form y = u1 y1 + u2 y2 where u1 and u2 are unctions to be determined. Assume for a moment that such a solution exists. Then y 0 = u1 y10 + u2 y20 + u01 y1 + u02 y2 . We shall look for u1 , u2 such that u01 y1 + u02 y2 = 0

(3).

y 0 = u1 y10 + u2 y20 ,

(4)

y 00 = u1 y100 + u2 y200 + u01 y10 + u02 y20 .

(5)

Then, we have

Substituting (4-5) in (1), (u1 y100 + u2 y200 + u01 y10 + u02 y20 ) + a(x)(u1 y10 + u2 y20 ) + b(x)(u1 y1 + u2 y2 ) = f (x), i.e., u1 [y100 + a(x)y10 b(x)y1 ] + u2 [y200 + a(x)y20 b(x)y2 ] + u01 y10 + u02 y20 = f (x), i.e., u01 y10 + u02 y20 = f (x).

(6)

Now, (3) and (6): "

y1

y2

y10

y20

#" # u01 u02

=

" # 0 f

gives u01 = −

y2 f , W

u02 =

y1 f . W

Hence, Z u1 = −

y2 f + C1 , W

Z u2 =

y1 f + C2 . W

Thus,  Z  Z  y2 f y1 f y= − + C1 y1 + + C 2 y2 W W is the general solution. Thus we have proved the following theorem.

19

THEOREM 2.13. If y1 , y2 are linearly independent solutions of the homogeneous equation (2), and if W (x) is their Wronskian, then a general solution of the nonhomogeneous equation (1) is given by y = u1 y1 + u2 y2 , where

Z u1 = −

y2 f + C1 , W

Z u2 =

y1 f + C2 . W

Analogously, it the following theorem also can be proved: THEOREM 2.14. If y1 , y2 , . . . , yn are linearly independent solutions of the homogeneous equation y (n) + a1 (x)y (n−1) + · · · + an−1 (x)y (1) + an (x)y = 0, where a1 , a2 , . . . , an are continuous functions on an interval I, and if W (x) is their Wronskian, i.e.,   y1 y2 ··· yn   0  y1 y20 ··· yn0  , W (x) = det   ··· ··· ··· ···    (n−1) (n−1) (n−1) y1 y2 · · · yn then a general solution of the nonhomogeneous equation y (n) + a1 (x)y (n−1) + · · · + an−1 (x)y (1) + an (x)y = f (x) is given by y = (u1 + C1 )y1 + (u2 + C2 )y2 + · · · + (un + Cn )yn , where u01 , u02 , . . . , u0n are obtained by solving the system      0 u01 y1 y2 ··· yn       0 0 0 0   y1    0 y · · · y u n   2 2 .  =   ···    ··· ··· · · ·  · · · · · ·   (n−1) (n−1) (n−1) u0n f y1 y2 · · · yn Remark 2.15. Suppose the right hand side of (1) is of the form f (x) = f1 (x) + f2 (x). Then it can be easily seen that: If y1 and y2 are solutions of y 00 + a(x)y 0 + b(x)y = f1 (x),

y 00 + a(x)y 0 + b(x)y = f2 (x),

respectively, then y1 + y2 are solutions of y 00 + a(x)y 0 + b(x)y = f1 (x) + f2 (x). ♦ 20

2.3.2

Method of undetermined coefficients

This method is when the coefficients of (1) are constants and f is of certain special forms. So, consider y 00 + py 0 + qy = f,

(1)

where p, q are constants. Case (i): f (x) = P (x)eαx , where P is a polynomial of degree n, and α ∈ R: We look for a solution of the form y = Q(x)eαx , where Q is a polynomial of degree n Substituting the above expression in the DE, we obtain: [Q00 + (2α + p)Q0 + (α2 + pα + q)Q]eαx = P (x)eαx . Thus, we must have Q00 + (2α + p)Q0 + (α2 + pα + q)Q = P (x). Note that, the above equation is an identity only if α2 + pα + q 6= 0, i.e., α is not a root of the auxiliary equation λ2 + pλ + q = 0. In such case, we can determine Q by comparing coefficients of powers of xk for k = 0, 1, . . . , n. If α is a root of the auxiliary equation λ2 + pλ + q = 0, then we must look for a solution of the form αx e y = Q(x)e ,

e is a polynomial of degree n + 1, or we must look for a solution of the form where Q y = xQ(x)eαx , where Q is a polynomial of degree n. Proceeding as above we can determine Q provided 2α + p 6= 0, i.e., if α is not a double root of the auxiliary equation λ2 + pλ + q = 0. If α is a double root of the auxiliary equation λ2 + pλ + q = 0, then we must look for a solution of the form αx b y = Q(x)e ,

b is a polynomial of degree n + 2, or we must look for a solution of the form where Q y = x2 Q(x)eαx , where Q is a polynomial of degree n, which we can determine by comparing coefficients of powers of x. Case (ii): f (x) = P1 (x)eαx cos βx + P1 (x)eαx sin βx, where P1 and P2 are polynomials and α, β are real numbers:

21

We look for a solution of the form y = Q1 (x)eαx cos βx + Q1 (x)eαx sin βx, where Q1 and Q2 are polynomials with degQj (x) = max{P1 (x), P2 (x)},

j ∈ {1, 2}.

Substituting the above expression in the DE, we obtain the coefficients of Q1 , Q2 if α + iβ is not a root of the auxiliary equation λ2 + pλ + q = 0. If α + iβ is a simple root of the auxiliary equation λ2 + pλ + q = 0, then we look for a solution of the form y = x[Q1 (x)eαx cos βx + Q1 (x)eαx sin βx], where Q1 and Q2 are polynomials with degQj (x) = max{P1 (x), P2 (x)}, j ∈ {1, 2}. The following example illustrates the second part of case (ii) above: Example 2.16.

2

We find the general solution of y 00 + 4y = x sin 2x.

The auxiliary equation corresponding to the homogeneous equation y 00 + 4y = 0 is: λ2 + 4 = 0. Its solutions are λ = ±2i. Hence, the general solution of the homogenous equation is: y0 = A cos 2x + B sin 2x. Note that the non-homogenous term, f (x) = x sin 2x, is of the form f (x) = P1 (x)eαx cos βx + P1 (x)eαx sin βx, with P1 (x) = 0,

α = 0, β = 2. Also, 2i = α + iβ is a simple root of the auxiliary equation. Hence,

a particular solution is of the form y = x[Q1 (x)eαx cos βx + Q1 (x)eαx sin βx], where Q1 and Q2 are polynomials with degQj (x) = max{P1 (x), P2 (x)} = 1. Thus, a a particular solution is of the form y = x[(A0 + A1 x) cos 2x + (B0 + B1 x) sin 2x]. Differentiating: y 0 = [A0 + (2A1 + 2B0 )x + 2B1 x2 ] cos 2x + [B0 + (2B1 − 2A0 )x − 2A1 x2 ] sin 2x, 2 This

example is included in the notes on November 23, 2012 – mtnair.

22

y 00 + 4y

=

2[B0 + (2B1 − 2A0 )x − 2A1 x2 ] cos 2x −2[A0 + (2A1 + 2B0 )x + 2B1 x2 ] sin 2x +[(2B1 − 2A0 ) − 4A1 x] sin 2x + [(2A1 + 2B0 ) + 4B1 x] cos 2x +4x[(A0 + A1 x) cos 2x + (B0 + B1 x) sin 2x].

Hence, y 00 + 4y = x sin 2x if and only if 2[B0 + (2B1 − 2A0 )x − 2A1 x2 ] + [(2A1 + 2B0 ) + 4B1 x] + 4x(A0 + A1 x) = 0, −2[A0 + (2A1 + 2B0 )x + 2B1 x2 ] + [(2B1 − 2A0 ) − 4A1 x] + 4x(B0 + B1 x) = x ⇐⇒ A0 = 0,

1 A1 = − , 8

B0 =

1 , 16

B1 = 0,

so that y = x[(A0 + A1 x) cos 2x + (B0 + B1 x) sin 2x] = −

x2 x cos 2x + sin 2x. 8 16

Thus, the general solution of the equation is: A cos 2x + B sin 2x −

x x2 cos 2x + sin 2x. 8 16 ♦

Remark 2.17. The above method can be generalized, in a natural way, to higher order equation y (n) + a1 y (n−1) + · · · + an−1 y (1) + an y = f (x) where f is of the form f (x) = P1 (x)eαx cos βx + P1 (x)eαx sin βx ♦

with P1 and P2 being polynomials and α, β are real numbers.

2.3.3

Equations reducible to constant coefficients case

A particular type of equations with non-constant coefficients can be reduced to the ones with constant coefficients. here it is: Consider xn y (n) + a1 xn−1 y (n−1) + · · · + an−1 xy (1) + an y = f (x). In this case, we take the change of variable: x 7→ z defined by x = ez . Then the equation (1) can be brought to the form Dn y + b1 Dn−1 y + · · · + bn−1 Dy + an y = f (ez ),

23

D :=

d , dz

(1)

where b1 , b2 , . . . , bn are constants. Let us consider the case of n = 2: x2 y 00 + a1 xy 0 + a2 y = f (x). Taking x = ez , dy dy dx = = y 0 x, dz dx dz d 0 dy 0 dx dy d2 y = (y x) = x + y0 = y 00 x2 + y 0 x = y 00 x2 + . 2 dz dz dz dz dz Hence we have x2 y 00 + a1 xy 0 + a2 y =



d2 y dy − dz 2 dz

 + a1

dy dy d2 y + a2 y = 2 + (a1 − 1) + a2 y. dz dz dz

Thus, the equation takes the form: dy d2 y + (a1 − 1) + a2 y = f (ez ). dz 2 dz Note also that d3 y dz 3

d 00 2 dy 00 2 dx (y x + y 0 x) = x + y 00 2x + y 00 x2 + y 0 x dz dz dz = y 000 x3 + 2y 00 x2 + y 00 x2 + y 0 x  2  d y dy dy = y 000 x3 + 3 + . − dz 2 dz dz

=

Hence, x3 y 000 + ax2 y 00 + bxy 0 + cy

= =

 2   2  d y dy d y dy d3 y dy dy − 3 − − + a − +b + cy dz 3 dz 2 dz dz dz 2 dz dz d3 y d2 y dy + (a − 3) 2 + (b − a + 3) + cy. 3 dz dz dz

24

3

System of first order linear homogeneous ODE

Consider the system: dx1 dt dx2 dt

= ax1 + bx2 = cx1 + dx2

The above system can be written in matrix notation as: #" # " # " a b x1 d x1 = dt x2 c d x2

(1)

or more compactly as: dX = AX, dt where

" X=

x1

#

x2

" ,

A=

#

a

b

c

d

.

Here, we used the convention: " # " # f0 d f = 0 . dt g g In this case we look for a solution of the form " # " # α1 eλt α1 λt X= =: e . α2 eλt α2 Substituting this into the system of equations we get " # " #" # α1 λt a b α1 λt λ e = e . α2 c d α2 Equivalently, "

#" # α1

a

b

c

d

α2

" =λ

α1 α2

# .

That is, "

#" # α1

a−λ

b

c

d−λ

α2

=

" # 0 0

.

(2)

Thus, if λ0 is a root of the equation det

" a−λ

b

#

c

d−λ

= 0,

(2) "

T

then there is a nonzero vector [α1 , α2 ] satisfying (2), and X = (1). 25

α1 α2

# eλ0 t is a solution of the system

Definition 3.1. The equation (3) is called the auxiliary equation for the system (1).

Let us consider the following cases: Case (i): Suppose the roots of the auxiliary equation (3) are real distinct, say λ1 and λ2 . Suppose " (1) # α1

" and

(1)

α2

(2)

α1

#

(2)

α2

are nonzero solutions of (2) corresponding to λ = λ1 and λ = λ2 , respectively. Then, the vector valued functions X1 =

" (1) # α1 (1)

α2

e

λ1 t

,

" (2) # α1

X2 =

(2)

α2

eλ2 t

are solutions of (1), and they are linearly independent. In this case, the general solution of (1) is given by C1 X1 + C2 X2 . Case (ii): Suppose the roots of the auxiliary equation (3) are complex non-real. Since the entries of the matrix are real, these roots " are # conjugate to each other. Thus, they are of the form α + iβ and α1 α − iβ for β 6= 0. Suppose be a nonzero solution of (2) corresponding to λ = α + iβ. The α2 numbers α1 and α2 need not be real. Thus, " # " (1) # (2) α1 α1 + iα1 = (1) (2) . α2 α2 + iα2 Then, the vector valued function " # " (1) # (2) α1 (α+iβ)t α1 + iα1 αt X := e = (1) (2) e [cos βt + i sin βt] α2 α2 + iα2 is a solution of (1). Note that X = X1 + iX2 , where

" X1 =

# (1) (2) α1 cos βt − α1 sin βt (1)

(2)

α2 cos βt − α2 sin βt

αt

e ,

X2 =

" (1) # (2) α1 sin βt + α1 cos βt (1)

(2)

α2 sin βt + α2 cos βt

eαt .

We see that X1 and X2 are also are solutions of (1), and they are linearly independent. In this case, a general solution of (1) is given by C1 X1 + C2 X2 . Case (iii): Suppose λ0 is a double root of the auxiliary equation (3). In this case there are two subcases: • There are linearly independent solutions for (2). • There is only one (up to scalar multiples) nonzero solution for (2).

26

In the first case if

" (1) # α1 (1)

α2

" and

(2)

α1

#

(2)

α2

are the linearly independent solutions of (2) corresponding to λ = λ0 , then the vector valued functions " (1) # " (2) # α1 α1 λ0 t λ0 t X1 = , X2 = (1) e (2) e α2 α2 are solutions of (1), and the general solution of (1) is given by C1 X1 + C2 X2 . " In the second case, let u := " # β1 v := is such that β2

α1 α2

# is a nonzero solution of (2) corresponding to λ = λ0 , and let

(A − λ0 I)v = u. Then X = C1 ueλ0 t + C2 [tu + v]eλ0 t is the general solution. Remark 3.2. Another method of solving a system is to convert the given system into a second order system for one of x1 and x2 , and obtain the other. ♦

27

4

Power series method

4.1

The method and some examples

Consider the differential equation: y 00 + f (x)y 0 + g(x)y = r(x).

(1)

We would like to see if the above equation has a solution of the form y=

∞ X

cn (x − x0 )n

(2)

n=0

in some interval I containing some known x0 , where c0 , c1 , . . . are to determined. Recall from calculus: Suppose the power series

∞ X

an (x − x0 )n converges at some point other than

n=0

x0 .

• There exists ρ > 0 such that the series converges at every x with |x − x0 | < ρ. • The series diverges at every x with |x − x0 | > ρ. •

∞ X

an (x − x0 )n = 0 implies an = 0 for all n = 0, 1, 2, . . ..

n=0

• The series can be differentiated term by term in the interval (x0 − r, x0 + ρ) any number of times, i.e.,

∞ ∞ X dk X n n(n − 1) · · · (n − k + 1)an (x − x0 )n−k a (x − x ) = n 0 dxk n=0 n=k

for every x with |x − x0 | < ρ and for every k ∈ N. • If f (x) :=

P∞

n=0

an (x − x0 )n for |x − x0 | < ρ, then an =

f (n) (x0 ) . n!

The above number ρ is called the radius of convergence of the series

∞ X

an (x − x0 )n .

n=0

Definition 4.1. A (real valued) function f defined in a neighbourhood of a point x0 ∈ R is said to be analytic at x0 if it can be expressed as f (x) =

∞ X

an (x − x0 )n ,

|x − x0 | < ρ,

n=0

for some ρ > 0, where a0 , a1 , . . . are real numbers. Recall that if p(x) and q(x) are polynomials given by p(x) = a0 + a1 x + · · · + an xn , 28

q(x) = b0 + b1 x + · · · + bn xn ,

then p(x)q(x) = a0 b0 + (a0 b1 + a1 b0 )x + · · · + (a0 bn + a1 bn−1 + · · · + an b0 )xn . Motivated by this, for convergent power series

∞ X

an (x − x0 )n and

n=0 ∞ X

an (x − x0 )n

n=0

∞  X

∞ X n=0

∞  X bn (x − x0 )n = cn (x − x0 )n ,

n=0

bn (x − x0 )n , we define

cn :=

n=0

n X

ak bn−k .

k=0

Now, it may be too much to expect to have a solution of the form (2) for a differential equation (1) for arbitrary continuous functions f, g r. Note that we require the solution to have only second derivative, whereas we are looking for a solution having a series expansion; in particular, differentiable infinitely many times. But, it may not be too much expect to have a solution of the form (2) if f, g, r also have power series expansions about x0 . Power series method is based on such assumptions. The idea is to consider those cases when f, g, r also have power series expansions about x0 , say f (x) =

∞ X

an (x − x0 )n ,

g(x) =

n=0

∞ X

bn (x − x0 )n ,

r(x) =

n=0

∞ X

dn (x − x0 )n ..

n=0

Then substitute the expressions for f, g, r, y and obtain the coefficients cn , n ∈ N, by comparing coefficients of (x − x0 )k for k = 0, 1, 2, . . . . Note that this case includes the situation when: • Any of the functions f, g, r is a polynomial, • Any of the functions f, g, r is a rational function, i.e., function of the form p(x)/q(x) where p(x) and q(x) are polynomials, and in that case the point x0 should not be a zero of q(x). Example 4.2. y 00 + y = 0.

(∗)

In this case, f = 0, g = 0, r = 0. So, we may assume that the equation has a solution power series expansion around any point x0 ∈ R. For simplicity, let x0 = 0, and assume that the solution is of the ∞ X form y = cn xn . Note that n=0 ∞ X

(∗) ⇐⇒

n(n − 1)cn xn−2 +

n=2

⇐⇒

∞ X

∞ X

∞ X

cn xn = 0 ⇐⇒

n=0

(n + 2)(n + 1)cn+2 xn +

n=0

n=0

⇐⇒ c2n =

(−1)n a0 , (2n)!

cn (n + 2)(n + 1)

c2n+1 =

29

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

cn x n = 0

n=0

[(n + 2)(n + 1)cn+2 + cn ]xn = 0 ⇐⇒ (n + 2)(n + 1)cn+2 + cn ⇐⇒ (n + 2)(n + 1)cn+2 = −

∞ X

∀n ∈ N0 ∀n ∈ N0 .

∀n ∈ N0 := N ∪ {0}

∞ X

Thus, if y =

cn xn is a solution of (∗), then

n=0

y=

∞ X

n

cn x =

n=0

∞ X

c2n x

2n

n=0

+

∞ X

c2n+1 x2n+1 = c0 cos x + c1 sin x

n=0

for arbitrary c0 and c1 . We can see that this, indeed, is a solution. The following theorem specifies conditions under which a power series solution is possible. THEOREM 4.3. Let p, q r be analytic at a point x0 . Then every solution of the equation y 00 + p(x)y 0 + q(x)y = r(x) can be represented as a power series in powers of x − x0 .

4.2

Legendre’s equation and Legendre polynomials

The differential equation (1 − x2 )y 00 − 2xy 0 + α(α + 1)y = 0

(∗)

is called Legendre equation. Here, α is a real constant. Note that the above equation can also be written as

dy i d h (1 − x2 ) + α(α + 1)y = 0. dx dx Note that (∗) can also be written as y 00 −

2xy 0 α(α + 1)y + = 0. 1 − x2 1 − x2

It is of the form (1) with f (x) = −

2x , 1 − x2

g(x) =

α(α + 1) , 1 − x2

r(x) = 0.

Clearly, f, g, r are rational functions, and have power series expansions around the point x0 = 0. Let ∞ X us assume that a solution of (∗) is of the form y = cn xn . Substituting the expressions for y, y 0 , y 00 n=0

into (∗), we obtain 2

(1 − x )

∞ X

n(n − 1)cn x

n−2

n=2

i.e.,

∞ X n=2

i.e.,

∞ X

n(n − 1)cn xn−2 −

ncn x

n−1

+ α(α + 1)

n=1

∞ X

n(n − 1)cn xn −

n=2

(n + 2)(n + 1)cn+2 xn −

n=0

− 2x

∞ X

∞ X

∞ X n=0

∞ X

2ncn xn + α(α + 1)

n=1

n(n − 1)cn xn −

n=2

∞ X n=1

30

cn xn = 0,

∞ X

cn xn = 0,

n=0

2ncn xn +

∞ X n=0

α(α + 1)cn xn = 0.

Equating coefficients of xk to 0 for k ∈ N0 , we obtain 6c3 − 2c1 + α(α + 1)c1 = 0,

2c2 + α(α + 1)c0 = 0,

(n + 2)(n + 1)cn+2 + [−n(n − 1) − 2n + α(α + 1)]cn = 0, i.e., 2c2 + α(α + 1)c0 = 0,

6c3 + [−2 + α(α + 1)]c1 = 0,

(n + 2)(n + 1)cn+2 + (α − n)(α + n + 1)cn = 0, i.e., c2 = −

α(α + 1) c0 , 2

c3 =

−2 + α(α + 1) c1 , 6

cn+2 = −

(α − n)(α + n + 1) cn . (n + 2)(n + 1)

Note that if α = k is a positive integer, then coefficients of xn+2 is zero for n ∈ {k, k + 1, . . .}. Thus, in this case we have y = y1 (x) + y2 (x), where: • If α = k is an even integer, then y1 (x) is a polynomial of degree k with only even powers of x, and y2 (x) is a power series with only odd powers of x, • If α = k is an odd integer, then y2 (x) is a polynomial of degree k with only odd powers of x, and y1 (x) is a power series with only even powers of x. Now, suppose α = k is a positive integer. Then, from the iterative formula cn+2 = −

(α − n)(α + n + 1) cn (n + 2)(n + 1)

we have ck 6= 0 and ck+2 = 0 so that ck+2j = 0

for j ∈ N.

ck−2 = −

k(k − 1) ck , 2(2k − 1)

Thus,

ck−4 = − ck−6 = −

(k − 2)(k − 3) k(k − 1)(k − 2)(k − 3) ck−2 = (−1)2 ck . 4(2k − 3) 2.4.(2k − 1)(2k − 3)

(k − 4)(k − 5) k(k − 1)(k − 2)(k − 3)(k − 4)(k − 5) ck−4 = (−1)3 ck . 6(2k − 5) 2.4.6(2k − 1)(2k − 3)(2k − 5)

In general, for 2` < k, ck−2`

k(k − 1)(k − 2) · · · (k − 2` + 1) ck [2.4. · · · (2`)](2k − 1)(2k − 3) · · · (2k − 2` + 1) k!(2k − 2)(2k − 4) · · · (2k − 2`) = (−1)` ck (k − 2`)!2` `!(2k − 1)(2k − 2)(2k − 3)(2k − 4) · · · (2k − 2` + 1)(2k − 2`) k!2` (k − 1)(k − 2) · · · (k − `) = (−1)` ck (k − 2`)!2` `!(2k − 1)(2k − 2)(2k − 3)(2k − 4) · · · (2k − 2` + 1)(2k − 2`) k!(k − 1)!(2k − 2` − 1)! = (−1)` ck (k − 2`)!`!(k − ` − 1)!(2k − 1)! =

(−1)`

31

Taking ck := it follows that ck−2` = (−1)`

(2k)! 2k (k!)2

(2k − 2`)! . 2k `!(k − `)!(k − 2`)!

Definition 4.4. The polynomial Pn (x) =

Mn X

(−1)`

`=0

(2n − 2`)! xn−2` 2n `!(n − `)!(n − 2`)!

is called the Legendre polynomial of degree n. Here, Mn = n/2 if n is even and Mn = (n − 1)/2 if ♦

n is odd. Recall Pn (x) =

Mn X

(−1)k

k=0

(2n − 2k)! xn−2k . 2n k!(n − k)!(n − 2k)!

It can be seen that P0 (x) = 1,

P1 (x) = x,

P2 (x) =

1 3 2 (x − 1), P2 (x) = (5x3 − 3x), 2 5 1 P5 (x) = (63x5 − 70x3 + 15x). 8

1 (35x4 − 30x2 + 3), 8 Mn X (2n − 2k)! (−1)k n (−x)n−2k = (−1)n Pn (x). Pn (−x) = 2 k!(n − k)!(n − 2k)! P4 (x) =

k=0

Rodrigues’ formula:

Pn (x) =

Let

1 dn 2 (x − 1)n . n!2n dxn

n X (−1)r (n Cr )x2n−2r . f (x) = (x − 1) = 2

n

r=0

Then

M1 X f (x) = (−1)r (n Cr )(2n − 2r)x2n−2r−1 , 0

r=0

f 00 (x) =

M2 X

(−1)r (n Cr )(2n − 2r)(2n − 2r − 1)x2n−2r−2 ,

r=0

n

f (x)

=

Mn X

(−1)r (n Cr )[(2n − 2r)(2n − 2r − 1) · (2n − 2r − n + 1)]x2n−2r−n ,

r=0

=

Mn X (−1)r (n Cr )[(2n − 2r)(2n − 2r − 1) · (n − 2r + 1)]xn−2r , r=0

=

Mn X (−1)r

=

n!2n Pn (x),

r=0

(2n − 2r)! n−2r n! x r!(n − r)! (n − 2r)!

32

Generating function: √

∞ X 1 = Pn (x)un . 1 − 2xu + u2 n=0

For a fraction β, we use the expansion: (1 + α)β = 1 +

∞ X

(β Cn )αn ,

(β Cn ) :=

n=1

1 [β(β − 1) · · · (β − n + 1)]. n!

Thus, for β = −1/2, −1/2

(

  1   1  1  1  1 − − 1 − − 2 ··· − − n + 1 Cn ) = − n! 2 2 2 2      2n − 1  3 5 1 1 ··· = (−1)n n! 2 2 2 2 h i 1 (2n)! = (−1)n n!2n 2n n! (2n)! = (−1)n 2n . 2 (n!)2

Thus, − 12

(1 − α)

=

∞ X

an αn ,

an := (−1)n

n=0

(2n)! . 22n (n!)2

Also, 2 n

(2xu − u ) =

n X k=0

n

X n! n! (−1)k 2n−k (2xu)n−k (−u2 )k = xn−k un+k . k!(n − k)! k!(n − k)! k=0

Thus, (2xu − u2 )n =

n X

bn,k xn−k un+k ,

bn,k = (−1)k 2n−k

k=0

n! . k!(n − k)!

2

Taking α = 2xu − u , we have 1

(1 − 2xu + u2 )− 2

=

∞ X

an

n=0

n hX

bn,k xn−k un+k

i

k=0

= a0 + a1 b1,0 xu + (a1 b1,1 + a2 b2,0 x2 )u2 +(a2 b2,1 x + a3 b3,0 x3 )u3 +(a2 b2,2 + a3 b3,1 x2 + a4 b4,4 x4 )u4 + · · · = f0 (x) + f1 (x)u + f2 (x)u2 + · · · , where fn (x) =

Mn X

an−k bn−k,k xn−2k .

k=0

Since an−k bn−k,k =

(n − k)! n−2k (2n − 2k)! [2(n − k)]! (−1)k 2 = (−1)k n , (2n−k )2 [(n − k)!]2 k!(n − 2k)! 2 k!(n − k)!(n − 2k)!

33

we have fn (x) = Pn (x). Thus, √ Note that, taking x = 1,

∞ X 1 = Pn (x)un . 1 − 2xu − u2 n=0

∞ X

∞ X 1 = Pn (1)un 1 − u n=0

un =

n=0

so that Pn (1) = 1 for all n. Recurrence formulae: 1. (n + 1)Pn+1 (x) = (2n + 1)xPn (x) − nPn−1 (x). 0 2. nPn = xPn0 (x) − Pn−1 (x). 0 0 3. (2n + 1)Pn+1 (x) = Pn+1 (x) − nPn−1 (x). 0 0 4. Pn+1 (x) = xPn−1 (x) − nPn−1 (x).

5. (1 − x2 )Pn0 (x) = n[Pn−1 (x) − xPn (x)]. 1

Proofs. 1. Recall that the generating function for (Pn ) is (1 − 2xt + t2 )− 2 , i.e., 1

(1 − 2xt + t2 )− 2 =

∞ X

Pn (x)tn .

n=0

Differentiating with respect to t: 3

(x − t)(1 − 2xt + t2 )− 2 =

∞ X

nPn (x)tn−1

n=1

⇐⇒ 1

(x − t)(1 − 2xt + t2 )− 2 = (1 − 2xt + t2 )

∞ X

nPn (x)tn−1

n=1

⇐⇒ (x − t)

∞ X

Pn (x)tn = (1 − 2xt + t2 )

n=0

∞ X

nPn (x)tn−1 = (1 − 2xt + t2 )

n=1

∞ X

(n + 1)Pn+1 (x)tn .

n=0

n

Equating the coefficients of t , we obtain xPn x − Pn−1 (x) = (n + 1)Pn+1 (x) − 2x nPn (x) + (n − 1)Pn−1 (x), i.e., (n + 1)Pn+1 (x) = (2n + 1)xPn (x) − nPn−1 (x). 34

2. Differentiating with respect to t: 2 − 23

(x − t)(1 − 2xt + t )

=

∞ X

nPn (x)tn−1

n=1

Differentiating with respect to x: 2 − 23

t(1 − 2xt + t )

=

∞ X

Pn0 (x)tn

n=0

Hence, 3

(x − t)t(1 − 2xt + t2 )− 2 =

∞ X

nPn (x)tn =

n=1

Thus, (x − t)

∞ X

Pn0 (x)tn =

n=0 n

Equating the coefficients of t , we obtain nPn =

∞ X

nPn (x)tn

n=0 ∞ X

nPn (x)tn

n=0

xPn0 (x)

0 − Pn−1 (x).

3. Differentiating the recurrence relation in (1) with respect to x and then using the expression for xPn0 (x) from (2), we get the result in (3). 4. Differentiating the recurrence relation in (1) with respect to x leads to 0 0 (n + 1)Pn+1 (x) = (2n + 1)Pn (x) + (n + 1)xPn0 (x) + n[xPn0 (x) − Pn−1 (x)].

Now, using (2) and replacing n by n − 1 leads to the required relation. 5. Recurrence relation in (2) and (4) imply the required relation. Exercise 4.5.

1. Show that Pn0 (1) =

n(n+1) . 2

(Hint: Use the fact that Pn (x) satisfies the Legendre equation.) 2. Using generating function derive (a) Pn (−1) = (−1)n , (b) Pn (−x) = (−1)n Pn (x). (Hind: Replace x by y := −x and then t by τ := −t.) Z 1 Z 1 Z 1 3. Find values of x[Pn (x)]2 dx, x2 [Pn (x)]2 dx, x2 Pn+1 (x)Pn−1 (x)dx. −1

−1

−1

(Hint: Use recurrence formula.) 4. Prove that for every polynomial q(x) of degree n, there exists a unique (n+1)-tuple (a0 , a1 , . . . , an ) of real numbers such that q(x) = a0 P0 (x) + a1 P1 (x) + . . . an Pn (x). (Hint: use induction on degree.) ♦

35

4.3

Power series solution around singular points

Look at the DE: x2 y 00 − (1 + x)y = 0. ∞ X Does it have a nonzero solution of the form an xn ? Following our method of substitution and n=0

determination of coefficients, it can be see that an = 0 for all n ∈ N0 . What went wrong? Note that the above DE is same as y 00 −

1+x y = 0, x2

which is of the form y 00 + p(x)y 0 + q(x)y = 0

(1) 1+x with p(x) = 0 and q(x) = . Note that p(x) is not analytic at x0 = 0. x2 Definition 4.6. A point x0 ∈ R is called a regular point of (1) if p(x) and q(x) are analytic at x0 . If x0 is not a regular point of (1), then it is called a singular point of (1). y Example 4.7. 1. Consider (x − 1)y 00 + xy 0 + = 0. This takes the form (1) with x x 1 p(x) = , q(x) = . x−1 x(x − 1)

Note that x = 0 and x = 1 are singular points of the DE. All other points in R are regular points. 2. Consider the Cauchy equation: x2 y 00 + 2xy 0 − 2y = 0. This takes the form (1) with 2 2 , q(x) = 2 . x x Note that x = 0 is the only singular point of this DE. p(x) =

♦ Definition 4.8. A singular point x0 ∈ R of the DE (1) is called a regular singular point if (x − x0 )p(x) and (x − x0 )2 q(x) are analytic at x0 . Otherwise, x0 is called an irregular singular ♦

point of (1). Example 4.9. Consider x2 (x − 2)y 00 + 2y 0 + (x + 1)y = 0. This takes the form (1) with p(x) = Note that

2 , x2 (x − 2)

q(x) =

x+1 . x2 (x − 2)

2 x+1 , x2 q(x) = , x(x − 2) x−2 2 (x + 1)(x − 2) (x − 2)p(x) = 2 , (x − 2)2 q(x) = . x x2 xp(x) =

We see that 36

• x = 0 is an irregular singular point, • x = 2 is a regular singular point. ♦ Example 4.10. Consider the DE y 00 +

b(x) 0 c(x) y + 2 y = 0, x x

where a(x) and b(x) are analytic at 0. Note that the above equation is of the form (1) with p(x) = and q(x) =

4.3.1

c(x) x2 .

Thus, 0 is a regular singular point of the given DE.

b(x) x ♦

Frobenius method

It is known that a DE of the form y 00 +

b(x) 0 c(x) y + 2 y = 0, x x

(1)

where a(x) and b(x) are analytic at 0 has a solution of the form y(x) = xr

∞ X

an xn ,

n=0

for some real or complex number r and for some real numbers a0 , a1 , a2 , . . . with a0 6= 0. Note that (∗) is same as x2 y 00 + xb(x)y 0 + c(x)y = 0

(2)

and it reduces to the Euler–Cauchy equation when b(x) and c(x) are constant functions. Substituting the expression for y in (2) into (1), we get: x2

∞ X

(n + r)(n + r − 1)an xn+r−2 + xb(x)

∞ X

(n + r)an xn+r−1 + c(x) = 0.

n=0

n=0

That is,

∞ X

(n + r)(n + r − 1)an xn+r + b(x)

n=0

∞ X

(n + r)an xn+r + c(x) = 0.

n=0

Let b(x) =

∞ X

bn x n ,

c(x) =

n=0

∞ X

cn x n .

n=0

r

Comparing comparing coefficients of x , we get [r(r − 1) + b0 r + c0 ]a0 = 0. This quadratic equation is called the indicial equation of (1). 37

(3)

Let r1 , r2 be the roots of the indicial equation. Then one of the solutions is ∞ X

y1 (x) = xr1

an xn ,

n=0

where a0 , a1 , . . . are obtained by comparing coefficients of xn+r , n = 0, 1, 2, . . ., in (3) for r = r1 . Another solution, linearly independent of y1 is obtained using the method of variation of parameter. Recall that, in the method of variation of parameter, • the second solution y2 is assumed to be of the form y2 (x) = u(x)y1 (x), • substituting the expressions for y2 , y20 , y200 in (2), • use the fact that y1 (x) satisfies (2), • obtain a first order ODE for u(x), and • solve it to obtain an expression for u(x). We have seen that Z y2 (x) = y1 (x)

R

e− p(x) dx, [y1 (x)]2

p(x) :=

a(x) . x

In case y1 (x) is already in a simple form, then the above expression can be used. Otherwise, one may use the above mentioned steps to reach appropriated expression for y2 (x) by making use of the series expression for y1 (x). By the above procedure we have the following (see Kreiszig): Case 1: If r1 and r2 distinct and not differing by an integer, then y2 is of form y2 (x) = xr1

∞ X

An x n .

n=0

Case 2: If r1 = r2 = r, say, i.e., r is a double root, then y2 is of the form y2 (x) = y1 (x) ln(x) + xr

∞ X

An x n .

n=1

Case 3: If r1 and r2 differ by an integer and r2 > r1 , then y2 is of the form y2 (x) = ky1 (x) ln(x) + xr2

∞ X

An x n .

n=0

The method described above is called the Frobenius method3 . 3 George

Frobenius (1849–1917) was a German mathematician.

38

Example 4.11. Let us ind linearly independent solutions for the Euler-Cauchy equation: x2 y 00 + b0 xy 0 + c0 y = 0. Note that this is of the form (2) with b(x) = b0 , c(x) = c0 , constants. Assuming a solution is of the P∞ form y = xr n=0 an xn , we obtain ∞ X

(n + r)(n + r − 1)an xn+r + b0

n=0

∞ X

(n + r)an xn+r + c0 = 0.

n=0

Now, equating the coefficient of xr to 0, we get the indicial equation as [r(r − 1) + b0 r + c0 ]a0 = 0, a0 6= 0, so that r2 − (1 − b0 )r + c0 = 0. For a root r and n ∈ N, [(n + r)(n + r − 1) + (n + r)b0 ]an = 0, i.e., (n + r)[(n + r − 1) + b0 ]an = 0, i.e., [(n + r − 1) + b0 ]an = 0 ∀ n ∈ N. We can take an = 0 for all n ∈ N. Thus, y1 (x) = xr . The other solution is given by Z y2 (x) = y1 (x)

R

e− p(x) dx, [y1 (x)]2

p(x) :=

a(x) . x

Thus, y2 (x) = x

r

Z

R

e− p(x) dx, x2r

p(x) :=

b0 , i.e., y2 (x) = xr x

Z

1 x2r+b0

dx.

If r is a double root, then 2r + b0 = 1 so that y2 (x) = xr ln(x). If r is not a double root, then y2 (x) = x

r

Z

1 1 dx = . x2r+b0 −(2r + b0 − 1)xr+b0 −1

If r = r1 and r2 are the roots, then we have r1 + r2 = 1 − b0 so that r + b0 − 1 and hence, y2 (x) =

x r2 . −(2r1 + b0 − 1)

Thus, xr1 and xr2 are linearly independent solutions.

Example 4.12. Consider the DE: x(x − 1)y 00 + (3x − 1)y 0 + y = 0.

39

(∗)

This is of the form (1) with b(x) =

P∞ 3x − 1 x , c(x) = . Now, taking y = xr n=0 an xn , we obtain x−1 x−1

from (1): x(x − 1)y 00

(x2 − x)

=

∞ X

(n + r)(n + r − 1)an xn+r−2

n=0 ∞ X

=

(n + r)(n + r − 1)an xn+r −

n=0

(3x − 1)y 0

(n + r)(n + r − 1)an xn+r−1

n=0

(3x − 1)

=

∞ X

∞ X

(n + r)an xn+r−1

n=0 ∞ X

=

∞ X

3(n + r)an xn+r −

n=0

(n + r)an xn+r−1 .

n=0

Hence, (∗): ∞ X

[(n + r)(n + r − 1) + 3(n + r) + 1]an xn+r +

n=0

∞ X

[−(n + r)(n + r − 1) − (n + r)]an xn+r−1 = 0.

n=0

Equating coefficient of x

r−1

to 0, we get the indicial equation as −r(r − 1) − r = 0, i.e., r2 = 0. Thus,

r = 0 is a double root of the indicial equation. Hence, we obtain: ∞ X

[(n)(n − 1) + 3(n) + 1]an xn +

∞ X

[−(n)(n − 1) − (n)]an xn−1 = 0,

n=1

n=0

i.e., ∞ X

(n + 1)2 an xn −

∞ X

n2 an xn−1 = 0,

∞ X

i.e.,

∞ X

(n + 1)2 an+1 xn = 0.

n=0

n=0

n=1

n=0

(n + 1)2 an xn −

Thus, an+1 = an for all n ∈ N0 , and consequently, taking a0 = 1, y1 (x) =

∞ X

xn =

n=0

a0 . 1−x

Now, Z y2 (x) = y1 (x) Note that Z

Z p(x)dx

= =

3 dx − x−1

Z

R

e− pdx dx, [y1 (x)]2

1 dx = x(x − 1)

p(x) :=

Z

3x − 1 . x(x − 1)

3 dx + x−1

Z

1 dx − x

Z

1 dx x−1

3 ln |x − 1| + ln |x| − ln |x − 1| = 2 ln |x − 1| + ln |x| = ln |(x − 1)2 x|, R

e− pdx 1 1 = = . 2 2 2 [y1 (x)] |(x − 1) x|[y1 (x)] x Thus, y2 (x) =

ln(x) . 1−x ♦

40

Example 4.13. Consider the DE: (x2 − 1)x2 y 00 − (x2 + 1)xy 0 + (x2 + 1)y = 0. This is of the form (1) with b(x) = −

(∗)

P∞ x2 + 1 (x2 + 1) , c(x) = 2 . Now, taking y = xr n=0 an xn , we 2 (x − 1) x −1

obtain from (1): (x2 − 1)x2 y 00

=

(x2 − 1)

∞ X

(n + r)(n + r − 1)an xn+r

n=0

=

∞ X

(n + r)(n + r − 1)an xn+r+2 −

n=0

(x2 + 1)xy 0

=

∞ X

(n + r)(n + r − 1)an xn+r

n=0

(x2 + 1)

∞ X

(n + r)an xn+r

n=0

= (x2 + 1)y

=

∞ X

∞ X

(n + r)an xn+r+2 +

n=0 ∞ X

(n + r)an xn+r ,

n=0

an xn+r+2 +

n=0

∞ X

an xn+r .

n=0

Thus, (∗) takes the form ∞ X

[(n + r)(n + r − 1) − (n + r) + 1]an xn+r+2 +

∞ X

[−(n + r)(n + r − 1) − (n + r) + 1]an xn+r = 0. (∗∗)

n=0

n=0

Equating coefficient of xr to 0, we get the indicial equation as [−r(r − 1) − r + 1]a0 = 0,

i.e., (r2 − 1) = 0.

The roots are r1 = 1 and r2 = −1. For r1 = 1, (∗∗) takes the form ∞ X

[(n + 1)n − (n + 1) + 1]an xn+3 +

n=0

i.e.,

∞ X

[−(n + 1)n − (n + 1) + 1]an xn+1 = 0,

n=0

∞ X n=0

n2 an xn+3 −

∞ X

n(n + 2)an xn+1 = 0,

i.e.,

n=0

This implies a1 = 0 and n2 an − (n + 2)(n + 4)an+2 = 0 ∀ n ∈ N. Hence, an = 0 for all n ∈ N so that y(x) = x. Taking y1 (x) = x, we obtain the second solution y2 as Z y2 (x) = y1

R

e− p , y12

where     x2 + 1 (x2 − 1) + 2 1 2 1 1 1 p=− 2 =− 2 =− + =− + − . (x − 1)x x − 1)x x (x2 − 1)x x−1 x+1 x 41

Hence, e−

x2 − 1 so that x     Z Z 2 Z −R p 1 x2 − 1 1 x −1 e =x dx = x ln(x) + 2 . y2 (x) = y1 dx = x y12 x2 x x3 2x R

p

=

Thus, y1 = x,

y2 = x ln(x) +

1 2x ♦

are linearly independent solutions. P∞

Remark 4.14. It can be seen that if we take the solution as y = xr

n=0

An xn with r = −1, then

we arrive at An = 0 so that it violates our requirement, and the resulting expression will not be a ♦

solution.

4.3.2

Bessel’s equation

Bessel’s equation is given by x2 y 00 + xy 0 + (x2 − ν 2 )y = 0 where ν is a non-negative real number. This is a special case of the equation y 00 + p(x)y 0 + q(x)y = 0 where p, q are such that xp(x) and x2 q(x) are analytic at 0, i.e., 0 is a regular singular point. Thus, Frobenius method can be applied. Taking a solution y of the form y = xr

∞ X

an xn , we have

n=0 ∞ X

(n + r)(n + r − 1)an x

n+r

n=0

+

∞ X

(n + r)an x

n+r

n=0

+

∞ X

n+r

(an−2 x

n=2

∞ X

ν 2 an xn+r = 0.

n=0

Coefficient of xr is 0 ⇐⇒ [r(r − 1) + r − ν 2 ]a0 ⇐⇒ r2 − ν 2 = 0. Coefficient of xr+1 is 0 ⇐⇒ [(r + 1)2 − ν 2 ]a1 = 0 Coefficient of xr+n :

[(n + r)(n + r − 1) + (n + r) − ν 2 ]an + an−2 .

Thus, roots of the indicial equation are r1 = ν, r2 = −ν. Taking r = r1 = ν, we have a1 = 0 and an = −

an−2 an−2 =− 2 , 2 (n + r)(n + r − 1) + (n + r) − ν n + 2nν

n = 2, 3, . . . .

Hence, a2n−1 = 0 for all n ∈ N and a2n = −

a2n−2 a2n−2 =− 2 , (2n)2 + 4nν 2 n(n + ν)

n ∈ N.

It is a usual convention to take 1 a0 = ν , 2 Γ(ν + 1)

Z Γ(α) := 0

42

e−t tα−1 dt,

α > 0.

Recall that Γ(α + 1) = αΓ(α). Then we have a2 = −

a0 1 1 = − 2+ν = − 2+ν , 22 (1 + ν) 2 (ν + 1)Γ(ν + 1) 2 Γ(ν + 2) a4 = −

a2 2 2 2(2 +

ν)

= (−1)2

1 24+ν 2Γ(ν

+ 3)

,

(−1)n . 22n+ν n!Γ(ν + n + 1)

a2n = The corresponding solution is Jν (x) =

∞ X

(−1)n x2n+ν , 2n+ν n!Γ(n + ν + 1) 2 n=0

which is called the Bessel function of the first kind of order ν. Observe: • Since the Bessel equation involves only ν 2 , it follows that ∞ X

J−ν (x) =

n=0

(−1)n x2n−ν − ν + 1)

22n−ν n!Γ(n

is also a solution. • If ν is not an integer, then Jν (x) and J−ν (x) are linearly independent solutions. • If ν is an integer, then say ν = k ∈ N then J−k (x) = (−1)k Jk (x)

(∗)

say ν = k ∈ N then so that J−k and Jk are linearly dependent. To see the above relation (∗), note that Jk (x)

= =

∞ X n=0 ∞ X n=0

Also, J−ν (x) =

(−1)n x2n+k , + n + 1)

22n+k n!Γ(k

(−1)n x2n+k , + k)!

22n+k n!(n

∞ X

(−1)n x2n−ν . 2n−ν n!Γ(n − ν + 1)! 2 n=0

It can be seen that if n = 1, 2, . . . , ν − 1, then Γ(n − ν − k) → ∞ as ν → n. Hence for ν = −k, k ∈ N, J−k (x)

= = = =

∞ X

(−1)n x2n−k , 2n−k n!Γ(n − k + 1) 2 n=0 ∞ X n=k ∞ X

(−1)n x2n−k − k)!

22n+k n!(n

(−1)n+k x2n+k 2n+k (n + k)!n! 2 n=0 (−1)k Jk (x). 43

Now, for an integer k, for obtaining a second solution of the Bessel equation which is linearly independent of Jk , we can use the general method, i.e., write the Bessel equation as y 00 + p(x)y 0 + q(x0y = 0 e−

Z and knowing a solution y1 , obtain y2 := y1 (x)

p(x) =

R

p(x)dx

y12

1 , x

q(x) =

dx. Note that x2 − k 2 . x2

Thus, the second solution according to the above formula is Z dx Yk (x) = Jk (x) . x[Jk (x)]2 This is called the Bessel equation of the second kind of order k. Now, we observe few more relations: 0

1. (xν Jν (x)) = xν Jν−1 (x). 0

2. (x−ν Jν (x)) = −x−ν Jν+1 (x). 3. Jν−1 (x) + Jν+1 (x) =

2ν x Jν (x).

4. Jν−1 (x) − Jν−1 (x) = 2Jν0 (x). Proofs: Note that (xν Jν (x))

0

= = =

∞ X

(−1)n

n=0 ∞ X

(−1)n

n=0 ∞ X

(−1)n

n=0

=

=

ν

∞ X

(2n + 2ν)x2n+2ν−1 22n+ν n!Γ(n + ν + 1) 2(n + ν)x2n+2ν−1 22n+ν n!(n + ν)Γ(n + ν) x2n+2ν−1 22n+ν−1 n!Γ(n + ν)

(−1)n

n=0

x Jν−1 (x).

44

x2n+2ν−1 22n+ν−1 n!Γ(n

+ ν)

This proves (1). To prove (2), note that x−ν Jν (x)

0

∞ X

=

(−1)n

n=1 ∞ X

2nx2n−1 22n+ν n!Γ(n + ν + 1)

(−1)n+1

=

n=0 ∞ X

(−1)n+1

=

n=0

= x−ν

∞ X

2(n + 1)x2n+1 22n+ν+2 (n + 1)!Γ(n + ν + 2) x2n+1 22n+ν+1 n!Γ(n

(−1)n+1

n=0 −ν −x Jν+1 (x).

=

+ ν + 2)

x2n+ν+1 + ν + 2)

22n+ν+1 n!Γ(n

Proofs of (3) & (4): From (1) and (2), Jν−1 (x) + Jν+1 (x)

0 0 = x−ν (xν Jν (x)) − xν x−ν Jν (x) = x−ν [xν Jν0 (x) + νxν−1 Jν (x)] − xν [x−ν Jν0 (x) − νx−ν−1 Jν (x)] 2ν Jν (x). = x

Jν−1 (x) − Jν+1 (x)

0 0 = x−ν (xν Jν (x)) + xν x−ν Jν (x) = x−ν [xν Jν0 (x) + νxν−1 Jν (x)] + xν [x−ν Jν0 (x) − νx−ν−1 Jν (x)] =

Using the fact Γ( 21 ) =

2Jν0 (x).

π, it can be shown (verify!) that r J 12 =

4.4

2 sin x, πx

r J− 12 =

2 cos x. πx

Orthogonality of functions

Definition 4.15. Functions f and g defined on an interval [a, b] are said to be orthogonal with respect to a nonzero weight function w if Z

b

f (x)g(x)w(x)dx = 0. a

A sequence (fn ) of functions is said to be an orthogonal sequence of functions with respect to w if Z

b

fi (x)fj (x)w(x)dx = 0 for i 6= j. a

[Here, we assume that the above integral exits; that is the case, if for example, they are continuous ♦

or bounded and piece-wise continuous.]

45

Note that

(

Z

sin(nx) sin(mx)dx = 0

Z

(

cos(nx) cos(mx)dx = 0

Z

0

if n 6= m,

π

if n 6= m,

0

if n 6= m,

π

if n 6= m,

sin(nx) cos(mx)dx = 0. 0

Thus, writing f2n−2 (x) = cos(nx),

f2n−1 (x) = sin(nx)

for

n ∈ N,

then (fn ) is an orthogonal sequence of functions with respect to w = 1. Notation: We shall denote Z hf, giw :=

b

fi (x)fj (x)w(x)dx a

and call this quantity as the scalar product of f and g with respect to w. If w(x) = 1 for every x ∈ [a, b], then we shall denote hf, gi := hf, giw . We observe that • hf, f iw ≥ 0, • hf + g, hiw = hf, hiw + hg, hiw , • hcf, f iw = chf, f iw . If f, g, w are continuous functions, then • hf, f iw = 0 ⇐⇒ f = 0. Exercise 4.16. Let f1 , , . . . , fn be linearly independent continuous functions. Let g1 = f1 and for j = 1, . . . , n, define g1 , . . . , gn iteratively as follows: gj+1 = fj+1 − hfj+1 , g1 iw g1 − hfj+1 , g2 iw g2 − · · · hfj+1 , gj iw gj , i.e., gj+1 = fj+1 −

j X

hfj+1 , fi iw fi ,

j = 1, . . . , n − 1

j = 1, 2, . . . , n−1. Prove that g1 , . . . , gn are orthogonal functions

i=1

with respect to w.

Definition 4.17. Functions f1 , f2 , . . . are said to be linearly independent if for every n ∈ N, f1 , . . . , fn are linearly independent, i.e., for every n ∈ N, if α1 , . . . , αn are scalars such that α1 f1 + · · · + αn fn = 0, then αi = 0 for i = 1, . . . , n.

Definition 4.18. A sequence (fn ) on [a, b] is said to be an orthonormal sequence of functions with respect to w if (fn ) is an orthogonal sequence with respect to w and hfn , fn iw = 1 for every j ∈ N. ♦ Exercise 4.19. Let fj (x) = xj−1 for j ∈ N. Find g1 , g2 , . . . as per the formula in Exercise 4.16 with w(x) = 1 and [a, b] = [−1, 1]. Observe that, for each n ∈ N, gn is a scalar multiple of the Legendre ♦

polynomial Pn−1 . 46

4.4.1

Orthogonality of Legendre polynomials

Recall that for non-negative integers n, the Legendre equation is given by (1 − x2 )y 00 − 2xy 0 + λn y = 0,

λn := n(n + 1).

This equation can be written as: [(1 − x2 )y 0 ]0 + λn y = 0.

(∗)

Recall that for each n ∈ N0 , the Legendre polynomial Pn (x) =

Mn X

(

(2n − 2k)! xn−2k , (−1)k n 2 k!(n − k)!(n − 2k)!

n 2 n−1 2

Mn :=

k=0

if n even, if n odd

satisfies the equation (∗). Thus, [(1 − x2 )Pn0 ]0 + λn Pn = 0,

(∗)1

0 0 [(1 − x2 )Pm ] + λm Pm = 0.

(∗)2

=⇒ [(1 − x2 )Pn0 ]0 Pm + λn Pn Pm = 0,

0 0 [(1 − x2 )Pm ] Pn + λm Pm Pn = 0

=⇒ 0 0 {[(1 − x2 )Pn0 ]0 Pm − [(1 − x2 )Pm ] Pn } + (λn − λm )Pn Pm = 0,

i.e., 0 [(1 − x2 )Pn0 Pm ]0 − [(1 − x2 )Pm Pn ]0 + (λn − λm )Pn Pm = 0

=⇒ Z

1

{[(1 − x

2

)Pn0 Pm ]0

− [(1 − x

2

0 )Pm Pn ]0 }dx

Z

1

+ (λn − λm )

−1

Pn Pm dx = 0 −1

i.e., Z

1

(λn − λm )

Pn Pm dx = 0. −1

Thus, Z n 6= m

=⇒ λn 6= λm

1

=⇒

Pn Pm dx = 0. −1

Using the expression for Pn , it can be shown that Z 1 Pn2 dx = −1

2 . 2n + 1

Hence, •

nq

2n+1 2

P n : n ∈ N0

o

is an orthonormal sequence of polynomials.

Remark 4.20. Recall that for n ∈ N0 , the Legenendre polynomial Pn (x) is of degree n and the P0 , P1 , P2 , . . . are orthogonal. Hence P0 , P1 , P2 , . . . are linearly independent. We recall the following result from Linear Algebra: 47

• If q0 , q1 , . . . , qn are polynomials which are 1. linearly independent and 2. degree of qj is atmost n for each j = 0, 1, . . . , n, then every polynomial q of degree at most n can be uniquely represented as q = c0 q0 + c1 q1 + . . . + cn qn . In the above if q0 , q1 , . . . , qn are orthogonal also, i.e., hqj , qk i = 0 for j 6= k, then we obtain cj =

hq, qj i , hqj , qj i

j = 0, 1, . . . , n.

Thus, q=

n X

cj qj =

j=0

n X hq, qj i qj . hq j , qj i j=0

In particular: • If q is a polynomial of degree n, then n X hq, Pj i Pj , q= hP j , Pj i j=0

where P0 , P1 , . . . are Legendre polynomials. From Real Analysis, we recall that: • For every continuous function f defined on a closed and bounded interval [a, b], there exists a sequence (qn ) of polynomials such that (qn ) converges to f uniformly on [a, b], i.e., for every ε > 0 there exists a positive integer Nε such that |f (x) − qn (x)| ≤ ε

∀ n ≥ Nε ,

∀ x ∈ [a, b].

The above result is known as Weierstrass approximation theorem. Using the above result it can be shown that: • If q0 , q1 , . . . , are nonzero orthogonal polynomials on [a, b] such that max deg(qj ) ≤ n, then 0≤j≤n

every continuous function f defined on [a, b] can be represented as f=

∞ X

cj qj ,

cj :=

j=0

hq, qj i , hqj , qj i

j ∈ N0 .

The equality in the above should be understood in the sense that kf −

∞ X

cj qj k → 0

j=n

where kgk2 := hg, gi. 48

as

n→∞

(∗)

The expansion in (∗) above is called the Fourier expansion of f with respect to the orthogonal polynomials qn , n ∈ N0 . If we take P0 , P1 , P2 , . . . on [−1, 1], then the corresponding Fourier expansion ♦

is known as Fourier–Legendre expansion.

4.4.2

Orthogonal polynomials defined by Bessel functions

Recall that for a positive integer n ∈ N, the Bessel function of the first kind of order n is given by Jn (x) =

∞ X j=0

(−1)j x2j+n + j + 1)

22j+n j!Γ(n

is a power series, and it satisfies he Bessel equation: x2 Jn00 + xJn0 + (x2 − n2 )Jn = 0. THEOREM 4.21. If α and β are zeros of Jn (x) in the interval [0, 1], then ( Z 1 0 if α 6= β, xJn (αx)Jn (βx)dx = 1 J (α), if α = β. 0 2 n+1 Proof. Observe that, for λ ∈ R, if z = λx and y(x) = Jn (λx), then yn0 (x) = λJn0 (λx) = λJn (z),

yn00 (x) = λ2 Jn00 (z).

Thus, we have z 2 Jn00 (z) + zJn0 (z) + (z 2 − n2 )Jn (z) = 0 ⇐⇒ λ2 x2

yn00 (x) yn0 (x) + λx + (λ2 x2 − n2 )yn (x) = 0 λ2 λ

⇐⇒ x2 yn00 (x) + xyn0 (x) + (λ2 x2 − n2 )yn (x) = 0 Now, let u(x) = Jn (αx),

v(x) = Jn (βx).

Thus, we have x2 u00 + xu0 + (α2 x2 − n2 )u = 0, ⇐⇒ xu00 + u0 + (α2 x − =⇒

x2 v 00 + xv 0 + (β 2 x2 − n2 )v = 0

n2 )u = 0, x

xv 00 + v 0 + (β 2 x −

h n2 i v xu00 + u0 + (α2 x − )u = 0, x

n2 )v = 0 x

h n2 i u xv 00 + v 0 + (β 2 x − )v = 0 x

=⇒ x[vu00 − uv 00 ] + [vu0 − uv 0 ] + (α2 − β 2 )xuv = 0

49

⇐⇒

d [x(vu0 − uv 0 )] + (α2 − β 2 )xuv = 0 dx

=⇒ Z 0

1

d [x(vu0 − uv 0 )]dx + (α2 − β 2 ) dx

1

Z

xuvdx = 0. 0

Since u(1) = Jn (α) = 0 and v(1) = Jn (β) = 0, it follows that (α2 − β 2 )

1

Z

xuvdx = 0. 0

Hence, Z α 6= β

1

xJn (αx)Jn (βx)dx = 0.

=⇒ 0

Next, we consider the case of β = α: Note that 2u0 [x2 u00 + xu0 + (α2 x2 − n2 )u = 0, i.e., 2x2 u0 u00 + 2xu0 u0 + 2(α2 x2 − n2 )u0 u = 0, i.e., [x2 (u0 )2 ]0 + 2(α2 x2 − n2 )u0 u = 0, Also, [α2 x2 u2 − n2 u2 ]0 = α2 (2x2 uu0 + 2xu2 ) − n2 (2uu0 ) = 2(α2 x2 − n2 )u0 u + 2α2 xu2 . Thus, [x2 (u0 )2 ]0 + 2(α2 x2 − n2 )u0 u = 0 ⇐⇒ [x2 (u0 )2 ]0 + [α2 x2 u2 − n2 u2 ]0 − 2α2 xu2 = 0, =⇒ Z

1

[x2 (u0 )2 ]0 dx +

0

Z

1

[α2 x2 u2 − n2 u2 ]0 dx − 2α2

0

Z

1

xu2 dx = 0,

0

i.e., [x2 (u0 )2 ]10 + [α2 x2 u2 − n2 u2 ]10 − 2α2

Z

1

xu2 dx = 0,

0

Since u(1) = Jn (α) = 0 and u(0) = Jn (0) = 0, it follows that [u0 (1)]2 − 2α2

Z

1

xu2 dx = 0,

0

i.e., Z

1

0

x[Jn (αx)]2 dx =

1 0 1 [J (α)]2 = Jn+1 (α). 2 n 2

The last equality follows, since: (x−n Jn )0 = −x−n Jn+1 ⇐⇒ x−n Jn0 − nx−n−1 Jn = −x−n Jn+1 50

so that taking x = α, −α−n Jn+1 (α) = α−n Jn0 (α) − nα−n−1 Jn (α) = α−n Jn0 (α). Thus, Jn0 (α) = Jn+1 (α), and the proof is complete.

51

5

Sturm–Liouville problem (SLP)

Definition 5.1. For continuous real valued functions p, q, r defined on interval such that r0 exists and continuous and p(x) > 0 for all x ∈ [a, b], consider the differential equation (r(x)y 0 )0 + [q(x) + λp(x)]y = 0,

(1)

together with the boundary conditions k1 y(a) + k2 y 0 (a) = 0,

(2)

`1 y(b) + `2 y 0 (b) = 0.

(3)

The problem of determining a scalar λ and a corresponding nonzero function y satisfying (1)–(3) is called a Sturm–Liouville problem (SLP). A scalar (real or complex number) λ for which there is a nonzero function y satisfying (1)–(3) is called an eigenvalue of the SLP, and in that case the ♦

function y is called the corresponding eigenfunction. We assume the following known result.

THEOREM 5.2. Under the assumptions on p, q, r given in Definition 5.1, the set of all eigenvalues of SLP is a countably infinite set4 . THEOREM 5.3. Eigenfunctions corresponding to distinct eigenvalues are orthogonal on [a, b] with respect to the weight function p(x). Proof. Suppose λ1 and λ2 are eigenvalues of the SLP with corresponding eigenvectors y1 and y2 , respectively. Let us denote Ly := [r(x)y 0 ]0 + q(x)y. Then we have Let us denote Ly1 = −λ1 py1 ,

Ly2 = −λ2 py2 .

=⇒ (Ly1 )y2 − (Ly2 )y1 = (λ2 − λ1 )py1 y2 . =⇒ Z

b

Z [(Ly1 )y2 − (Ly2 )y1 dx = (λ2 − λ1 )

a

b

py1 y2 dx. a

Note that (Ly1 )y2 − (Ly2 )y1 = [(ry10 )y2 − (ry20 )y1 ]0 . 4 A set S is said to be countably infinite if it is in one-one corresponding to the set N of natural numbers. For example, other than N itself, the set Z of all integers, and the set Q of all rational numbers are countably infinite. However, the set {x ∈ R : 0 < x < 1} is not a countably infinite set. An infinite set which is not countably infinite is called an uncountable set. For example, the set {x ∈ R : 0 < x < 1} is an uncountable set; so also the set of all irrational numbers in {x ∈ R : 0 < x < 1}

52

Hence Z

b

[(Ly1 )y2 − (Ly2 )y1 dx = [(ry10 )y2 − (ry20 )y1 ](b) − [(ry10 )y2 − (ry20 )y1 ](a).

a

Using the boundary conditions, the last expression on the above can be shown to be 0. Thus, we obtain Z (λ2 − λ1 )

b

py1 y2 dx = [(ry10 )y2 − (ry20 )y1 ](b) − [(ry10 )y2 − (ry20 )y1 ](a) = 0.

a b

Z Therefore, if λ2 6= λ1 , we obtain

py1 y2 dx = 0. a

THEOREM 5.4. Every eigenvalue of the SLP (1)–(3) is real. Proof. Let us denote Ly := [r(x)y 0 ]0 + q(x)y. Suppose λ := α + iβ is an eigenvalue of SLP with corresponding eigenfunction y(x) = u(x) + iv(x), where α, β ∈ R, and u, v are real valued functions. Then we have L(u + iv) = −(α + iβ)p(u + iv), i.e., Lu + iLv = −p(αu − βv) − ip(αv + βu). Hence, Lu = −p(αu − βv),

Lv = −p(αv + βu)

=⇒ (Lu)v − (Lv)u = βp(v 2 + u2 ). =⇒ Z

b

b

Z

p(v 2 + u2 )dx.

[(Lu)v − (Lv)u]dx = β a

a

But, (Lu)v − (Lv)u = [(ru0 )v − (rv 0 )u]0 . Hence, Z

b

Z [(Lu)v − (Lv)u]dx =

a

b

[(ru0 ) − (rv 0 )u]0 dx = [(ru0 )v − (rv 0 )u](b) − [(ru0 )v − (rv 0 )u](a).

a

Using the fact that u and v satisfy the boundary conditions (2)-(3), it can be shown that [(ru0 )v − (rv 0 )u](b) − [(ru0 )v − (rv 0 )u](a) = 0. Z Thus, we obtain β λ = α ∈ R.

b

p(v 2 + u2 )dx = 0. Since β

a

Z

b

p(v 2 + u2 )dx we obtain β = 0, and hence

a

THEOREM 5.5. If y1 and y2 are the eigenfunctions corresponding to an eigenvalue λ of the SLP, then prove that y1 , y2 are linearly dependent. 53

Proof. Suppose y1 and y2 are eigenfunctions corresponding to an eigenvalue λ of the SLP. Then we have Ly1 = −λpy1 ,

Ly2 = −λpy2 .

Hence, (Ly1 )y2 − (Ly2 )y1 = 0. But, (Ly1 )y2 − (Ly2 )y1 = [(ry10 )y2 − (ry20 )y1 ]0 = [rW (y1 , y2 )]0 . Thus [rW (y1 , y2 )]0 = 0 so that, using the assumption that r is not a zero function, we obtain rW (y1 , y2 ) is a constant function, say r(x)W (y1 , y2 )(x) = c, constant. But, by the boundary condition (2) we have k1 y1 (a) + k2 y10 (a)

=

0

k2 y20 (a)

=

0

k1 y2 (a) + i.e.,

" #" # y1 (a) y10 (a) k1 y2 (a) y20 (a)

k2

=

" # 0 0

.

Hence, W (y1 , y2 )(a) = 0 so that r(a)W (y1 , y2 )(a) = 0 and hence, c = 0. This implies that W (y1 , y2 ) is a zero function, and hence y1 , y2 are linearly dependent. Example 5.6. For λ ∈ R, consider the SLP: y 00 + λy = 0,

y(0) = 0 = y(π)

Note that, for λ = 0, the problem has only zero solution. Hence, 0 is not an eigenvalue of the problem. If λ < 0, say λ = −µ2 , then a general solution is given by y(x) = C1 eµx + C2 e−µx . Now, y(0) implies C1 + C2 = 0 and y(π) = 0 implies C1 eiµπ + C1 e−iµπ = 0. Then, it follows that, C1 = 0 = C2 . Hence, the SLP does not have any negative eigenvalues. Next suppose that λ > 0, say λ = µ2 . Then a general solution is given by y(x) = C1 cos(µx) + C2 sin(µx). Note that y(0) = 0 implies C1 = 0. Now, y(π) = 0 implies y(π) = C2 sin(µπ) = 0. Hence, for those values of µ for which sin(µπ) = 0, we obtain nonzero solution. Now, sin(µπ) = 0 ⇐⇒ µπ = nπ

for

n ∈ Z.

Thus the eigenvalues and corresponding eigenfunctions of the SLP are λn := n2 ,

yn (x) := sin(nx), n ∈ N. ♦ 54

Example 5.7. For λ ∈ R, consider the SLP: y 00 + λy = 0,

y 0 (0) = 0 = y 0 (π)

Note that, for λ = 0, y(x) = α + βx is a solution of the DE. Now, y 0 (0) = 0 = y 0 (π) = 0 imply β = 0. Hence, y(x) = 1 is a solution. If λ < 0, say λ = −µ2 , then a general solution is given by y(x) = C1 eµx + C2 e−µx . Note that y 0 (x) = µC1 eµx − µC2 e−µx . Hence, y 0 (0) = 0 = y 0 (π)

=⇒ C1 − C2 = 0,

C1 eµπ − C2 e−µπ = 0.

Hence, C1 = C2 = 0, and hence the SLP does not have any negative eigenvalues. Next suppose that λ > 0, say λ = µ2 . Then a general solution is given by y(x) = C1 cos(µx) + C2 sin(µx). Then, y 0 (x) = −µC1 sin(µx) + µC2 cos(µx). Now, y(0) implies C2 = 0, and hence y(π) = 0 implies sin(µπ) = 0. Note that sin(µπ) = 0 ⇐⇒ µπ = nπ

for

n ∈ Z.

Thus the eigenvalues and corresponding eigenfunctions of the SLP are λn := n2 ,

yn (x) := cos(nx), n ∈ N0 . ♦

Exercise 5.8. For λ ∈ R, consider the SLP: y 00 + λy = 0,

y 0 (π) = 0.

y(0) = 0,

Show that the eigenvalues and the corresponding eigenfunctions for the above SLP are given by h 2n − 1  i  2n − 1 2 , yn (x) = sin x , n ∈ N. λn = 2 2 ♦ Exercise 5.9. Consider the Schr¨ odinger equation: −

h2 00 ψ (x) = λψx, 2πm

x ∈ [0, `],

along with the boundary condition ψ(0) = 0 = ψ(`). Show that the eigenvalues and the corresponding eigenfunctions for the above SLP are given by r  nπx  h2 π 2 n2 2 sin , n ∈ N. λn = , ψ (x) = n 2m`2 ` ` ♦ 55

Exercise 5.10. Let Ly := [r(x)y 0 ]0 + q(x)y. Prove that hLy, zip = hy, Lzip

∀ y, z ∈ C[a, b], ♦

for every weight function p(x) > 0 on [a, b].

Definition 5.11. An orthogonal sequence (ϕn ) of nonzero functions in C[a, b] is called a complete system for C[a, b] with respect to a weight function w if every f ∈ C[a, b] can be written as f=

∞ X

cn ϕn ,

n=1

where the equality above is in the sense that Z a

It can be seen that cn =

b

N 2 X (x) − cn ϕn (x) w(x)dx → 0 f

as

N → ∞.

n=1

hf, ϕn iw . hfn , ϕn iw

References  William E. Boycee and Richard C. DiPrima (2012): Elementary Differential Equations , John Wiley and Sons, Inc.

56