Next Article in Journal
A New Explicit Magnus Expansion for Nonlinear Stochastic Differential Equations
Next Article in Special Issue
On Differential Equations Associated with Perturbations of Orthogonal Polynomials on the Unit Circle
Previous Article in Journal
Strong Solutions of the Incompressible Navier–Stokes–Voigt Model
Previous Article in Special Issue
A Characterization of Polynomial Density on Curves via Matrix Algebra
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Eigenvalue Problem for Discrete Jacobi–Sobolev Orthogonal Polynomials

by
Juan F. Mañas-Mañas
1,*,†,
Juan J. Moreno-Balcázar
1,2,† and
Richard Wellman
3,†
1
Departamento de Matemáticas, Universidad de Almería, 04120 Almería, Spain
2
Instituto Carlos I de Física Teórica y Computacional, 18071 Granada, Spain
3
Department of Mathematics & Computer Science, Colorado College, CO 80903, USA
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2020, 8(2), 182; https://doi.org/10.3390/math8020182
Submission received: 29 October 2019 / Revised: 7 January 2020 / Accepted: 22 January 2020 / Published: 3 February 2020

Abstract

:
In this paper, we consider a discrete Sobolev inner product involving the Jacobi weight with a twofold objective. On the one hand, since the orthonormal polynomials with respect to this inner product are eigenfunctions of a certain differential operator, we are interested in the corresponding eigenvalues, more exactly, in their asymptotic behavior. Thus, we can determine a limit value which links this asymptotic behavior and the uniform norm of the orthonormal polynomials in a logarithmic scale. This value appears in the theory of reproducing kernel Hilbert spaces. On the other hand, we tackle a more general case than the one considered in the literature previously.
MSC:
33C47; 34L15; 42C05

1. Introduction

The study of Sobolev inner products and the properties of the corresponding orthogonal polynomials is a relevant topic within the theory of orthogonal polynomials. Indeed, Sobolev orthogonality is a recent topic in the theory of orthogonal polynomials. In fact, it has been developed throughout the last 30 years, although the first seminal paper was written by Lewis in 1947 (see [1]) in the framework of the simultaneous approximation to a function and its derivatives in the corresponding Sobolev space. The relevance of Sobolev orthogonal polynomials (SOP) is given by the fact that they are not orthogonal in a standard way. Thus, if we consider a typical Sobolev inner product in the appropriate Sobolev space, then some nice properties of standard orthogonal polynomials (such as the three-term recurrence relation and the interlacing properties of zeros) are lost. Furthermore, some powerful methods and techniques developed for standard orthogonal polynomials have not found their equivalence in SOP and many questions remain unanswered. Therefore, we need to construct new techniques to obtain algebraic, differential, and asymptotic properties of the SOP. This fact was already noticed on the first papers by German mathematicians such as in [2,3], or [4].
Concretely, given a Sobolev inner product (SIP)
( f , g ) = R f ( x ) g ( x ) d μ 0 + k = 1 m R f ( k ) ( x ) g ( k ) ( x ) d μ k ,
in the Sobolev space
W 2 , m ( μ 0 , μ 1 , , μ m ) : = f : R | f | 2 d μ 0 + k = 1 m R | f ( k ) | 2 d μ k < + ,
where μ i with i = 0 , , m are positive Borel measures supported on the real line, we usually classify this inner product as follows (see, for example, [5]):
  • Continuous SIP. All the measures μ i , with i = 0 , , m , have continuous support.
  • Discrete SIP. The measure μ 0 has continuous support and the measures μ 1 , , μ m are discrete, i.e., they are supported on finite subsets.
  • Discrete-Continuous SIP. The measure μ m has continuous support and the measures μ 0 , , μ m 1 are discrete.
Obviously, when m 1 , we have ( x f , g ) ( f , x g ) . As it is well known, the identity ( x f , g ) = ( f , x g ) is the key to obtain many properties of standard orthogonal polynomials, therefore the study of Sobolev orthogonal polynomials needs a different approach as we have mentioned previously.
In the first few years, the most exhaustively studied case in the literature corresponded to m = 1 . Thus, in the continuous case, a breaking paper was given in [6] where the concept of a pair of coherent measures was introduced. This concept was originally useful for minimizing the Gibbs phenomenon that occurs when approximating a function by the partial sum of a Fourier series (see [7]). Later, it has been very fruitful in the study of algebraic and asymptotic properties of Sobolev orthogonal polynomials. In fact, the original concept was generalized on several occasions (for example, in [8] or [9]), being the most general the one introduced in 2014 with the ( M , N ) –coherent pairs of order ( m , k ) (see [10]).
On the other hand, the discrete-continuous case attracted interest when it was discovered that this type of inner product provides Sobolev orthogonality to families of classical orthogonal polynomials with nonstandard parameters (Gegenabauer, Jacobi, and Laguerre polynomials), see details in the papers [11,12,13,14,15] or in a more general framework [16].
The discrete case has been studied extensively since the 1990s, with very general papers being [17] some of the most relevant. Along these years, algebraic, asymptotic, and differential properties of the corresponding orthogonal polynomials have been studied. The motivation of this paper is to tackle one aspect less studied in the literature. Concretely, it is known from some papers by Bavinck in the 1980s that certain families of discrete Sobolev orthogonal polynomials are eigenfunctions of a differential operator. In this way, we are interested in knowing the asymptotic behavior of the corresponding eigenvalues, which allows us to get a limit value of interest in the theory of reproducing kernel Hilbert spaces.
The chronology of the advances in the theory of the Sobolev orthogonality has been collected in several surveys: [5,18,19,20,21,22]. Even a very brief outreach paper has been published—see [23]. About the applications of SOP, we have already mentioned the usefulness of these nonstandard polynomials in the simultaneous approximation of a function and their derivatives as well as to tackle the Gibbs phenomenon, together with the fact that standard polynomials with nonstandard parameters are orthogonal with respect to a SIP. More recently, other different applications have been obtained among others in [24,25,26] or [27] related to use SOP for solving some type of Cauchy problem for ordinary differential equations.
In this paper, we focus our attention on a special case of the discrete SIP
( f , g ) S = f ( x ) g ( x ) d μ + i = 0 p M i f ( i ) ( c ) g ( i ) ( c ) , M i 0 , i = 0 , , p 1 , M p > 0 ,
where μ is a positive Borel measure. The study of the orthogonal polynomials with respect to the above inner product has attracted the attention of researchers in recent decades (see [5] and the aforementioned surveys). If we treat these polynomials as eigenfunctions of a differential operator, the study of the corresponding eigenvalues arises as a topic of interest. Thus, very recently, the asymptotic behavior of the eigenvalues has been studied in [28] when μ is a classical continuous measure (Jacobi, Laguerre, or Hermite) and c is a point located on the real axis adequately.
Here, we consider a discrete Sobolev inner product involving the Jacobi weight and including two derivatives of different order located at 1 and 1 . Concretely,
( f , g ) S = 1 1 f ( x ) g ( x ) ( 1 x ) α ( 1 + x ) β d x + M f ( j 1 ) ( 1 ) g ( j 1 ) ( 1 ) + N f ( j 2 ) ( 1 ) g ( j 2 ) ( 1 ) ,
where M , N > 0 , α , β > 1 , and j 1 , j 2 N { 0 } . Let { q n ( M , N ) } n 0 be the sequence of orthonormal polynomials with respect to (1). It is well known that these polynomials are eigenfunctions of a differential operator T (see [29]). Thus, our first goal is to establish the asymptotic behavior of the corresponding eigenvalues which we denote by ϱ n and as an application of this result and the properties of the corresponding Sobolev orthonormal polynomials, we can compute the value
r 0 = lim sup n + log n max x [ 1 , 1 ] | q n ( M , N ) ( x ) | 2 log ϱ n .
This value is relevant for the work that one of the authors of this article is developing in the framework of reproducing kernel Hilbert spaces and their interactions with the applied machine learning [30].
We will prove that in our case it is enough to compute the value
s 0 = lim n + log max x [ 1 , 1 ] | q n ( M , N ) ( x ) | log ϱ n ,
to obtain the value r 0 . This value s 0 was already computed in the particular case of the symmetric case in [31], that is, when we consider α = β , M = N , and j 1 = j 2 (Gegenbauer case). The symmetry provides us with relations (see e.g., ([31], Proposition 5)) that we have not been able to derive for this nonsymmetric case.
The structure of the paper is the following: in Section 2, basic properties of Jacobi polynomials are introduced; in Section 3, the asymptotic behavior of the eigenvalues ϱ n is obtained. Section 4 is devoted to obtaining algebraic, differential, and asymptotic properties of these discrete Sobolev orthogonal polynomials, which, together with the results in Section 3, allow us to get the value r 0 in Section 5. Finally, we have included Section 6 with the conclusions and some open problems.

