Let f:R-->R be differentiable for all x. Suppose that f'(x)>1 for all x. Show that the graph of y=f(x) can intersect the graph of y=x no more than once.
I have no idea where to even begin... any ideas?
Oh I see now. So if we suppose towards contradiction that f has two fixed points: x_1 and x_2 with x_1< x_2, then we would have f(x_1)= x_1 and f(x_2)= x_2. Then, by the Mean Value Theorem, we would have for some c in the interval (x_1, x_2):
f'(c) = f(x_2) - f(x_1) / x_2 - x_1 = (x_2 - x_1)/(x_2 - x_1) = 0
which contradicts the assumption that f'(x)>1 for all x...?
In more general terms, given , you can have at most one fixed point. But if you also have , then you know for sure that there exists a fixed points, and hence it is unique. To show this, take the sequence defined by and show it is convergent to the unique fixed points.