 Research
 Open Access
 Published:
Polynomial solutions of differential equations
Advances in Difference Equations volume 2011, Article number: 58 (2011)
Abstract
A new approach for investigating polynomial solutions of differential equations is proposed. It is based on elementary linear algebra. Any differential operator of the form $L\left(y\right)=\sum _{k=0}^{k=N}{a}_{k}\left(x\right){y}^{\left(k\right)}$, where a _{ k } is a polynomial of degree ≤ k, over an infinite field F has all eigenvalues in F in the space of polynomials of degree at most n, for all n. If these eigenvalues are distinct, then there is a unique monic polynomial of degree n which is an eigenfunction of the operator L, for every nonnegative integer n. Specializing to the real field, the potential of the method is illustrated by recovering Bochner's classification of second order ODEs with polynomial coefficients and polynomial solutions, as well as cases missed by him  namely that of Romanovski polynomials, which are of recent interest in theoretical physics, and some Jacobi type polynomials. An important feature of this approach is the simplicity with which the eigenfunctions and their orthogonality and norms can be determined, resulting in significant reduction in computational complexity of such problems.
2000 MSC: 33C45; 34A05; 34A30; 34B24.
1 Introduction
Polynomial solutions of differential equations is a classical subject, going back to Routh [1], Bochner [2] and Brenke [3] and it continues to be of interest in applications, as in, e.g., [4, 5]. The idea we wish to present in this article is to conduct the discussion of differential equations with polynomial coefficients in a linear algebraic context. It is surprising that by such a change of view point, one can add more than what is available in the classical literature and, at the same time, recover classical results efficiently and in a unified manner.
We take this opportunity to correct a common misconception regarding Brenke's contributions in the classification of secondorder ODEs that have polynomial solutions [6, p. 508]. He first considers all the secondorder ODEs that have a polynomial solution in every degree and only subsequently classifies selfadjoint equations by an argument similar to that given in Section 3. He then returns to the general secondorder equation and, for an inexplicable reason, does not carry through the argument to its logical conclusion and misses some important cases.
In this article, we investigate operators of the form $L\left(y\right)={\sum}_{k=0}^{N}{a}_{k}\left(x\right){y}^{\left(k\right)}$, where a _{ k } is a polynomial of degree ≤ k, with coefficients in an infinite field F. Clearly, any linear n thorder differential operator, which has polynomial coefficients and eigenpolynomials of degrees 0 up to n, must be of this form, and, as shown in Section 2, such operators may not have eigenpolynomials in every degree. We show that these operators, operating on polynomials, have all their eigenvalues in the field and in case the eigenvalues are distinct, there is exactly one monic polynomial in every degree which is an eigenfunction of L.
Specializing to secondorder equations because of their importance in applicationsand leaving in this article the higherorder case because of its technical complexitythe canonical forms of secondorder equations, their eigenvalues, and multiplicities are investigated. This includes the family of Romanovski polynomials and some Jacobitype polynomials, which are missing in the classification of Brenke and Bochner as well as in the latest books on the subject; the Romanovski polynomials are the main subject of some recent physics literature [5, 7].
Necessary and sufficient conditions for a secondorder operator to be selfadjoint are obtained and a reduction formula for computations of norms of eigenfunctions of these operators is also given, which avoids the customary casebycase analysis found, e.g., in [6, 8, 9].
A complete classification of secondorder operators which are selfadjoint with respect to some weight function is also given: among all the polynomial solutions of differential equations, the classical polynomials make their appearance as soon as one searches for selfadjoint operators. This classification is due originally to Brenke [3].
Although one normally assumes that the leading polynomial coefficient of a differential equation should never vanish, it is worth noting that it is precisely the singularities of the equation that encapsulate all the important information about the equation.
In the last section, the important examples of Jacobi and some nonstandard polynomials are given in detail.
Regarding eigenvalues we will use the following terminology.
Let λ be an eigenvalue of an operator L on a finite dimensional space. The geometric multiplicity of λ is the dimension of its eigenspace while its algebraic multiplicity (or multiplicity for short) is its multiplicity as a zero of the characteristic polynomial. Moreover, λ is said to be simple if its algebraic multiplicity is equal to 1, semisimple if its algebraic and geometric multiplicities coincide, and defective if its algebraic multiplicity is greater than its geometric multiplicity.
2 Basic results
In this article, ℙ is the space of all polynomials over an infinite field F and ℙ _{ n } is the subspace of polynomials with degree at most n, and for a fixed positive integer N, L : ℙ → ℙ is the N thorder operator given by $Ly={\sum}_{k=1}^{N}{a}_{k}\left(x\right){D}^{k}y$, where D is the usual differential operator and a _{ k } (x) is a polynomial of degree at most k (1 ≤ k ≤ N). In this way, for each nonnegative integer n, ℙ _{ n } is Linvariant. Put ${a}_{k}\left(x\right)={\sum}_{h\ge 0}{a}_{kh}{x}^{h}$, where a _{ kh } = 0 if k < h. As L(x ^{j} ) is a scalar multiple of x ^{j} plus lowerorder terms (1 ≤ j ≤ n), we see that the matrix representation of L, with respect to the standard basis B _{ n } = {1, x,. .., x ^{n} }, is upper triangular and the eigenvalues are the coefficients of x ^{j} in L(x ^{j} ) (1 ≤ j ≤ n). In more detail, the (n+1) × (n+1) matrix of L operating on ℙ _{ n } is
where (j − k) _{ k } = (j − 1)(j − 2) ⋯ (j − k) and a _{ kh } = 0 when k < h, so A _{ n } is upper triangular (and where each row and each column has at most N + 1 nonzero entries). Clearly, A _{ n } _{+1} is obtained from A _{ n } by adding one row and one column at the end, and so all the eigenvalues of the operator L are in F and are given by
where a _{ nn } = 0 if n > N. Each λ _{ n } has, as an eigenfunction, a polynomial y _{ n } (x) = y _{ n } _{0} + y _{ n } _{1} x + ⋯ + y _{ nn } x ^{n} whose vector representation (y _{ n } _{0} ,..., y _{ nn } ) ^{T} in the standard basis B _{ n } of ℙ _{ n } can directly be computed using the homogeneous triangular system
In particular, if the eigenvalues λ _{0}, λ _{1},..., λ _{ n } (for some n) are distinct, then ℙ _{ n } has a basis of eigenfunctions and, for reasons of degree, L has (up to a constant) a unique polynomial of degree r (for each r, 0 ≤ r ≤ n) corresponding to λ _{ r } as an eigenfunction. We summarize this in
Proposition 2.1 Let L : ℙ → ℙ be an operator given by $Ly=\sum _{k=1}^{N}{a}_{k}\left(x\right){D}^{k}y$ , where a _{ k } (x) is a polynomial of degree at most k. For each k ( 1 ≤ k ≤ N), let c _{ k } be the coefficient of x ^{k} in a _{ k } (x). Then all the eigenvalues of L are in the field F and are ℤlinear combinations of the c _{ k } . If all the eigenvalues are distinct, then L has, up to a constant, a unique polynomial for each degree as an eigenfunction.
Some observations concerning the eigenvalues and their multiplicity are in order. First, let
where, as in Proposition 2.1, c _{ k } = a _{ kk } is the coefficient of x ^{k} in a _{ k } (x). Then each eigenvalue λ _{ n } of L is just f(n) (n ≥ 0). This immediately gives an (N + 1)term recurrence relation between the eigenvalues, for if E is the shift operator given by Ef(x) = f(x+1), then (E− 1) ^{N} _{+1} f(n) = 0. When all the c _{ k } are zero (i.e., all eigenvalues are equal to zero), then f is identically zero and one can get the eigenfunctions of L by considering the (N − 1)order operator obtained from L by replacing y by Dy. We therefore assume that f is not the zero polynomial. Suppose that an eigenvalue is repeated r times, say
In this case, f takes on the same value at r different nonnegative integers, and so r ≤ deg (f) ≤ N. Moreover, if the field F = ℝ, it is clear that there is a positive integer u such that for each integer v ≥ u, the set {n : f(n) = v} is a singleton, meaning that only finitely many eigenvalues λ _{ n } of L have multiplicity greater than 1, and, if any exist, they must all lie between the largest local maximum and the smallest local minimum of f.
An interesting fact occurs when N = 2. Suppose, as before, that not both coefficients c _{1} and c _{2} are zero and that an eigenvalue has algebraic multiplicity 2, say λ _{ n } = λ _{ n } _{′} for some nonnegative integers n < n′. Then, from Equation 2.1, nc _{1} + n(n − 1)c _{2} = n′c _{1} + n′(n′ − 1)c _{2}, and, λ _{ n } _{+} _{ n } _{′} = (n + n′)c _{1} + (n + n′)(n + n′ − 1)c _{2} = 0. Since the multiplicity of the eigenvalue zero cannot exceed 2, we obtain that for each integer k > n + n′, the eigenvalue λ _{ k } has multiplicity 1. We also see that if n _{1} + n _{2} = n + n′, where n _{1} < n _{2}, then λ _{ n } _{1} = λ _{ n } _{2}, meaning that the number of eigenvalues that have multiplicity 2 is $\u2308\frac{n+{n}^{\prime}}{2}\u2309$. We thus have
Proposition 2.2 Let the field be ℝ. Then, with the above notation, either all eigenvalues of the N th order operator L are equal to 0 or all have multiplicity 1 except for finitely many of them which will then have multiplicity at most N. In case N = 2, there will be eigenvalues with multiplicity 2 precisely when a nonnegative integer k exists for which c _{1} + kc _{2} = 0, and then the number of such eigenvalues is $\u2308\frac{k+1}{2}\u2309$.
It is perhaps tempting to think that although the eigenvalues of the operator L may not be distinct, yet it is still diagonalizable. As Proposition 2.3 shows, this is not always the case.
We now concentrate on secondorder operators. Let L(y) = a(x)y′′ + b(x)y′, where deg(a) = 2, deg(b) ≤ 1. Following Bochner [2], by scaling and translation, we may assume that a(x) = x ^{2} − 1, x ^{2} + 1 or x ^{2}. We then have the following result.
Proposition 2.3 (i) The equation (x _{2}+ ε)y′′ + (αx + β)y′ + λy = 0, ε = 0, 1, − 1 has unique monic polynomial solutions in every degree if α > 0 or if α < 0 and it is not an integer.
If α = −(n + m − 1) for 0 ≤ m ≤ (n − 1), then the eigenvalue λ = n(n − 1) + αn = −nm has algebraic multiplicity 2 and eigenpolynomials can only be of degree n or m. An eigenpolynomial $y={\sum}_{k=0}^{n}{a}_{k}{x}^{k}$ is of degree n if and only if
in which case the λ eigenspace in ℙ _{ n } is twodimensional; otherwise the λ eigenspace is onedimensional.
(ii) The equation xy′′ + (αx + β)y′ + λy = 0 has unique monic polynomial solutions in every degree if α ≠ 0.
(iii) The equation y′′ +(αx+β)y′ +λy = 0 has unique monic polynomial solutions in every degree if α ≠ 0.
Proof.
(i) Let L(y) = (x ^{2} + ε)y′′ + (αx + β)y′, where ε = 0, 1,− 1. By Proposition 2.1 or noticing that the eigenvalues are given by the coefficients of x ^{n} in L(x ^{n} ), these eigenvalues are λ = n(n − 1) + αn. Suppose such an eigenvalue is a repeated eigenvalue. Then, L(x ^{m} ) = λx ^{m} + lower degree terms, where m ≠ n. Therefore, n(n − 1) + αn = m(m − 1) + αm which gives α = −(n + m − 1). This means that if α is not an integer or if α is a positive integer, then the operator L has distinct eigenvalues. In this case, there is up to a scalar only one polynomial in every degree which is an eigenfunction of L.
Now suppose α = −(n + m − 1) for distinct nonnegative integers n,m and λ = n(n− 1)+αn = −nm. We may assume that n > m. Suppose L(x ^{k} ) = λx ^{k} + lower degree terms, with k ≠ n. Then α = −(n + m − 1) = −(n + k − 1) gives k = m. Therefore, if there is a repeated eigenvalue, it is of multiplicity 2 and eigenpolynomials can only be of degrees m and n. Moreover, if α = −(n+m− 1) = −(i + j − 1) then the eigenvalue −ij is also repeated.
Since the algebraic multiplicity of an eigenvalue is always greater than or equal to its geometric multiplicity, a nonrepeated eigenvalue of L has exactly one monic polynomial as an eigenfunction.
Let us now determine the geometric multiplicities of all the eigenvalues in case α is a nonpositive integer.
Let α = −(n + m − 1) where n > m ≥ 0. As seen above the eigenvalue λ = n(n − 1) + αn = −nm is of algebraic multiplicity 2 and the corresponding eigenpolynomials can only be in degrees n and m. If $y={\sum}_{k=0}^{n}{a}_{k}{x}^{k}$ then
The solutions of L(y) = λy = (n(n − 1) + αn)y = −(nm)y satisfy therefore
where a _{ n } _{+1} = 0, a _{ n } _{+2} = 0 and a _{ n } ≠ 0. From Equation 2.2 we can solve for a _{ k } in terms of a _{ k } _{+1}, a _{ k } _{+2} provided (k(k − 1) + αk − λ) ≠ 0. Therefore, we can solve for all a _{ k } with k > m in terms of a _{ n } . Equation 2.2 for k = m reads
If Equation 2.3 holds then a _{ m } can be arbitrary and every a _{ k } for k < m is determined in terms of a _{ m } and a _{ n } . In this case, the λ eigenspace is twodimensional. If Equation 2.3 does not hold then there is no eigenpolynomial of degree n. In this case, there will be a unique monic polynomial of degree m.
(ii & iii) Here the proofs follow from the fact that the eigenvalues of the operator L in both the cases are αn so, for α ≠ 0, all the eigenvalues are distinct.
Proposition 2.3 shows, in particular, that for Jacobitype differential equations, there are cases where the algebraic and geometric multiplicities are equal to 2 and cases where the algebraic multiplicity is 2 and the geometric multiplicity is 1 (Cf. [2]).
Corollary 2.4 Let L(y) = x ^{2} y′′ + (αx + β)y′.
(i) If α is not a nonpositive integer then all the eigenvalues of L are simple.
(ii) If α = −(n + m − 1) where n > m ≥ 0 then all eigenvalues λ except λ = −nm, are simple and the eigenvalue −nm has multiplicity 2.
In this case if β = 0 then all the eigenvalues are semisimple with eigenpolynomials ^{k} (k = 0, 1,...).
If β ≠ 0 then the repeated eigenvalue −nm is defective with eigenpolynomial
Proof. (i) and the first statement of (ii) have already been proved in Proposition 2.3.
Using Equation 2.3 in the proof of Proposition 2.3 with
and
we get
Therefore, for ε = 0 we get

