Polynomial approximation avoiding values in countable sets
Johan Andersson, Linnea Rousu

TL;DR
This paper extends classical polynomial approximation theorems to ensure the approximating polynomials avoid specified countable sets of values, broadening the scope of uniform approximation on complex domains.
Contribution
It generalizes Lavrenté's and Mergelyan's theorems to include polynomial approximations that avoid given countable sets of values on complex domains.
Findings
Polynomial approximations can avoid countable sets on compact sets with connected complements.
Extension of Lavrenté's theorem to avoid countable sets.
Extension of Mergelyan's theorem for finite unions of Jordan domains.
Abstract
We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial without zeros on the set K, so that the polynomial can avoid values from any given countable set. We also prove a corresponding version of Mergelyan's theorem when the interior of K is a finite union of Jordan domains, pairwise separated by a positive distance.
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
TopicsHolomorphic and Operator Theory · Advanced Banach Space Theory · Analytic and geometric function theory
Polynomial approximation avoiding values in countable sets
Johan Andersson Email:[email protected] Address: Department of Mathematics, School of Science and Technology, Örebro University, Örebro, SE-701 82 Sweden.
Linnea Rousu Email:[email protected]
Abstract
We generalize a version of Lavrentév’s theorem which says that a function that is continuous on a compact set with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial without zeros on the set , so that the polynomial can avoid values from any given countable set. We also prove a corresponding version of Mergelyan’s theorem when the interior of is a finite union of Jordan domains, pairwise separated by a positive distance.
1 Introduction
Motivated by the Voronin universality theorem for the Riemann zeta-function, the first author [1], [2] generalized the Lavrentév theorem [8] and the Mergelyan theorem [9] so that in certain cases the approximating polynomial may be assumed to be zero-free on the compact set . In particular the following conjecture111Gauthier (unpublished) also considered this problem in the seventies, see [2, Remark 1]. [2, Conjecture 2] was stated
Conjecture 1**.**
Assume that is a compact set with connected complement and that is a continuous function on which is analytic in the interior of , such that is zero-free on . Then given any there exists a polynomial which is zero-free on such that
[TABLE]
While the conjecture in general seems quite difficult, it was proved in [1] that the conjecture is true if the interior of is empty, and more generally in [2, Theorem 6] that the conjecture is true if the interior of is a finite union of Jordan domains, pairwise separated by a positive distance. The conjecture has since then been proved in increasing generality. Gauthier-Knese [6] proved that the conjecture is true for “chains of Jordan domains”. Khruschev [7] proved the conjecture to be true if is locally connected. Andersson-Gauthier [3] gave an independent proof222Actually a somewhat more general statement was proved, see e.g. [3, Theorem 4]. of the “trees of Jordan domains” case. Furthermore it was proved by Danielyan [5, Theorem 1] that the conjecture is true for some with any given zero-set . However he did not prove it for all functions with such a zero-set and the conjecture is thus still open for more complicated sets like the Cornucopia set333Example suggested by A. G. O-Farrell. See discussion in [2, Section 4]..
2 Main results
This paper deals with the generalization444Parts of the results in this paper are included in the undergraduate thesis [11] written by the second author and supervised by the first author of the present paper. of the zero-free approximation problem to approximation by polynomials which avoids any countable set on the set . Our main result is the following theorem.
Theorem 1**.**
Let be any countable set and let be a compact set with connected complement, such that its interior is the union of a finite number of Jordan domains, pairwise separated by a positive distance. Let be a continuous function on which is analytic in its interior such that if . Then given any there exists some polynomial such that if and such that
[TABLE]
In the proof of Theorem 1 (see section 4), we use similar arguments as in the proof of the corresponding result for the zero-free case [2, Theorem 6]. In particular we use rescaling of Riemann mappings and the Carathéodory theorem. However, to treat the parts of the set that are not in we need some more complicated argument, see Lemma 2 in section 3. With Conjecture 1 in mind we may ask if the corresponding result holds in the finite or countable case.
Question 1**.**
Does Conjecture 1 hold
if we replace “zero-free” with “avoid any set with two elements”? 2. 2.
if we replace “zero-free” with “avoid any finite set ”? 3. 3.
if we replace “zero-free” with “avoid any countable set ”?
It is clear that the truth of Conjecture 1 does not change if we replace “zero-free” with ”avoid any set with one element”, since we may always consider a shifted function (see proof of Lemma 1 in section 3). While we have managed to answer Question 1 in the affirmative in the case when the interior of is the union of finitely many separated Jordan domains, by using the proof method of [2], it is not clear to us how the methods of Gauthier-Knese [6], Andersson-Gauthier [3] or Khruschev [7] would generalize to this problem. In fact we do not even know how to treat the case when is a set with two elements and is the union of two closed discs that intersects at one point. We suggest this as an open problem.
Problem 1**.**
Let . Prove or give a counterexample: For any and continuous function on that is analytic on such that if there exists some polynomial such that
[TABLE]
and such that if .
In the same way that the Lavrentév theorem [8] is a direct consequence of the Mergelyan theorem [9], for compact sets with empty interior, Theorem 1 gives us the following version555See [11, Sats 3.2.2]. This result also follows easily by using Lavrentév’s theorem to approximate by a polynomial and then using Lemma 2 to approximate the polynomial by the polynomial . of Lavrentév’s theorem which generalizes the zero-free version [1, Theorem 1.1].
Theorem 2**.**
Let be any countable set, let be a compact set with connected complement and without interior points, and let be a continuous function on . Then given any there exists some polynomial such that if and such that
[TABLE]
This result is stronger when is a larger set. Examples of large sets (in terms of area measure) that satisfies the conditions of the theorem are , and , where is a fat Cantor set. In fact we can choose to have one-dimensional measure arbitrarily close to so that for have area measure arbitrarily close to . The result is also stronger if is a larger set, such as a dense set in . An example of a dense set in is when is the set of rational complex numbers. Even stronger, if we use as the set of (complex) algebraic numbers in Theorem 2 we obtain the following result on approximation by a polynomial that only takes transcendental values on the set .
Corollary 1**.**
Let be a compact set with connected complement and without interior points, and let be a continuous function on . Then given any there exists some polynomial such that
[TABLE]
and such that is transcendental if .
While our results hold for a countable set it would be interesting to know whether they hold for some uncountable set . We do not consider this problem here, but the following result gives some restriction on how we can choose the sets and if we want our approximation results to hold.
Proposition 1**.**
If we remove the condition that is countable in Theorem 2 then the conclusion of Theorem 2 is false if has some non trivial path-connected component and has some non trivial connected component.
Proof.
We give a proof by contradiction, by assuming that the conclusion of Theorem 2 holds for this choice of and . Since has some non trivial path-connected component and by using the fact that a path-connected set in the complex plane is arc-connected666http://mathworld.wolfram.com/Arcwise-Connected.html we can find two points such that , and some simple curve (Jordan arc) with parametrization such that , and . Now let be such that and such that and are contained in the same connected component of . Let us consider the smooth curve with parametrization that is given in the figure below,
a_{1}$$a_{2}Intersection pointf(B)=\Gamma$$p(B)$$\varepsilon-neighborhood of
and let the continuous function be defined by if , such that and by the Tietze extension theorem [12, Theorem 20.4] as any continuous extension to . Let us now use our assumption that the conclusion of Theorem 2 holds and construct a polynomial such that if and such that
[TABLE]
holds. If is sufficiently small, then contains a Jordan curve surrounding but not . This is a consequence of the fact that the curve follows the -neighborhood of (grey in figure) and by the crossed arcs lemma777http://www.cut-the-knot.org/blue/JCT/JCT_Part4.shtml must intersect in the marked square with side (see figure) centered at the intersection point of the curve . It follows by the Jordan curve theorem that is not connected and that and do not lie in the same connected component of . Since this contradicts our assumption that and lie in the same connected component of . ∎
3 Some lemmas on polynomials approximating polynomials
In order to prove Theorem 1 we need some useful lemmas on polynomial approximation. In fact we only need Lemma 2, but in order to prove Lemma 2 we need the following Lemma.
Lemma 1**.**
Let be a polynomial and let be a compact subset of . Then given any and any complex number there exists some polynomial of the same degree as such that
[TABLE]
and such that for .
The following proof is a shifted variant of the proof of [1, Theorem 1.1].
Proof.
Let be such that
[TABLE]
where denotes the zeros of . Since has no interior points there exist sequences such that . Let
[TABLE]
Since we obtain for Since the coefficients converge it is clear that converges uniformly to on . Hence, there is some such that
[TABLE]
Let Since for it follows that if , and since it follows from (3) that
[TABLE]
∎
Lemma 2**.**
Let be a polynomial and let be a compact subset of . Then given any and any countable set there exists some polynomial such that
[TABLE]
and such that for .
Proof.
Let and let be the degree of . Let and . For there is, according to Lemma 1, some polynomial of degree such that
[TABLE]
and such that
[TABLE]
where for is definied recursively so that
[TABLE]
By the inequalities (5), (6), and the triangle inequality we find for that
[TABLE]
By (6) and (7) it follows that is a Cauchy-sequence in the vector space of polynomials of degree at most equipped with the sup-norm on . Since this space is complete then
[TABLE]
is a polynomial of degree at most888It is clear by the construction that the polynomial will in fact have degree exactly . . The inequality (7) yields
[TABLE]
For the polynomial definied by (8), the inequalites (4), (6), (9) and the triangle inequality gives us
[TABLE]
for all The conclusion of our lemma follows by (9) and (10), by recalling that and . ∎
4 Proof of Theorem 1
Since we also have Thus we have that if . Now let where are Jordan domains such that if . Let denote the open unit disc. By the Carathéodory theorem999Also called the Carathéodory-Osgood-Taylor theorem since it was proved independently by Carathéodory [4] and Osgood-Taylor [10]. [12, Theorem 14.19], the Riemann mappings extend to homeomorphisms It is clear that
[TABLE]
Let us now define
[TABLE]
whenever for sufficiently small such that
[TABLE]
The Tietze extension theorem [12, Theorem 20.4] allows to be extended to a continuous function on such that
[TABLE]
By the construction it is clear that is continuous on , that is analytic on and that if . Thus the compact set and the closed set are disjoint and must hence be separated by a positive distance so that
[TABLE]
By Mergelyan’s theorem (see [9] or [12, Theorem 20.5]) we can choose a polynomial such that
[TABLE]
By Lemma 2 there exists some polynomial such that
[TABLE]
and such that if . By the inequalities (12), (13), (14) and the triangle inequality it follows that also if . Thus if . Finally it follows from the inequalities (11), (13), (14) and the triangle inequality that
[TABLE]
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Johan Andersson. Lavrent ′ ev’s approximation theorem with nonvanishing polynomials and universality of zeta-functions. In New directions in value-distribution theory of zeta and L 𝐿 L -functions , Ber. Math., pages 7–10. Shaker Verlag, Aachen, 2009. ar Xiv:1010.0386 [math.NT]
- 2[2] Johan Andersson. Mergelyan’s approximation theorem with nonvanishing polynomials and universality of zeta-functions. J. Approx. Theory , 167:201--210, 2013. ar Xiv:1010.0850 [math.CV] · doi ↗
- 3[3] Johan Andersson and Paul M. Gauthier. Mergelyan’s theorem with polynomials non-vanishing on unions of sets . Complex Var. Elliptic Equ. , 59(1):99--109, 2014. · doi ↗
- 4[4] Constantin Carathéodory. Über die Begrenzung einfach zusammenhängender Gebiete. Math. Ann. , 73(3):323--370, 1913.
- 5[5] Arthur A. Danielyan. On the zero-free polynomial approximation problem. J. Approx. Theory , 205:60--63, 2016. ar Xiv:1501.00247 [math.CV] · doi ↗
- 6[6] Paul M. Gauthier and Greg Knese. Zero-free polynomial approximation on a chain of Jordan domains. Ann. Sci. Math. Québec , 36(1):107--112 (2013), 2012. ar Xiv:1208.6549 [math.CV]
- 7[7] Sergey Khrushchev. Mergelyan’s theorem for zero free functions. J. Approx. Theory , 169:1--6, 2013. · doi ↗
- 8[8] Mikhail A. Lavrentév. Sur les functions d’une variable complexe représentables par de séries de polynomes. Hermann & Cie, 1936.
