Converse to Runge's approximation theorem

I'm trying to prove the following fact

If $K$ is a compact set whose complement is not connected, then there exists a function $f$ holomorphic in a neighborhood of $K$ which cannot be approximated uniformly by polynomials in $K$.

This is an exercise from Stein & Shakarchi's complex analysis, and the book gives the following hint

Pick a point $z_0$ in a bounded component of $K^{c}$, and let $f(z)=\displaystyle\frac{1}{(z-z_0)}$. If $f$ can be approximated uniformly by polynomials on $K$, show that there exists a polinomial $p$ such that $\left |{(z-z_0)p(z)-1}\right |<1$. Use the maximum modulus principle to show that this inequality continues to hold for all $z$ of $K^{c}$ that contains $z_0$.

I don't know how to begin the problem, any hint will be appreciated, please don't give answers.

Thanks

-

1 Answer

You can begin by considering the case where $K=\{z\in \Bbb C:|z|=1\}$ and $z_0=0$, which is simpler but uses the same ideas. These ideas are described here.

-

ok, i hadn't seen it right away because i hadn't seen that inmediate consequence to the maximum modulus principle, you need only to check that if $\Omega$ is the bounded component containing $z_0$, then $\bar{\Omega}-\Omega\subseteq{K}$. Thanks!!! – Camilo Arosemena Oct 14 '12 at 16:26
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 19, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.928852379322052, "perplexity_flag": "head"}