If β = 0, then (n − k)(k − m)a _{ k }= 0. Therefore, all a _{ k }are zero except for k = n and k = m. The general solution is therefore a linear combination of x ^{n}and x ^{m}. The eigenvalue −nm in this case is of geometric multiplicity 2.

Assume β ≠ 0. For k = n and k = m Equation 2.4 gives 0 = βa _{ n } _{+1}(n + 1) and 0 = βa _{ m } _{+1}(m + 1). Since a _{ n } _{+1} is zero, if there is an eigenpolynomial of degree n then we must have a _{ m } _{+1} = 0. This means that there cannot be an eigenpolynomial of degree n.
Now from Equation 2.4 we get
Taking a _{ m } = 1 we get
This gives recursively
Substituting m − k = l we get
which gives the monic eigenpolynomial of degree l given by
In Proposition 2.3, there is no claim to any kind of orthogonality properties. Nevertheless, the nonclassical functions appearing here are of great interest in Physics and their properties and applications are investigated in [5, 7, 10].
Now the equations a(x)y′′ + b(x)y′ + c(x)y = λx can be written as secondorder SturmLiouville equations in the sense of [9, p. 291] by multiplying by a suitable weight function [8, p. 45] and for suitable boundary conditions. A natural question is: What is the explanation for the weight function and the particular form of the boundary conditions?
The following proposition shows that both the weight and general boundary conditions are forced upon us as soon as we demand that the operator L(y) = a(x)y′′ + b(x)y′ + c(x)y should be selfadjoint for some weight function p. The weight function can be determined from the following wellknown proposition whose proof can be found for example in [3].
Proposition 2.5 Let L be the operator defined by Ly = a(x)y′′ + b(x)y′ + c(x)y on a linear space C of functions which are at least twice differentiable on a finite interval I. Define a bilinear function on C by $\left(y,\phantom{\rule{0.1em}{0ex}}u\right)\phantom{\rule{2.77695pt}{0ex}}=\phantom{\rule{2.77695pt}{0ex}}\underset{I}{\int}pyudx$, where p ∈ C is nonnegative and does not vanish identically in any open subinterval of I. Then
2.1 Norms of eigenfunctions
The norms of the eigenfunctions relative to the weight p can be obtained using the wellknown threeterm recurrence relation for orthogonal polynomials. We include a proof for the readers' convenience and because it is the main point in computation of norms of eigenfunctions.
Proposition 2.6 [8, p. 306] If {P _{ n } } _{ n } _{= 0} _{,1} _{,2} ... is a sequence of orthogonal polynomials, then in the expression
all the coefficients are 0 except for j = n + 1, n, n − 1.
Proof. Denoting the inner product by round brackets, we have
if j + 1 ≤ n − 1 that is, if j ≤ n − 2, which is what we wanted to show.
Now
Let us rewrite this equation as
As there is only one monic eigenpolynomial in every degree, the differential equation must determine all the coefficients. We assume that all eigenfunctions are normalized to be monic.
So P _{ n } = xP _{ n− } _{1} + q(x), where deg(q) ≤ n − 1. Therefore (P _{ n } , P _{ n } ) = (xP _{ n− } _{1}, P _{ n } ) = (P _{ n− } _{1}, xP _{ n } ) = (P _{ n− } _{1}, c _{ n } P _{ n− } _{1}) = c _{ n } (P _{ n− } _{1}, P _{ n− } _{1}) using Equation 2.4 and orthogonality of eigenfunctions of different degrees.
Now, from the differential equation, determining the leading three coefficients of every P _{ n } and using Equation 2.4 leads to the determination of c _{ n } , taking into account that a _{ n } = 1. This gives (P _{ n } , P _{ n } ) = c _{ n } c _{ n− } _{1} ... c _{1}(P _{0}, P _{0}) and (P _{0}, P _{0}) is the integral of the weight function p over an appropriate interval.
The values of a _{ n } , b _{ n } , c _{ n } for classical orthogonal polynomials are given in the table below.
3 Canonical forms of selfadjoint secondorder equations with polynomial coefficients
Let us now determine the operators for which there is a basis of orthogonal eigenpolynomials for the weight function determined by the operator. The results of this section were arrived at independently; however, the authors found later that such a classification was done first by Brenke [3].
From Proposition 2.5, the operator L would be selfadjoint if there is no contribution from the boundary terms: this is ensured if the product a(x)p(x) vanishes at the end points of the intervalfinite or infiniteon which the natural weight function p(x) associated to L is integrable on the entire interval.
The integrability of the weight function determines the differential equation and finiteness of the norm of polynomials ensures that manipulations as in Proposition 2.5 are legitimate. The operator L will then be selfadjoint and it will operate on the vector space of all polynomials of degree at most n for every nonnegative integer n.
As L has a basis of eigenvectors in any finite dimensional subspace on which it operates, we see that there will be monic polynomial of degree n, which will be an eigenfunction of L, and the corresponding eigenvalues would therefore be determined from the form of the equation. If these eigenvalues are distinct for different degrees, these polynomials would automatically be orthogonal.
The operator L can be determined from the following requirements

