Polynomial convexity
In mathematics, especially in several complex variables, polynomial convexity is a notion of convexity for compact subsets of complex Euclidean space defined using complex polynomials.
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, especially in several complex variables, polynomial convexity is a notion of convexity for compact subsets of complex Euclidean space defined using complex polynomials. It is analogous to ordinary convexity, but instead of separating points by real affine functions or hyperplanes, it uses inequalities involving holomorphic polynomials. = \{z\in\mathbb{C}^n : |p(z)|\leq \sup_{w\in K}|p(w)| \text{ for every complex polynomial } p\}.
The set K is called polynomially convex if \widehat K=K. Equivalently, K is polynomially convex if every point outside K can be separated from K by a polynomial: for every z\notin K , there is a polynomial p such that |p(z)|>\sup_{w\in K}|p(w)|. K=\{(z_1,\ldots,z_n): |z_1|=\cdots=|z_n|=1\}, then its polynomially convex hull is the closed unit polydisc \widehat K=\{(z_1,\ldots,z_n): |z_j|\leq 1,\ j=1,\ldots,n\}.
In one complex variable, polynomial convexity has a particularly simple topological description. If K\subset\mathbb{C} is compact, then \widehat K is obtained from K by filling in the bounded connected components of \mathbb{C}\setminus K . Thus a compact subset of the complex plane is polynomially convex if and only if its complement has no bounded components.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1365988228 under CC BY-SA 4.0; modifications have been made.