Prove that lim sup(x_n) = max(lim sup(y_n), lim sup(z_n))

  • Thread starter Thread starter drawar
  • Start date Start date
drawar
Messages
130
Reaction score
0

Homework Statement


Let (x_{n}) be a bounded sequence. For each n \in \mathbb{N}, let y_{n}=x_{2n} and z_{n}=x_{2n-1}. Prove that
\lim \sup {x_n} = \max (\lim \sup {y_n},\lim \sup {z_n})


Homework Equations





The Attempt at a Solution



Don't know if I'm at the right path but I've tried letting M= \lim \sup {x_n}, M_{1}= \lim \sup {y_n}, and M_{2} = \lim \sup {z_n} and see that M \geq \max (M_{1}, M_{2}). How do I proceed from here to prove that M = \max (M_{1}, M_{2})? Thank you!
 
Physics news on Phys.org
Does this observation help?
$\sup {x_n} = \max (\sup {y_n},\sup {z_n})$
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top