Markov's inequality on Koornwinder's domain in $L^p$ norms
Tomasz Beberok

TL;DR
This paper establishes the optimal exponent in Markov's inequality for a specific domain in the plane within $L^p$ norms, advancing understanding of polynomial inequalities on complex domains.
Contribution
It determines the exact exponent value (4) for Markov's inequality on Koornwinder's domain in $L^p$ norms, which was previously unknown.
Findings
Optimal exponent in Markov's inequality is 4.
The result applies to the domain defined by $ ext{Omega}$ in the plane.
Provides a precise mathematical characterization of polynomial bounds.
Abstract
Let . We prove that the optimal exponent in Markov's inequality on in norms is 4.
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.
Taxonomy
TopicsAnalytic and geometric function theory · Spectral Theory in Mathematical Physics · Mathematical functions and polynomials
-norm estimate for the Bergman projection on Hartogs triangle
Tomasz Beberok
Faculty of Mathematics and Computer Science, Jagiellonian University,
Lojasiewicza 6, 30-048 Krakow, Poland
**Markov’s inequality on Koornwinder’s domain in norms **
Tomasz Beberok
Abstract. Let . We prove that the optimal exponent in Markov’s inequality on in norms is 4.
Keywords: Markov inequality; norms; Markov exponent AMS Subject Classifications: primary 41A17, secondary 41A44
1 Introduction
Throughout this paper (, respectively) denotes the set of algebraic polynomials of variables with real coefficients (with total degree at most ). We begin with the definition of multivariate Markov’s inequality.
Definition 1.1
Let be a compact set. We say that admit Markov’s inequality if there exist constants such that for every polynomial and
[TABLE]
where is the supremum norm on .
A compact set with this property is called a Markov set. The inequality (1) is a generalization of the classical inequality proved by A. A. Markov in 1889, which gives such estimate on . The theory of Markov inequality and it’s generalizations is still the active and fruitful area of approximation theory (see, for instance, [5, 7, 17]). For a given compact set , an important problem is to determine the minimal constant in (1). This can be used to minimize the loss of regularity in problems concerning the linear extension of classes of functions with restricted growth of derivatives (see [24, 25]). Such an is so-called Markov’s exponent of (see [4] for more detail on this matter). In the case of supremum norm various information about Markov’s exponent is known (see, e.g., [8, 11, 21, 26, 27]). The Markov type inequalities were also studied in norms (see [1, 6, 12, 13, 14, 15]). In this case the question of Markov’s exponent problem is much more complex. In particular, to the best of our knowledge, there is no example of a compact set in with cusps for which Markov’s exponent (with respect to the Lebesgue measure) is known. The attempts to solve this problem led, among others, to a so-called Milówka–Ozorka identity (see [3, 22, 23] for discussion). The aim of this note is to give such an example. More precisely, we show that, in the notation above, Markov’s exponent of in norms is 4. Here which is depicted in the Figure 1. Since is the region for Koornwinder orthogonal polynomials (first type), see [18, 19], we call this set Koornwinder’s domain.
2 Some weighted polynomial inequalities on simplex
The following lemma will be particularly useful in the proof of our main result.
Lemma 2.1
Let , and . Then there exists a positive constant such that, for every , we have
[TABLE]
**Proof. ** We start with . Since is a convex body in , the result of Wilhelmsen [30] gives
[TABLE]
where is the width of the convex body (the minimal distance between parallel supporting hyperplanes). Therefore by Lemma 3 from [13], there is a constant such that, for all ,
[TABLE]
Thus we conclude that (2) holds when . Now, for each , it is clear that
[TABLE]
where
[TABLE]
We shall show that there is a constant such that, for all ,
[TABLE]
Since is a bounded convex set and is bounded away from zero on , we have (see [9, 12, 13, 20])
[TABLE]
Now consider the case . The integral is then
[TABLE]
We perform the change of variables , . The integral becomes
[TABLE]
Define . Then
[TABLE]
Hence, (using Goetgheluck’s result–see [10])
[TABLE]
Therefore
[TABLE]
On the other hand,
[TABLE]
We have, arguing as before, that there exists constants such that for every polynomial
[TABLE]
Therefore we see immediately that
[TABLE]
Thus we finally have
[TABLE]
A similar result for obtains if one considers the substitution , and polynomial . We omit the details. Thus we have shown that, if , then (4) holds. That completes the proof.
Now we shall prove the following weighted Schur-type inequality.
Lemma 2.2
(with previous notation). Let be a natural number. Then, for every and , satisfying the condition
[TABLE]
one can find a constant such that, for any and every , we have
[TABLE]
**Proof. ** The idea of the proof comes from [13]. Thus we proceed by induction on the length of . If , then
[TABLE]
Therefore
[TABLE]
Now, for , assume that (5) holds when . We shall show that (5) is still valid for such that . Here denotes the length of . Let
[TABLE]
Notice that the set contains at most elements. By Leibniz’s rule, if , then
[TABLE]
Let be a constant so that (2) holds. We set
[TABLE]
where . Then, for each , we have
[TABLE]
This yields
[TABLE]
Therefore by the preceding lemma,
[TABLE]
On the other hand, if , then there exists such that
[TABLE]
Thus we can share into at most disjoint subsets such that, for every , there exists an index for which (6) holds. Therefore, since , on each , replacing by , we conclude by induction that
[TABLE]
Since we see that
[TABLE]
with
[TABLE]
which completes the induction and the proof.
3 Main result
Our main result reads as follows:
Theorem 3.1
Let . Then there exists constant such that for every polynomial we have
[TABLE]
**Proof. ** Let us first prove the inequality (7) with respect to the second variable. Let . Then the integrals
[TABLE]
become, under a change of variables , ,
[TABLE]
where . Let us define polynomial . Then
[TABLE]
We now see, using Lemma 2.1, that
[TABLE]
Lemma 2.2 tells us that
[TABLE]
Hence
[TABLE]
That completes the proof of (7) for the derivative of with respect to . To prove the remaining part we need to consider the polynomials and . Then
[TABLE]
Hence
[TABLE]
Thus using an argument similar to the one that we carry out in detail in the previous case, one can obtain the desired estimate.
Remark 3.1
In the same fashion, we may prove that there exists a positive constant such that for every we have
[TABLE]
where and is a positive odd number.
4 Sharpness of the exponents
In fact, according to [2], it is enough to prove sharpness in the supremum norm. The discussion here is based on unpublished work of M. Baran. Let us consider following sequence of polynomials
[TABLE]
where is the th Chebyshev polynomial of the first kind. Note that the degree of a polynomial is equal . Since
[TABLE]
we may conclude that
[TABLE]
for any . On the other hand,
[TABLE]
A similar calculation shows that, for ,
[TABLE]
Let denote the Jacobi polynomials. In order to prove sharpness of (8), we consider the sequence of polynomials . Thus
[TABLE]
By the well known symmetry relation (see [29], Chap. IV)
[TABLE]
we find that
[TABLE]
Now Bernoulli’s inequality, for each positive integer and , implies that
[TABLE]
Hence, if , then
[TABLE]
We may now apply the result of Szegö (see [29], Chap. VII) to get
[TABLE]
where . If , we can combine (9) and (10) to see that
[TABLE]
That is what we wished to prove.
Acknowledgment
The author deeply thanks Mirosław Baran and Leokadia Białas-Cież who pointed out some important remarks, corrections and shared their unpublished notes.
The author was supported by the Polish National Science Centre (NCN) Opus grant no. 2017/25/B/ST1/00906.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Baran, New approach to Markov inequality in L p superscript 𝐿 𝑝 L^{p} norms, in: Approximation theory. In memory of A.K. Varma, I. Govil et al. – editors, M. Dekker, Inc., New York–Basel–Hong Kong (1998) 75–85.
- 2[2] M. Baran, A. Kowalska, Generalized Nikolskii’s property and asymptotic exponent in Markov’s inequality, ar Xiv:1706.07175 (2017).
- 3[3] M. Baran, A. Kowalska, B. Milówka and P. Ozorka, Identities for a derivation operator and their applications, Dolomites Res. Notes Approx. 8 (2015) 102–110.
- 4[4] M. Baran, W. Pleśniak, Markov’s exponent of compact sets in ℂ n superscript ℂ 𝑛 \mathbb{C}^{n} , Proc. Amer. Math. Soc. 123 (1995) 2785–2791.
- 5[5] L. Białas-Cież, J.P. Calvi, A. Kowalska, Polynomial inequalities on certain algebraic hypersurfaces, J. Math. Anal. Appl. 459 (2) (2018) 822–838.
- 6[6] P. Borwien, T. Erdélyi, Polynomials and Polynomial Inequalities, Springer, New York 1995.
- 7[7] A. Brudnyi, Bernstein Type Inequalities for Restrictions of Polynomials to Complex Submanifolds of ℂ N superscript ℂ 𝑁 \mathbb{C}^{N} , J. Approx. Theory, 225 (2018) 106–147.
- 8[8] R.A. De Vore, G.G. Lorentz, Constructive Approximation, Springer-Verlag, 1993.