2. Background on Jacobi Orthogonal Polynomials

We denote by P n ( α , β ) ( x ) the classical Jacobi orthogonal polynomials with respect to the weight function ( 1 x ) α ( 1 + x ) β , on ( 1 , 1 ) with α , β > 1 and taking the standardization given in ([32], f. (4.1.1)):
P n ( α , β ) ( 1 ) = n + α n = Γ ( n + α + 1 ) Γ ( n + 1 ) Γ ( α + 1 ) .
Using ([32], f. (4.1.4)), we have
P n ( α , β ) ( 1 ) = ( 1 ) n P n ( β , α ) ( 1 ) = ( 1 ) n n + β n = ( 1 ) n Γ ( n + β + 1 ) Γ ( n + 1 ) Γ ( β + 1 ) .
Their derivatives satisfy (see, ([33], f. (4)) and ([32], f. (4.21.7)))
P n ( α , β ) ( k ) ( x ) = 1 2 k Γ ( n + α + β + k + 1 ) Γ ( n + α + β + 1 ) P n k ( α + k , β + k ) ( x ) , k 0 .
Using (2) and (4), we deduce
P n ( α , β ) ( k ) ( 1 ) = 1 2 k Γ ( n + α + β + k + 1 ) Γ ( n + α + β + 1 ) Γ ( n + α + 1 ) Γ ( n k + 1 ) Γ ( α + k + 1 ) ,
where P n ( α , β ) ( k ) ( 1 ) denotes the k-th derivative of P n ( α , β ) ( x ) evaluated at x = 1 . Thus, using (3) and (4) we have:
P n ( α , β ) ( k ) ( 1 ) = ( 1 ) n k 1 2 k Γ ( n + α + β + k + 1 ) Γ ( n + α + β + 1 ) Γ ( n + β + 1 ) Γ ( n k + 1 ) Γ ( β + k + 1 ) .
The norm of these polynomials is given by (see, ([32], f. (4.3.3))):
| | P n ( α , β ) | | 2 = 2 α + β + 1 2 n + α + β + 1 Γ ( n + α + 1 ) Γ ( n + β + 1 ) Γ ( n + 1 ) Γ ( n + α + β + 1 ) .
Finally, they satisfy the second-order differential equation (see ([32], f. (4.2.1))):
( x 2 1 ) y ( x ) + ( α β + ( α + β + 2 ) x ) y ( x ) = n ( n + α + β + 1 ) y ( x ) ,
i.e., P n ( α , β ) are the eigenfunctions of the differential operator
J : ( x 2 1 ) D 2 + ( α β + ( α + β + 2 ) x ) D ,
where D denotes the derivative operator. Thus, we can write down
J P n ( α , β ) ( x ) = n ( n + α + β + 1 ) P n ( α , β ) ( x ) ,
so
λ n = n ( n + α + β + 1 )
are the corresponding eigenvalues.
Along the paper, we use the well-known Stirling’s formula (see, for example, ([34], f. (5.11.13))):
lim n + n b a Γ ( n + a ) Γ ( n + b ) = 1 .
Next, we give some asymptotic behaviors which will be useful in the next section.
Lemma 1.
Letting k be a nonnegative integer, we have:
lim n + P n ( α , β ) ( k ) ( 1 ) n α + 2 k = 1 2 k Γ ( α + k + 1 ) ,
lim n + ( 1 ) n P n ( α , β ) ( k ) ( 1 ) n β + 2 k = ( 1 ) k 2 k Γ ( β + k + 1 ) .
In addition,
lim n + n | | P n ( α , β ) | | 2 = 2 α + β .
Proof. 
We can deduce them straightforwardly using (5)–(7) and (9). □
The kernel polynomials and their derivatives are given by
K n ( j , k ) ( x , y ) = i = 0 n P i ( α , β ) ( j ) ( x ) P i ( α , β ) ( k ) ( y ) | | P i ( α , β ) | | 2 , j , k N { 0 } .
For our purposes, we need to know some asymptotic behaviors of these kernel polynomials evaluated at the points 1 and 1 . Next, we introduce a result which generalizes some particular cases obtained in ([33], Lemma 1) or ([35], Pag. 147).
Proposition 1.
Let j , k be nonnegative integers. Then, we have
lim n + K n 1 ( j , k ) ( 1 , 1 ) n 2 α + 2 j + 2 k + 2 = 1 2 α + β + j + k + 1 ( α + j + k + 1 ) Γ ( α + j + 1 ) Γ ( α + k + 1 ) .
lim n + K n 1 ( j , k ) ( 1 , 1 ) n 2 β + 2 j + 2 k + 2 = ( 1 ) j + k 2 α + β + j + k + 1 ( β + j + k + 1 ) Γ ( β + j + 1 ) Γ ( β + k + 1 ) .
lim n + ( 1 ) n K n ( j , k ) ( 1 , 1 ) n α + β + 2 j + 2 k + 1 = ( 1 ) k 2 α + β + j + k + 1 Γ ( α + j + 1 ) Γ ( β + k + 1 ) .
Proof. 
To prove these results, we use (2)–(7), (9), the Stolz–Cesàro criterion, and the following limit
lim n + n α + β + 2 j + 2 k + 2 ( n 1 ) α + β + 2 j + 2 k + 2 ( α + β + 2 j + 2 k + 2 ) n α + β + 2 j + 2 k + 1 = 1 .
(13a) 
This case has been proved in ([33], Lemma 1).
(13b) 
We use the same technique as in ([33], Lemma 1), getting
lim n + K n 1 ( j , k ) ( 1 , 1 ) n 2 β + 2 j + 2 k + 2 = lim n + K n 1 ( j , k ) ( 1 , 1 ) K n 2 ( j , k ) ( 1 , 1 ) n 2 β + 2 j + 2 k + 2 ( n 1 ) 2 β + 2 j + 2 k + 2   = lim n + P n 1 ( α , β ) ( j ) ( 1 ) P n 1 ( α , β ) ( k ) ( 1 ) ( 2 β + 2 j + 2 k + 2 ) | | P n 1 ( α , β ) | | 2 n 2 β + 2 j + 2 k + 1   = 1 2 α + β ( 2 β + 2 j + 2 k + 2 ) ( 1 ) j 2 j Γ ( β + j + 1 ) ( 1 ) k 2 k Γ ( β + k + 1 ) .
(13c) 
In this case, we cannot use the Stolz–Cesàro criterion in the previous straightforward way. Then, we use a different approach based on the Christoffel–Darboux formula (see ([32], f. (4.5.2))):
K n ( 0 , 0 ) ( x , y ) = a n P n + 1 ( α , β ) ( x ) P n ( α , β ) ( y ) P n ( α , β ) ( x ) P n + 1 ( α , β ) ( y ) x y ,
with a n = 2 α β 2 n + α + β + 2 Γ ( n + 2 ) Γ ( n + α + β + 2 ) Γ ( n + α + 1 ) Γ ( n + β + 1 ) .
First, it is enough to apply (9) to get
lim n + a n n = 1 2 α + β + 1 .
Now, using a Leibniz rule, we obtain (see also [36])
K n ( 0 , k ) ( x , y ) = a n P n + 1 ( α , β ) ( x ) k y k P n ( α , β ) ( y ) x y P n ( α , β ) ( x ) k y k P n + 1 ( α , β ) ( y ) x y = a n P n + 1 ( α , β ) ( x ) i = 0 k k ! P n ( α , β ) ( i ) ( y ) i ! ( x y ) k i + 1 P n ( α , β ) ( x ) i = 0 k k ! P n + 1 ( α , β ) ( i ) ( y ) i ! ( x y ) k i + 1 .
Taking derivatives again, we deduce
K n ( j , k ) ( x , y ) = a n i = 0 k P n ( α , β ) ( i ) ( y ) k ! i ! j x j P n + 1 ( α , β ) ( x ) ( x y ) k i + 1 i = 0 k P n + 1 ( α , β ) ( i ) ( y ) k ! i ! j x j P n ( α , β ) ( x ) ( x y ) k i + 1 = a n i = 0 k = 0 j k ! i ! P n + 1 ( α , β ) ( ) ( x ) P n ( α , β ) ( i ) ( y ) ( x y ) k i + j + 1 j q = 0 j 1 ( k + i 1 q ) i = 0 k = 0 j k ! i ! P n ( α , β ) ( ) ( x ) P n + 1 ( α , β ) ( i ) ( y ) ( x y ) k i + j + 1 j q = 0 j 1 ( k + i 1 q ) .
Dividing the previous expression by ( 1 ) n n α + β + 2 j + 2 k + 1 and evaluating at x = 1 and y = 1 , we get
( 1 ) n K n ( j , k ) ( 1 , 1 ) n α + β + 2 j + 2 k + 1 = a n n i = 0 k = 0 j k ! i ! P n + 1 ( α , β ) ( ) ( 1 ) P n ( α , β ) ( i ) ( 1 ) ( 1 ) n n α + β + 2 j + 2 k 2 k i + j + 1 j q = 0 j 1 ( k + i 1 q ) i = 0 k = 0 j k ! i ! P n ( α , β ) ( ) ( 1 ) P n + 1 ( α , β ) ( i ) ( 1 ) ( 1 ) n n α + β + 2 j + 2 k 2 k i + j + 1 j q = 0 j 1 ( k + i 1 q ) .
Finally, taking limits in (15) and considering (10), (11), and (14), all terms tend to zero except when i = k and = j , so
lim n + ( 1 ) n K n ( j , k ) ( 1 , 1 ) n α + β + 2 j + 2 k + 1 = lim n + a n n P n + 1 ( α , β ) ( j ) ( 1 ) ( 1 ) n P n ( α , β ) ( k ) ( 1 ) 2 n α + β + 2 j + 2 k + P n ( α , β ) ( j ) ( 1 ) ( 1 ) n + 1 P n + 1 ( α , β ) ( k ) ( 1 ) 2 n α + β + 2 j + 2 k = 1 2 α + β + 1 1 2 1 2 j Γ ( α + j + 1 ) ( 1 ) k 2 k Γ ( β + k + 1 ) + 1 2 j Γ ( α + j + 1 ) ( 1 ) k 2 k Γ ( β + k + 1 ) = ( 1 ) k 2 α + β + j + k + 1 Γ ( α + j + 1 ) Γ ( β + k + 1 ) .

