Thus, the inequality holds when x and y are positive real numbers.
(b) We first prove that both sequences are convergent. To assist us in proving this, let us first prove that both sequences are positive. That is,
∀n∈N,xn,yn≥0.
Using induction, we first prove the base case. Since
0≤x1≤y1
then
x1,y1≥0.
Moving on to the induction step, assume that both xn and yn are positive. Then, for xn, we have
xn+1=xnyn=xnyn≥0
since each argument of the square root functions are positive. With the same assumption (both xn and yn are positive), for yn, we have
yn+1=2(xn+yn)≥0
since the numerator is obviously positive.
We can now come back to our original objective which was to prove that both sequences are convergent. To apply MCT, let's prove that xn is increasing and bounded above. The base case holds true since
The last inequality is obviously true, applying the identity in (a), since both xn and yn are positive. To help us in finding an upper bound for xn, let's prove that prove with induction that yn is decreasing. Our base case holds because
y2=2(x1+y1)≤y1⟺x1+y1≤2y1⟺x1≤y1.
For our induction step, by assuming that yn+1≤yn, we then have
Again, the last inequality is true by applying the proven identity in (a). Since we've previously proven that all yn terms are positive, we can use 0 as its lower bound. This then allows us to apply MCT on yn, assuring us of a limit this sequence. In finding an upper bound for xn, notice that (this is why it was important to prove that yn is decreasing)
∀n∈N,x1≤x2≤⋯≤xn−1≤xn≤yn≤yn−1≤⋯≤y2≤y1.
Therefore, we can use y1 as an upper bound for all terms in the sequence xn. Again, having satisfied the conditions of MCT for xn, we know that xn converges as well. Now, to prove that both sequences converge to the same limit, notice that