(1)
the leading term a(x) is nonzero and of degree at most 2, the degree of b(x) is at most 1 and c(x) is a constant;

(2)
the natural weight function associated to L is integrable on the interval I determined by roots of a(x);

(3)
a(x)p(x) vanishes at the end points of I and, in case there is an end point at infinity, the product a(x)p(x)P(x) should vanish at infinity for all polynomials P(x);

(4)
all polynomials should have finite norm on the interval I with the weight p(x).
Case I. The polynomial a(x) has two distinct real roots.
By a linear change of variables and scaling, we may assume that the roots are 1 and − 1. Assuming that a(x) is nonnegative in the interval [− 1, 1], we have a(x) = 1−x ^{2}.
Let b(x) = αx + β so
So the weight p(x) is
The weight is obviously finite in the interval (− 1, 1). For p(x) to be integrable we must have β − α > 0 and β + α < 0. Thus, α < β < −α, so α < 0.
Case II: The polynomial a(x) has repeated real roots. In this case, we can assume that a(x) = x ^{2}. Let b(x) = αx + β. The weight function is now $p\left(x\right)=\frac{1}{{x}^{2}}{e}^{\int \frac{\alpha x+\beta}{{x}^{2}}dx}=\frac{x{}^{\alpha}}{{x}^{2}}{e}^{\beta \u2215x}$. We may take the interval I = (0, ∞).
In this case a necessary condition for the integrability of the weight is that deg(b)− deg(a) + 1 > 0, so this case does not arise.
Case III: The polynomial a(x) is linear.
In this case, we can take a(x) = x. Let b(x) = αx + β. In this case the weight function is $p\left(x\right)=\frac{1}{\leftx\right}{e}^{\int \frac{\alpha x+\beta}{x}dx}=x{}^{\beta 1}{e}^{\alpha x}$. This is integrable near zero if and only if β ≥ 1. Since $\underset{0}{\overset{\infty}{\int}}{e}^{\alpha x}{x}^{\epsilon}dx$, where ε > 0, is finite only if α ≤ 0 we see that we cannot take the interval I from −∞ to ∞. Without loss of generality we can take this to be the interval [0, ∞). So, the weight function is now p(x) = x ^{β−} ^{1} e ^{αx} with α < 0 and β ≥ 1. All polynomials have finite norm with respect to this weight and for all polynomials p(x) the product P(x)p(x) vanishes at 0 and ∞. Therefore, the equation xy" + (αx + β)y′ + λy = 0 has polynomial solutions for every degree n. The corresponding eigenvalue is λ = −αn.
Case IV: α(x) = 1
In this case L(y) = y" + (αx + β)y′ + γy. The weight is $p\left(x\right)={e}^{\frac{\alpha {x}^{2}}{2}}{e}^{\beta x}$. So α must be negative, for the product P(x)p(x) to vanish at the end points of the interval I for all polynomials P(x), and therefore I must be (−∞, ∞).
Remark The case of a second degree a(x) with no real roots does not arise, because of the requirements (3) and (4) above which a weight function must satisfy.
4 Examples
As illustration of the ideas of previous sections, we discuss the Jacobi polynomials and two nonstandard examples including the Romanovski polynomials.
4.1 Jacobi polynomials
First note that for any differentiable function f with f' continuous, the integral ${\int}_{0}^{\epsilon}\frac{f\left(x\right)}{{x}^{\alpha}}dx$ is finite if α < 1as one sees using integration by parts.
Consider the equation (1 − x ^{2})y" + (αx + β)y′ + λy = 0. As above, the weight function p(x) for the operator
is
So ${\int}_{1}^{1}p\left(x\right)f\left(x\right)dx$ would be finite if β + α < 0 and −β + α < 0, that is, if α < β < −α.
The weight is not differentiable at the end points of the interval. So, first consider L operating on twice differentiable functions on the interval [− 1 + ε, 1 − ε]. If u, v are functions in this class then by Proposition 2.5,
Moreover, $\left(1{x}^{2}\right)p\left(x\right)={\left(1x\right)}^{\frac{\left(\beta +\alpha \right)}{2}}{\left(1+x\right)}^{\frac{\beta \alpha}{2}}$ is continuous on the interval [− 1, 1] and vanishes at the endpoints − 1 and 1. Therefore, if we define $\left(u,v\right)=\underset{\epsilon \to 0}{lim}\underset{1+\epsilon}{\overset{1\epsilon}{\int}}p\left(x\right)u\left(x\right)v\left(x\right)dx$ then L would be a selfadjoint operator on all polynomials of degree n and so, there must be, up to a scalar, a unique polynomial which is an eigenfunction of L for eigenvalue −n(n − 1) + nα.
So, these polynomials satisfy the equation
and this equation has unique monic polynomial eigenfunctions of every degree, which are all orthogonal.
4.2 The equation t(1 − t)y" + (1 − t)y+ λy= 0
This equation is investigated in [4] and the eigenvalues determined experimentally, by machine computations. Here, we will determine the eigenvalues in the framework provided by Propositions 2.1 and 2.5.
Let L(y) = t(1 − t)y" + (1 − t)y′. Let ℙ _{ n } be the space of al polynomials of degree at most n. As L maps ℙ _{ n } into itself, the eigenvalues of L are given by the coefficient of x ^{n} in L(x ^{n} ). The eigenvalues turn out to be −n ^{2}. As these eigenvalues are distinct, there is, up to a constant, a unique polynomial of degree n which is an eigenfunction of L.
The weight function is $p\left(t\right)=\frac{1}{1t}=\frac{1}{1t}$ on the interval [0, 1] and it is not integrable. However, as L(y)(1) = 0, the operator maps the space V of all polynomials that are multiples of (1 − t) into itself. Moreover, ${\int}_{0}^{1}p\left(t\right){\left(\left(1t\right)\psi \left(t\right)\right)}^{2}dt$ is finite.
The requirement for L to be selfadjoint on V is $t\left(\xi {\eta}^{\prime}{\xi}^{\prime}\eta \right){}_{0}^{1}=0$ for all ξ, η in V. As ξ, η vanish at 1, the operator L is indeed selfadjoint on V.
Let V _{ n } = (1  t)ℙ_{ n }, where ℙ _{ n } is the space of all polynomials of degree at most n. As the codimension of V _{ n } in V _{ n } _{+1} is 1, the operator L must have an eigenvector in V _{ n } for all the degrees from 1 to n + 1. If y = (1−t)ψ is an eigenfunction and deg(ψ) = n, then, by the argument as in the examples above, we see that the corresponding eigenvalue is λ = −(n + 1)^{2}.
Therefore, up to a scalar, there is a unique eigenfunction of degree n + 1 which is a multiple of 1 − t and all these functions are orthogonal for the weight $p\left(t\right)=\frac{1}{1t}$.
Using the uniqueness up to scalars of these functions, the eigenfunctions are determined by the differential equation and can be computed explicitly.
4.3 Romanovski polynomials
These polynomials are investigated in [5, 7] and their finite orthogonality is also proved there. Here, we establish this in the framework of Proposition 2.5.
The Romanovski polynomials are eigenfunctions of the operator L(y) = (1 + x ^{2})y" + (αx + β)y′. For α > 0, or α < 0, α not an integer, there is only one monic polynomial in every degree which is an eigenfunction of L; for α a nonpositive integer, the eigenspaces can be twodimensional for certain values of β (Proposition 2.3).
The formal weight function is $p\left(x\right)={\left({x}^{2}+1\right)}^{\left(\frac{\alpha 2}{2}\right)}{e}^{\beta {tan}^{1}\left(x\right)}={\left({x}^{2}+1\right)}^{\frac{\gamma}{2}}{e}^{\beta {tan}^{1}\left(x\right)}$,where γ = α− 2. Therefore, a polynomial of degree N is integrable over the reals with weight p if and only if N + γ + 1 < 0; and if the product of two polynomials P, Q is integrable, then the polynomials are themselves integrable for the weight p.
As in Proposition 2.5, we find that $\left(LP,Q\right)\left(P,LQ\right)=\left({x}^{2}+1\right)p\left(x\right)\left(P{Q}^{\prime}{P}^{\prime}Q\right){}_{\infty}^{\infty}$, because if deg(P) ≠ deg(Q) then the product (x ^{2} + 1)p(x)(PQ′ − P′Q) is asymptotic to ${x}^{2+\gamma +deg\left(P\right)+deg\left(Q\right)1}={x}^{deg\left(P\right)+deg\left(Q\right)+\gamma +1}$ and deg(P) + deg(Q) + γ + 1 < 0.
Therefore, if P, Q are integrable eigenfunctions of L with different eigenvalues and deg(P) + deg(Q) + γ + 1) < 0, then P, Q are orthogonal.
For several nontrivial applications to problems in Physics, the readers are referred to [5].
References
 1.
