Polynomial convexity

Key takeaways

Polynomial convexity belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Polynomial convexity to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Polynomial convexity from memory before moving on to harder problems.

Reference excerpt

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.

Definition Let K {\displaystyle K} be a compact subset of C n {\displaystyle \mathbb {C} ^{n}} . The polynomially convex hull of K {\displaystyle K} is the set

K ^ = { z ∈ C n : | p ( z ) | ≤ sup w ∈ K | p ( w ) | for every complex polynomial p } . {\displaystyle {\widehat {K}}=\{z\in \mathbb {C} ^{n}:|p(z)|\leq \sup _{w\in K}|p(w)|{\text{ for every complex polynomial }}p\}.}

The set K {\displaystyle K} is called polynomially convex if

K ^ = K . {\displaystyle {\widehat {K}}=K.}

Equivalently, K {\displaystyle K} is polynomially convex if every point outside K {\displaystyle K} can be separated from K {\displaystyle K} by a polynomial: for every z ∉ K {\displaystyle z\notin K} , there is a polynomial p {\displaystyle p} such that

| p ( z ) | > sup w ∈ K | p ( w ) | . {\displaystyle |p(z)|>\sup _{w\in K}|p(w)|.}

Examples Every compact polynomially convex set is equal to the intersection of all polynomial inequalities that contain it. Basic examples include closed polydiscs and many compact convex subsets of C n {\displaystyle \mathbb {C} ^{n}} . If K {\displaystyle K} is the distinguished boundary of the unit polydisc,

K = { ( z 1 , … , z n ) : | z 1 | = ⋯ = | z n | = 1 } , {\displaystyle K=\{(z_{1},\ldots ,z_{n}):|z_{1}|=\cdots =|z_{n}|=1\},}

then its polynomially convex hull is the closed unit polydisc

K ^ = { ( z 1 , … , z n ) : | z j | ≤ 1 , j = 1 , … , n } . {\displaystyle {\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 ⊂ C {\displaystyle K\subset \mathbb {C} } is compact, then K ^ {\displaystyle {\widehat {K}}} is obtained from K {\displaystyle K} by filling in the bounded connected components of C ∖ K {\displaystyle \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.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Polynomial convexity

Start with the simplest possible case. Write down what Polynomial convexity claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Polynomial convexity before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Polynomial convexity ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Polynomial convexity

In research: Polynomial convexity appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Polynomial convexity in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Polynomial convexity is common in secondary-school and first-year university syllabi. It links to neighbouring topics Approximation theory, Several complex variables, so understanding it makes those chapters shorter.
In everyday life: Look for Polynomial convexity outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Polynomial convexity in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Polynomial convexity means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Polynomial convexity out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Polynomial convexity in simple terms?

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, i…

Why does Polynomial convexity matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Polynomial convexity?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Polynomial convexity.