# Proof Explanation

http://ocw.mit.edu/courses/mathematics/18-101-analysis-ii-fall-2005/lecture-notes/lecture6.pdf

Can someone explain Lemma 2.16 to me?

What is $\mathbf{R}_\delta$? And how does step (2.18) prove the whole thing is one to one?

Guess: I am guessing (2.18)'s conclusion is somehow related to Mean Value Thrm? A wild guess with no basis

-

$R_{\delta}$ is defined in the first few lines of the pdf file. Establishing 2.81 shows $f$ is injective in $R_{\delta}$ because if $f(x)=f(y)$ then $|x-y|\leq 2 |f(x)-f(y)|=0$ so $x=y.$
Oh so if $f(x) = f(y)$. But if that were the case, why not just use the Mean Value Theorem to prove this in the first case? The formulas look nearly identical – love Feb 20 '13 at 23:59
A function is one to one if $f(x)=f(y) \implies x=y.$ In 2.81, if we suppose $f(x)=f(y)$ we can indeed conclude $x=y$ by putting our information in. But if you try that in the one you just mentioned, you only get $0 \leq |f'(p)||x-y|$ which doesn't let you conclude $x=y.$ – Ragib Zaman Feb 21 '13 at 0:10
Whether $|f'(p)|$ is zero or not, having $0\leq |f'(p)||x-y|$ doesn't let us say $x=y.$ We might have $|x-y|=1$ and the inequality will still be true. In fact, $0\leq |f'(p)| |x-y|$ is trivially true since the right hand side is non-negative because of the absolute values. I don't understand how the MVT will help here. – Ragib Zaman Feb 21 '13 at 0:18