How to use the triangle inequality to solve a proof involving absolute values?

Click For Summary
The discussion focuses on using the triangle inequality to prove that if |s_n - s| < 1, then |s_n| < |s| + 1. Participants explore the implications of the triangle inequality, particularly the form |a| = |(a-b) + b|, to derive the necessary relationships. A key insight is that the reverse triangle inequality can be utilized, leading to the conclusion that |s_n| can be bounded by |s| + 1. Suggestions include considering specific cases and manipulating the inequality to achieve the desired result. The conversation emphasizes the importance of understanding and applying the triangle inequality effectively in proofs involving absolute values.
Bennigan88
Messages
38
Reaction score
0

Homework Statement


Use the triangle inequality to prove that \left| s_n - s \right| &lt; 1 \implies \left| s_n \right| &lt; \left| s \right| +1

Homework Equations


The triangle inequality states that \left| a-b \right| \leq \left| a-c \right| + \left| c-b \right|


The Attempt at a Solution


So far I have \left| s_n - s \right| &lt; 1 \implies -1 &lt; s_n - s &lt; 1 \implies s_n &lt; s + 1. But now I don't see how I can use the triangle inequality to move forward. Hints greatly appreciated, no spoilers please!
 
Physics news on Phys.org
Bennigan88 said:

Homework Statement


Use the triangle inequality to prove that \left| s_n - s \right| &lt; 1 \implies \left| s_n \right| &lt; \left| s \right| +1

Homework Equations


The triangle inequality states that \left| a-b \right| \leq \left| a-c \right| + \left| c-b \right|

The Attempt at a Solution


So far I have \left| s_n - s \right| &lt; 1 \implies -1 &lt; s_n - s &lt; 1 \implies s_n &lt; s + 1. But now I don't see how I can use the triangle inequality to move forward. Hints greatly appreciated, no spoilers please!
Well, if ##s_n## is less than ##s+1##, what does that imply about ##|s_n|##?

Edit: The utter wrongness of my previous post should be disregarded while I sit in the corner of shame. One can also consider the case where c = 0 in the given statement of the triangle inequality too get your answer.
 
Last edited:
Bennigan88 said:

Homework Statement


Use the triangle inequality to prove that \left| s_n - s \right| &lt; 1 \implies \left| s_n \right| &lt; \left| s \right| +1

Homework Equations


The triangle inequality states that \left| a-b \right| \leq \left| a-c \right| + \left| c-b \right|


The Attempt at a Solution


So far I have \left| s_n - s \right| &lt; 1 \implies -1 &lt; s_n - s &lt; 1 \implies s_n &lt; s + 1. But now I don't see how I can use the triangle inequality to move forward. Hints greatly appreciated, no spoilers please!

Do you have the equivalent inequality ##|a+b|\le |a|+|b|## to work with? That is what is usually called the triangle inequality. Anyway, here's my hint: ##|a| = |(a-b)+b|##.
 
I found that in general, a &lt; b + 1 \nRightarrow \left| a \right| &lt; \left| b \right| + 1. Setting c = 0 would give me \left|{s_n-s}\right| &lt; \left|{s_n}\right| + \left|{s}\right|. I feel like what I really need to show is \left|{s}\right| - \left|{s_n}\right| \leq \left|{s_n-s}\right|.
 
Write down the triangle inequality. You need a minus sign, which can be obtained by moving something to the other side of the inequality.
 
As far as I can figure, the way to prove it is this: ## \left|{a+b}\right| \leq \left|{a}\right| + \left|{b}\right| \implies \left|{a}\right| \geq \left|{a+b}\right| - \left|{b}\right| \implies \left|{\left({a+b}\right)-b}\right| \geq \left|{a+b}\right| - \left|{b}\right|
\implies \left|{x-y}\right| \geq \left|{x}\right| - \left|{y}\right| ## as long as ##y = b## and ##x = b + a## but since for any ##b## any other number can be expressed as ##b+a## for some ##a##, this holds for all ##x,y##.

Is there a flaw? Is there a more elegant way to show this?
 
LCKurtz said:
Do you have the equivalent inequality ##|a+b|\le |a|+|b|## to work with? That is what is usually called the triangle inequality. Anyway, here's my hint: ##|a| = |(a-b)+b|##.

Bennigan88 said:
As far as I can figure, the way to prove it is this: ## \left|{a+b}\right| \leq \left|{a}\right| + \left|{b}\right| \implies \left|{a}\right| \geq \left|{a+b}\right| - \left|{b}\right| \implies \left|{\left({a+b}\right)-b}\right| \geq \left|{a+b}\right| - \left|{b}\right|
\implies \left|{x-y}\right| \geq \left|{x}\right| - \left|{y}\right| ## as long as ##y = b## and ##x = b + a## but since for any ##b## any other number can be expressed as ##b+a## for some ##a##, this holds for all ##x,y##.

Is there a flaw? Is there a more elegant way to show this?

Using my hint:##|a| = |(a-b)+b|\le |a-b| + |b|\implies |a|-|b|\le |a-b|##. That's it. You can get absolute values on the left if you switch the ##a## and ##b## so you have ##|b|-|a|\le |a-b|##. Together those give ##|\,|a|-|b|\,|\le |a-b|##. That is usually called the reverse triangle inequality.
 
LCKurtz said:
Using my hint:##|a| = |(a-b)+b|\le |a-b| + |b|\implies |a|-|b|\le |a-b|##. That's it. You can get absolute values on the left if you switch the ##a## and ##b## so you have ##|b|-|a|\le |a-b|##. Together those give ##|\,|a|-|b|\,|\le |a-b|##. That is usually called the reverse triangle inequality.

Thank you, that's much nicer.
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
815
  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K