For , , and a positive integer , consider near . Its indicial roots are . The first Frobenius solution, normalized to leading coefficient one, is , with . If is a positive integer, a second pure Frobenius solution with leading coefficient one would requireBefore , induction makes for indices not divisible by . If divides , the coefficient is nonzero, and the exceptional equation is impossible. If does not divide , the right-hand side is zero and is free. Thus, in the Frobenius case classification, a positive integer gap gives Case IIIa exactly when divides , and Case IIIb otherwise.
The coefficient of the necessary logarithm can also be calculated. Let . The product rule gives . Therefore a second solution , with , hasFor the preceding recurrence relation gives , soThis proves that the logarithm cannot disappear for a special nonzero value of . For , reduction of order instead produces the repeated-root Logarithmic Frobenius solution directly.
Articles by others on the same topic
There are currently no matching articles.