Routh EJ: On some properties of certain solutions of a differential equation of second order. Proc Lond Math Soc 1884, 16: 245261. 10.1112/plms/s116.1.245
 2.
Bochner S: Uber SturmLiouvillesche Polynomsysteme. Math Z 1929, 29: 730736. 10.1007/BF01180560
 3.
Brenke WC: On polynomial solutions of a class of linear differential equations of the second order. Bull A M S 1930, 36: 7784. 10.1090/S000299041930048880
 4.
Chaudhry MA, Qadir A: Identitytype functions and polynomials. Int J Math Math Sci 2007,2007(94204):2131.
 5.
Raposo AP, Weber HJ, AlvarezCastillo D, Kirchbach M: Romanovski polynomials in selected physics problems. Cent Eur J Phys 2007,5(3):253284. 10.2478/s1153400700185
 6.
Ismail M: Classical and Quantum Orthogonal Polynomials in One Variable. Cambridge University Press; 2005.
 7.
Weber HJ: Connections between real polynomial solutions of hypergeometrictype differential equations with Rodrigues formula. Cent Eur J Math 2007,5(2):415427. 10.2478/s1153300700046
 8.
Birkhoff G, Rota GC: Ordinary Differential Equations. 3rd edition. John Wiley and Sons, NY; 1978.
 9.
Hilbert D, Courant R: Methods of Mathematical Physics. Interscience Publishers, NY; 1953.
 10.
AlvarezCastillo DE: Exactly solvable potentials and Romanovski polynomials in quantum mechanics. Thesis, Institute of Physics at the Autonomous University of San Luis Potosi, Mexico 2007., rXiv: 0808.1642
Acknowledgements
The authors thank the referees for their valuable comments and Professor A. W. Knapp for his comments and suggestions on the first version of this article. They also thank the King Fahd University of Petroleum and Minerals for its support and excellent research facilities.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
This was a joint work in every aspect. All the authors have read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Azad, H., Laradji, A. & Mustafa, M.T. Polynomial solutions of differential equations. Adv Differ Equ 2011, 58 (2011). https://doi.org/10.1186/16871847201158
Received:
Accepted:
Published:
Keywords
 Weight Function
 Polynomial Coefficient
 Polynomial Solution
 Monic Polynomial
 Algebraic Multiplicity