Question 7.11
3 months ago
For contradiction, suppose that f(x)≠xf(x)\ne xf(x)=x for all xxx. Define g(x)=xg(x)=xg(x)=x. Notice that g(0)=0<f(0)g(0)=0<f(0)g(0)=0<f(0) because f(0)≠0f(0)\ne0f(0)=0. Likewise, g(1)=1>f(1)g(1)=1>f(1)g(1)=1>f(1) because f(1)≠1f(1)\ne1f(1)=1. Hence, by Exercise 10, g(x)=x=f(x)g(x)=x=f(x)g(x)=x=f(x) for some xxx in [0,1][0,1][0,1], which is a contradiction.
Sign in to share your solution for this question.
Navigate
Q 7.11