where G(D, x) is a linear polynomial operator of order less than that of P(D, x); F will then have to be a polynomial of degree ? 2. In'a previous paper [1], the following operational identities were established: (1) x D( _ [(xD + 1 n)(xD + 1 2n) ... (xD + 1 rn)D]n, (2) x(r?l)nDrn= [x(xD + 1 n) (xD + 1 2n) ... (xD + 1 rn)]n, (3) D(r+l)nXrn = [(xD + 1 + n)(xD + 1 + 2n) ... (xD + 1 + rn)D]n, (4) Drnx(?+l)n=[x (xD + 1 + n)(xD + 1 + 2n) ... (xD + 1 + rn)]n. The above equations imply the reducibility of the operators given on the lefthand side. In addition, by means of the reducibility, certain nth order linear differential equations were solved. In this paper, we extend the notion of reducibility. We then exhibit a class of operators satisfying this condition and apply it to solving certain other nth order linear differential equations. First, let us consider a special case of (1), i.e., (5) xnD2n {xD2 + (1 n)D}In. The idea for extending the notion of reducibility was obtained from attempts to ascribe a meaning to (5) for nonintegral n. If, in (5), we let n -> n + 2, we formally obtain ( 6) X~~n+2-D2n+1 _{D2 + ( n)}(2n+l),2 (6) x = {xD 2 -In ( D We will show that (6) holds if it is interpreted as (7) = {xD2 (2 -)D To establish (7), we let x = eZ. Since XDx= DZ(DZ -1) ** (D, n + 1), we have to show that
Read full abstract