3. Asymptotic Behavior of the Eigenvalues ϱ n

In [29], it was established that the discrete Sobolev orthonormal polynomials q n ( M , N ) are eigenfunctions of a certain differential operator T , i.e., T q n ( M , N ) = ϱ n q n ( M , N ) . In the same paper, see ([29], f. (5)), and, under certain conditions that we will expose later, the author claims
ϱ n = λ n + M α n + N β n + M N γ n , n max j 1 , j 2 ,
where λ n is defined in (8) and
α n = α j 1 + i = j 1 + 1 n ( λ i λ i 1 ) K i 1 ( j 1 , j 1 ) ( 1 , 1 ) , β n = β j 2 + i = j 2 + 1 n ( λ i λ i 1 ) K i 1 ( j 2 , j 2 ) ( 1 , 1 ) , γ n = γ max j 1 , j 2 + i = max j 1 , j 2 + 1 n ( λ i λ i 1 ) K i 1 ( j 1 , j 1 ) ( 1 , 1 ) K i 1 ( j 2 , j 2 ) ( 1 , 1 ) K i 1 ( j 1 , j 2 ) ( 1 , 1 ) 2 .
Moreover, the author proved that there are two ways to construct the differential operator T . These two ways depend on the relation between j 1 , j 2 (either j 1 j 2 or j 2 j 1 ), but in both cases the differential operator obtained is the same, so the expression (16) for the eigenvalues holds in both cases (for more details, see [29]).
However, when the inner product (1) is symmetric, i.e., when α = β , M = N , and j 1 = j 2 , then
ϱ n = λ n + M μ n ,
and the process to establish the asymptotic behavior of ϱ n is technically easier. Thus, through this paper, we assume that the inner product (1) is nonsymmetric. The results corresponding to the symmetric case can be found in [31].
For convenience, we assume j 1 j 2 . Denote by s n ( M ) ( x ) the orthogonal polynomials with respect to the inner product
( f , g ) = 1 1 f ( x ) g ( x ) ( 1 x ) α ( 1 + x ) β d x + M f ( j 1 ) ( 1 ) g ( j 1 ) ( 1 ) .
In this case, the condition to obtain (16) is s n ( M ) ( j 2 ) ( 1 ) 0 while j 2 < n . Using ([33], Prop. 2), we can assure that s n ( M ) ( x ) has n real and simple zeros, and they are located in ( 1 , 1 + ε ] with ε 0 . On the other hand, using Rolle’s Theorem, between two zeros of s n ( M ) ( x ) , one zero of s n ( M ) ( x ) exists, so we can assure that there are n 1 real and simple zeros of s n ( M ) ( x ) in ( 1 , 1 + ε ) . However, s n ( M ) ( x ) is a polynomial of degree n 1 , so it has n 1 zeros, thus s n ( M ) ( 1 ) 0 . We can repeat this process and we can assure that s n ( M ) ( j 2 ) ( 1 ) 0 , with j 2 < n . For the case j 1 j 2 , we can proceed in a similar way (see also [36]).
Following [29], α 0 = 0 and { α i } i = 1 j 1 can be chosen arbitrarily. Thus, we take α 1 = α 2 = = α j 1 = 0 . Similarly for the values β n and γ n , it is necessary that β 0 = γ 0 = 0 and the quantities { β i } i = 1 j 2 and { γ i } i = 1 max j 1 , j 2 can be chosen arbitrarily. Again, we choose β 1 = β 2 = = β j 2 = 0 and γ 1 = γ 2 = = γ max j 1 , j 2 = 0 . Therefore, taking into account
λ n λ n 1 = 2 n + α + β ,
and substituting in (16), the expressions α n , β n and γ n can be simplified to
α n = i = j 1 + 1 n ( 2 i + α + β ) K i 1 ( j 1 , j 1 ) ( 1 , 1 ) ,
β n = i = j 2 + 1 n ( 2 i + α + β ) K i 1 ( j 2 , j 2 ) ( 1 , 1 ) ,
γ n = i = max j 1 , j 2 + 1 n ( 2 i + α + β ) K i 1 ( j 1 , j 1 ) ( 1 , 1 ) K i 1 ( j 2 , j 2 ) ( 1 , 1 ) K i 1 ( j 1 , j 2 ) ( 1 , 1 ) 2 .
Now, we are ready to compute the asymptotic behavior of the above sequences of real numbers and, via (16), we obtain the wanted asymptotic behavior of the eigenvalues ϱ n .
Proposition 2.
Let α n , β n and γ n be defined in (18)–(20), respectively. Then,
lim n + α n n 2 α + 4 j 1 + 4 = 1 2 α + β + 2 j 1 + 1 ( α + 2 j 1 + 2 ) ( α + 2 j 1 + 1 ) Γ 2 ( α + j 1 + 1 ) ,
lim n + β n n 2 β + 4 j 2 + 4 = 1 2 α + β + 2 j 2 + 1 ( β + 2 j 2 + 2 ) ( β + 2 j 2 + 1 ) Γ 2 ( β + j 2 + 1 ) ,
lim n + γ n n 2 α + 2 β + 4 j 1 + 4 j 2 + 6 = C α , β , j 1 , j 2 ,
where C α , β , j 1 , j 2 = 1 2 2 ( α + β + j 1 + j 2 + 1 ) ( α + β + 2 j 1 + 2 j 2 + 3 ) ( α + 2 j 1 + 1 ) ( β + 2 j 2 + 1 ) Γ 2 ( α + j 1 + 1 ) Γ 2 ( β + j 2 + 1 ) .
Proof. 
To prove (21), we use (13a), the Stolz–Cesàro criterion and
lim n + n 2 α + 4 j 1 + 4 ( n 1 ) 2 α + 4 j 1 + 4 ( 2 α + 4 j 1 + 4 ) n 2 α + 4 j 1 + 3 = 1 .
Then,
lim n + α n n 2 α + 4 j 1 + 4 = lim n + α n α n 1 n 2 α + 4 j 1 + 4 ( n 1 ) 2 α + 4 j 1 + 4   = lim n + ( 2 n + α + β ) K n 1 ( j 1 , j 1 ) ( 1 , 1 ) ( 2 α + 4 j 1 + 4 ) n 2 α + 4 j 1 + 3   = 1 2 α + β + 2 j 1 + 1 ( α + 2 j 1 + 2 ) ( α + 2 j 1 + 1 ) Γ ( α + j 1 + 1 ) Γ ( α + j 1 + 1 ) .
Formula (22) is proved in the same way now using (13b). Finally, to establish (23), we use Proposition 1 getting
lim n + γ n n 2 α + 2 β + 4 j 1 + 4 j 2 + 6 = lim n + γ n γ n 1 n 2 α + 2 β + 4 j 1 + 4 j 2 + 6 ( n 1 ) 2 α + 2 β + 4 j 1 + 4 j 2 + 6   = lim n + ( 2 n + α + β ) K n 1 ( j 1 , j 1 ) ( 1 , 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) 2 ( 2 α + 2 β + 4 j 1 + 4 j 2 + 6 ) n 2 α + 2 β + 4 j 1 + 4 j 2 + 5   = C α , β , j 1 , j 2 .
Theorem 1.
Let ϱ n be the eigenvalues of the differential operator T . Then,
lim n + ϱ n n 2 α + 2 β + 4 j 1 + 4 j 2 + 6 = M N C α , β , j 1 , j 2 ,
where the quantity C α , β , j 1 , j 2 is defined in Proposition 2.
Proof. 
It is enough to apply Proposition 2 in (16). □
Remark 1.
Notice that, for a symmetric inner product of type (1), we cannot derive the asymptotic behavior of the corresponding eigenvalues ϱ n from Theorem 1 in a straightforward way. This is because the expressions for ϱ n are essentially different in each case (see (16) and (17)). Thus, as we have commented previously, the symmetric case is technically easier to analyze and it was done in [31].

