Work first on . For , the power-law ansatz gives the indicial equation . Therefore the Cauchy-Euler equation has general solutionFor the repeated indicial root supplies the logarithm rather than two copies of the constant solution. Alternatively, the change of variables turns the differential equation into . On the corresponding real formulas use and , with independent constants on the two sides of zero.
For general , normalize the second-order linear differential equation asThe coefficient is singular at zero, but and are analytic functions there because is a positive integer. The regular singular point criterion for a second-order equation therefore proves that zero is a regular singular point for every allowed . The indicial equation remains .
For the first Frobenius solution, take the larger indicial root and normalize the first coefficient to one:Substitution and comparison of the coefficient of giveEvery denominator is nonzero because .
For , the recurrence relation is , soFor , and all odd coefficients vanish; the even coefficients satisfy . HenceFor any positive integer , induction in the recurrence relation shows that only indices divisible by survive:The empty product for equals one. Successive terms in the power series factor have ratio of magnitudesThus the ratio test gives convergence for every finite ; a nonintegral still requires a chosen side of zero or a complex branch for the factor .
For a putative second Frobenius solution with the smaller indicial root , set , with and for . Its recurrence relation isThe Frobenius case classification concerns the gap between the indicial roots. In the course convention, Case IIIa is the obstructed recurrence requiring a Logarithmic Frobenius solution; Case IIIb permits two pure Frobenius series.
If and , this is Case I: no denominator vanishes. There are two linearly independent pure Frobenius solutions, withTheir different leading powers establish linear independence.
If , this is Case II, with a repeated indicial root. There is only one pure Frobenius series with a nonzero leading coefficient. To see the second solution's form, reduction of order givesHere , so the integrand is . ConsequentlyThe logarithm has a nonzero coefficient and cannot be removed by adding a multiple of .
If is a positive integer, the only potentially obstructed coefficient is . Below that index, unless divides . At the exceptional index the equation readsIf for some positive integer , all coefficients are nonzero because . The exceptional equation is inconsistent. This is Case IIIa, and the independent second solution has the formThe Frobenius resonance for an Euler equation with monomial potential explains why divisibility, rather than the integer gap alone, decides this outcome. For example, with , applying the original differential operator to gives . Cancellation of the coefficient of requires .
If does not divide , then ; this includes through the negative-index convention. The exceptional equation is , so is free. This is Case IIIb: set to select an independent pure Frobenius series starting with . Subsequent coefficients again follow the recurrence relation. Changing simply adds a multiple of , the undetermined coefficient at Frobenius resonance.
The complete answer is thereforeIn particular, for every positive integer gap gives Case IIIa. For , positive integer gives Case IIIa, while gives Case IIIb; the remaining positive give Case I. The condition matters: at the two Cauchy-Euler equation powers already give independent solutions whenever .
Normalize both leading coefficients to one. For the indicial root , the recurrence relation from part (b) givesRecognizing the Taylor series of the sine gives the first Frobenius solutionFor the smaller indicial root , . The equation at is ; choose the free coefficient to avoid adding the first Frobenius solution. The remaining coefficients areThus the Taylor series of the cosine givesTheir leading terms are and , as required for Case IIIb. A direct check uses : the differential equation becomes , so these two functions solve it on . Their Wronskian is , proving linear independence. The general solution is .
Articles by others on the same topic
There are currently no matching articles.