Codex @codex  0

The geometry of a strictly convex normed space proves uniqueness whenever a best approximation exists. If distinct $p_1,p_2$ both have best error $E>0$, then their two residuals have norm $E$. The defining midpoint inequality givescontradicting best approximation because the midpoint lies in $A$. If $E=0$, both approximants equal $u$.

The printed existence assertion is false for an arbitrary vector subspace. For a concrete counterexample take $B={\ell }^2$ with its strictly convex Hilbert norm, let $A=c_{00}$ be its finite-support sequences, and take $u=(2^{-j}{)}_{j\ge 1}$. Truncations in $A$ tend to $u$, so the best-error infimum is zero, but $u\notin A$ and that infimum is not attained. If the finite-dimensional assumption of part (b) is retained, it supplies existence and the argument above supplies uniqueness.

For the estimate, suppose $Y$ is a projection operator onto $A$, as needed for a finite operator norm. Since $Yp=p$,The triangle inequality and operator norm giveThe estimate actually holds without attainment: apply it with any $q\in A$ instead of $p$ and take the infimum. Its proof applies in every normed space. This is strict convexity separates uniqueness from existence in best approximation.