Christoffel formula for kernel polynomials on the unit circle
Cleonice F. Bracciali, Andrei Mart\'inez-Finkelshtein, A. Sri Ranga, and Daniel O. Veronese

TL;DR
This paper derives a formula linking Christoffel-Darboux kernels for measures on the unit circle when the measure is modified by a polynomial factor, and explores how this affects associated recurrence parameters and specific measure examples.
Contribution
It provides a determinantal formula connecting kernels of original and modified measures and analyzes the impact on recurrence coefficients for orthogonal polynomials.
Findings
Derived a determinantal formula for kernel transformation under polynomial measure modification
Established relations between recurrence parameters of original and modified measures
Applied results to specific measures like Geronimus weight and hypergeometric functions
Abstract
Given a nontrivial positive measure on the unit circle, the associated Christoffel-Darboux kernels are , , where are the orthonormal polynomials with respect to the measure . Let the positive measure on the unit circle be given by , where is a conjugate reciprocal polynomial of exact degree . We establish a determinantal formula expressing directly in terms of . Furthermore, we consider the special case of ; it is known that appropriately normalized polynomials satisfy a recurrence relation whose coefficients are given in terms of two sets of real parameters and ,…
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.
Christoffel formula for kernel polynomials on the unit circle
C.F. Braccialia, A. Martínez-Finkelshteinb, A. Sri Rangaa and D.O. Veronesec
aDMAp, IBILCE, UNESP - Universidade Estadual Paulista,
15054-000, São José do Rio Preto, SP, Brazil.
aDepartamento de Matemáticas, Universidad de Almería, 04120 Almería,
and Instituto Carlos I de Física Teórica and Computacional, Granada University, Spain
cICTE, UFTM - Universidade Federal do Triângulo Mineiro,
38064-200 Uberaba, MG, Brazil. [email protected] (corresponding author)
Abstract
Given a nontrivial positive measure on the unit circle, the associated Christoffel-Darboux kernels are , , where are the orthonormal polynomials with respect to the measure . Let the positive measure on the unit circle be given by , where is a conjugate reciprocal polynomial of exact degree . We establish a determinantal formula expressing directly in terms of .
Furthermore, we consider the special case of ; it is known that appropriately normalized polynomials satisfy a recurrence relation whose coefficients are given in terms of two sets of real parameters and , with for . The double sequence characterizes the measure . A natural question about the relation between the parameters , , associated with , and the sequences , , corresponding to , is also addressed.
Finally, examples are considered, such as the Geronimus weight (a measure supported on an arc of ), a class of measures given by basic hypergeometric functions, and a class of measures with hypergeometric orthogonal polynomials.
Keywords: Orthogonal functions, Christoffel formulas, three term recurrence relation, orthogonal polynomials on the unit circle.
1 Introduction
Given a nontrivial positive measure on the unit circle the associated orthonormal polynomials are defined by and
[TABLE]
for , where stands for the Kronecker delta. These are orthogonal polynomials on the unit circle, or in short, OPUC. A recent complete treatise on OPUC is the monograph [24]. Among their fundamental properties is that all their zeros belong to the open unit disk .
The reproducing kernels (also known as Christoffel–Darboux kernels or simply CD kernels) associated with the measure are given by
[TABLE]
They have been the subject of study in many recent contributions including the review [25] on their use in the spectral theory of orthogonal polynomials and random matrices.
In what follows we use the standard notation for the reversed (or conjugate-reciprocal) polynomials: if is an algebraic polynomial of degree , then
[TABLE]
With this notation, the well-known Christoffel-Darboux formula says that for ,
[TABLE]
Notice that . On the other hand, if , then all zeros of (as a polynomial in ) lie on , and up to a normalization factor, is a so-called para-orthogonal polynomial of degree . For information concerning para-orthogonal polynomials we refer to [4] and references therein.
A multiplication of the given measure by a factor that is positive on its support, , yields a new measure and a corresponding set of OPUC and of CD kernels. It is a natural question to ask whether there is an explicit connection between these two sets.
In this paper we are interested in the case when the factor is of the form , where is a polynomial. For the orthogonality on the real axis, this is the content of the so-called Christoffel formula (see, for example, [29]), which was extended in [20] to cover OPUC (see also [22], which generalizes [20] and constitutes a nice survey of related results obtained prior to 1999, as well as some recent related results in [1, 2]). In these cases there is a determinantal expression for the “new” orthogonal polynomials in terms of those orthogonal with respect to .
One of the goals of this paper is to obtain such a determinantal formula for the CD kernels on . Observe that this kind of expressions is not a trivial consequence of the analogous formulas for OPUC.
Recall that the classical Fejér–Riesz theorem (see [19, §1.12]) says that every non-negative trigonometric polynomial can be written as , , where is an algebraic polynomial non-vanishing in . Equivalently, we can say that is of the form , where is a self-reciprocal polynomial (i.e., ) of degree .
Motivated by this result, we slightly weaken the assumptions of Fejér and Riesz and require the trigonometric multiplication factor of to be non-negative only within the support of . More precisely, let be a self-reciprocal polynomial of exact degree , , and non-negative on , and let
[TABLE]
which is also a positive measure on .
We denote by
[TABLE]
the zeros of . Those of them not on must appear in pairs symmetric with respect to ; notice that no is . However, unlike in the case of Fejér–Riesz, if , zeros of on also can be simple, as long as the hypothesis of positivity of on (i.e., the positivity of on ) is preserved.111For instance, if , we can consider the self reciprocal polynomial , with and . Then the rational function
is positive on , but not on the entire ; see Example 4.3 in Section 4 below.
In what follows we will be mainly interested in the case when all ’s are pairwise distinct (or equivalently, when all zeros of are simple).
Definition 1.1**.**
Given , we call a set of not identically [math] algebraic polynomials admissible if , ,
[TABLE]
and either one of the following three conditions is satisfied:
[TABLE]
[TABLE]
or
[TABLE]
Theorem 1.1**.**
For an admissible set and define
[TABLE]
and the matrix
[TABLE]
Then, there exists a polynomial of degree such that
[TABLE]
Observe that for certain values of , both sides of (1.10) can vanish, in which case the identity in (1.10) is formally correct, but practically useless. Thus, a natural question is about sufficient conditions for .
Theorem 1.2**.**
Let all the zeros of be simple. For an admissible set and , with the notations of Theorem 1.1, if either
- i)
, condition (1.5) holds and polynomials are linearly independent, or 2. ii)
, condition (1.6) holds and polynomials are linearly independent, or 3. iii)
, condition (1.7) holds and polynomials , , …, are linearly independent,
then .
Remark 1.1**.**
If the polynomial has non-simple zeros, then the results above still hold if one replaces the polynomials in each row of the matrix by the respective derivatives in accordance with the order of multiplicity. For example, if , then the fourth row of must be replaced by
[TABLE]
where stands for its derivative with respect to .
Given an admissible set , we define , with
[TABLE]
Observe that .
Proposition 1.3**.**
A set of polynomials is admissible if and only if is. Moreover, satisfies (1.5) (resp., (1.7)), then satisfies (1.7) (resp., (1.5)).
Additionally, if ,
[TABLE]
It would be nice to have a simple recipe for constructing an admissible set for which (1.10) renders a non-trivial identity for the CD kernel . Obviously, there is no “universal” such that in (1.10) is for all . However, there is a simple admissible set that guarantees this, at least for .
It is easy to check that , with
[TABLE]
is admissible and satisfies both (1.5) and (1.6). The corresponding is
[TABLE]
satisfying, by Proposition 1.3, condition (1.7).
Proposition 1.4**.**
Let the admissible set of polynomials be given by (1.13), and let be such that
[TABLE]
Then , , …, are linearly independent. In particular, it holds for .
Corollary 1.5**.**
For the admissible sets of polynomials and , given by (1.13) and (1.14), respectively, both and in (1.10) when .
Example 1.1**.**
Let us consider the normalized Lebesgue measure on ,
[TABLE]
Then
[TABLE]
so that all satisfy conditions (1.15) from Proposition 1.4. In particular, for all such , and for the admissible set given by (1.13), in (1.10). However, , which implies that polynomials in (1.8) are linearly dependent for any choice of the admissible set of polynomials , and hence, one cannot find an admissible set for which . Clearly, we still can recover by taking limit,
[TABLE]
The proofs of the assertions above are gathered in Section 2.
In Section 3 we consider an interesting particular case of , for which constitute an instance of paraorthogonal polynomials on . A convenient “symmetrization” of these polynomials was found in [8]; it was shown there that the appropriately normalized , that we denote by (see the precise definition in Section 3) satisfy a three term recurrence relation of the form
[TABLE]
for , with and . Sequences and are both real, with for . As shown in [4, 6, 8], the double sequence is a parametrization of the measure , alternative to its Verblunsky coefficients. Thus, a natural question is the relation between the parameters , , associated with , and the sequences , , corresponding to . These questions will be addressed in Section 3. Since the statement of the corresponding results requires introducing a considerable piece of notation, we postpone it to the aforementioned section.
Finally, in Section 4 we consider four different applications of our formulas: a rather straightforward case when is the Lebesgue measure on , the Geronimus weight (a measure supported on an arc of ), a class of measures given by basic hypergeometric functions, and a class of measures with hypergeometric OPUC.
2 Proof of the Christoffel formula for kernels
First we discuss a characterization of the kernel polynomials .
Let be fixed. With the positive measure on we consider the complex-valued measure on given by,
[TABLE]
The following simple lemma will be useful in the forthcoming proofs:
Lemma 2.1**.**
Let be an integrable function on such that either one of the following condition is satisfied:
- i)
* and*
[TABLE]
or 2. ii)
* and*
[TABLE]
Then -a.e. (in case when ) and \mu\big{|}_{\mathbb{T}\setminus\{w\}}-a.e., otherwise.
In particular, if is a polynomial and has an infinite number of points of increase, then i) or ii) imply that .
Proof.
Consider i) first. For the statement is trivial, so let . By assumptions of the lemma,
[TABLE]
and hence,
[TABLE]
In particular, taking the real part, we get
[TABLE]
and it remains to notice that
[TABLE]
unless and .
In the case ii), we have that
[TABLE]
so that
[TABLE]
and again,
[TABLE]
unless and .
Lemma 2.2**.**
For a fixed and , the CD kernel is a polynomial in of degree , characterized up to a constant factor by the following orthogonality relations,
[TABLE]
and the additional condition
- a)
if , then is of degree exactly ; 2. b)
if , then
[TABLE]
Proof.
Orthogonality conditions (2.3) are a straightforward consequence of (1.2) and of the well-known relations for the reversed polynomials,
[TABLE]
Since for , , using the definition (1.1) of we conclude that it is a polynomial in of degree . For , using (1.2) and the fact that does not vanish inside or on the unit disk, we see that
[TABLE]
Let us prove that these relations characterize the CD kernel.
Assume that . If is a polynomial of degree exactly , satisfying
[TABLE]
then there exists a constant such that is of degree . By hypothesis, satisfies the same orthogonality conditions, so that
[TABLE]
and it remains to apply Lemma 2.1, ii), to conclude that .
On the other hand, if of degree satisfies (2.4) and is such that
[TABLE]
then there exists a non-zero constant, let us denote it by again, such that
[TABLE]
Combining it with (2.3) and (2.4) we get that for ,
[TABLE]
It means that
[TABLE]
Since cannot vanish at , we conclude that .
In order to prove Theorem 1.1 we need some preparatory steps.
With the notation of Section 1, it is immediate to check that is an algebraic polynomial in (of degree ) and in (of degree ). Furthermore, for each it vanishes at the zeros of . Thus, we can write
[TABLE]
where is an algebraic polynomial in (of degree ) and in . We need to show that for each , there exists a constant such that
[TABLE]
If this is established, the polynomial dependence of from (as well as on the admissible set chosen, see Definition 1.1) is a straightforward consequence of (2.5)–(2.6).
We prove (2.6) by appealing to the characterization of given in Lemma 2.2.
By (2.3) and the definition of , kernels satisfy
[TABLE]
Thus, a necessary condition for (2.6) is that
[TABLE]
This is always true, and it is an immediate consequence of the following lemma:
Lemma 2.3**.**
For ,
[TABLE]
Thus,
[TABLE]
Proof.
In order to calculate
[TABLE]
with account of (1.4), it is sufficient to find the values of
[TABLE]
for .
Since , we get
[TABLE]
Analogously, from , we conclude that
[TABLE]
By (2.3) it follows that all integrals in (2.10) (and consequently, in (2.9)) vanish, which yields (2.7)–(2.8).
So, the necessary condition (orthogonality) always holds. Now we go for a sufficient condition, given by a) and b) of Lemma 2.2.
Recall first the following well known fact, that we state just as a remark.
Remark 2.1**.**
By the maximum principle, for , and for . By (1.2),
[TABLE]
which for can be rewritten as
[TABLE]
The right hand side is of absolute value , so that equality is possible only for . Same analysis is valid for the other case and we conclude that the zeros of (as a polynomial of ) are of absolute value (respectively, or ) if (respectively, or ).
Lemma 2.4**.**
Let be defined by (2.5) and fixed. The following conditions are necessary and sufficient for :
- i)
* and*
[TABLE] 2. ii)
* and*
[TABLE]
Proof.
is clearly a sufficient condition in i) and ii) for (2.11) and (2.12), respectively. So, we prove that this is also necessary.
For i), if (which is equivalent to ), then by (2.8),
[TABLE]
and we use again Lemma 2.1, ii), to conclude that .
For ii), if
[TABLE]
then by (2.8) we have in fact that for ,
[TABLE]
Since , we conclude that
[TABLE]
But cannot vanish at , which implies that , and .
A combination of Lemmas 2.3 and 2.4 constitutes the proof of Theorem 1.1. Indeed, let . Consider the identity (2.5); by Lemma 2.4, i), either or . In the latter case by the characterization in Lemma 2.2, a),
[TABLE]
On the other hand, if , then again by Lemma 2.4, ii), either or
[TABLE]
in which case by Lemma 2.2, b), coincides, up to a constant factor, with .
Now we turn to Theorem 1.2.
Checking (2.11) or (2.12) is not straightforward. Seeking a more explicit algebraic condition, we introduce a notation for the minors of the matrix : the one, obtained by deleting its first row and column,
[TABLE]
and the minor obtained from by deleting its first row and its last column,
[TABLE]
Lemma 2.5**.**
Let be defined by (2.5) and fixed, and let either one of the following conditions hold:
- •
(1.5) with ;
- •
(1.7) with .
Then
[TABLE]
On the other hand, if condition (1.6) holds with , then
[TABLE]
Proof.
Under assumptions of the first part, observe that
[TABLE]
We prove the part first, assuming . If (1.5), then the leading coefficient of is leading coefficient of , so . And if (1.7) takes place, then (see Remark 2.1)
[TABLE]
so again.
Now, for the part, let and . Then, by (2.15),
[TABLE]
Under assumption (1.5) with , we conclude that
[TABLE]
and it remains to apply the assertion i) of Lemma 2.4.
If we have (1.7) with , then by (2.16),
[TABLE]
where is again a polynomial of degree . By (2.8),
[TABLE]
and by Lemma 2.1, i), we conclude again that .
Finally, notice that under (1.6), for each ,
[TABLE]
is a linear combination of integrals of the form
[TABLE]
and by (2.3), each of these integrals vanishes, so that (1.6) implies
[TABLE]
In consequence,
[TABLE]
By Lemma 2.2, b), the integral in the right hand side does not vanish. Thus, the integral in the left hand side is if and only if , and it remains to use part ii) of Lemma 2.4 to conclude the proof.
Let us look at some sufficient conditions that guarantee that either or do not vanish.
Lemma 2.6**.**
Let all the zeros of be simple, and either one of the following conditions hold:
- •
(1.5) with ;
- •
(1.7) with .
If polynomials are linearly independent, then .
Furthermore, if (1.6) holds with , then linear independence of the polynomials implies that .
Proof.
Assume that , which means that the columns of the matrix in the right hand side of (2.13) are linearly dependent: there exist constants , possibly depending on , not all zero, such that
[TABLE]
In other words, the polynomial
[TABLE]
vanishes at the zeros of , and by the assumed linear independence of ’s, .
With (1.5), and since all the zeros of are simple,
[TABLE]
and if , then by (2.7),
[TABLE]
so that again by Lemma 2.1, ii), we conclude that this is impossible.
In the same vein, with assumption (1.7),
[TABLE]
and since , by (2.7),
[TABLE]
and using Lemma 2.1, i), we arrive at the same conclusion.
Analogously, if , by the same reasoning there exists a polynomial
[TABLE]
(by the linear independence of ’s), that again vanishes at the zeros of , so that
[TABLE]
Using that and (2.17), we conclude that
[TABLE]
and it remains to use Lemma 2.1, i).
Now we can finish the proof of Theorem 1.2. Indeed, if , (1.5) holds and are all linearly independent, then we have (Lemma 2.6), then (Lemma 2.5), which implies that in (1.10), (Lemma 2.4).
On the other hand, if , (1.6) holds and are all linearly independent, then we have (Lemma 2.6), then (Lemma 2.5), which again implies that in (1.10), (Lemma 2.4).
Finally, the case of , with condition (1.7) holds, , and when polynomials , , …, are linearly independent, follows from the first case considered and Proposition 1.3 (see its proof next).
Now we turn to Proposition 1.3.
Proof of Proposition 1.3.
Recall that admissibility of means that for ,
[TABLE]
which makes the first statement of the Proposition a straightforward consequence of (1.11).
Let us use the superscript in the definition (1.8) to indicate the dependence of ’s on the admissible set explicitly:
[TABLE]
Using the identity
[TABLE]
we can rewrite it as
[TABLE]
Conjugating and using the definition (1.11) we conclude that
[TABLE]
Denoting , we have by (1.10) that
[TABLE]
Using (2.18) we continue this set of identities as
[TABLE]
Since by Proposition 1.3, is also admissible, we get from (1.10):
[TABLE]
By the definition of self-reciprocal polynomial,
[TABLE]
hence it finally simplifies to
[TABLE]
This proves (1.12).
We finish this section by establishing that the choice of given in (1.13) (and consequently, of in (1.14)) renders a non-trivial identity for the CD kernel when .
Proof of Proposition 1.4.
In order to prove our statement, we need to modify the notation, reflecting explicitly the dependence on and , but not on . Hence, along this proof we denote
[TABLE]
Observe that with the assumptions (1.15),
[TABLE]
so it is sufficient to establish the linear independence of , , …, . We do it by induction in . For , the system
[TABLE]
is linearly independent, just because, again by assumptions (1.15), , and .
Assuming that the linear independence is proved already for for all , let
[TABLE]
Again, , and for , so that , and thus,
[TABLE]
But for ,
[TABLE]
which yields now that also . It remains to observe that
[TABLE]
which, by the induction hypothesis, are linearly independent. This yields that also . Hence,
[TABLE]
are linearly independent. The proposition is proved.
3 A three-term recurrence for CD kernels
We now give some special consideration to the case in which . It is well known that the sequence satisfies a three-term recurrence relation (see [8, Thm. 2.1]). Moreover, with an appropriate normalization this recurrence takes an especially convenient form, which we briefly summarize here.
In what follows, we use the standard notation , , for the monic OPUC, as well as for the Verblunsky coefficients , . It is well known that for , and that the sequence uniquely determines the measure on and allows to recover the monic OPUC via the Szegő recurrence,
[TABLE]
(see, for example, [15] and [24]).
Let
[TABLE]
then ’s also satisfy a relation, which can be used to compute them recursively in terms of ’s,
[TABLE]
starting with .
We define the sequence
[TABLE]
It is easy to check that all , so the terms of the following sequence are all positive:
[TABLE]
With this notation we introduce the normalized CD kernels
[TABLE]
It turns out (see [8]) that they satisfy the following three-term recurrence formulas:
[TABLE]
for , with and , where both and are real sequences. In fact,
[TABLE]
and
[TABLE]
with from (3.1). In the standard terminology, this means that is a positive chain sequence, and is a parameter sequence for . From [4, 6, 23] it is known that the double sequence determines uniquely the measure on , as it happens also to the Verblunsky coefficients. There is actually a direct connection between these two parametrizations: if from to we can navigate using (3.1) and (3.5), the inverse mapping is given by
[TABLE]
with .
The Christoffel transformation , given by (1.3), induces the corresponding transformation both on the Verblunsky coefficients and on the parametrization of measures. Formulas for can be derived from [20] or [22] by evaluating the OPUC at the origin. A natural question, that we address next, is the existence of an effective way of constructing from .
If is an admissible set (see Definition 1.1) satisfying (1.5), then by Lemma 2.5, (see (2.13)), so that we can rewrite (1.10) as
[TABLE]
where each coefficient , , can be computed in a trivial fashion as a ratio of two minors of the matrix in (1.9), with in the denominators, times .
Let us consider particularly the admissible set (1.13), so that (3.8) takes the form
[TABLE]
Theorem 3.1**.**
Let . The coefficients in the left hand side of the connection formula (3.9) satisfy
[TABLE]
with .
Furthermore, the the coefficients and corresponding to the measure from (1.3) are, for ,
[TABLE]
and
[TABLE]
with defined in (3.2).
Proof.
It is easily seen from (3.4) that , . Hence, we always have
[TABLE]
One of the features of the modified kernels and is that they are conjugate-reciprocal polynomials, so that
[TABLE]
[TABLE]
and
[TABLE]
Hence,
[TABLE]
which also establishes the value of as stated in the theorem.
Next, by (3.10),
[TABLE]
From this and from the identity we easily obtain the results for . Likewise, using that -c_{n}(\nu)=\mathop{\rm Im}\big{(}R_{n}(0;\nu)/R_{n-1}(0;\nu)\big{)} we find the expression for .
From the reproducing properties of the kernels and , we have
[TABLE]
when is a polynomial of degree at most . Thus, from (3.11) we have
[TABLE]
This leads to the result for as stated.
Let us consider the simplest non-trivial case, when , so that , where is such that is positive on . Let and be respectively the CD kernel polynomials with respect to and . If the zeros and of are distinct then
[TABLE]
where
[TABLE]
and
[TABLE]
Here,
[TABLE]
In the case when has a multiple zero then the formulas for and can be replaced by
[TABLE]
Here,
[TABLE]
In terms of the normalized CD kernels and , the relation (3.9) takes the form
[TABLE]
for , where is the solution of the system of equations
[TABLE]
assuming . A direct consequence of Theorem 3.1 is the following:
Corollary 3.2**.**
The coefficients in the connection formula (3.12) satisfy
[TABLE]
with , as well as
[TABLE]
and
[TABLE]
Furthermore, the the coefficients and corresponding to the measure satisfy for ,
[TABLE]
and
[TABLE]
4 Examples
Example 4.1**.**
We start with the simplest case of the normalized Lebesgue measure on , given by (1.16), illustrating the discussion in Example 1.1 for . In this setting, , , and for the admissible set from (1.13), , and . Hence, the matrix in (1.9) is is
[TABLE]
But for the normalized Lebesgue measure , the CD kernel satisfies the identities
[TABLE]
which can be used to simplify the expression for for :
[TABLE]
Recall that
[TABLE]
so that, as ,
[TABLE]
Using the arguments from Example 1.1, for
[TABLE]
we have
[TABLE]
Example 4.2**.**
We consider the positive measure on the unit circle given by
[TABLE]
where and . Recall that
[TABLE]
The choice
[TABLE]
makes a probability measure (see [28]). It is also known that the normalized CD-kernels, defined as in (3.3), are
[TABLE]
where , , and . Furthermore, the parametrization of (see Section 3) is given by
[TABLE]
with , see [28].
If we consider the normalized kernel polynomials with respect to the measure
[TABLE]
where , with and , then all formulas from Corollary 3.2 apply.
The choice
[TABLE]
is particularly interesting, since the measure coincides, up to a multiplicative constant, with , which leads to the following connection formula:
Theorem 4.1**.**
Let be given by (4.14). Then, for ,
[TABLE]
where
[TABLE]
and
[TABLE]
Proof.
From Heine’s -analogue of Gauss summation formula (see, for example, [16, p. 14]) we get
[TABLE]
and it remains to apply the formulas from Corollary 3.2 to arrive at
[TABLE]
as stated. Furthermore, observing that
[TABLE]
we find that
[TABLE]
Using this identity in the Corollary 3.2 we get
[TABLE]
Taking into account the initial condition , we finally conclude that
[TABLE]
Example 4.3**.**
Our next example is the one-parametric family of Geronimus polynomials, defined by the constant Verblunsky coefficients,
[TABLE]
The corresponding unit orthogonality measure is (see [17] and [24, p. 83])
[TABLE]
where is the characteristic function of the interval , with ; is the Dirac delta at the point defined by
[TABLE]
and the mass is given by
[TABLE]
Let us consider the probability measure obtained by rotating by the angle , so that . That is,
[TABLE]
The Verblunsky coefficients of are
[TABLE]
Recall that the normalized CD Kernels (3.3),
[TABLE]
satisfy the three term recurrence relation (3.4). From [23] it follows that its coefficients (3.5)–(3.6) are also constant, given by
[TABLE]
with
[TABLE]
From the theory of difference equations we find
[TABLE]
for , where
[TABLE]
with and . Notice that and
[TABLE]
for .
The conjugate reciprocal polynomial
[TABLE]
is such that for (although it is negative outside of this interval). With the assumption we consider given by
[TABLE]
which is again a positive measure on , and we can calculate the coefficients in the relation (3.12).
It turns out (see formulas in Corollary 3.2) that
[TABLE]
and
[TABLE]
Thus, (3.12) takes the form
[TABLE]
We can apply Corollary 3.2 in order to find the multiplication constant and the coefficients , that appear in the three term recurrence (3.4) for the normalized CD kernels : now
[TABLE]
for , and
[TABLE]
Example 4.4**.**
As our last example we consider the probability measure on the unit circle given by , where
[TABLE]
Here, and . From [27] we know that the associated monic orthogonal polynomials and the normalized CD kernels are, respectively,
[TABLE]
and
[TABLE]
Moreover, the parametrization of (see Section 3) is given by
[TABLE]
with .
Now, if we consider the normalized CD kernels with respect to the measure
[TABLE]
where , with and , then (3.12) together with the formulas in Corollary 3.2 hold.
However, if , so that , then in Corollary 3.2 the expressions for the evaluations of and have to be replaced by (see Remark 1.1) expressions involving also the derivatives.
Let us consider . In this case, coincides, up to a multiplicative constant, with and
[TABLE]
Hence, if we write (3.12) in the form
[TABLE]
we obtain
[TABLE]
Since
[TABLE]
one easily finds
[TABLE]
for . Moreover, since
[TABLE]
it follows from Corollary 3.2 that
[TABLE]
Acknowledgements
The research of first author (CFB) was partially supported by grant 305208/2015-2 of CNPq and research project 2014/22571-2 of FAPESP of Brazil.
The second author (AMF) was partially supported by the Spanish Government together with the European Regional Development Fund (ERDF) under grant MTM2014-53963-P from MINECO, by Junta de Andalucía (the Excellence Grant P11-FQM-7276 and the research group FQM-229), and by Campus de Excelencia Internacional del Mar (CEIMAR) of the University of Almería.
The research of the third author (ASR) was partially supported by grants 305073/2014-1 and 475502/2013-2 of CNPq and the research project 2016/13309-8 of FAPESP of Brazil.
Part of this work was carried out during the visit of AMF to the Department of Applied Mathematics of IBILCE, UNESP. He acknowledges the hospitality of the hosting department, as well as a the financial support of the Special Visiting Researcher Fellowship 401891/2013-5 of the Brazilian Mobility Program “Science without borders”.
The manuscript was completed while ASR and AMF were visiting the Shanghai Jiao Tong University (SJTU) in the fall of 2016, AMF as a Visiting Chair Professor. They both would like to thank the SJTU for providing them with excellent working environment. ASR would also like to thank Mikhail Tyaglov of Shanghai Jiao Tong university for the kind invitation.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Ariznabarreta, M. Mañas, A. Toledano, CMV biorthogonal Laurent polynomials: Christoffel formulas for Christoffel and Geronimus perturbations, preprint ar Xiv:1610.02008.
- 2[2] G. Ariznabarreta, M. Mañas, A. Toledano, CMV biorthogonal Laurent polynomials. II: Christoffel formulas for Christoffel and Geronimus perturbations, preprint ar Xiv:1611.03547.
- 3[3] C.F. Bracciali, J.H. Mc Cabe, T.E. Peréz and A. Sri Ranga, A class of orthogonal functions given by a three term recurrence formula, Math. Comp. , 85 (2016), 1837-1859.
- 4[4] C.F. Bracciali, A. Sri Ranga and A. Swaminathan, Para-orthogonal polynomials on the unit circle satisfying three term recurrence formulas, Appl. Numer. Math., 109 (2016), 19-40.
- 5[5] M.J. Cantero, L. Moral and L. Velázquez, Measures and para-orthogonal polynomials on the unit circle, East J. Approx. , 8 (2002), 447-464.
- 6[6] K. Castillo, M.S. Costa, A. Sri Ranga and D.O. Veronese, A Favard type theorem for orthogonal polynomials on the unit circle from a three term recurrence formula, J. Approx. Theory , 184 (2014), 146-162.
- 7[7] T.S. Chihara, An Introduction to Orthogonal Polynomials , Mathematics and its Applications Series (Gordon and Breach, New York, 1978).
- 8[8] M.S. Costa, H.M. Felix and A. Sri Ranga, Orthogonal polynomials on the unit circle and chain sequences, J. Approx. Theory , 173 (2013), 14-32.
