Polynomial perturbations of hermitian linear functionals and difference equations
M. J. Cantero, L. Moral, L. Velazquez

TL;DR
This paper introduces a new method for analyzing polynomial modifications of hermitian functionals on the unit circle, characterizing quasi-definiteness via difference equations for Schur parameters, with applications to orthogonal polynomials.
Contribution
It presents a novel approach to study polynomial modifications of arbitrary degree for hermitian functionals, linking quasi-definiteness to recurrence relations of Schur parameters.
Findings
Characterization of quasi-definiteness through difference equations.
Analysis of degree one polynomial perturbations of Lebesgue measure.
Classification of orthogonal polynomials related by linear relations.
Abstract
This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial modifications of arbitrary degree. The main objective is the characterization of the quasi-definiteness of the functionals involved in the problem in terms of a difference equation relating the corresponding Schur parameters. The results are presented in the general framework of (non necessarily quasi-definite) hermitian functionals, so that the maximum number of orthogonal polynomials is characterized by the number of consistent steps of an algorithm based on the referred recurrence for the Schur parameters. Some concrete applications to the study of orthogonal polynomials on the unit circle show the effectiveness of this new approach: an exhaustive…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8Peer 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 · Matrix Theory and Algorithms · Advanced Topics in Algebra
Polynomial perturbations of hermitian linear functionals and difference equations
M.J. Cantero, L. Moral, L. Velázquez 111The work of the authors was partially supported by the Spanish grants from the Ministry of Education and Science, project code MTM2005-08648-C02-01, and the Ministry of Science and Innovation, project code MTM2008-06689-C02-01, and by Project E-64 of Diputación General de Aragón (Spain).
(Departamento de Matemática Aplicada. Universidad de Zaragoza. Spain)
Abstract
This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial modifications of arbitrary degree.
The main objective is the characterization of the quasi-definiteness of the functionals involved in the problem in terms of a difference equation relating the corresponding Schur parameters. The results are presented in the general framework of (non necessarily quasi-definite) hermitian functionals, so that the maximum number of orthogonal polynomials is characterized by the number of consistent steps of an algorithm based on the referred recurrence for the Schur parameters.
Some concrete applications to the study of orthogonal polynomials on the unit circle show the effectiveness of this new approach: an exhaustive and instructive analysis of the functionals coming from a general inverse polynomial perturbation of degree one for the Lebesgue measure; the classification of those pairs of orthogonal polynomials connected by a kind of linear relation with constant polynomial coefficients; and the determination of those orthogonal polynomials whose associated ones are related to a degree one polynomial modification of the original orthogonality functional.
Keywords and phrases: Orthogonal polynomials, Hermitian functionals, Schur parameters.
(2000) AMS Mathematics Subject Classification: 42C05.
1 Introduction
The intense activity during the last decades around the theory of orthogonal polynomials on the unit circle has stimulated the study of perturbations of hermitian functionals. The possibility of considering modifications that do not preserve the hermitian character of the functional leads to left and right orthogonal polynomials (see [3]), thus most of the efforts have been concentrated in the analysis of hermitian perturbations as a source of new families of standard orthogonal polynomials (see the recent monograph on orthogonal polynomials on the unit circle [22, 23]) and the references therein).
This paper proposes a new method to study the hermitian modifications obtained when multiplying a hermitian functional by a Laurent polynomial of any degree, in short, the hermitian polynomial modifications. This kind of perturbation has been considered previously (see for instance [1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 24]), but the usual approaches have the drawback of being formulated in terms of orthogonal polynomials, kernels and determinants, what makes difficult the practical application, specially for perturbations of high degree.
On the contrary, our method is based on a recurrence for the Schur parameters of the two functionals involved in the perturbation. This provides an algorithm to generate the Schur parameters of one of the functionals, starting from the Schur parameters of the other functional. Furthermore, this recurrence yields a characterization of the maximum number of orthogonal polynomials for one of the functionals, given the number of orthogonal polynomials that the other functional has. That is, this approach permits us to study the relation between the quasi-definiteness of a functional and a polynomial modification of any degree with less computational effort than the methods already existing.
We distinguish between three different but related problems, depending on the data at hand:
- •
Basic problem: characterize when two functionals are related by a polynomial perturbation in terms of their Schur parameters.
- •
Direct problem: characterize the quasi-definiteness of a polynomial modification from the Schur parameters of the original functional.
- •
Inverse problem: characterize the quasi-definiteness of a functional from the Schur parameters of one of its polynomial modifications.
Despite the symmetry between the direct and inverse problems, they have a quite different nature which makes much more interesting the last one. The root of this difference is the fact that, given a functional and a Laurent polynomial, the corresponding polynomial modification is uniquely defined while there are infinitely many functionals whose modification is the given one. This leads to a rich structure in the set of solutions of the inverse problem which, as we will see, is related to another kind of interesting modifications: the addition of Dirac deltas and its derivatives. Hence, any information about inverse polynomial modifications can be translated as a result on perturbations by Dirac deltas.
Furthermore, as an example will show, some special solutions of an inverse problem can act as “attractors” for the asymptotics of the parameters of other solutions. Thus, the analysis of those special solutions provides information about the asymptotics of perturbations by Dirac deltas.
The rich structure of the inverse problem has a double interest due to the fact that our approach, based on a recurrence for the Schur parameters, also yields interesting connections between the study of polynomial modifications and difference equations. Therefore, the asymptotics of the solutions of the inverse problem is closely related to the asymptotics of difference equations.
The content of the paper is structured in the following way: the rest of the introduction summarizes the basic definitions and notations; Section 2 includes the main results about hermitian polynomial modifications, i.e., it is devoted to what we call basic problem; direct and inverse problems are discussed in Section 3, including an exhaustive analysis of an explicit example of inverse problem; and Section 4 shows other applications of the techniques developed in the paper, i.e., a complete classification of the pairs of orthogonal polynomials related by certain type of linear relations with constant polynomial coefficients, and the determination of the orthogonal polynomials whose associated ones come from a polynomial modification of degree one of the original orthogonality functional.
Now we proceed with the conventions for the notation.
In what follows and are called respectively the unit circle and the open unit disk on the complex plane. is the complex vector space of polynomials with complex coefficients, and the vector subspace of polynomials whose degree is not greater than , while is the trivial subspace. is the complex vector space of Laurent polynomials and, for , we define the vector subspace . Given any we define and, if , denotes its reversed polynomial . Sometimes we use the notation for polynomials whose degree can be smaller than . Then we refer to the operator when it is advisable to avoid misunderstandings.
Any hermitian linear functional on (, ) defines a sesquilinear functional by
[TABLE]
The sequence is a sequence of orthogonal polynomials with respect to the hermitian linear functional if
- (i)
,
- (ii)
,
and when such a sequence exists is called a quasi-definite functional. If we can assure only the existence of a finite segment of orthogonal polynomials, i.e., a finite set of polynomials satisfying (i) and (ii). When has a finite segment of orthogonal polynomials of length we say that is quasi-definite on .
In the positive definite case (, ) there exists a positive measure supported on providing an integral representation for the functional ,
[TABLE]
Due to this reason a sequence satisfying (i) and (ii) is called a sequence of orthogonal polynomials on the unit circle, even in the general quasi-definite case. If for all , is called a sequence of orthonormal polynomials on the unit circle. We denote by the orthonormal polynomials with positive leading coefficients.
In that follows denotes the sequence of monic orthogonal polynomials (MOP) with respect to a hermitian functional . Two hermitian linear functionals have a common finite segment of MOP iff there exists such that for any , although requiring this condition to hold only for any is enough due to the hermiticity. In this case we say that and are equivalent in or, in a more symbolic way, in . If this holds for any , we simply say that and are equivalent and we write .
A sequence is a sequence of MOP on the unit circle iff it satisfies the recurrence relation (see [25, 13, 22])
[TABLE]
with and for . Applying the operator to the above recurrence we get the equivalent one
[TABLE]
The values are called the Schur parameters or reflection coefficients of the hermitian linear functional .
A straightforward computation yields
[TABLE]
where relates and by When is positive definite for , which means that for .
2 Hermitian polynomial modifications
We are interested in those (Laurent) polynomial modifications of hermitian functionals which preserve their hermitian character, in short, the hermitian polynomial modifications of hermitian functionals. If is a linear functional on and the modified functional is defined by
[TABLE]
The modified functional is hermitian for every hermitian iff , which is equivalent to state that with (see [2]). Such a polynomial can be uniquely determined by simply requiring , a convention that we will assume in what follows. We will refer to as the degree of the polynomial modification, which we will consider greater than or equal to one, and will be called a hermitian Laurent polynomial of degree .
Another way to characterize a hermitian polynomial modification is through the polynomial of degree . The condition means that is self reciprocal, i.e., . Thus the hermitian polynomial modifications are related to the self-reciprocal polynomials of even degree.
The set of roots of a self-reciprocal polynomial, counting the multiplicity, is invariant under the transformation . That is, their roots lie on the unit circle or appear in symmetric pairs . Indeed, this property characterizes the self-reciprocal polynomials up to numerical factors. This implies that any self-reciprocal polynomial of even degree factorizes into a product of self-reciprocal polynomials of degree 2. As a consequence, an arbitrary hermitian polynomial modification is a composition of elementary ones of degree 1, i.e., if with , then with and .
Sometimes we will deal with polynomials whose degree is not necessarily but such that . In this case we will say that is self-reciprocal in to avoid misunderstandings. Such a polynomial has the general form where is strictly self-reciprocal. Thus, a self-reciprocal polynomial in is actually self-reciprocal iff it has no zeros at the origin.
Given a hermitian functional and a Laurent polynomial , our purpose is to obtain relations between the MOP and Schur parameters associated with the functionals and . Multiplying by a non null real factor gives rise to a hermitian functional which is equivalent to and, hence, with the same MOP and Schur parameters as . Therefore, concerning our aim, the Laurent polynomial , as well as the polynomials and , are defined up to non null real factors.
The following general result will be useful to achieve our objective. In what follows we denote by the orthogonal complement in of a subspace .
Lemma 2.1** (see [26]).**
Let be a hermitian functional such that the corresponding -th MOP exists. Then, is a basis of \bigl{(}z^{r}\mathbb{P}_{n-r-1}\bigr{)}^{\bot_{n+r}} for , and a generator system of for .
Sketch of the proof. If , the orthogonality of assures that \mathfrak{B}\subset\bigl{(}z^{r}\mathbb{P}_{n-r-1}\bigr{)}^{\bot_{n+r}}. Besides, iff , , . Furthermore, this decomposition is unique because which proves the linear independence of Then, the first result follows from the fact that \sharp\mathfrak{B}=2r+1=\dim\bigl{(}z^{r}\mathbb{P}_{n-r-1}\bigr{)}^{\bot_{n+r}}.
Suppose now that . From the previous result we know that is a basis of . Hence, is a linear independent subset of with elements, thus it is a basis of , which proves the second result.
Our interest in the previous lemma is the following direct consequence.
Corollary 2.2**.**
Let be a hermitian functional such that the corresponding -th MOP exists. Then, every polynomial \Omega\in\bigl{(}z^{r}\mathbb{P}_{n-r-1}\bigr{)}^{\bot_{n+r}} has a unique decomposition , , , for , and every polynomial has infinitely many such decompositions for .
Remark 2.3*.*
It is worth it to remark the case in the above corollary, which says that every polynomial admits a unique decomposition , , .
The next theorem is the starting point for our approach to the study of hermitian polynomial modifications of hermitian functionals.
Theorem 2.4**.**
Let , be hermitian functionals with finite segments of MOP , respectively, and let with a polynomial of degree . Then, the following statements are equivalent:
- (i)
* in .*
- (ii)
There exist , with such that
[TABLE]
- (iii)
There exist , with such that
[TABLE]
The polynomials , satisfying or are unique, , and .
Proof.
The equivalence between (ii) and (iii) follows from the use of the operator and the fact that is a self-reciprocal polynomial of degree . Also, assuming (ii) we get because , and the equality (\varphi_{j},\varphi_{j})_{u}=u\bigl{[}\varphi_{j}z^{-j}\bigl{]}=C_{j}(0)\varepsilon_{j+r} implies . On the other hand, evaluating (4) at we find that . It only remains to prove the equivalence between (i) and (ii) and the uniqueness of decomposition (3).
Suppose (i), i.e., , , for any . The orthogonality of with respect to gives
[TABLE]
which means that A\varphi_{j}\in\bigl{(}z^{r}\mathbb{P}_{j-1}\bigr{)}^{\bot_{2r+j}} with respect to . Using Corollary 2.2 we get (3) and the uniqueness of the polynomials , .
On the other hand, if , satisfy (3), the orthogonality of with respect to yields
[TABLE]
for and
[TABLE]
So, for iff is a finite segment of MOP with respect to , which means that in . ∎
Equality (4) is true taking , no matter whether has degree or not. In what follows we will assume this convention for the polynomials .
Remark 2.5*.*
The functional has a finite segment of MOP of length (at least) one iff . Therefore, Theorem 2.4 assures that the condition is equivalent to the existence of a (unique) decomposition
[TABLE]
with . However, Remark 2.3 says even more: no matter the value of , there is always a unique decomposition like (5). The equality implies that is only responsible of .
The above theorem has the following consequence for quasi-definite functionals.
Corollary 2.6**.**
Let , be quasi-definite functionals with sequences of MOP , respectively, and let with a polynomial of degree . Then, iff there exist polynomials , with such that
[TABLE]
or equivalently
[TABLE]
For convenience, in what follows we will use a matrix notation and we will adopt some definitions and conventions that will be used in the rest of the paper. If is a hermitian Laurent polynomial of degree , and are the polynomials given by , . We denote by and the -th MOP with respect to the hermitian functionals and respectively. Also,
[TABLE]
The matrices and , known as transfer matrices, permit us to write recurrence relations (1) and (2) for and in the compact form
[TABLE]
while the matrices make possible to combine (3) and (4) into
[TABLE]
The structure of the matrices is worth to be remarked.
Definition 2.7**.**
A polynomial matrix \mathcal{C}=\scriptsize\pmatrix{C_{1}&D_{1}\cr D_{2}&C_{2}}, , satisfying with J=\scriptsize\pmatrix{0&1\cr 1&0} will be called a -self-reciprocal matrix in . This is equivalent to state that and .
We denote by the set of -selfreciprocal matrices in such that and . These conditions mean that and , thus the general form of a polynomial matrix is
[TABLE]
where here and below we assume that .
Given a polynomial matrix like (8) we will denote
[TABLE]
which is -self-reciprocal too, but in general does not necessarily belong to because can have degree .
The determinant of a -self-reciprocal matrix in is a self-reciprocal polynomial in . When has degree we will say that is a regular -self-reciprocal matrix. This is equivalent to , which in case of means simply . We will denote by the subset of regular -self-reciprocal matrices of .
The next result about -self-reciprocal matrices will be useful later on.
Lemma 2.8**.**
Let \mathcal{S}=\pmatrix{z&a\cr z\overline{a}&1}, \mathcal{T}=\pmatrix{z&b\cr z\overline{b}&1} with .
- (i)
If , , the equation defines a matrix iff
[TABLE]
In this case .
- (ii)
If , , the equation defines a matrix iff
[TABLE]
In this case .
Proof.
If the equation can be written as
[TABLE]
Let . Then is a -self-reciprocal matrix in