[See Steps] Let g : be a function such that the following holds: There is a constant 0 ≤ L ≤ 1 such that | g (x) - g (y) | ≤ L |x - y| for all x, y . The
Question:
Let g : be a function such that the following holds:
There is a constant 0 ≤ L ≤ 1 such that
| g (x) – g (y) | ≤ L |x – y| for all x, y .
The aim of this problem is to prove that there is a unique x* with the property x* = g (x*) (such an x* is called a fixed point of g). To do this, we will follow the following scheme:
First choose an arbitrary, but fixed, x 0 . Then define inductively
x n+1 = g (x n ) for every integer n ≥ 0.
-
Prove that for every n ≥ 1, we have
|x n+1 - x n | ≤ L n |x 1 - x 0 | - Conclude from the inequality (0.1) that the sequence {x n } is a Cauchy sequence
-
Define now
x* =
Note that the limit exists because {x n } is Cauchy. Prove that x* = g (x*)
(Hint: Recall the definition of the sequence x n ) - Prove that x* is the only real number with the property t = g(t)
(Hint: Assume that there are x 1 , x 2 with x 1 = g (x 1 ) and x 2 = g (x 2 ) and use the fact that 0 ≤ L ≤ 1 to show that x 1 = x 2)
Deliverable: Word Document 