Test Review 4 - is it this easy?

  • Thread starter Thread starter cmurphy
  • Start date Start date
  • Tags Tags
    Review Test
cmurphy
Messages
29
Reaction score
0
Let (sn) be a real sequence and s in R. Prove that lim sup (sn) < s implies
sn < s for n large.

My answer seems too easy. Is there anything missing?

Given lim sup (sn) < s.
By definition of lim sup, we know lim N->infinity sup {sn: n > N} < s
Then for n > N, we must have sn < s.

Colleen
 
Physics news on Phys.org
cmurphy said:
Let (sn) be a real sequence and s in R. Prove that lim sup (sn) < s implies
sn < s for n large.
My answer seems too easy. Is there anything missing?
Given lim sup (sn) < s.
By definition of lim sup, we know lim N->infinity sup {sn: n > N} < s
Then for n > N, we must have sn < s.
Colleen

What exactly is the "definition of lim sup"? How does
lim N->infinity sup {sn: n > N} < s follow from it?
 
The definition in our books is that:

lim sup {sn: n>N}
n->inf

i.e. For large n, the lim sup sn is the limit of all of the suprema. They also defined lim sup sn to be exactly the supremum of the set of subsequential limits.
 
Also, the fact that lim sup sn < s for some real number s is given.

Then I just made the substitution lim sup sn = lim n->infinity sup{sn: n>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