3
$\begingroup$

Let $d\in\mathbb N$ and $ P_d := \left\{p : K \to \mathbb{R} :\quad p(x) = \sum\limits_{i=1}^d p_i x^i\quad\text{ where }\quad \{p_i\}_{i=1}^d \subset \mathbb{R}\right\}, $ the set of all polynomials of degree at most $d$, where $K$ is a compact set. We have to show that $P_d$ isn't dense in the space of all continuous functions $C(K,\mathbb{R})$.

Our teacher gave us a hint: Consider a continuous function $f$ which has $d + 1$ zeros and show that all polynomials which approximate $f$ at its zeros with accuracy $\varepsilon > 0$ are uniformly bounded (Lagrange interpolation). Use this observation to show that there are continuous functions $f$ which cannot be approximated by $P_d$ with given accuracy $\varepsilon > 0$.

I can't figure out how to use this hint to solve the problem. Please help me out. Thanks.

  • 0
    http://en.wikipedia.org/wiki/Uniformly_bounded2012-07-03

2 Answers 2

1

Assume $\{p_n\}_n$ is a bounded sequence in $P_d$. We can write $ p_n(x)=a_n (x-x_{1,n})(x-x_{1,n})\cdots (x-x_{d,n}) $ for suitable sequences $\{a_n\}$, $\{x_{i,n}\}_n$, $i=1,\ldots ,d$. Since $x \in K$, a compact set, up to subsequences we can assume $ a_n \to a_\infty, \quad x_{i,n} \to x_{i,\infty} $ as $n \to +\infty$. But then $\{p_n\}$ converges uniformly on $K$ to the polynomial $ p_\infty (x) = a_\infty (x-x_{1,\infty})\cdots (x-x_{d,\infty}). $ In particular, $\deg p_\infty \leq d$.

Remark. This is a rephrasing of Davide Giraudo's comment.

  • 0
    Essentially, this argument shows that you can only approximate polynomials of degree at most $d$. Clearly, in $C(K)$ there are elements that are not polynomials of degree $d$ (for instance there are polynomials of degree $d+1$). Just one remark: $P_d$ is closed under uniform convergence, whatever $K$ may be. *Your* problem becomes false if $K$ is a set of $d$ points.2012-07-03
2

In an infinite dimensional normed space $X$, a finite dimensional subspace $F$ cannot be dense. Indeed, we can show that $F$ is necessarily closed, for example by induction on the dimension. Furthermore, $F$ is necessarily strict.

Apply this to $X:=C(K,\Bbb R)$ and $F:=P_d$, provided that $K$ is infinite, or at least contains strictly more than $d$ points.