Convergence of a recursevely defined sequence x 0 </msub> = 0 , x <mro

manierato5h

manierato5h

Answered question

2022-06-21

Convergence of a recursevely defined sequence x 0 = 0, x n + 1 = 1 ( 1 / 2 ) x n 2

Answer & Explanation

Cristopher Barrera

Cristopher Barrera

Beginner2022-06-22Added 24 answers

First, we try a loose bound. Notice that x 0 = 0 , x 1 = 1 and x n [ 0 , 1 ]. Also we can say that x n = 1 1 / 2 x n 2 ( x n ( 3 1 ) ) = ( x n 1 ( 3 1 ) ) 3 1 + x n 1 2 . Therefore we have
| x n ( 3 1 ) | = | x n 1 ( 3 1 ) | | 3 1 + x n 1 2 | | x n 1 ( 3 1 ) | 3 2
So we can know that | x n 3 + 1 | ( 3 1 ) ( 3 2 ) n
Now we refine our estimation: we know that
| x n ( 3 1 ) | = | x n 1 ( 3 1 ) | | 3 1 + x n 1 2 | = | x 0 ( 3 1 ) | i = 0 n 1 | 3 1 + x i 2 | = ( 3 1 ) i = 0 n 1 | 3 1 + x i ( 3 1 ) 2 | = ( 3 1 ) i = 0 n 1 ( 3 1 ) | 1 + x i ( 3 1 ) 2 ( 3 1 ) | ( 3 1 ) n + 1 exp ( i = 0 n 1 | x i ( 3 1 ) 2 ( 3 1 ) | ) by  1 + x e x ( 3 1 ) n + 1 exp ( i = 0 n 1 ( 3 1 ) ( 3 2 ) i 2 ( 3 1 ) ) ( 3 1 ) n + 1 exp ( i = 0 ( 3 1 ) ( 3 2 ) i 2 ( 3 1 ) ) = ( 3 1 ) n + 1 exp ( 2 + 3 )
Take C = exp ( 2 + 3 ) ( 3 1 ) suffice.
Similarly, we have (notice that x n > 0 so x n ( 3 1 ) 2 ( 3 1 ) > 1 2 . For x > 1 / 2 we know that 1 + x e 2 | x |
| x n ( 3 1 ) | = | x n 1 ( 3 1 ) | | 3 1 + x n 1 2 | = ( 3 1 ) i = 0 n 1 ( 3 1 ) | 1 + x n 1 ( 3 1 ) 2 ( 3 1 ) | ( 3 1 ) n + 1 exp ( i = 0 n 1 2 | x n 1 ( 3 1 ) 2 ( 3 1 ) | ) ( 3 1 ) n + 1 exp ( 2 i = 0 n 1 ( 3 1 ) ( 3 2 ) i 2 ( 3 1 ) ) ( 3 1 ) n + 1 exp ( 2 i = 0 ( 3 1 ) ( 3 2 ) i 2 ( 3 1 ) ) = ( 3 1 ) n + 1 exp ( 4 2 3 )
Take c = ( 3 1 ) exp ( 4 2 3 ) suffice.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?