Orthogonal polynomials on the real line corresponding to a perturbed chain sequence
Kiran Kumar Behera, A. Swaminathan

TL;DR
This paper investigates how perturbations of chain sequences influence orthogonal polynomials on the real line, revealing connections to measure transformations and illustrating with Laguerre polynomials.
Contribution
It introduces a specific perturbation of chain sequences affecting orthogonal polynomials on [0,∞) and links these to measure transformations, with applications to Laguerre polynomials.
Findings
Perturbations relate to transformations of symmetric measures.
The study reveals kernel polynomial consequences of chain sequence disturbances.
Application to generalized Laguerre polynomials demonstrates the theory.
Abstract
In recent years, chain sequences and their perturbations have played a significant role in characterising the orthogonal polynomials both on the real line as well as on the unit circle. In this note, a particular disturbance of the chain sequence related to orthogonal polynomials having their true interval of orthogonality as a subset of is studied leading to an important consequence related to the kernel polynomials. Such perturbations are shown to be related to transformations of symmetric measures. An illustration using the generalized Laguerre polynomials is also provided.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Fractional Differential Equations Solutions · Scientific Research and Discoveries
Orthogonal polynomials on the real line
corresponding to a perturbed chain sequence
Kiran Kumar Behera
Department of Mathematics, Indian Institute of Technology, Roorkee-247667, Uttarakhand, India
and
A. Swaminathan
Department of Mathematics
Indian Institute of Technology, Roorkee-247 667, Uttarkhand, India
[email protected], [email protected]
Abstract.
In recent years, chain sequences and their perturbations have played a significant role in characterising the orthogonal polynomials both on the real line as well as on the unit circle. In this note, a particular disturbance of the chain sequence related to orthogonal polynomials having their true interval of orthogonality as a subset of is studied leading to an important consequence related to the kernel polynomials. Such perturbations are shown to be related to transformations of symmetric measures. An illustration using the generalized Laguerre polynomials is also provided.
Key words and phrases:
Moment functional, Jacobi matrices, Chain sequences, Orthogonal polynomials, Kernel polynomials
2010 Mathematics Subject Classification:
42C05, 33C45, 15B99
1. Preliminaries
Let be a moment functional defined on the vector space of polynomials with real coefficients. The quantities , are called the moments of order and are used to construct the Hankel matrix . In case the principal submatrices are non-singular, is said to be quasi-definite and there always exists a sequence of polynomials , where for ,
[TABLE]
satisfying the property,
[TABLE]
The sequence is said to be orthonormal with respect to .
Following the notation used in [16, Page 12], the sequence satisfies the three term recurrence relation (the so called Favard’s Theorem),
[TABLE]
where and are pre-defined. Further, and , and are related to the coefficients of as [10],
[TABLE]
Moreover, though is arbitrary, it is usually taken to be equal to for convenience. It may be noted that the recurrence coefficients and satisfy the above conditions if and only if is positive definite, that is, if for every polynomial such that for all .
In many cases, the polynomials are normalized to make their leading coefficient equal to one. These monic orthogonal polynomials denoted as and defined by , , satisfy the recurrence relation
[TABLE]
with and . In the sequel, these will be called an orthogonal polynomials sequence (OPS). The system (1.2) is usually written in the more precise form: , where and
[TABLE]
is called the monic Jacobi matrix associated with the orthogonal polynomials generated by (1.2). The polynomials defined as , , are called the associated polynomials associated with and constitute a second solution of the recurrence relation
[TABLE]
with the modified initial conditions and . Following the notation used in [9], these polynomials will be denoted as , . By induction, it can be seen that , is a monic polynomial of degree .
It is interesting to note that if is positive definite, it can be used to define an inner product on the space of polynomials. In such a case, there exists a positive measure supported on a subset of the real line with denoting the smallest closed interval containing this support. The linear functional now has the representation . Further, the Stieltjes transform of the measure
[TABLE]
yields the Jacobi continued fraction expansion
[TABLE]
where the and are the same coefficients appearing in (1.2). The Stieltjes function plays a very fundamental role in the theory of orthogonal polynomials on the real line. It admits the power series expansion at infinity
[TABLE]
and hence acts as the generating function for the moments associated with . Further, the convergent of the continued fraction in the right hand side of (1.15) is easily seen to be and hence as , converges uniformly to on compact subsets of [4]. Here is the extended complex plane.
An equivalence transformation of the convergent of the continued fraction in (1.15) yields [4]
[TABLE]
where
[TABLE]
The quantities can also be obtained, [9, Page 110], from the recurrence relation (1.2) as
[TABLE]
Such structures, called chain sequences have been studied in [21], followed by a systematic treatment in [9] (see also [11, Section 7.2]), particularly in the context of orthogonal polynomials on the real line.
Formally stated, a sequence is called a positive chain sequence if it can be expressed in terms of another sequence as , . Here, called a parameter sequence of the chain sequence is such that and , . The parameter sequence is in general not unique, and in such cases it is interesting to study the bounds for each parameter , . The minimal parameter sequence of the positive chain sequence is defined as , , with , . Thus, for instance, the minimal parameter sequence of the chain sequence as defined in (1.16) is given by , . At the other end, there is the maximal parameter sequence , whose parameters are defined as,
[TABLE]
where denotes the supremum of the set. It is known that , , for any parameter sequence of . In case, , the parameter sequence is unique and is called a single parameter positive chain sequence, abbreviated as SPPCS in the sequel.
2. Symmetric Orthogonal Polynomials
A positive measure is called symmetric if it satisfies . The monic polynomials , , which are orthogonal with respect to satisfy
[TABLE]
with and .
In a series of research articles [3, 17, 19, 18], many properties of symmetric orthogonal polynomials have been discussed in the context of certain orthogonal Laurent polynomials. Particularly, if and are two different symmetric distributions related by the Christoffel transformation as , where is positive real constant, then
Theorem 2.1**.**
[19, Theorem 1]* Associated with and there exists a sequence of positive numbers , with and for , such that*
[TABLE]
This result was established using the transformation for and the monic polynomials , uniquely defined by
[TABLE]
where is strong distribution on . Note that if corresponds to , the transformation maps to . For any strong distribution on , the monic polynomials satisfy
[TABLE]
with and . Further, the unique coefficients , and , are all positive real numbers.
Two kinds of strong distributions play important role in this analysis. The first is the ScS distribution and the second is the SS distribution. A strong distribution with its support inside is called a ScS distribution if [19]
[TABLE]
A strong distribution with its support inside is called a SS distribution if , [19]. Then it is known that is a ScS distribution if and only if is a SS distribution. Further, if , then
[TABLE]
Conversely, is a SS distribution if and only if is a ScS distribution and in this case
[TABLE]
Then choosing
[TABLE]
with and appropriate choices of and , the relations (2.1) are obtained.
In this note, we consider the particular case when the sequence satisfy and
[TABLE]
This sequence can be obtained from appropriate conditions imposed on the coefficients and , for instance, choosing the coefficients such that they satisfy and so on. Consequently, the coefficients associated with the Christoffel transformation mentioned above satisfy
[TABLE]
Thus it can be seen that transformations of the symmetric measures are related to transformations of strong distributions on which possess special properties like symmetry. In this note, we study this particular case of the transformation from the point of view of a perturbation of the chain sequences associated with polynomial sequences orthogonal on and some related consequences. We also provide an illustration using the Laguerre polynomials in the last section.
3. Perturbed chain sequences
The theory of chain sequences has been used to study many properties of a given orthogonal polynomial system on the real line, for instance, its true interval of orthogonality, which is the smallest closed interval that contains all the zeros of all the polynomials of such a system. Denoting the true interval of orthogonality of satisfying (1.2) as and
[TABLE]
the following are known to be equivalent, [11, Corollary 7.2.4],
- (i)
is contained in , 2. (ii)
for and both and are chain sequences.
We note that here . In particular, the true interval of orthogonality is a subset of if and only if for and there are numbers such that , , , satisfying,
[TABLE]
As in [9], the sequence is constructed using another sequence , where and , . For details, the reader is referred to [9, Chapter 1, Theorems 9.1, 9.2], where it is shown that
[TABLE]
and the parameters are given by , . Hence when , we obtain the minimal parameter sequence .
Associated with the chain sequence , another sequence arises in a very natural way. Defining and
[TABLE]
it can be seen that becomes a chain sequence with the minimal parameter sequence where and , . Hence, we give the following definition which was given earlier in [2] with reference to orthogonal polynomials on the unit circle.
Definition 3.1**.**
Suppose is a chain sequence with as its minimal parameter sequence. Let be another sequence given by and for . Then the chain sequence having as its minimal parameter sequence is called as complementary chain sequence of .
If , a non-minimal parameter sequence is obtained for the chain sequence . In this case, the associated chain sequence , is defined as
[TABLE]
where for .
Definition 3.2**.**
Suppose is a chain sequence with as its non-minimal parameter sequence. Let be another sequence given by for . Then the chain sequence having as its parameter sequence is called as generalised complementary chain sequence of .
It may be noted from the above two definitions that for a fixed chain sequence, while its complementary chain sequence is unique, its generalised complementary chain sequence need not be unique. In fact, a chain sequence will have as many generalised complementary chain sequences as its non-minimal parameter sequences. Naturally, the complementary chain sequence and all the generalised complementary chain sequences will coincide only for a SPPCS.
We would like to mention that the chain sequences and have definite sources in the theory of orthogonal polynomials on the real line. To see this, first note that the symmetric polynomials satisfy the property , , which implies the existence of two OPS and such that
[TABLE]
It is interesting to note that is the sequence of kernel polynomial corresponding to based at the origin and abbreviated as KOPS in the sequel.
Further, if the polynomials , , satisfy the recurrence relation,
[TABLE]
with and then,
- (i)
, , if and only if
[TABLE] 2. (ii)
, , if and only if
[TABLE]
With these notations, the parameter sequences can be denoted as and , . Further, denoting , , the following theorem shows that the polynomials and associated respectively, with the complementary chain sequence and the generalised complementary chain sequence , can be attributed to a particular perturbation of the recurrence coefficients of the polynomials .
Remark 3.1**.**
Such perturbations of the recurrence coefficients as well as of the Stieltjes function have been studied deeply. The reader is referred to [7, 10, 22] for some details. In most of the cases only a single modification or a finite composition of modifications is considered. In this note however, all the recurrence coefficients are perturbed.
Theorem 3.1**.**
Let the symmetric polynomials satisfy
[TABLE]
with , and where, for ,
[TABLE]
Then, with , , where , satisfy,
[TABLE]
with the initial conditions and .
Proof.
First note that, the perturbation (3.5) implies that the sequence of coefficients is replaced by . That is, are pair-wise interchanged to , . Then, for ,
[TABLE]
which implies,
[TABLE]
or equivalently,
[TABLE]
Similarly, for ,
[TABLE]
which implies,
[TABLE]
or equivalently,
[TABLE]
Using (3.7) and (3.8), it is easy to find the three term recurrence relations for and . For this, first is eliminated. From (3.8), it can be seen that,
[TABLE]
Using this in (3.7), gives,
[TABLE]
with and (using (3.8)) . Similarly, (3.7) gives
[TABLE]
Using this in (3.8) yields,
[TABLE]
with the initial conditions and (using (3.7)) , thus proving the theorem. ∎
Corollary 3.1**.**
Consider the OPS satisfying (3.10) but for . Then is associated with the generalised complementary chain sequence .
Proof.
From the recurrence relation
[TABLE]
with and , the chain sequence is given by
[TABLE]
with the parameter sequence = . The result now follows since , . ∎
The OPS can be seen to be co-recursive with respect to the OPS arising from the initial conditions and . The co-recursive polynomials have been investigated in the past; see for example, [8], and later [12] in which the structure and spectrum of the generalised co-recursive polynomials have been studied.
Further, from (3.10), the associated chain sequence is with the first few terms as
[TABLE]
Proceeding as above, we obtain the minimal parameter sequence where and , . which shows that the OPS is associated with the complementary chain sequence .
Viewing the generalised complementary chain sequences as perturbations of the minimal parameters or simply a transformation of the original chain sequence, we give an important consequence of Theorem 3.1.
Corollary 3.2**.**
The kernel polynomial system remains invariant under generalised complementary chain sequence if the sequence satisfies,
[TABLE]
Proof.
The proof follows from a comparison of (3.9) and the expressions for and . ∎
Corollary 3.2 is important because it is known [9, Ex. 7.2, p. 39], that the relation between the monic orthogonal polynomials and the kernel polynomials is not unique. That is, for fixed , though will lead to a unique kernel polynomial system , there are infinite number of other monic orthogonal polynomial systems which has the same as their kernel polynomial system. Hence generalised complementary chain sequences can be used to construct two orthogonal polynomials systems having the same kernel polynomial systems.
The following theorem unifies the recurrence relations for the polynomials and the associated kernel polynomials for both the chain sequence as well as its generalised complementary chain sequence.
Theorem 3.2**.**
Consider the recurrence relation,
[TABLE]
with and . Then,
- (i)
, , if and only if,
[TABLE] 2. (ii)
, , if and only if,
[TABLE]
Let the zeros of and be denoted as
[TABLE]
For fixed , by interlacing of zeros of and it is understood that are mutually separated by for . Further, in the present case, it is interesting to note from (3.1) and (3.10), that the sum of the roots of is given by while that for is .
Remark 3.2**.**
It is clear that if , interlacing of the zeros of and can never occur.
For , we have the following result.
Proposition 3.1**.**
For fixed , the zeros and cannot interlace if and have the same sign for some .
Proof.
Suppose and for some . If the zeros of and interlace, then which is a contradiction.
The case and can be proved similarly. ∎
The last result in this section shows that while the generalised complementary chain sequence of associated with yields an OPS, that associated with the associated polynomials leads to a KOPS.
Theorem 3.3**.**
Consider the OPS . Then the generalised complementary chain sequence associated with leads to a KOPS satisfying the relation
[TABLE]
with and .
Proof.
It is clear from (3.11) that satisfy
[TABLE]
with and . The associated chain sequence is
[TABLE]
with the (non-minimal) parameter sequence . Hence the OPS associated with the generalised complementary chain sequence satisfy (3.12).
To prove that is a KOPS, consider the polynomials given by
[TABLE]
The first thing that we require is that so that choosing , we have .
Suppose now that satisfy the recurrence relation
[TABLE]
with and and where the coefficients and are to be determined. One way for the recurrence relation to hold, is that we must have which implies , . One possible choice for and satisfying the above equations is
[TABLE]
Since for , by Favard’s Theorem [9, Theorem 4.4, p. 21] becomes a OPS and its corresponding KOPS [9, eqn. 7.3, p. 35]. ∎
Corollary 3.3**.**
The following holds
[TABLE]
Proof.
Comparing with the recurrence relation (3.1), it can be observed that are co-recursive with respect to and arise due to change in the initial value . Hence , [8], so that
[TABLE]
Since , , (3.3) follows. ∎
Remark 3.3**.**
The polynomials in the left hand side of (3.3) are quasi-orthogonal of order 2 on . For details regarding quasi-orthogonality, the reader is referred to [5] and the references therein.
4. Concluding remarks
- (A)
The monic Jacobi matrix of the polynomials and are given respectively by,
[TABLE]
The respective decomposition of the above Jacobi matrices are then given by,
[TABLE]
and,
[TABLE]
It may be observed that can be obtained from by deleting the first column of while can be obtained from by adding the first column of , with replaced by , as the first column of . The Jacobi matrix and its LU decomposition for the polynomial system can be obtained similarly.
The monic Jacobi matrix associated with the three canonical transformations, the Christoffel, the Geronimus and the Uvarov transformations, are found in [6], wherein the procedure is given using the Darboux transformation. Hence, it will be interesting to study the application of Darboux transformation in the case of (generalised) complementary chain sequences. 2. (B)
The results obtained in this note can be applied to the Laguerre polynomials which provide some insights into chain sequences related to these orthogonal polynomials.
Consider the three term recurrence relation satisfied by the generalized Laguerre polynomials , [9, Page 154],
[TABLE]
with and and where , . Using the notations introduced immediately after (3.1), the associated chain sequence is,
[TABLE]
and as can be easily verified, the minimal parameters are given by, , . It is easily seen that , and hence by [2, Lemma 2.3], the chain sequence complementary to is a SPPCS. Moreover, for , and hence by Wall’s criteria for SPPCS [21, Theorem 19.3], determines its parameters uniquely. Further, choosing , it is found that and implies . Similarly, implies . Proceeding further on similar lines, it can be easily proved by induction that , and , . This gives the recurrence relation for the associated kernel polynomials as
[TABLE]
with and . Clearly, as is known, , .
Consider now the polynomials satisfying the recurrence relation
[TABLE]
with and . From the related chain sequence, we obtain the sequence where , and , . The kernel polynomial sequence associated with satisfy
[TABLE]
with and . If we let , the resulting polynomials satisfy
[TABLE]
with and . From (4.1) it is clear that these polynomials are the associated generalized Laguerre polynomials of order 1 but with shifted to . The polynomial sequence corresponding to the generalized complementary chain sequence satisfy
[TABLE]
with and . Comparing with (4.2), we find that , .
The (co-recursive) polynomials corresponding to the complementary chain sequence satisfy the recurrence
[TABLE]
with and .
Moreover, since the condition in Corollary 3.2 is satisfied, the kernel polynomials for the OPS is the same (upto a constant multiple) as that for the OPS . 3. (C)
We recall that the Routh-Romanovski Laguerre polynomials which are analogous to Laguerre polynomials are given by
[TABLE]
The sequence are the polynomials studied as one of the three finite classes of hypergeometric orthogonal polynomials [13], see also [14, 15].
Further, the sequence satisfy the three term recurrence [13, eqn. 4.19]
[TABLE]
The above recurrence relation can be normalised to satisfy a recurrence relation of the form (1.2). Hence it will be interesting to see the effect of (generalised) complementary chain sequence on these polynomials. It is important to remark that the results related to -analogue of Routh-Romanovski polynomials on the unit circle are studied in [20].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. E. Andrews, R. Askey and R. Roy, Special functions , Encyclopedia of Mathematics and its Applications, 71, Cambridge Univ. Press, Cambridge, 1999.
- 2[2] K. K. Behera, A. Sri Ranga and A. Swaminathan, Orthogonal polynomials associated with complementary chain sequences, SIGMA Symmetry Integrability Geom. Methods Appl. 12 (2016), Paper No. 075, 17 pp.
- 3[3] A. C. Berti and A. Sri Ranga, Companion orthogonal polynomials: some applications, Appl. Numer. Math. 39 (2001), no. 2, 127–149.
- 4[4] C. F. Bracciali, D. K. Dimitrov and A. Sri Ranga, Chain sequences and symmetric generalized orthogonal polynomials, J. Comput. Appl. Math. 143 (2002), no. 1, 95–106.
- 5[5] C. Brezinski, K. A. Driver and M. Redivo-Zaglia, Quasi-orthogonality with applications to some families of classical orthogonal polynomials, Appl. Numer. Math. 48 (2004), no. 2, 157–168.
- 6[6] M. I. Bueno and F. Marcellán, Darboux transformation and perturbation of linear functionals, Linear Algebra Appl. 384 (2004), 215–242.
- 7[7] K. Castillo, F. Marcellán and J. Rivero, On co-polynomials on the real line, J. Math. Anal. Appl. 427 (2015), no. 1, 469–483.
- 8[8] T. S. Chihara, On co-recursive orthogonal polynomials, Proc. Amer. Math. Soc. 8 (1957), 899–905.
