Polynomial Convexity: The Three Spheres Problem
Eva Kallin
Additional contact information
Eva Kallin: Mass. Inst. of Techn., Department of Mathematics
A chapter in Proceedings of the Conference on Complex Analysis, 1965, pp 301-304 from Springer
Abstract:
Abstract A compact subset Y of C n is called polynomially convex if for each point x in C n ~ Y there is a polynomial p such that $$ \left| {p(x)} \right| > \sup \,\left\{ {\left| {p(y)} \right|:y \in Y} \right\} $$ we say that such a polynomial p separates x from Y. A set Y is convex in the ordinary sense just in case each point of the complement can be separated from Y by a polynomial of degree one, so each convex set is polynomially convex. Finite sets are also polynomially convex, so polynomially convex sets need not be connected. Any compact set which lies entirely in the real subspace of points having all real coordinates is polynomially convex because of the Weierstrass approximation theorem. Polynomial convexity, unlike ordinary convexity, is not preserved under real linear transformations or even under general complex linear mappings, though of course it is preserved by complex linear isomorphisms. There is no nice internal description of polynomially convex sets analogous to the condition that a set is convex if and only if it contains the closed line segment joining each pair of its points. Thus although many sets are known to be polynomially convex it can be rather difficult to decide about some fairly simple sets.
Keywords: Maximal Ideal Space; Polynomially Convex; Sphere Problem; Polynomial Hull; Closed Line Segment (search for similar items in EconPapers)
Date: 1965
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-48016-4_26
Ordering information: This item can be ordered from
http://www.springer.com/9783642480164
DOI: 10.1007/978-3-642-48016-4_26
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().