0
$\begingroup$

Let $(A_n), (B_n)$ be two bounded sequences.

Show that there is a sequence of natural numbers $n_1 < n_2 <\cdots$ so that both the subsequences $(A_{n_k})$ and $(B_{n_k})$ converge.

My problem with solving this: Is it possible to say that assuming $A_n > B_n$ for all $n$ then we can make a subsequence of $n_1 < n_2 <\cdots$ from $B_n$ to $\infty$ and then from $A_n$ to $\infty$?

Thanks in advance!

  • 1
    First of all, as $(A_n)$ and $(B_n)$ don't relate in any way, it is sufficent, that each bounded sequence has a convergent subsequence. Therefore see http://en.wikipedia.org/wiki/Bolzano%E2%80%93Weierstrass_theorem2012-12-23
  • 0
    So what does that question mean? I'm puzzled...2012-12-23

1 Answers 1

4

At this point you are undoubtedly aware of a result stating that a bounded sequence has a convergent subsequence. You should also remember a result stating that a subsequence of a convergent sequence converges. An approach (or extended hints):

  1. Apply the first result to the sequence $A_1,A_2,\ldots$ to get a converging subsequence $A_{n_1},A_{n_2},\ldots$
  2. Apply the first result to the sequence $B_{n_1},B_{n_2},\ldots$ to get - hmm, you think about this a bit
  3. Apply the second result to the sequence $A_{n_{k_1}},A_{n_{k_2}},\ldots$
  • 0
    Ah Sorry. I thought it was a typo (I thought you meant $B_1,B_2,...$). I am removing my comment2012-12-23
  • 0
    Actually the first two steps are enough, aren't they?2012-12-23
  • 0
    @AndreasT: The third step is admittedly easier, but it is IMHO necessary.2012-12-23
  • 0
    @JyrkiLahtonen I'm afraid I misinterpreted 'second result' with 'second step', i.e. I thought you meant to extract again another subsequence. I didn't read carefully enough your answer, I'm sorry...2012-12-23