4. Some Properties of Discrete Jacobi–Sobolev Orthogonal Polynomials

The aim of this section is to get useful algebraic and asymptotic properties of these discrete Sobolev orthogonal polynomials with the target of computing the asymptotic value r 0 in the next section. For convenience, now we use the orthogonal polynomials with respect to (1) with the same leading coefficient as the polynomials P n ( α , β ) ( x ) and we denote them by Q n ( M , N ) ( x ) . First, we get the following connection formula:
Lemma 2.
We have
Q n ( M , N ) ( x ) = P n ( α , β ) ( x ) M Φ ( n , j 1 , j 2 ) K n 1 ( j 1 , 0 ) ( 1 , x ) N Ψ ( n , j 1 , j 2 ) K n 1 ( j 2 , 0 ) ( 1 , x ) ,
where
Φ ( n , j 1 , j 2 ) = P n ( α , β ) ( j 1 ) ( 1 ) 1 + N K n 1 ( j 2 , j 2 ) ( 1 , 1 ) N P n ( α , β ) ( j 2 ) ( 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) 1 + M K n 1 ( j 1 , j 1 ) ( 1 , 1 ) + N K n 1 ( j 2 , j 2 ) ( 1 , 1 ) + M N K n 1 ( j 1 , j 1 ) ( 1 , 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) 2 ,
Ψ ( n , j 1 , j 2 ) = P n ( α , β ) ( j 2 ) ( 1 ) 1 + M K n 1 ( j 1 , j 1 ) ( 1 , 1 ) M P n ( α , β ) ( j 1 ) ( 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) 1 + M K n 1 ( j 1 , j 1 ) ( 1 , 1 ) + N K n 1 ( j 2 , j 2 ) ( 1 , 1 ) + M N K n 1 ( j 1 , j 1 ) ( 1 , 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) 2 .
Proof. 
We use a standard technique (see, for example, [37]). We have
Q n ( M , N ) ( x ) = P n ( α , β ) ( x ) + k = 0 n 1 a n , k P k ( α , β ) ( x ) .
Now, using the orthogonality of Q n ( M , N ) ( x ) , we get for 0 i < n ,
0 = Q n ( M , N ) ( x ) , P i ( α , β ) ( x ) S = P n ( α , β ) ( x ) + k = 0 n 1 a n , k P k ( α , β ) ( x ) , P i ( α , β ) ( x ) S = 1 1 P n ( α , β ) ( x ) P i ( α , β ) ( x ) ( 1 x ) α ( 1 + x ) β d x + k = 0 n 1 a n , k 1 1 P k ( α , β ) ( x ) P i ( α , β ) ( x ) ( 1 x ) α ( 1 + x ) β d x + M Q n ( M , N ) ( j 1 ) ( 1 ) P i ( α , β ) ( j 1 ) ( 1 ) + N Q n ( M , N ) ( j 2 ) ( 1 ) P i ( α , β ) ( j 2 ) ( 1 ) = a n , i | | P i ( α , β ) | | α 2 + M Q n ( M , N ) ( j 1 ) ( 1 ) P i ( α , β ) ( j 1 ) ( 1 ) + N Q n ( M , N ) ( j 2 ) ( 1 ) P i ( α , β ) ( j 2 ) ( 1 ) .
Then,
a n , i = M Q n ( M , N ) ( j 1 ) ( 1 ) P i ( α , β ) ( j 1 ) ( 1 ) + N Q n ( M , N ) ( j 2 ) ( 1 ) P i ( α , β ) ( j 2 ) ( 1 ) | | P i ( α , β ) | | 2 .
Next, using the definition of kernel polynomials and the expression (27), we obtain:
Q n ( M , N ) ( x ) = P n ( α , β ) ( x ) M Q n ( M , N ) ( j 1 ) ( 1 ) K n 1 ( j 1 , 0 ) ( 1 , x ) N Q n ( M , N ) ( j 2 ) ( 1 ) K n 1 ( j 2 , 0 ) ( 1 , x ) .
We need to calculate Q n ( M , N ) ( j 1 ) ( 1 ) and Q n ( M , N ) ( j 2 ) ( 1 ) . To do this, we build a system of two equations and two unknowns as it follows. We derive the expression (28) j 1 times and evaluate at x = 1 , then we repeat the process, but now deriving it j 2 times and evaluating at x = 1 . Thus, using the fact that
K n 1 ( j , k ) ( a , b ) = K n 1 ( k , j ) ( b , a ) ,
for all a , b R and j , k N { 0 } , we can build the linear system
Q n ( M , N ) ( j 1 ) ( 1 ) = P n ( α , β ) ( j 1 ) ( 1 ) M Q n ( M , N ) ( j 1 ) ( 1 ) K n 1 ( j 1 , j 1 ) ( 1 , 1 ) N Q n ( M , N ) ( j 2 ) ( 1 ) K n 1 ( j 2 , j 1 ) ( 1 , 1 ) , Q n ( M , N ) ( j 2 ) ( 1 ) = P n ( α , β ) ( j 2 ) ( 1 ) M Q n ( M , N ) ( j 1 ) ( 1 ) K n 1 ( j 2 , j 1 ) ( 1 , 1 ) N Q n ( M , N ) ( j 2 ) ( 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) .
Solving the system, we get the result. □
The asymptotic behavior of the coefficients in the connection Formula (24) is given by the following result.
Lemma 3.
Let Φ ( n , j 1 , j 2 ) and Ψ ( n , j 1 , j 2 ) be defined in (25) and (26), respectively. Then,
lim n + Φ ( n , j 1 , j 2 ) n α + 2 j 1 + 2 = 2 α + β + j 1 + 1 ( α + 2 j 1 + 1 ) Γ ( α + j 1 + 1 ) M ,
lim n + ( 1 ) n Ψ ( n , j 1 , j 2 ) n β + 2 j 2 + 2 = ( 1 ) j 2 2 α + β + j 2 + 1 ( β + 2 j 2 + 1 ) Γ ( β + j 2 + 1 ) N .
Proof. 
To establish the results, we need (10), (11), and (13). We have only proved (29) because the proof of (30) is totally similar. Thus,
lim n + Φ ( n , j 1 , j 2 ) n α + 2 j 1 + 2 = P n ( α , β ) ( j 1 ) ( 1 ) n α + 2 j 1 + 2 1 + M K n 1 ( j 1 , j 1 ) ( 1 , 1 ) + N K n 1 ( j 2 , j 2 ) ( 1 , 1 ) + M N K n 1 ( j 1 , j 1 ) ( 1 , 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) 2 + N P n ( α , β ) ( j 1 ) ( 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) n α + 2 j 1 + 2 1 + M K n 1 ( j 1 , j 1 ) ( 1 , 1 ) + N K n 1 ( j 2 , j 2 ) ( 1 , 1 ) + M N K n 1 ( j 1 , j 1 ) ( 1 , 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) 2 N P n ( α , β ) ( j 2 ) ( 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) n α + 2 j 1 + 2 1 + M K n 1 ( j 1 , j 1 ) ( 1 , 1 ) + N K n 1 ( j 2 , j 2 ) ( 1 , 1 ) + M N K n 1 ( j 1 , j 1 ) ( 1 , 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) K n 1 ( j 1 , j 2 ) ( 1 , 1 ) 2 = lim n + N P n ( α , β ) ( j 1 ) ( 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) n α + 2 j 1 + 2 n 2 α + 2 β + 4 j 1 + 4 j 2 + 4 M N K n 1 ( j 1 , j 1 ) ( 1 , 1 ) K n 1 ( j 2 , j 2 ) ( 1 , 1 ) n 2 α + 2 β + 4 j 1 + 4 j 2 + 4 = 2 α + β + j 1 + 1 ( α + 2 j 1 + 1 ) Γ ( α + j 1 + 1 ) M .
The following result compares asymptotically Q n ( M , N ) ( k ) ( x ) and P n ( α , β ) ( k ) ( x ) at the end points of the interval [ 1 , 1 ] .
Lemma 4.
Let k be a nonnegative integer; then,
lim n + Q n ( M , N ) ( k ) ( 1 ) P n ( α , β ) ( k ) ( 1 ) = k j 1 α + j 1 + k + 1 ,
lim n + Q n ( M , N ) ( k ) ( 1 ) P n ( α , β ) ( k ) ( 1 ) = k j 2 β + j 2 + k + 1 .
Proof. 
We only prove (31) because (32) is obtained in the same way. We derive the Formula (24) k times and evaluate at x = 1 , then we take limits and apply Propositon 1 and Lemmas 1 and 3 getting
  lim n + Q n ( M , N ) ( k ) ( 1 ) P n ( α , β ) ( k ) ( 1 ) = lim n + P n ( α , β ) ( k ) ( 1 ) M Φ ( n , j 1 , j 2 ) K n 1 ( j 1 , k ) ( 1 , 1 ) N Ψ ( n , j 1 , j 2 ) K n 1 ( j 2 , k ) ( 1 , 1 ) P n ( α , β ) ( k ) ( 1 ) = 1 M 2 α + β + j 1 + 1 ( α + 2 j 1 + 1 ) Γ ( α + j 1 + 1 ) M 1 2 α + β + j 1 + k + 1 ( α + j 1 + k + 1 ) Γ ( α + j 1 + 1 ) Γ ( α + k + 1 ) 1 2 k Γ ( α + k + 1 ) = 1 α + 2 j 1 + 1 α + j 1 + k + 1 = k j 1 α + j 1 + k + 1 .
