Frobenius Series Solutions III - Frobenius theory

Given how tedious it can be to search for Frobenius series solutions to a given differential equation, it would be nice to have some "forecasting" information that would let us know:

  1. When are we guaranteed to find a Frobenius series solution?
  2. When are we guaranteed that the general solution can be represented by a Frobenius series?
  3. If there is only one Frobenius series solution (up to scaling), how do we find another solution?

We will briefly outline answers to those questions here, although we won't provide any proofs or justifications. We simply summarize the situation

A measure of singularity


First we need a measure of "how bad" a singularity is for a (second-order, linear, homogeneous) differential equation.

Definition of regular singular point

Consider the differential equation

y+p(x)y+q(x)y=0.

We say x0 is a regular singular point of the differential equation if it is a singular point (i.e., either p or q is not analytic at x0) but the functions P(x)=(xx0)p(x) and Q(x)=(xx0)2q(x) are analytic at x0.

A singular point that is not regular is called an irregular singular point.

More intuitively, x0 is a regular singular point of the differential equation is:

Example

The point x0=0 is:

Example

Consider the differential equation below

y+1+xx(x1)2y+2x(x2)y=0.

The point x0 is:

Existence of a Frobenius series solution


Here's our first bit of good news:

Frobenius series solutions at regular singular points

Suppose x0 is a regular singular point of the differential equation

y+p(x)y+q(x)y=0.

Then there exists at least one Frobenius series solution.

We can even say a bit more. Let's stick to the case x0=0 for simplicity.

The indicial equation

Suppose x0=0 is a regular singular point of the differential equation

y+p(x)y+q(x)y=0.

Then there exists a Frobenius series solution of the form y(x)=xrn=0anxn (with a00), where r is a solution to the equation below (called the indicial equation):

r(r1)+P(0)r+Q(0)=0.

Here P(x)=xp(x) and Q(x)=x2q(x), as defined earlier.

In fact, a lot more is known. We are not going to explore this further here, though, so for now we'll simply present the ...

Flowchart of madness


seriesMethodsFlowchart.png

Final example


We should see at least one example illustrating a situation at the bottom-right corner of the flow chart, i.e., in which there is only one Frobenius series solution and we have to work extra hard to get a second, linearly independent solution.

To that end, consider the differential equation

4x2y(3+4x)y=0.

Since x0=0 is a regular singular point we know there is at least one solution that can be represented by a Frobenius series centered at 0. After substituting in the function y(x)=xrn=0anxn (with a00) and simplifying, we obtain

(4r24r3)a0m=0+m=1[(4(m+r)(m+r1)3)am4am1]xm=0.

It follows that y(x) is a solution exactly when the following equations are satisfied:

4r24r3=0,(4(m+r)(m+r1)3)am4am1=0for m1.

The first equation is (up to scaling) the indicial equation, and gives r=32,12. We are guaranteed to find a Frobenius solution for the larger root, namely r=32. When r=32, the remaining equations (eventually) simplify to m(m+2)am=am1. Setting m=1,2,, we find that

a1=13a0,a2=18a1=124a0,

We have therefore found one Frobenius solution, namely (after setting a0=1 for convenience)

y1(x)=x3/2(1+13x+124x2+)=x3/2+13x5/2+124x7/2+.

Let us try to repeat the above solution for the root r=12. In this case, the recursion relation eventually simplifies to m(m2)am=am1 for m1. Setting m=1,2,, we then see that

m=1:a1=a0a1=a0m=2:0a2=a1a1=0.

But we are assuming a00, so we cannot both have a1=a0 and a1=0. Our recursion relation is giving an inconsistent (or incompatible) set of equations. There is no Frobenius solution when r=12.

Warning

It is tempting to solve the recursion relation for am, finding that am=1m(m2)am1 and declaring that for m=2 one has a2=120a1, which is a "divide by zero" error. This is not correct and is not a valid contradiction. The equation m(m2)am=am2 is valid for all m1, but the equation am=1m(m2)am1 is only valid when we have not divided by zero, i.e., for all m1 except m=2. For m=2, we must stick with the original equation, which is still valid.

It turns out that the second solution is of the form

y2(x)=Ay1(x)ln(x)+x1/2n=0bnxn,

where y1(x) is the Frobenius series solution you found (and we assume b00). After substituting in this function (and much simplification), we eventually obtain

(b0b1)m=0+m=2[m(m2)bmbm1+2A(m1)m!(m2)!]xm=0.

(The m=1 term vanishes.)

From the given information, y(x) is a solution exactly when the following equations are satisfied:

b0b1=0,m(m2)bmbm1+2A(m1)m!(m2)!=0for m2.

The first equation gives b1=b0. Setting m=2, in the remaining equations give

m=2:0b2b1+A=0A=b1=b0m=3:3b3b2+2A3=0b3=13b22A9=29b0+13b2

If we persist, we will be able to write every coefficient bm in terms of b0 and b2. From the terms we have found so far, we have discovered the solution

y2(x)=b0y1(x)ln(x)+x1/2(b0b0x+b2x2+(29b0+13b2)x3+)=b0(y1(x)ln(x)+x1/2x1/2+29x5/2+)+b2(x3/2+13x5/2+)

We are free to take any nonzero value for b0 and any value (including zero) for b2, and every pair of choices will produce a valid solution. For example, if we take b0=1 and b2=0, we obtain the solution

y2(x)=y1(x)ln(x)+x1/2x1/2+29x5/2+,

where y1(x) is the solution we found earlier.

Suggested next notes


Coming soon