Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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!

share|improve this question
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 en.wikipedia.org/wiki/Bolzano%E2%80%93Weierstrass_theorem –  sonystarmap Dec 23 '12 at 7:10
    
So what does that question mean? I'm puzzled... –  Harold Dec 23 '12 at 7:28

1 Answer 1

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$
share|improve this answer
    
Ah Sorry. I thought it was a typo (I thought you meant $B_1,B_2,...$). I am removing my comment –  Nameless Dec 23 '12 at 7:41
    
Actually the first two steps are enough, aren't they? –  AndreasT Dec 23 '12 at 13:00
    
@AndreasT: The third step is admittedly easier, but it is IMHO necessary. –  Jyrki Lahtonen Dec 23 '12 at 13:28
    
@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... –  AndreasT Dec 23 '12 at 23:40

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.