Remark 2.
From Lemmas 1 and 4, we deduce that
Q n ( M , N ) ( 1 ) j 1 α + j 1 + 1 P n ( α , β ) ( 1 ) j 1 ( α + j 1 + 1 ) Γ ( α + 1 ) n α , if j 1 > 0 , Q n ( M , N ) ( 1 ) j 2 β + j 2 + 1 P n ( α , β ) ( 1 ) ( 1 ) n + 1 j 2 ( β + j 2 + 1 ) Γ ( β + 1 ) n β , if j 2 > 0 ,
where the symbol ≈ means the following: if a n b n , then lim n + a n b n = 1 .
We claim that the Euclidean norm of the Sobolev polynomials behaves asymptotically like the one of classical Jacobi polynomials.
Proposition 3.
lim n + | | Q n ( M , N ) | | S | | P n ( α , β ) | | = 1 .
Proof. 
We have
Q n ( M , N ) ( x ) , Q n ( M , N ) ( x ) S = Q n ( M , N ) ( x ) , P n ( α , β ) ( x ) S   = | | P n ( α , β ) | | 2 + M Q n ( M , N ) ( j 1 ) ( 1 ) P n ( α , β ) ( j 1 ) ( 1 )   + N Q n ( M , N ) ( j 2 ) ( 1 ) P n ( α , β ) ( j 2 ) ( 1 ) .
Then,
| | Q n ( M , N ) | | S 2 | | P n ( α , β ) | | 2 = 1 + M Q n ( M , N ) ( j 1 ) ( 1 ) P n ( α , β ) ( j 1 ) ( 1 ) | | P n ( α ) | | 2 + N Q n ( M , N ) ( j 2 ) ( 1 ) P n ( α , β ) ( j 2 ) ( 1 ) | | P n ( α ) | | 2 = 1 + M Φ ( n , j 1 , j 2 ) P n ( α , β ) ( j 1 ) ( 1 ) | | P n ( α ) | | 2 + N Ψ ( n , j 1 , j 2 ) P n ( α , β ) ( j 2 ) ( 1 ) | | P n ( α ) | | 2 .
Finally, taking limits and using the relations (10)–(12), (29) and (30), we get
lim n + Φ ( n , j 1 , j 2 ) P n ( α , β ) ( j 1 ) ( 1 ) | | P n ( α ) | | 2 = lim n + Ψ ( n , j 1 , j 2 ) P n ( α , β ) ( j 2 ) ( 1 ) | | P n ( α ) | | 2 = 0 ,
and the result is proved. □
A useful estimate of the uniform norm is given in the next result.
Theorem 2.
Let q = max { α , β } be. If q 1 / 2 , then we have
| | Q n ( M , N ) | | = max x [ 1 , 1 ] Q n ( M , N ) ( x ) C n q ,
where C is a constant independent of n.
Proof. 
We have forwardly from (24)
max x [ 1 , 1 ] Q n ( M , N ) ( x ) max x [ 1 , 1 ] P n ( α , β ) ( x ) + M Φ ( n , j 1 , j 2 ) max x [ 1 , 1 ] K n 1 ( j 1 , 0 ) ( 1 , x )   + N Ψ ( n , j 1 , j 2 ) max x [ 1 , 1 ] K n 1 ( j 2 , 0 ) ( 1 , x ) .
First, let us find asymptotic upper bounds of the quantities max x [ 1 , 1 ] K n 1 ( j 1 , 0 ) ( 1 , x ) and max x [ 1 , 1 ] K n 1 ( j 2 , 0 ) ( 1 , x ) , to find an upper bound of max x [ 1 , 1 ] Q n ( M , N ) ( x ) . To reach this, we use the well-known upper bound for the classical Jacobi polynomials (see ([32], f. (7.32.2))):
max x [ 1 , 1 ] P n ( α , β ) ( x ) = n + q n n q Γ ( q + 1 ) , if q 1 / 2 .
Thus,
max x [ 1 , 1 ] K n 1 ( j 1 , 0 ) ( 1 , x ) = max x [ 1 , 1 ] i = 0 n 1 P i ( α , β ) ( j 1 ) ( 1 ) P i ( α , β ) ( x ) | | P i ( α , β ) ( x ) | | 2   i = 0 n 1 P i ( α , β ) ( j 1 ) ( 1 ) max x [ 1 , 1 ] P i ( α , β ) ( x ) | | P i ( α , β ) ( x ) | | 2   = i = 0 n 1 i + q i P i ( α , β ) ( j 1 ) ( 1 ) | | P i ( α , β ) ( x ) | | 2   = 1 Γ ( q + 1 ) i = 0 n 1 Γ ( i + q + 1 ) P i ( α , β ) ( j 1 ) ( 1 ) Γ ( i + 1 ) | | P i ( α , β ) ( x ) | | 2   n α + 2 j 1 + q + 2 2 α + β + j 1 ( α + 2 j 1 + q + 2 ) Γ ( α + j 1 + 1 ) Γ ( q + 1 ) ,
where we have used the Stolz–Cesàro criterion, and formulas (9), (10), and (12) to prove
lim n + i = 0 n 1 Γ ( i + q + 1 ) P i ( α , β ) ( j 1 ) ( 1 ) Γ ( i + 1 ) | | P i ( α , β ) ( x ) | | 2 n α + q + 2 j 1 + 2 = lim n + P n 1 ( α , β ) ( j 1 ) ( 1 ) Γ ( n + q ) ( α + q + 2 j 1 + 2 ) Γ ( n ) | | P n 1 ( α , β ) ( x ) | | 2 n α + q + 2 j 1 + 1   = 1 2 α + β + j 1 ( α + q + 2 j 1 + 2 ) Γ ( α + j 1 + 1 ) .
In an analogous way,
max x [ 1 , 1 ] K n 1 ( j 2 , 0 ) ( 1 , x ) 1 Γ ( q + 1 ) i = 0 n 1 Γ ( i + q + 1 ) P i ( α , β ) ( j 2 ) ( 1 ) Γ ( i + 1 ) | | P i ( α , β ) ( x ) | | 2   n β + 2 j 2 + q + 2 2 α + β + j 2 ( β + 2 j 2 + q + 2 ) Γ ( β + j 2 + 1 ) Γ ( q + 1 ) ,
where now we have used the Stolz–Cesàro criterion again, and formulas (9), (11) and (12) to prove
lim n + i = 0 n 1 Γ ( i + q + 1 ) P i ( α , β ) ( j 2 ) ( 1 ) Γ ( i + 1 ) | | P i ( α , β ) ( x ) | | 2 n β + q + 2 j 2 + 2 = lim n + Γ ( n + q ) P n 1 ( α , β ) ( j 2 ) ( 1 ) ( β + q + 2 j 2 + 2 ) Γ ( n ) | | P n 1 ( α , β ) ( x ) | | 2 n β + q + 2 j 2 + 1   = 1 2 α + β + j 2 ( β + q + 2 j 2 + 2 ) Γ ( β + j 2 + 1 ) .
Finally, it is enough to apply these results together with (29) and (30) in (33) to deduce the result. □
Remark 3.
For the case q < 1 / 2 , we have not obtained any result. When the inner product (1) is symmetric, we can obtain an upper bound for this uniform norm (see [31]). The key in that case is that the Sobolev polynomials can be expressed in terms of a finite combination of classical Gegenbauer polynomials where the coefficients of this expansion are convergent when n tends to . Unfortunately, we have not been able to get such type of expansion for the nonsymmetric case that we are tackling in this paper. Thus, this case remains open.

