The Brouwer fixed point theorem states for the continuous case that,
Every continuous application $G: D^n \rightarrow D^n$ has a fixed point
I don't fully understand the J. Milnor proof.
The proof is done by contradiction. We assume $G$ has no fixed points.
Then $\forall x \in D^n$, $||x - G(x)|| > 0$. We know that $D^n \subset R^n$. Then $D^n$ is compact means that $D^n$ is closed and bounded.
Therefore, the application that compute the distance between $x$ and $G(x)$, $$ D^n \rightarrow [0, +\infty[, \quad x \rightarrow ||x - G(x)|| $$
reach its minimal value for $||x - G(x)|| = \delta > 0$
By the Stone-Weierstrass approximation theorem, $\exists$ a polynomial, $$ P: R^n \rightarrow R^n $$
of $n$ variables and $n$ components such that $G$ be the continuous uniform limit of a sequence of polynomial $P_k$ and then we can assume that there exist a polynomial $P$ "close enough" to $G$,
$$ \forall x \in D^n: \quad 0 < ||P(x) - G(x)|| < \delta / 2 $$
We know by the reverse triangular inequality, $$ \delta / 2 > ||P(x) - G(x)|| \geq \Bigl| ||P(x)|| - ||G(x)|| \Bigr| \geq ||P(x)|| - 1 $$
Then, $$ ||P(x)|| \leq \delta / 2 + 1 $$
Let $\hat{P}(x) \equiv \frac{P(x)}{||P(x)||} \geq \frac{P(x)}{\delta / 2 + 1}$ wich is smooth.
We then compute that,
$$ ||\hat{P}(x) - G(x)|| \geq \left\Vert \frac{P(x)}{\delta / 2 + 1} - G(x) \right\Vert $$
I should conclude that this last expression is $< \delta$ and conclude that $\hat{P}$ has no fixed points which contradict the Brouwer fixed point theorem for the smooth case. I don't know how to do that. How can I finish this proof ?