Sharp Constants of Approximation Theory. III. Certain Polynomial Inequalities of Different Metrics on Convex Sets
Michael I. Ganzburg

TL;DR
This paper establishes limit relations between sharp polynomial inequalities on convex bodies and entire functions of exponential type, advancing the understanding of approximation theory in multivariate settings.
Contribution
It introduces new limit relations connecting polynomial inequalities on convex bodies with entire functions of exponential type, extending previous univariate results.
Findings
Limit relations between polynomial and entire function inequalities
Sharp constants characterized for multivariate convex bodies
Advancement in approximation theory for multivariate polynomials
Abstract
Let be a centrally symmetric convex body and let be its polar. We prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials on and the corresponding constants for entire functions of exponential type with the spectrum in .
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.
Sharp Constants of Approximation Theory. III. Certain Polynomial Inequalities
of Different Metrics on Convex Sets
Michael I. Ganzburg
Department of Mathematics
Hampton University
Hampton, VA 23668
USA
Abstract.
Let be a centrally symmetric convex body and let be its polar. We prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials on and the corresponding constants for entire functions of exponential type with the spectrum in .
Key words and phrases:
Sharp constants, multivariate Markov-Bernstein-Nikolskii type inequality, algebraic polynomials, entire functions of exponential type.
2010 Mathematics Subject Classification:
Primary 41A17, 41A63, Secondary 26D10
1. Introduction
We continue the study of the sharp constants in multivariate inequalities of approximation theory that began in [17] and [18]. In this paper we prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials on convex sets and entire functions of exponential type.
Notation. Let be the Euclidean -dimensional space with elements , the inner product , and the norm . Next, is the -dimensional complex space with elements and the norm ; denotes the set of all integral lattice points in ; and is a subset of of all points with nonnegative coordinates. We also use multi-indices and with
[TABLE]
Let be a set of all polynomials in variables of total degree at most , with complex coefficients. Given , and , let , and be the -dimensional parallelepiped, cube, and ball, respectively.
Let be the space of all measurable complex-valued functions on a measurable set with the finite quasinorm
[TABLE]
This quasinorm allows the following ”triangle” inequality:
[TABLE]
where and for .
In this paper we will need certain definitions and properties of convex bodies in . We first define the width of a convex body in as the minimal distance between two parallel supporting hyperplanes of .
Next, throughout the paper is a centrally symmetric (with respect to the origin) closed convex body in and is the polar of . It is well known that is a centrally symmetric (with respect to the origin) closed convex body in and (see, e.g., [29, Sect. 14]). The set generates the following dual norms on and by
[TABLE]
Note also that is the unit ball in the norm on with the boundary , the width , and the -dimensional volume . For example, if , and , then for and , where , and . In particular, , and .
Let be a straight line passing through a fixed point and the origin, and let be the closest point to . We also need the equivalent definition of the dual norm in given by the formula (see, e.g., [29, Theorem 14.5])
[TABLE]
Given , the set of all trigonometric polynomials with complex coefficients is denoted by .
Definition 1.1**.**
We say that an entire function has exponential type if for any there exists a constant such that for all , .
The class of all entire function of exponential type is denoted by . It is easy to verify that if , then . Throughout the paper, if no confusion may occur, the same notation is applied to and its restriction to (e.g., in the form . The class was defined by Stein and Weiss [33, Sect. 3.4]. For and , similar classes were defined by Bernstein [5] and Nikolskii [26], [27, Sects. 3.1, 3.2.6], see also [9, Definition 5.1]. Properties of functions from have been investigated in numerous publications (see, e.g., [5, 26, 27, 33, 25, 12, 13, 14] and references therein). Some of these properties are presented in Section 2. We need more definitions for entire functions of several variables.
We say that an entire function has exponential type if
[TABLE]
The class of all entire functions of exponential type is denoted by .
Next, let us define the indicator and the -indicator of by
[TABLE]
respectively. Note that equivalent definitions of and were introduced by Plancherel and Pólya [28] (see also [31, Sect. 3.4.2]). The class of all functions with is denoted by . A similar class was introduced by the author [12]. It turns out that (see Lemma 2.1 (d)), but the definition of is needed for the proof of important Lemma 2.2.
Throughout the paper denote positive constants independent of essential parameters. Occasionally we indicate dependence on certain parameters. The same symbol does not necessarily denote the same constant in different occurrences. In addition, we use the ceiling function .
** Markov-Bernstein-Nikolskii Type Inequalities.** Let be a linear differential operator with constant coefficients . We assume that is the identity operator.
Next, we define sharp constants in multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic and trigonometric polynomials and entire functions of exponential type. Let
[TABLE]
Here, , and .
The purpose of this paper is to prove limit relations between and . The limit relation for multivariate trigonometric polynomials
[TABLE]
was proved by the author [17, Theorem 1.3]. In the univariate case of , and , (1.6) was proved by the author and Tikhonov [19]. In earlier publications [21, 22], Levin and Lubinsky established versions of (1.6) on the unit circle for . Certain extensions of the Levin-Lubinsky’s results to the -dimensional unit sphere in were recently proved by Dai, Gorbachev, and Tikhonov [8].
In case of an even , the unit ball , and the operator , where is the Laplace operator, the author [18, Corollary 4.4] proved the following limit relation for multivariate algebraic polynomials:
[TABLE]
The proof of (1.7) was based on invariance theorems and limit relations for sharp constants in univariate weighted spaces (see [18, Theorems 2.1, 2.2, 4.1]). Note that certain properties of the sharp constants in univariate weighted spaces are discussed by Arestov and Deikalova [2]. For , and , (1.7) was established in [16, Theorem 1.1].
In this paper we extend relation (1.7) to any , and .
Main Results and Remarks. We recall that is a centrally symmetric (with respect to the origin) closed convex body in .
Theorem 1.2**.**
If , and , then exists and
[TABLE]
In addition, there exists a nontrivial function such that
[TABLE]
The following corollary is a direct consequence of Theorem 1.2 and relation (1.6).
Corollary 1.3**.**
If , and , then
[TABLE]
Remark 1.4*.*
Relations (1.8) and (1.9) show that the function from Theorem 1.2 is an extremal function for .
Remark 1.5*.*
In definitions (1.4) and (1.5) of the sharp constants we discuss only complex-valued functions and . We can define similarly the ”real” sharp constants if the suprema in (1.4) and (1.5) are taken over all real-valued functions on from and , respectively. It turns out that the ”complex” and ”real” sharp constants coincide. For this fact was proved in [16, Sect. 1] (cf. [19, Theorem 1.1]) and the case of can be proved similarly.
Remark 1.6*.*
Note that the following relation for a different class of polynomials holds true:
[TABLE]
where the supremum in (1.10) is taken over all nontrivial polynomials in variables of degree at most in each variable. In addition, note that, unlike relation (1.8), both sides of (1.10) contain the same set .
Remark 1.7*.*
Equality (1.8) presents one more example of a relation between entire functions of exponential type on and polynomials on . The limit relations for the corresponding errors of approximation of by functions from and polynomials from restricted to were proved by the author [12, Theorems 5.1, 5.2]. Certain versions of these results are discussed below in Lemmas 2.3 and 2.4.
Remark 1.8*.*
Let us introduce a sharp constant in the classic inequality of different metrics
[TABLE]
where is a compact subset of and is a constant. Let us assume that the following inequalities hold true:
[TABLE]
if any. For example, the third inequality in (1.11) holds true for and any domain , satisfying the cone condition, in particular for convex bodies (not necessarily symmetric), see [6, Theorem 1], [7, Theorem 2], [11, Theorem 2]. It is also valid for and any domain with the smooth boundary, see [6, Theorem 2], [7, Theorem 5], [20, p. 433]. The typical examples of sets when all inequalities in (1.11) hold true are the unit cube for and the unit ball for . More examples and discussions are presented by Ditzian and Prymak [10]. The author (see [16, Theorem 1.4] and [18, Corollary 4.6]) proved that exists for and found its exact value. However, it is unknown as to whether exists for .
The proof of Theorem 1.2 is presented in Section 3. Section 2 contains certain properties of functions from and . In particular, Lemma 2.7 that discusses inequalities of different metrics for multivariate polynomials on smaller domains is of independent interest.
2. Properties of Entire Functions and
Polynomials
In this section we discuss certain properties of multivariate entire functions of exponential type and polynomials that are needed for the proof of Theorem 1.2. We start with certain properties of entire functions of exponential type.
Lemma 2.1**.**
*(a) If , then there exists such that .
(b) if and only if there exists such that .
(c) The following Bernstein and Nikolskii type inequalities hold true:*
[TABLE]
*where is independent of .
(d) For .
(e) The Lebesgue measure of the set is zero for every .*
Proof.
Statement (a) follows from the obvious inclusion for a certain . Next, statement (b) follows from the inequalities where (here, is the least number such that ) and . Inequality (2.1) for , is well known (see, e.g., [27, Eq. 3.2.2(8)]). Then (2.1) follows from statement (a). Inequality (2.2) was proved in [25, Theorem 5.7].
To prove statement (d), we note that if , then by (2.2), while the relation was proved in a more general form by the author [12, Corollary 2.1]. Statement (e) was proved by Ronkin (see [30] and [31, Theorem 3.4.3]).
A compactness theorem for a set of entire functions is discussed below.
Lemma 2.2**.**
(a) Let be the set of all multivariate entire functions , where is the homogeneous polynomial of degree , satisfying the following conditions: for any the following inequalities are valid:
[TABLE]
where and are independent of and , and is independent of and . Then for any sequence there exist a subsequence and a function such that for every ,
[TABLE]
*uniformly on each compact subset of .
(b) If the function from statement (a) belongs to , then .*
Proof.
(a) By a multivariate version of Weierstrass’ theorem (see, e.g., [32, Sect. 1.2.5]), it suffices to prove statement (a) for . Let us set , and let
[TABLE]
By (2.3), the polynomials , are uniformly bounded on for a fixed and each . Therefore, using the Cantor diagonal process, we can select a subsequence such that
[TABLE]
uniformly on for any and . Here, are homogeneous polynomials of degree . Then inequality (2.3) shows that is an entire function that belongs to the class . Further, we obtain for
[TABLE]
where by (2.3) for and by (2.6),
[TABLE]
Then given and , we can choose such that . Finally by (2.6), we can choose such that for all . Thus (2.5) holds uniformly on , where . In addition, by Lemma 2.1 (b).
Next, we prove that . It follows from (2.4) and (2.6) that for any and ,
[TABLE]
The function is continuous at . Hence by (2.7), there exists a number such that for any . Therefore, for a fixed and any
[TABLE]
By Lemma 2.1 (e), the Lebesgue measure of the set is equal to zero for every fixed . Hence using (2.8), we see that there exists such that
[TABLE]
Thus . This completes the proof of statement (a) of the lemma.
(b) If , then by statement (a), and by Lemma 2.1 (d).
In the next two lemmas we discuss estimates of the error of polynomial approximation for functions from .
Lemma 2.3**.**
For any function , and , there is a polynomial such that
[TABLE]
This result was proved by the author [12, Lemma 4.4]. In case of a version of Lemma 2.3 was established by Bernstein [4] (see also [34, Sect. 5.4.4] and [1, Appendix, Sect. 83]). More general and more precise inequalities were obtained in [12] and [13].
Lemma 2.4**.**
For any , and , there is a polynomial such that for and ,
[TABLE]
Proof.
First of all, for , and , we need the following crude Markov-type inequality:
[TABLE]
Inequality (2.11) easily follows from a multivariate A. A. Markov-type inequality proved by Wilhelmsen [35, Theorem 3.1].
Next, let be the sequence of polynomials from Lemma 2.3. Then using (2.11) for and (2.9), we obtain
[TABLE]
Hence for , and we have
[TABLE]
Thus (2.10) is established.
Certain inequalities for multivariate trigonometric and algebraic polynomials are discussed in the next three lemmas.
Lemma 2.5**.**
For a polynomial , the following inequalities hold true:
[TABLE]
where is independent of , and .
Proof.
Inequality (2.12) is proved in [12, Lemma 3.2]. We first prove inequality (2.13) for and , i.e., we prove the inequality
[TABLE]
which is equivalent to
[TABLE]
where . This inequality without proof was discussed in [4] and [34, Eq. 2.6(9)] as a corollary of V. A. Markov’s inequality [23] (see also [34, Sect. 2.9.12]) and [24, Eqs. (5.1.4.1) and (6.1.2.5)])
[TABLE]
where is the Chebyshev polynomial of the first kind. It is sufficient to derive (2.15) from (2.16) for and . We consider three cases.
Case 1: or . Then we have from (2.16)
[TABLE]
Case 2: . Then we have from (2.16)
[TABLE]
Case 3: . It follows from (2.16) that we can replace with in inequalities (2.22). Therefore,
[TABLE]
Thus (2.15) and (2.14) follow from (2.19), (2.22), and (2.24).
To prove (2.13) for , we first draw a line passing through a fixed point and the origin with the equation , where and is the closest point to . In particular, for . In addition, we see by (1.3) that for ,
[TABLE]
Next, the restriction of to is a polynomial , where , and using relations (2.14) and (2.25), we obtain
[TABLE]
Thus (2.13) is established.
Note that a version of Lemma 2.5 was proved in [15, Theorem 1].
Next, we need a multivariate version of a generalized Bari’s inequality [16, Lemma 2.4]. Bari [3, Theorem 6] proved the following result for and .
Lemma 2.6**.**
Let be an even trigonometric polynomial of degree at most in each variable, , and let . Then for ,
[TABLE]
where is independent of and .
Proof.
The proof follows that of [3, Theorem 6] and [16, Lemma 2.4]. Let be the one-to-one function defined by the equation
[TABLE]
and let , where . Then
[TABLE]
and
[TABLE]
Next, let , by substitution (2.27), and let , where , i.e., . Then using (2.28), (2.29), and Nikolskii’s inequality for multivariate trigonometric polynomials of degree at most in each variable [27, Sect. 3.3.3], we obtain
[TABLE]
Hence (2.26) follows.
Certain polynomial estimates based on Lemma 2.6 are discussed in the following lemma.
Lemma 2.7**.**
*Let be an algebraic polynomial in variables of degree at most in each variable.
(a) For and ,*
[TABLE]
(b) For , and , the following inequality holds true:
[TABLE]
Proof.
Setting
[TABLE]
we have by Lemma 2.6
[TABLE]
Hence (2.30) holds true.
(b) Let such that . The cube , where , is a subset of . Indeed, for any we have by (1.3),
[TABLE]
Therefore, it follows from (2.30) that
[TABLE]
This proves (2.31).
Remark 2.8*.*
Lemma 2.7 (a) for was proved by a different method in [12, Lemma 3.3]. Note that (2.31) is valid for any convex body . In addition, note that an estimate of the constant in Nikolskii-type inequality (2.31) on a smaller convex body is , while for the corresponding inequality on the same domain the estimate is for domains with smooth boundaries and the estimate is for domains with boundaries, satisfying the cone condition (see Remark 1.8).
3. Proof of Theorem 1.2
Throughout the section we use the notation , introduced in Section 1.
Proof of Theorem 1.2. We first prove the inequality
[TABLE]
Let be any function from . Then by Lemma 2.1 (a); hence by [27, Sect. 3.1] (see also [17, Lemma 2.1 (d)]). In addition, by Bernstein’s and Nikolskii’s inequalities (2.1) and (2.2) and by the ”triangle” inequality (1.2). Therefore,
[TABLE]
Indeed, since , (3.2) is known for (see, e.g., [27, Theorem 3.2.5]), and for it follows from Nikolskii’s inequality (2.2), since if , then .
Let us first prove (3.1) for . Then by (3.2), there exists such that . Without loss of generality we can assume that . Let be a fixed number. Then using polynomials , from Lemma 2.4, we obtain for by (1.4),
[TABLE]
Next, note that , by Nikolskii’s inequality (2.3). Using again Lemma 2.4 (for and ), we have from (1.2)
[TABLE]
Combining (3) with (3.4), and letting , we arrive at (3.1) for .
In the case , for any there exists such that . Without loss of generality we can assume that . Then similarly to (3) and (3.4) we can obtain the inequality
[TABLE]
Finally letting and in (3.5), we arrive at (3.1) for . This completes the proof of (3.1).
Further, we will prove the inequality
[TABLE]
by constructing a nontrivial function , such that
[TABLE]
Then inequalities (3.1) and (3.6) imply (1.8). In addition, is an extremal function in (1.8), that is, (1.9) is valid.
It remains to construct a nontrivial function , satisfying (3.7). We first note that
[TABLE]
This inequality follows immediately from (3.1). Let be a polynomial, satisfying the equality
[TABLE]
The existence of an extremal polynomial in (3.9) can be proved by the standard compactness argument (cf. [19]). Next, setting , we have from (3.9) that
[TABLE]
We can assume that
[TABLE]
Then it follows from (3.10), (3.11), and (3.8) that
[TABLE]
Further, for any and , the following inequalities hold true:
[TABLE]
Inequalities (3.13) and (3.14) follow from (3.12) and Lemmas 2.5 and 2.7 (b) for . Let be a subsequence of such that
[TABLE]
Inequalities (3.13) and (3.14) show that the polynomial sequence satisfies the conditions of Lemma 2.2. Therefore, there exist a subsequence and a function such that
[TABLE]
uniformly on any cube . Moreover, by (3.11) and (3.16),
[TABLE]
In addition, using (1.2), (3.16), (3.10), (3.11), and (3.15), we obtain for any cube ,
[TABLE]
Next using (3) and (3.8), we see that
[TABLE]
Therefore, is a nontrivial function from , by (3.17) and (3.19). Thus for any cube , we obtain from (3.15), (3.16), and (3.17)
[TABLE]
Finally, letting in (3.20), we arrive at (3.7).
Acknowledgements. We are grateful to the anonymous referee for valuable suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] N. I. Akhiezer, Lectures on the Theory of Approximation, second ed., Nauka, Moscow, 1965 (in Russian).
- 2[2] V. Arestov, M. Deikalova, Nikol’skii inequality between the uniform norm and L q subscript 𝐿 𝑞 L_{q} -norm with ultraspherical weight of algebraic polynomials on an interval, Comput. Methods Funct. Theory 15 (2015), 689–708.
- 3[3] N. K. Bari, Generalization of inequalities of S. N. Bernstein and A. A. Markov, Izv. Akad. Nauk SSSR. Ser. Mat. 18 (1954), 159–176 (in Russian).
- 4[4] S. N. Bernstein, On the best approximation of continuous functions on the whole real axis by entire functions of given degree, V, Dokl. Akad. Nauk SSSR 54 (1946), 479–482 (in Russian).
- 5[5] S. N. Bernstein, On entire functions of finite degree of several variables, Dokl. Akad. Nauk SSSR 60 (1948), 949–952 (in Russian).
- 6[6] I. K. Daugavet, On Markov-Nikolskii type inequalities for algebraic polynomials in the multidimensional case. Dokl. Akad. Nauk SSSR 207 (1972), 521–522 (in Russian); English transl. in Soviet Math. Dokl. 13 (1972), 1548–1550.
- 7[7] I. K. Daugavet, Some inequalities for polynomials in the multidimensional case. Numerical Methods (Leningrad University) 10 (1976), 3–26 (in Russian).
- 8[8] F. Dai, D. Gorbachev, S. Tikhonov, Nikolskii constants for polynomials on the unit sphere, Constr. Approx. (2019), in press; ar Xiv:1708.09837.
