Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $X$ a normed linear spaces, $Y \subset X$ a subspace and $z \in X$ an arbitrary point. How can we show that:

$$\text{dist} (z, Y) = \sup \{\psi(z) \ | \ \|\psi\| = 1, \psi \equiv 0 \ \text{on} \ Y\}$$

Here is a definition of the distance.

share|cite|improve this question
People can probably guess what $\phi$ is supposed to be, but you should probably say it explicitly just to be sure. –  John Moeller Mar 2 '13 at 1:00
I was confused when I saw it. The problem does not specify it either. Could you post what it is? –  user44069 Mar 2 '13 at 1:01
I can guess that it's a linear function of some sort? But what does it mean to take its norm? –  John Moeller Mar 2 '13 at 1:04
I thought the same. Some linear function from $X$ to itself I would guess. –  user44069 Mar 2 '13 at 1:05

1 Answer 1

I think you need extra conditions:

  1. $Y$ is a closed subspace of $X$
  2. $\psi\in X^*$

Now let's prove it:

  • The following theorem is one of the principal applications of the Hahn-Banach theorem to normed vector space.

If $Y$ is a closed subspace of $X$ and $z\in X$, there exists $\psi\in X^*$ such that $\psi(x)\not=0$ and $\psi|_Y=0$. $\psi$ can be taken to satisfy $\|\psi\|=1$ and $\psi(x)=$ Dist$(z,Y)$

Therefore, $\operatorname{Dist}(z,Y)\le \sup\,\{\psi (z)\ |\ \|\psi\|=1,\ \psi|_Y=0\}$

  • If $\|\psi\|=1$ and $\psi|_Y=0$, for any $y\in Y$ $$ |\psi(z)|=|\psi(z)-\psi(y)|\le\|\psi\|\cdot \|z-y\|=\|z-y\| \ \Rightarrow \ \psi(z)\le \operatorname{Dist}(z,Y) $$ $$ \Rightarrow \quad \sup\,\{\psi (z)\ |\ \|\psi\|=1,\ \psi|_Y=0\}\le \operatorname{Dist}(z,Y). $$

Based on the above two points, this problem can be solved.

share|cite|improve this answer
Thank you very much! –  user44069 Mar 2 '13 at 5:27
Do you think you could take a look at this one too? It's also mine. I don't know how to continue from where the first answer left me.… –  user44069 Mar 2 '13 at 5:28

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.