5. Asymptotics of the Value r 0

As we have commented in the introduction, in our case, if we compute the value of s 0 , then we can guarantee the existence of r 0 and obtain its explicit value.
Theorem 3.
Let q = max { α , β } 1 / 2 be. If q = α and j 1 > 0 or q = β and j 2 > 0 , then
s 0 : = lim n + log max x [ 1 , 1 ] q n ( M , N ) ( x ) log ϱ n = q + 1 / 2 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) < 1 ,
where q n ( M , N ) ( x ) denotes the orthonormal polynomials with respect to (1).
Proof. 
Taking into account Theorem 2, Remark 2 and the hypothesis of this theorem, we can assure readers that there are two positive constants C 1 and C 2 independent of n , so that
C 1 n q max x [ 1 , 1 ] Q n ( M , N ) ( x ) C 2 n q .
In this way, simple algebraic manipulations lead to
  log max x [ 1 , 1 ] q n ( M , N ) ( x ) log ϱ n = log max x [ 1 , 1 ] Q n ( M , N ) ( x ) log | | Q n ( M , N ) | | S log ϱ n = log max x [ 1 , 1 ] Q n ( M , N ) ( x ) n q + log n q log | | Q n ( M , N ) | | S n 1 / 2 log n 1 / 2 log ϱ n n 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) + log n 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) = log max x [ 1 , 1 ] Q n ( M , N ) ( x ) n q + q log n log | | Q n ( M , N ) | | S n 1 / 2 1 / 2 log n log ϱ n n 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) + 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) log n .
Now, applying (34), the first term in the numerator of the above fraction is bounded, so taking limits we get the result. □
Corollary 1.
Let q = max { α , β } 1 / 2 be. If q = α and j 1 > 0 or q = β and j 2 > 0 , then
r 0 = lim n + log n max x [ 1 , 1 ] q n ( M , N ) ( x ) 2 log ϱ n = 2 s 0 + 1 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) = 2 ( q + 1 ) 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) .
Proof. 
We can observe
  log n max x [ 1 , 1 ] q n ( M , N ) ( x ) 2 log ϱ n = log ( n ) log ϱ n n 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) + 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) log ( n ) + log max x [ 1 , 1 ] q n ( M , N ) ( x ) 2 log ϱ n n 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) + 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) log ( n ) .
