Can't there be more than one fixed points in a contraction? or none? I was going through the contraction mapping theorem in my book where it says, that if $\phi: G\to G$ is a contraction, then $\phi$ has a unique fixed point $\alpha$ on $G$.
Sequence {$x_n$}, $x_{n+1} = \phi(x_n) $ for $n=0,1,2...$ converges to $\alpha$ with 
$$|x_n - \alpha |\leq\frac{\lambda^n }{1- \lambda} |x_1 - x_0|  $$ for n=1,2,3,4....
Can a contraction have only a unique fixed point? Cannot there be multiple fixed points? Like this?

Or cannot it have any fixed points at all?

 A: Yes, a contraction has a unique fixed point.  Proof:  Let $d(\cdot,\cdot)$ be our distance function (which is absolute value on the real numbers, but works in more general settings).
Assume $\phi$ is a contraction and $a,b$ are both fixed points.  Let $0<k<1$ be our contraction constant. Then $d(g(a),g(b))<k\cdot d(a,b)$,  since it's a contraction,  but $g(a)=a,g(b)=b$,  so $d(g(a),g(b))=d(a,b)$,  hence $d(a,b)<k\cdot d(a,b)$, which is only possible if $d(a,b)=0$,  hence $a=b$.
A: If you have two fixed points $a,b$, you have $\phi(a)=a, \phi(b)=b$, so $|\phi(a)-\phi(b)|=|a-b|$, violating the requirement of a contraction that $|\phi(a)-\phi(b)| \lt |a-b|$
A: If $a'$ and $a$ are fixed points, then $d(f(a'),f(a))=d(a',a)<\lambda d(a',a)$ with $0<\lambda <1$, which implies that $d(a,a')=0$ and hence $a=a'$.
A: A contraction mapping can never have more than one fixed point: if $a,b$ are both fixed points, then $d(a,b)=d(f(a),f(b))\leq \lambda d(a,b)$. This is only possible if $d(a,b)=0$.
On the other hand, by Banach fixed-point theorem, any contraction mapping of a complete metric space into itself has a fixed point. The proof is fairly straightforward: for any $x$, successive applications of the contraction to $x$ yield a Cauchy sequence, which converges by completeness, and by continuity the limit must be a fixed point.
The hypothesis of completeness is necessary, for example consider the map $x\mapsto x/2$ on $(0,1)$ with standard metric. It is a contraction mapping without any fixed points. Of course, there is a fixed point in the completion, namely $0$.
A: You seem to be a bit confused about how to think of a contraction as a line on a graph.  Let's assume that we are looking for a contraction on $[0,1]$, though we could use any complete subset of the reals (or even the real line itself.
Intuitively, we have:


*

*The line $y=x$ plotted on $[0,1]$ (so $x,y\in[0,1]$).  


Then a curve corresponding to a contraction is one such that:


*

*The curve corresponds to a function $y=f(x)$ for $0\le x\le1$.  

*The curve's $x$ and $y$ values never leave the square $[0,1]\times[0,1]$ - in other words, we always have $0\le x\le1,0\le y\le1$.  

*The slope of the curve is bounded above by some fixed constant $\lambda<1$.


Then the curve has a unique intersection with $y=x$; i.e., there is a unique point such that $x=f(x)$.  For example:

Of course, we don't require the curve to be differentiable in general, so it might not always make sense to talk about the 'slope' of the curve, but that's what you should have in mind.  
Your curves don't count as contraction mappings - the first one has slope greater than $1$ at some points, and the second leaves the square given by $0\le x\le1,0\le y\le1$, which is not allowed  
