Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Question: Define $L(f)=\sup\left\{\frac{d_F(f(x),f(y))}{d_E(x,y)}:x,y\in E\right\}$ to be the Lipschitz seminorm. Show that $\forall f,g$ Lipschitz, and $\forall \lambda \in \mathbb{R}$ $L(f+\lambda g)\leq L(f)+|\lambda|L(g)$.

My Work: The only ting I can see is that since both $L(f)$ and $L(g)$ are going to be bounded above, namely by $K_1$ and $K_2$ respectively, then you can use the fact that $\sup(A+B)=\sup A +\sup B$ and so I find it to be an equality. Is this wrong? I believe it is correct but any comments would be great. Just a friendly reminder that this is homework.

share|cite|improve this question

We don't have necessarily an equality, for example if $g=f$ and $\lambda=-1$. But we have, assuming $d_F$ comes from a norm, $$\small d(f(x)+\lambda g(x),f(y)+\lambda g(y))=\lVert f(x)-f(y)+\lambda(g(x)-g(y))\rVert\leq L(f)d(x,y)+|\lambda| L(g)d(x,y).$$

share|cite|improve this answer
    
Ah Yes I see what you mean. I was just discussing this with my professor. I do not have an equality I do however have an inequality which is actually what I needed to show. Thank you so much!! – Mathstudent Oct 24 '12 at 20:07

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.