1. Motivation
In [4, 5] the author found connections between even orthogonal polynomials on the ball and simplex polynomials in variables.
Following [5, section 4], let
|
|
|
be a weight function defined on the unit ball on , and let
|
|
|
|
where is the unit simplex on . For , and a multi-index, let be an orthogonal polynomial associated to the weight function of even degree in each of its variables. Then Y. Xu proved that it can be written in terms of orthogonal polynomials on the simplex as
|
|
|
|
where is, for each , an orthogonal polynomial of total degree on the simplex associated to .
In this way, there exists an important partial connection between classical ball polynomials and simplex ones.
Inspired by these relations, we try to analyze the situation for the leftover polynomials in this procedure, i.e., we want to know the properties of the polynomials with odd powers that were left in the above identification. We succeed doing so in a general framework, showing that these polynomials are related to new families of bivariate orthogonal polynomials, resulting from a Christoffel modification that we explicitly identify. Hence we have a totally answer in the case , that generalizes the one given by T. Chihara in [2].
The paper is organized as follows.
In Section 2 we state the basic tools and results that we will need along the paper. The Section 3 is devoted to describe symmetric monic orthogonal polynomial sequences, starting with the basic properties and regarding how the polynomials are. In Section 4 we analyze the quadratic decomposition process. This will be done in an equivalent procedure, i.e., given a symmetric monic orthogonal polynomial sequence, we separate it in four families of polynomials in a zip way, and we deduce the inherit properties of orthogonality for each of the four families, obtaining that they are Christoffel modifications of the quadratic transformation of the original weight function.
As a converse result, we construct a symmetric monic orthogonal polynomial sequence from a given one.
In Section 5 we give relations between the matrix coefficients of the three term relations of the involved families.
In addition, the matrix coefficients of the Christoffel transformations for the four families of orthogonal polynomials are given in terms of the matrix coefficients of the three term relations for the symmetric polynomials.
These matrices enable us to reinterpret the block Jacobi matrix associated with the four orthogonal polynomials sequences in terms of a or representation.
Finally, in the last Section, we complete the study started in [4, 5] describing explicitly the four families of orthogonal polynomials on the simplex deduced from a symmetric polynomial system orthogonal on the ball.
2. Basic Facts
For each , let
denote the linear space of bivariate polynomials of total degree not greater than , and let
. A polynomial is a linear combination of monomials, i.e.,
|
|
|
|
and it is of total degree if .
A polynomial of total degree is called centrally symmetric if As a consequence, if the degree of the polynomial is even, then it only contains monomials of even degree, and if the degree of the polynomial is odd, then the polynomial only contains monomials of odd powers.
We will say that a polynomial of partial degree in is -symmetric if
|
|
|
|
Therefore, if is even, only contains even powers in , and if is odd, it only contains odd powers in . Analogously, we define the -symmetric for a polynomial of degree in as
|
|
|
|
A -symmetric polynomial of degree in only contains odd powers in when is an odd number, and it contains only even power in when is even.
Obviously, if a polynomial is -symmetric and -symmetric, then it is centrally symmetric. In this case, if the polynomial has total degree , with degree in and degree in , and , then if is an odd number (respectively if is an odd number), then the polynomial only contains odd powers in (respectively, odd powers in ), and if is even (respectively, if is even), then it only contains even powers in (respectively, it contains only even powers in ).
For each , let denote the column vector
|
|
|
where, as usual, the superscript means the transpose. Then is called the canonical basis of . As in [3], for , we denote by
|
|
|
such that and .
For , and , we introduce the matrices: of dimension in the following way
|
|
|
such that , for , the rest of the elements are zero. In particular,
|
|
|
|
|
|
|
|
|
|
|
|
Observe that the -matrices are obtained from the identity matrices by introducing columns of zeros. The objective of these matrices is to extract the odd or the even elements in a vector of adequate size. The transpose of these matrices introduce zeroes into a vector in the odd or even positions.
A simple computation allows us to prove the next result.
Lemma 2.1.
For and , the following relations hold:
|
|
|
|
|
|
|
|
2.1. Orthogonal polynomial systems (OPS)
Let denote a basis of such that, for a
fixed ,
, and the set contains
linearly independent polynomials of total degree exactly .
We can write the vector of polynomials
|
|
|
The sequence of polynomial vectors of increasing size
is called a polynomial system (PS), and it is a basis of . We say that is a monic polynomial sequence if every entry has the form
|
|
|
|
Let be a weight function defined on a domain , and we suppose the existence of every moment,
|
|
|
|
As usual, we define the inner product
(2.1) |
|
|
|
|
and remember how the inner product acts over polynomial matrices. Let
and
be two polynomial matrices. The action of (2.1) over polynomial matrices is
defined as the matrix (cf. [3]),
|
|
|
where .
A PS is an
orthogonal polynomial system (OPS) with respect to if
|
|
|
where is a positive-definite symmetric matrix of size , and , or for short, is the zero matrix of adequate size. It was proved [3] that there exists a unique monic orthogonal polynomial system associated to , and we will call MOPS for short.
In this work we will use Christoffel modifications of a weight function given by a multiplication of a polynomial of degree .
In the next Lemma we recall the relations between the involved monic OPS ([1]).
Lemma 2.2.
Let be a weight function defined on a domain , and let be a polynomial with , such that is again a weight function on . Let
and be the respective monic OPS.
Then, for all ,
|
|
|
|
|
|
|
|
where
|
|
|
|
and
|
|
|
are non-singular matrices of size .
3. Symmetric Monic Orthogonal Polynomial Sequences
A weight function defined on is called centrally symmetric (cf. [3, p. 76]) if satisfies
|
|
and |
|
|
|
Therefore, by a natural change of variables, we get
|
|
|
and then , for an odd integer number.
We introduce an additional definition of symmetry.
Definition 3.1.
We say that a weight function is -symmetric if
|
|
and |
|
|
|
Analogously, the weight function is -symmetric if
|
|
and |
|
|
|
A -symmetric and -symmetric weight function is called -symmetric.
Obviously, if is -symmetric then it is centrally symmetric. As a consequence, if
is -symmetric, then when, at least one, or are odd numbers.
Let be the MOPS associated with a -symmetric weight function satisfying
(3.1) |
|
|
|
where is a positive-definite symmetric matrix.
Lemma 3.2.
If the explicit expression of every vector polynomial is given by
|
|
|
where
|
|
|
|
|
with ,
then the polynomials are -symmetric, that is,
|
|
|
When a bivariate polynomial is -symmetric then it has the same parity order in every variable, i.e., if the partial degree in the first variable is even (respectively, odd), then all powers in are even (respectively, odd), and analogously, if the partial degree in the second variable is even (respectively, odd), then all powers in are even (respectively, odd).
Therefore, the vector polynomial can be separated in a zip way, attending to the parity of the powers of and in its entries. In fact, for even, respectively odd degree, we get
(3.2) |
|
|
|
Lemma 3.3.
We can express the monic orthogonal polynomial vectors as
(3.3) |
|
|
|
|
(3.4) |
|
|
|
|
where, for ,
is a vector of size whose odd entries are independent monic polynomials of exact degree on , and its even entries are zeroes,
is a vector of size whose even entries are independent monic polynomials of exact degree on , and its odd entries are zeroes,
is a vector of size whose odd entries are independent monic polynomials of exact degree on , and its even entries are zeroes,
is a vector of size whose even entries are independent monic polynomials of exact degree on , and its odd entries are zeroes.
These families will be called big vector polynomials associated with .
We must observe that the big families are formed by vectors of polynomials in the variables , that contains polynomials of independent degree intercalated with zeros.
Our objective is to extract the odd entries in the vectors , and the even entries in , for .
Lemma 3.4.
For , and , we define the vector of polynomials
|
|
|
|
Then, its entries are independent polynomials of exact degree , and therefore, the sequences of vectors of polynomials are polynomial systems.
5. Bäcklund-type relations
Orthogonal polynomials in two variables satisfy a three term relation in each variable (cf. [3]) written in a vector form and matrix coefficients. In this section we want to relate the matrix coefficients of the three term relations for the monic orthogonal polynomial sequences involved in Theorems 4.1 and 4.2.
If is a MOPS associated with a centrally symmetric weight function, the three term relation takes a simple form. In fact, [3, Theorem 3.3.10] states that a measure is symmetric if, and only if, it satisfies the three term relations
(5.1) |
|
|
|
for , where , , and
|
|
|
|
|
are matrices of size with , for .
The four systems of monic orthogonal polynomials , with , involved in Theorems 4.1 and 4.2, satisfy the three term relations
|
|
|
where , , and
are matrices of respective sizes and , such that
|
|
|
|
|
|
|
|
|
|
where .
In addition, the matrices have full rank , for and .
Suppose that the -symmetric monic polynomial system and the four families of MOPS are related by (3.3) and (3.4), where , for , are the respective families of big polynomials.
Theorem 5.1 (Bäcklund-type relations).
In the above conditions, the following relations hold, for all and ,
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
with the convention that the matrix with negative indices is taken as a zero matrix.
We divide the proof in several lemmas starting from a useful one for symmetric polynomials.
Lemma 5.3.
Let , , be polynomials of the same parity order. If
|
|
|
then
|
|
|
Secondly, we deduce the relations between the big families of polynomials.
Lemma 5.4.
The four big families of polynomials , for , defined by (3.3) and (3.4), are related by the expressions:
(5.2) |
|
|
|
|
(5.3) |
|
|
|
|
(5.4) |
|
|
|
|
(5.5) |
|
|
|
|
for and denoting for brevity.
Proof.
The expressions (3.3) and (3.4) can be matrically rewritten in the following form
(5.6) |
|
|
|
|
(5.7) |
|
|
|
|
We can write the first three term relations (5.1) in the form
|
|
|
where we have omitted the arguments for simplicity. Substituting (5.6), we get
|
|
|
where we have omitted the arguments of the big polynomials for brevity. Now, since
|
|
|
and applying Lemma 5.3, we deduce
|
|
|
We finally arrive to,
|
|
|
Then, after a convenient simplification and by introducing the variable , we deduce the expressions (5.2), (5.4), (5.3), and (5.5) for . The same discussion can be done for the second variable using (5.7), taking .
∎
The identities in Lemma 5.4 can be used to deduce three terms relations for the big polynomial families. Apparently, (5.8)-(5.11) are three term relations for the bivariate polynomials , , but the these big families are not polynomial systems.
Lemma 5.5.
The families of big bivariate polynomials , for , satisfy the relations
(5.8) |
|
|
|
|
|
|
|
|
(5.9) |
|
|
|
|
|
|
|
|
(5.10) |
|
|
|
|
|
|
|
|
(5.11) |
|
|
|
|
|
|
|
|
for and .
Proof.
For , relations are obtained multiplying (5.2) by and using (5.5); substituting (5.2) in (5.5); replacing (5.4) in (5.3); and multiplying (5.4) by and substituting (5.3).
∎
From the three terms relations of the big polynomials obtained in Lemma 5.5, we can deduce the three term relations for the small ones by a multiplications of an adequate -matrix.
In fact, multiplying, respectively, (5.8) by , (5.9) by , (5.10) by , and (5.11) by , and making use of Lemma 2.1 we arrive to the following result.
Lemma 5.6.
The families of small bivariate polynomials , for , satisfy the three term relations
|
|
|
|
(5.12) |
|
|
|
|
|
|
|
|
(5.13) |
|
|
|
|
|
|
|
|
(5.14) |
|
|
|
|
|
|
|
|
(5.15) |
|
|
|
|
for and .
Now, the Bäcklund-type relations contained in Theorem 5.1 are proven identifying coefficients.
As we have shown in Theorems 4.1 and 4.2, the small polynomial systems , for are Christoffel modifications of the first family . Then, by Lemma 2.2, there exist short relations between that families. Lemma 5.4 also allows us to deduce short relations for the small polynomial systems, multiplying by the adequate -matrix, and using Lemma 2.1. Next result gives the coefficients in terms of the matrix coefficients of the three term relations of .
Corollary 5.7.
The families of small MOPS are related by
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
where
|
|
|
|
|
|
|
|
These matrices ’s enable us to reinterpret the block Jacobi matrix associated with the polynomials sequences ’s in terms of a or representation. In fact,
for , we define the block matrices
|
|
|
|
|
|
|
|
we recover the recurrence relations (5.12), (5.13), (5.14), (5.15), respectively
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
denoting , , and, for , the column vector is defined as
|
|
|
6. A case study
Moreover, if a weight function can be represented as , then
it is -symmetric.
Finally, we totally describe the connection between bivariate polynomials orthogonal with respect to a -symmetric weight function defined on the unit ball of , defined by
|
|
|
and bivariate orthogonal polynomials defined on the simplex
|
|
|
completing the discussion started by Y. Xu in [4, 5] for the even ball polynomials in each of its variables.
Following [5, section 4], let be a weight function defined on the unit ball on , and let
(6.1) |
|
|
|
|
Observe that is a -symmetric weight function defined on .
For , and , let be an orthogonal polynomial associated to the weight function of even degree in each of variables. Then Y. Xu proved that it can be written in terms of orthogonal polynomials on the simplex as
|
|
|
where is an orthogonal polynomial of total degree associated to .
We can answer the question that what is about the leftover polynomials, i.e., we can give explicitly the shape of the polynomials orthogonal with respect to . Following our results, these polynomials are related to new families of bivariate orthogonal polynomials, resulting from a Christoffel modification that we will explicitly identify.
Let be the monic orthogonal polynomial system associated with the -symmetric weight function , satisfying (3.1).
If the explicit expression of every monic vector polynomial is given by
|
|
|
then every polynomial , for , is -symmetric by Lemma 3.2. As we have proved, the vector of polynomials can be separated in a zip way,
cf. (3.2), attending to the parity of the powers of and , in its entries.
We deduce four families: ,
, , and . Only the first family was identified in [4, 5] under the transformation as a family of polynomials orthogonal on with respect to the weight function (6.1). We observe that the second family has the common factor , the third family has as common factor, and the fourth family has common factor the second variable .
Working as in Section 4, we separate the symmetric monic orthogonal polynomial vectors as
it was shown in Lemma 3.3
|
|
|
|
|
|
|
|
After deleting all zeros in above vectors of polynomials and substituting the variables by , we proved, in Theorem 4.1 that
is a MOPS associated with the weight function
|
|
|
, for ,
are MOPS associated with the Christoffel modification
|
|
|
is a MOPS associated with the Christoffel modification
|
|
|
for all .
Therefore, we have described the complete relation between orthogonal polynomials on the ball with orthogonal polynomials on the simplex.