We claim that the limits when n tends to infinite of the two terms in the previous expression exist, and therefore we have proven the first equality in (35). Using Theorem 1, the limit of the first term exists and its value is
lim n + log ( n ) log ϱ n n 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) + 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) log ( n ) = 1 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) .
To establish the existence of the other limit, it is enough to proceed in the same way as the proof of Theorem 3 but taking into account that now we have max x [ 1 , 1 ] q n ( M , N ) ( x ) 2 . The square modifies the previous proof slightly. Anyway, we can prove that the limit exists and we get
lim n + log max x [ 1 , 1 ] q n ( M , N ) ( x ) 2 log ϱ n n 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) + 2 ( α + β + 2 j 1 + 2 j 2 + 3 ) log ( n ) = 2 s 0 .
Gathering (36) and (37), we obtain the result. □
Remark 4.
Notice that, under the hypothesis of Theorem 3, s 0 [ 0 , 1 ) , but r 0 is strictly positive, i.e., r 0 ( 0 , 1 ) .
Remark 5.
To establish Theorem 3, it is essential to have an upper and lower bound of the uniform norm of Q n ( M , N ) . Moreover, these bounds must be of the same order. That occurs when j 1 or j 2 are positive integers although when both j 1 and j 2 are zero (Krall case), we cannot guarantee it. In this case, all the zeros of the Sobolev polynomials are within the interval ( 1 , 1 ) and both limits in Lemma 4 are zero when k = 0 . However, to establish the bounds that permit proving Theorem 3, it is necessary that these limits do not vanish. We have not found the adequate techniques to tackle this problem, so the existence of r 0 in the Krall case is posed as an open question.
Remark 6.
As we have commented in Remark 1, in the symmetric case, the limit value r 0 was obtained in [31].
Remark 7.
We have made numerical experiments with the objective of computing experimentally the values r 0 and s 0 . All the computations have been done with the software Mathematica ® 12 (Wolfram Research Europe Ltd, Long Hanborough Oxfordshire, United Kingdom). We have checked the convergence, but we have observed that it is slow, for example, taking α = 3 , β = 1 / 2 , j 1 = 1 , j 2 = 2 , M = 4 , and N = 5 , we get
log max x [ 1 , 1 ] q n ( M , N ) ( x ) log ϱ n log n max x [ 1 , 1 ] q n ( M , N ) ( x ) 2 log ϱ n
n = 100 0.125076 0.29941
n = 400 0.128414 0.303729
n = 1600 0.130748 0.306954
Limit s 0 = 7 / 50 = 0.14 r 0 = 8 / 25 = 0.32
Another example taking α = 2 , β = 1 / 2 , j 1 = 3 , j 2 = 1 , M = 2 , and N = 5 , we obtain
log max x [ 1 , 1 ] q n ( M , N ) ( x ) log ϱ n log n max x [ 1 , 1 ] q n ( M , N ) ( x ) 2 log ϱ n
n = 100 0.104015 0.257152
n = 400 0.102267 0.251277
n = 1600 0.101653 0.248629
Limit s 0 = 1 / 10 = 0.10 r 0 = 6 / 25 = 0.24
Finally, we have checked numerically that, when the hypothesis of Theorem 3 is not satisfied, then the thesis of the theorem will not necessarily be fullfilled. For example, with α = 3 , β = 1 / 2 , j 1 = 0 , j 2 = 1 , M = 4 , and N = 7 , we have the following results:
log max x [ 1 , 1 ] q n ( M , N ) ( x ) log ϱ n log n max x [ 1 , 1 ] q n ( M , N ) ( x ) 2 log ϱ n
n = 100 0.114743 0.299861
n = 400 0.0708432 0.209214
n = 1600 0.0494866 0.164716
Limit s 0 = 7 / 34 0.20588235 r 0 = 8 / 17 0.470588235

6. Conclusions

We have considered the nonsymmetric discrete SIP
( f , g ) S = 1 1 f ( x ) g ( x ) ( 1 x ) α ( 1 + x ) β d x + M f ( j 1 ) ( 1 ) g ( j 1 ) ( 1 ) + N f ( j 2 ) ( 1 ) g ( j 2 ) ( 1 ) ,
where M , N > 0 , α , β > 1 , and j 1 , j 2 N { 0 } , which can be seen as a differential perturbation located at the end points of the support of the Jacobi measure of the standard inner product
( f , g ) = 1 1 f ( x ) g ( x ) ( 1 x ) α ( 1 + x ) β d x .
It is known that these Sobolev polynomials are eigenfunctions of a differential operator. We have established the asymptotic behavior of the corresponding eigenvalues in Theorem 1, and we claim that the growth of these eigenvalues is faster than the one of the eigenvalues related to the Jacobi polynomials, concretely
Classical JacobiDiscrete Jacobi–Sobolev
Asymptotic behavior of the eigenvalues n 2 n 2 α + 2 β + 4 j 1 + 4 j 2 + 6
The study of the Jacobi–Sobolev orthogonal polynomials allows us to prove in Theorem 2 an upper bound for the uniform norm of these polynomials when max { α , β } 1 / 2 . This fact together with Theorem 1 are the essential keys to establish in Theorem 3, under some hypothesis, the value of the limit
lim n + log max x [ 1 , 1 ] q n ( M , N ) ( x ) log ϱ n ,
where q n ( M , N ) ( x ) are the discrete Jacobi–Sobolev orthonormal polynomials and ϱ n the corresponding eigenvalues. Furthermore, three open problems are posed:
  • Theorem 3 holds for max { α , β } 1 / 2 , and the case when max { α , β } ( 1 , 1 / 2 ) remains open.
  • Theorem 3 has not been established for the Krall case, that is, when j 1 = j 2 = 0 . Therefore, it is another open problem.
  • Numerical experiments lead us to think that Theorem 3 does not hold if we relax the hypothesis. Thus, the question is: what is the value of the limit, if it exists, when either max { α , β } = α and j 1 = 0 or max { α , β } = β and j 2 = 0 ?
Finally, we recall that the symmetric case was tackled in [31].

Author Contributions

All authors contributed equally to this work, as well as to its preparation. All authors have read and agreed to the published version of the manuscript.

Funding

The authors J.F.M.-M. and J.J.M.-B. are partially supported by the Ministry of Science, Innovation, and Universities of Spain and the European Regional Development Fund (ERDF), grant MTM2017-89941-P; they are also partially supported by ERDF and Consejería de Economía, Conocimiento, Empresas y Universidad de la Junta de Andalucía (grant UAL18-FQM-B025-A) and by Research Group FQM-0229 (belonging to Campus of International Excellence CEIMAR). The author J.J.M-B. is also partially supported by the research centre CDTIME of Universidad de Almería and by Junta de Andalucía and ERDF, Ref. SOMM17/6105/UGR.

Acknowledgments

