Take the 2-minute tour ×
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.

I'm working on this exercise (not homework) and I would gladly welcome some hints for how to solve it!

Exercise: Let $\{x_1,\dots,x_n\}$ be a set of linearly independent elements of a normed vector space $X$. Let $c_1,\dots,c_n \in \mathbb{C}$. Show that there exists $f\in X^\ast$ such that $f(x_i)=c_i$.

My idea:

I consider $M = span\{x_1,...,x_n\}$, which is a subspace of $X$. Any $x\in M$ can be written $x=\sum_1^n \lambda_k x_k$, for some $\lambda_1,...,\lambda_n \in \mathbb{C}$. Define $f:M \rightarrow \mathbb{C}$ by $f(x_i)=c_i$ for $i=1,...,n$. Then $$f(x) = \sum_1^n \lambda_k f(x_k) = \sum_1^n \lambda_k c_k.$$

If I can find a semi-norm $p:X \rightarrow \mathbb{R}$ such that $|f(x)| \leq p(x)$ for any $x \in M$, then by Hahn-Banach Theorem we would be done.

Thanks in advance!

share|improve this question
1  
$f$ is continuous on $M$, so $f$ is bounded. Does boundedness ring a bell for a good candidate of $p$? –  user27126 Dec 17 '12 at 10:53
    
@Sanchez what boundedness are you referring for? –  juniven Dec 17 '12 at 10:58
    
@jun, $f$ is bounded on $M$. –  user27126 Dec 17 '12 at 11:01
    
Sanchez: That makes sense! Since $|f(x)| < \infty$ there must exist a constant $C$ such that $|f(x)|< C\|x\| =: p(x)$ where $\|\cdot \|$ is the norm on $X$. –  DoubleTrouble Dec 17 '12 at 11:12
    
@DoubleTrouble, there you go :) It may be a good idea for you to write it up as an answer too. –  user27126 Dec 17 '12 at 11:17

2 Answers 2

up vote 4 down vote accepted

You still need a twist in your argument. You can define a norm $p$ on $M$ by $$ p(\sum_{k=1}^n\lambda_kx_k)=\sum_{k=1}^n|\lambda_k|. $$ Now, as $M$ is finite-dimensional, all norms on it are equivalent. This in particular tells us that there exists a constant $c$ such that $p(x)\leq c\|x\|$ for all $x\in M$ (since $\|\cdot\|$ is another norm on $M$). So you have $$ |f(x)|\leq\,c\,\max\{|c_1|,\ldots,|c_n|\}\,\|x\|,\ \ x\in M, $$ and now you can apply Hahn-Banach.

Or a slightly more direct approach would be to notice that since $M$ is finite dimensional, every functional is continuous, and thus $f$ is necessarily bounded in $M$.

share|improve this answer
    
I was actually thinking along that path (all norm are equivalent on M) at first, but was confused by something. However, you made it very clear. Thanks! Your second point fits my argument better, and is the missing puzzle bit! Thank you. –  DoubleTrouble Dec 17 '12 at 17:44

With some guidance from Sanchez, I managed to figure it out! We have

$$|f(x)| = |\sum_1^n \lambda_k c_k | < \infty,$$

Hence, for any $x \in M$ we have $|f(x)| < \infty$. Since $f$ is bounded there exists a constant $C$ such that $|f(x)| \leq C\|x\|$ for all $x \in M$, where $\| \cdot \|$ is the norm on $X$. If we define $p(x) = C\|x \|$, then it will clearly be a semi-norm on $X$ and we can use the Hahn-Banach Theorem to get the desired result!

share|improve this answer
    
A problem I mentioned still exists, namely that when you say $|f(x)| < \infty$, it's not clear what $x$ you are talking about. It's also unclear why $|f(x)| \leq C \| x \|$ follows. So, the latter follows from the continuity of $f$ on $M$, which is important here. –  user27126 Dec 17 '12 at 11:41
    
Okay, I was thinking that $|f(x)|< \infty$ for every $x\in M$ implied that there exists a constant $C$ s.t. $|f(x)| \leq C\|x \|$ for every $x\in M$. But I think I now understand why that is incorrect, e.g. you could have a sequence $\{y_n \}\subset M$ with $|f(y_n)| = n$. But then I don't understand how I should argue to see that $f$ is bounded/continuous. –  DoubleTrouble Dec 17 '12 at 12:29
    
I get it now, from Martin answer above! :) –  DoubleTrouble Dec 17 '12 at 17:44

Your Answer

 
discard

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.