From this proof it is clear to me that Chebyshev polynomial $\frac{1}{2^{n-1}} T_n(x)$ is minimum $\infty$-norm in $[-1,1]$ among the monic polynomials of degree $n$.
How to prove the uniqueness (if true) of such minimizing polynomial? I found this question, but the answer is not completely related. I have no idea to start.
Let $P$ be a polynomial with degree at most $n-1$ such that $\|2^{1-n}T_n+P\|_{\infty} \leq 2^{1-n}$.
For every $0 \leq k \leq n$, define $t_k=\cos{\frac{k\pi}{n}}$. Then $t_0 > t_1 > \ldots > t_n$ and $T_n(t_k)=(-1)^k$.
Therefore, for each $0 \leq k \leq n$, $\left|2^{1-n}(-1)^k+P(t_k)\right|=|2^{1-n}+(-1)^kP(t_k)| \leq 2^{1-n}$.
As a consequence, for all $0 \leq k \leq n$, $(-1)^kP(t_k) \leq 0$.
We want to show that this implies that $P=0$.
Define, for all even $0 \leq k \leq n-2$, $m_k$ to be a local maximum of $P$ in $(t_k,t_{k+2})$ (so $P(m_k) \geq P(t_{k+1}) \geq 0$, $P’(m_k)=0$); define, for all odd $0 \leq k \leq n-2$, $m_k$ to be a local minimum of $P$ in $(t_k,t_{k+2})$ (similarly, $P(m_k) \leq P(t_{k+1}) \leq 0$).
The $m_k$ are by construction pairwise distinct, they are $n-1$ zeroes of $P’$, but $\deg{P’} \leq n-2$. So $P’=0$, so $P=0$ (else there are no sign changes).