We thank Lance Littlejohn for his help and for introducing us to this topic.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Lewis, D.C. Polynomial least square approximations. Am. J. Math. 1947, 69, 273–278. [Google Scholar] [CrossRef]
  2. Schäfke, F.W.; Wolf, G. Einfache verallgemeinerte klassische Orthogonalpolynome. J. Reine Angew. Math. 1973, 262, 339–355. [Google Scholar]
  3. Althammer, P. Eine Erweiterung des Orthogonalitätsbegriffes bei Polynomen und deren Anwendung auf die beste Approximation. J. Reine Angew. Math. 1962, 211, 192–204. [Google Scholar]
  4. Gröbner, W. Orthogonale Polynomsysteme, die Gleichzeitig mit f(x) auch deren Ableitung f′(x) approximieren. In Funktionalanalysis, Approximationstheorie, Numerische Mathematik; Collatz, L., Ed.; ISNM 7; Birkhäuser: Basel, Switzerland, 1967; pp. 24–32. [Google Scholar]
  5. Marcellán, F.; Xu, Y. On Sobolev orthogonal polynomials. Expos. Math. 2015, 33, 308–352. [Google Scholar] [CrossRef] [Green Version]
  6. Iserles, A.; Koch, P.E.; Nørsett, S.P.; Sanz-Serna, J.M. On polynomials orthogonal with respect to certain Sobolev inner products. J. Approx. Theory 1991, 65, 151–175. [Google Scholar] [CrossRef] [Green Version]
  7. Iserles, A.; Sanz-Serna, J.M.; Koch, P.E.; Nørsett, S.P. Orthogonality and approximation in a Sobolev space. In Algorithms for Approximation, II (Shrivenham, 1988); Chapman and Hall: London, UK, 1990; pp. 117–124. [Google Scholar]
  8. Marcellán, F.; Moreno-Balcázar, J.J.; Martínez-Finkelshtein, A. k-coherence of measures with non-classical weights. In Margarita Mathematica en Memoria de José Javier Guadalupe Hernández; Servicio de Publicaciones, Universidad de la Rioja: Logroño, Spain, 2001; pp. 77–83. [Google Scholar]
  9. De Jesus, M.N.; Petronilho, J. Sobolev orthogonal polynomials and (M,N) coherent pairs of measures. J. Comput. Appl. Math. 2013, 237, 83–101. [Google Scholar] [CrossRef] [Green Version]
  10. De Jesus, M.N.; Marcellán, F.; Petronilho, J.; Pinzón-Cortés, N.C. (M,N)-coherent pairs of order (m,k) and Sobolev orthogonal polynomials. J. Comput. Appl. Math. 2014, 256, 16–35. [Google Scholar] [CrossRef] [Green Version]
  11. Kwon, K.H.; Littlejohn, L.L. The orthogonality of the Laguerre polynomials {Ln(−k)(x)} for positive integers k. Ann. Numer. Math. 1995, 2, 289–303. [Google Scholar]
  12. Pérez, T.E.; Piñar, M.A. On Sobolev orthogonality for the generalized Laguerre polynomials. J. Approx. Theory 1996, 86, 278–285. [Google Scholar] [CrossRef] [Green Version]
  13. Álvarez de Morales, M.; Pérez, T.E.; Piñar, M.A. Sobolev orthogonality for the Gegenbauer polynomials {Cn(−N+1/2)(x)}n≥0. J. Comput. Appl. Math. 1998, 100, 111–120. [Google Scholar] [CrossRef] [Green Version]
  14. Alfaro, M.; Pérez, T.E.; Piñar, M.A.; Rezola, M.L. Sobolev orthogonal polynomials: The discrete-continuous case. Methods Appl. Anal. 1999, 6, 593–616. [Google Scholar] [CrossRef] [Green Version]
  15. Alfaro, M.; Álvarez de Morales, M.; Rezola, M.L. Orthogonality of the Jacobi polynomials with negative integer parameters. J. Comput. Appl. Math. 2002, 145, 379–386. [Google Scholar] [CrossRef] [Green Version]
  16. Sánchez-Lara, J.F. On the Sobolev orthogonality of classical orthogonal polynomials for non standard parameters. Rocky Mountain J. Math. 2017, 47, 267–288. [Google Scholar] [CrossRef]
  17. López, G.; Marcellán, F.; Van Assche, W. Relative asymptotics for polynomials orthogonal with respect to a discrete Sobolev inner product. Constr. Approx. 1995, 11, 107–137. [Google Scholar] [CrossRef] [Green Version]
  18. Marcellán, F.; Alfaro, M.; Rezola, M.L. Orthogonal polynomials on Sobolev spaces: Old and new directions. J. Comput. Appl. Math. 1993, 48, 113–131. [Google Scholar] [CrossRef] [Green Version]
  19. Meijer, H.G. A short history of orthogonal polynomials in a Sobolev space. I. The non-discrete case. Nieuw Arch. Wisk. 1996, 14, 93–112. [Google Scholar]
  20. Martínez-Finkelshtein, A. Asymptotic properties of Sobolev orthogonal polynomials. J. Comput. Appl. Math. 1998, 99, 491–510. [Google Scholar] [CrossRef] [Green Version]
  21. Martínez-Finkelshtein, A. Analytic aspects of Sobolev orthogonal polynomials revisited. J. Comput. Appl. Math. 2001, 127, 255–266. [Google Scholar] [CrossRef] [Green Version]
  22. Marcellán, F.; Moreno-Balcázar, J.J. Asymptotics and zeros of Sobolev orthogonal polynomials on unbounded supports. Acta Appl. Math. 2006, 94, 163–192. [Google Scholar] [CrossRef] [Green Version]
  23. Marcellán, F.; Moreno-Balcázar, J.J. What is…a Sobolev orthogonal polynomial? Notices Am. Math. Soc. 2017, 64, 873–875. [Google Scholar] [CrossRef]
  24. Behr, N.; Dattoli, G.; Duchamp, G.H.E.; Licciardi, S.; Penson, K.A. Operational Methods in the Study of Sobolev-Jacobi Polynomials. Mathematics 2019, 7, 124. [Google Scholar] [CrossRef] [Green Version]
  25. Ren, Y.; Yu, X.; Wang, Z. Diagonalized Chebyshev Rational Spectral Methods for Second-Order Elliptic Problems on Unbounded Domains. Numer. Math. Theor. Meth. Appl. 2019, 12, 265–284. [Google Scholar] [CrossRef]
  26. Sharapudinov, I.I. Sobolev-orthogonal systems of functions and the Cauchy problem for ODEs. Izv. Ross. Akad. Nauk Ser. Mat. 2019, 83, 204–226, translation in Izv. Math. 2019, 83, 391–412. [Google Scholar] [CrossRef]
  27. Sharapudinov, I.I. Sobolev-orthogonal systems of functions and some of their applications. Uspekhi Mat. Nauk 2019, 74, 87–164. (In Russian) [Google Scholar] [CrossRef]
  28. Mañas–Mañas, J.F.; Moreno–Balcázar, J.J. Classical Sobolev Orthogonal Polynomials: Eigenvalue Problem. Results Math. 2019, 74, 144. [Google Scholar] [CrossRef] [Green Version]
  29. Bavinck, H. Differential and difference operators having orthogonal polynomials with two linear perturbations as eigenfunctions. J. Comput. Appl. Math. 1998, 92, 85–95. [Google Scholar] [CrossRef] [Green Version]
  30. Welman, R. Regularized kernel learning in Hilbert scales. Unpublish work.
  31. Littlejohn, L.L.; Mañas–Mañas, J.F.; Moreno–Balcázar, J.J.; Wellman, R. Differential operator for discrete Gegenbauer-Sobolev orthogonal polynomials: Eigenvalues and asymptotics. J. Approx. Theory 2018, 230, 32–49. [Google Scholar] [CrossRef] [Green Version]
  32. Szego, G. Orthogonal Polynomials. In American Mathematical Society Colloquium Publications, 4th ed.; American Mathematical Society: Providence, RI, USA, 1975; Volume 23. [Google Scholar]
  33. Mañas–Mañas, J.F.; Marcellán, F.; Moreno–Balcázar, J.J. Asymptotic behavior of varying discrete Jacobi–Sobolev orthogonal polynomials. J. Comput. Appl. Math. 2016, 300, 341–353. [Google Scholar] [CrossRef] [Green Version]
  34. Askey, R.A.; Roy, R. Gamma function. In NIST Handbook of Mathematical Functions; Cambridge University Press: Cambridge, UK, 2010; pp. 135–147. [Google Scholar]
  35. Arvesú, J.; Álvarez–Nodarse, R.; Marcellán, F.; Pan, K. Jacobi–Sobolev-type orthogonal polynomials: Second-order differential equation and zeros. J. Comput. Appl. Math. 1998, 90, 135–156. [Google Scholar] [CrossRef] [Green Version]
  36. Mañas–Mañas, J.F.; Marcellán, F.; Moreno–Balcázar, J.J. Asymptotics for varying discrete Sobolev orthogonal polynomials. Appl. Math. Comput. 2017, 314, 65–79. [Google Scholar] [CrossRef]
  37. Marcellán, F.; Ronveaux, A. On a class of polynomials orthogonal with respect to a discrete Sobolev inner product. Indag. Math. 1990, 1, 451–464. [Google Scholar] [CrossRef] [Green Version]

Share and Cite

MDPI and ACS Style

Mañas-Mañas, J.F.; Moreno-Balcázar, J.J.; Wellman, R. Eigenvalue Problem for Discrete Jacobi–Sobolev Orthogonal Polynomials. Mathematics 2020, 8, 182. https://doi.org/10.3390/math8020182

AMA Style

Mañas-Mañas JF, Moreno-Balcázar JJ, Wellman R. Eigenvalue Problem for Discrete Jacobi–Sobolev Orthogonal Polynomials. Mathematics. 2020; 8(2):182. https://doi.org/10.3390/math8020182

Chicago/Turabian Style

Mañas-Mañas, Juan F., Juan J. Moreno-Balcázar, and Richard Wellman. 2020. "Eigenvalue Problem for Discrete Jacobi–Sobolev Orthogonal Polynomials" Mathematics 8, no. 2: 182. https://doi.org/10.3390/math8020182

APA Style

Mañas-Mañas, J. F., Moreno-Balcázar, J. J., & Wellman, R. (2020). Eigenvalue Problem for Discrete Jacobi–Sobolev Orthogonal Polynomials. Mathematics, 8(2), 182. https://doi.org/10.3390/math8020182

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop