Are the two sequences decreasing, inferiorly bounded, and converging to 0?

  • Context: MHB 
  • Thread starter Thread starter Francolino
  • Start date Start date
  • Tags Tags
    Sequences
Click For Summary
SUMMARY

The sequences \( (a_n) \) and \( (b_n) \) defined by the recurrence relations \( a_{n+1} = \sqrt{a_n \cdot b_n} \) and \( b_{n+1} = \frac{b_0}{a_0} \sqrt{a_n \cdot b_n} \) with initial conditions \( a_0 > b_0 > 0 \) are both decreasing and inferiorly bounded. The proof involves demonstrating that \( a_{n+1} < a_n \) and \( b_n < a_n \) through induction. Ultimately, both sequences converge to 0, confirming their behavior as specified in the discussion.

PREREQUISITES
  • Understanding of sequences and convergence in real analysis
  • Familiarity with mathematical induction techniques
  • Knowledge of polar coordinates and their application in mathematical proofs
  • Basic properties of square roots and inequalities
NEXT STEPS
  • Study the principles of mathematical induction in depth
  • Explore convergence criteria for sequences in real analysis
  • Learn about the application of polar coordinates in mathematical proofs
  • Investigate properties of decreasing sequences and their bounds
USEFUL FOR

Mathematics students, educators, and researchers interested in sequence convergence, real analysis, and proof techniques will benefit from this discussion.

Francolino
Messages
14
Reaction score
0
Let be $ (a_n) $ and $ (b_n) $ two sequences that verify: $$ a_{n+1} = \sqrt{a_{n}\cdot b_{n}}, \quad b_{n+1} = \frac {b_{0}}{a_{0}}\sqrt{a_{n}\cdot b_{n}}, \quad a_{0} > b_{0} > 0 $$ Indicate if the following statements are true:

(1) Both sequences are decreasing.
(2) Both sequences are inferiorly bounded.
(3) Both sequences converge to 0.

Well, I tried to do something similar to what I was suggested to do in http://mathhelpboards.com/calculus-10/convergence-sequence-15868.html. So I took polar coordinates:

Using that: $$ \left\{\begin{matrix}
a_{n} = r_{n}\cos(\theta_{n}) \\
b_{n} = r_{n}\sin(\theta_{n})
\end{matrix}\right. $$ Then: $$ \left\{\begin{matrix}
r_{n+1}\cos(\theta_{n+1}) = \sqrt{r_{n}\cos(\theta_{n})} \\
r_{n+1}\sin(\theta_{n+1}) = \left (\frac{b_{0}}{a_{0}} \right )\sqrt{r_{n}\sin(\theta_{n})}
\end{matrix}\right. $$ Squaring both equations: $$ \left\{\begin{matrix}
r_{n+1}^2\cos^2(\theta_{n+1}) = r_{n}\cos(\theta_{n}) \\
r_{n+1}^2\sin^2(\theta_{n+1}) = \left (\frac{b_{0}}{a_{0}} \right )^2 r_{n}\sin(\theta_{n})
\end{matrix}\right. $$ Summing both equations I get: $$ r_{n+1}^2 = r_{n}\left [ \cos(\theta_{n}) + \left (\frac{b_{0}}{a_{0}} \right )^2\sin(\theta_{n}) \right ] $$ But I got stuck there. :/
 
Last edited:
Physics news on Phys.org
Polar coordinates are not going to be much help here. I think that the key idea will be to use proof by induction.

Can you see for example whether it is true that $a_{n+1} < a_n$, or that $b_n <a_n$?
 
Hi,
I think you want to prove these statements directly. Here's an outline of a proof:

View attachment 4570
 

Attachments

  • johng001.png
    johng001.png
    8.7 KB · Views: 102
Last edited by a moderator:
Hi again,
Now that you have digested my previous post, I hope, here's an alternate way to prove the results:

View attachment 4571
 

Attachments

  • johng002.png
    johng002.png
    13.7 KB · Views: 113
Last edited by a moderator:

Similar threads

  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K