|
|
|
|
polynomially convex hull
|
(Definition)
|
|
Definition 1 Let $K \subset {\mathbb{C}}$ be a compact subset of the complex plane, then the polynomially convex hull of $K$ , denoted $\hat{K}$ , is defined as \begin{equation*} \hat{K} := \{ z \in {\mathbb{C}} : \lvert p(z) \rvert \leq \max_{\zeta \in K} \lvert p(\zeta) \rvert \text{ for all polynomials $p$ } \}. \end{equation*}A compact set $K$ is said to be polynomially convex if $K = \hat{K}$
Obviously $K \subset \hat{K}$ . The intuitive idea behind this definition is that the polynomially convex hull of $K$ fills in any ``holes'' that may exist in $K$ . The following proposition makes that precise.
One of the reasons for this definition is the following result.
Proposition 2 Let $f$ be a function analytic in an open neighbourhood $N$ of a compact set $K \subset {\mathbb{C}}$ , and suppose that $f$ can be approximated by polynomials uniformly on compact subsets of $N$ . Then $f$ can be extended analytically to a neighbourhood of $\hat{K}$
.
For example if we take $K = \{ z \in {\mathbb{C}} : \lvert z \rvert = 1 \}$ (the unit circle) then $\hat{K} = \{ z \in {\mathbb{C}} : \lvert z \rvert \leq 1 \}$ (the closed unit disc). The fact that the inside of the disc belongs to $\hat{K}$ follows from the maximum modulus principle as polynomials are analytic functions. The fact that $\hat{K}$ does not contain anything outside the closed unit disc follows by looking at the polynomial $p(z) = z$ which has always greater modulus outside of the unit disc then anywhere on the unit circle. So if we have a function defined on a neighbourhood of the unit circle and which we can approximate uniformly on compact subsets of this neighbourhood by polynomials, then we can extend this function analytically to the whole unit disc. So this for example implies that $f(z) := \frac{1}{z}$ cannot be approximated uniformly on compact subsets by polynomials on a neighbourhood of the unit circle.
The reason why we call $\hat{K}$ a ``hull'' of some sort is that the conventional convex hull of $K \subset {\mathbb{R}}^n$ can be defined as the set of points $x$ such that for all linear functions $f \colon {\mathbb{R}}^n\to \mathbb{R}$ we have $\lvert f(x) \rvert \leq \sup_{y\in K} \lvert f(y) \rvert$ . This coincides with conventional definition because if $x$ is not in the conventional convex hull, then there is a linear functional that separates $x$ from the hull (by Hahn-Banach theorem in general, or more elementarily in ${\mathbb{R}}^n$ by Farkas's lemma), and conversely if $x$ is in the convex hull of $K$ then such linear function does not exist for the same reason. So, intuitively the conventional convex hull is set of point that are inseparable from from $K$ by linear functions. Polynomially convex hull is the same thing, but with polynomials. Of course similar definitions can be made with respect to other classes of functions. For example, hulls with respect to plurisubharmonic functions are very useful in multivariate complex analysis.
- 1
- John B. Conway. Functions of One Complex Variable I. Springer-Verlag, New York, New York, 1978.
|
"polynomially convex hull" is owned by jirka.
|
|
(view preamble | get metadata)
Cross-references: complex analysis, plurisubharmonic functions, classes, definitions, similar, conversely, Farkas' lemma, Hahn-Banach theorem, linear functional, points, convex hull, implies, contain, modulus, disc, unit disc, closed, unit circle, polynomials, neighbourhood, open, analytic, function, simply connected, interior, components, proposition, compact set, complex plane, compact subset
This is version 3 of polynomially convex hull, born on 2004-05-05, modified 2005-03-07.
Object id is 5833, canonical name is PolynomiallyConvexHull.
Accessed 3931 times total.
Classification:
| AMS MSC: | 52A01 (Convex and discrete geometry :: General convexity :: Axiomatic and generalized convexity) | | | 30C10 (Functions of a complex variable :: Geometric function theory :: Polynomials) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
