Proving Convergence of Absolute Value Sequence in Real Numbers

Daveyboy
Messages
57
Reaction score
0
For a sequence in the reals

{an} converges to a, show {|an|} converges to |a|.

For any e>0 the exists an N s.t. for any n>N |an-a|<e

I want to use this inequality, but there is something funny going on. I do not know how to justify it.

|an-a|\leq||an|-|a||
 
Physics news on Phys.org
Look at three separate cases.

1) a> 0. Can you show that, for some N, for all n> N a_n&gt; 0? (Take \epsilon= a/2.)

2) a< 0. Can you show that, for some N, for all n> N a_n&lt; 0?

3) a= 0. Here, ||a_n|- a|= ||a_n||= |a_n|.
 
Okay I see how to break it down case wise and find N accordingly. That will work nicely.

However, I was hoping to use the reverse triangle inequality but I run into the double abs. value. It just doesn't look right to say that
for any e>0 there exists and N s.t. for any n >N

|an - a| < e
and
|an - a| \geq |an| - |a|
implies

e>||an| - |a||

but if I showed this wouldn't it be true?
 
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