Bourbaki

Exercise 13, § 4

Tag 02BP, permanent. Cite it as [Bourbaki, Tag 02BP].

Spectral Theories, I, p. 175

Soit n∈Nn\in \mathbf{N}.

a) A subset V of Cn\mathbf{C}^n is polynomially convex if and only if, for every x∈Cn−x\in \mathbf{C}^n- V, there exists an entire function f:Cn→Cf:\mathbf{C}^n\rightarrow \mathbf{C} such that

∣f(x)∣>|f(x)|> supy∈V∣f(y)∣_{y\in V}|f(y)|.

b) Let K⊂RnK\subset \mathbf{R}^n be a compact subset. Then K is polynomially convex in Cn\mathbf{C}^n.

c) Let V be a compact polynomially convex subset of Cn\mathbf{C}^n and f∈f\in O(V)\mathscr{O}(V). Then the graph of ff is polynomially convex in Cn+1\mathbf{C}^{n+1}. (Use the Oka–Weil theorem).

Solution

No solution has been written yet.

Cited by

Nothing.

Cites

Nothing.

Machine translation of the English, by gpt-5-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.