How Can Triangle Inequality Be Applied in Complex Mathematical Proofs?

  • Thread starter Thread starter BustedBreaks
  • Start date Start date
  • Tags Tags
    Analysis
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 2K views
BustedBreaks
Messages
62
Reaction score
0
1) By writing a = (a+b) + (-b) use the Triangle Inequality to obtain |a| - |b| [tex]\leq[/tex] |a+b|. Then interchange a and b to show that ||a| - |b|| [tex]\leq[/tex] |a+b|.

The replace b by -b to obtain ||a| - |b|| [tex]\leq[/tex] |a - b|.



Okay. I am a bit lost.

I started out by plugging in what they give me for a in the first line into the Triangle Inequality, but that just reduces back to the Triangle Inequality.


I'm just not sure where to start.





2) Let n be a natural number and [tex]a_{1}, a_{2}, ... a_{n}[/tex]be positive numbers. Prove that [tex](1+a_{1})(1+a_{2})+...+(1+a_{n}) \geq 1+a_{1}+a_{2}+...+a_{n}.[/tex]

and that

[tex](a_{1}+a_{2}+...+a_{n})(a_{1}^{-1}+a_{2}^{-1}+...+a_{n}^{-1}) \geq n^{2})[/tex]



For the first part of this problem I started out by expanding [tex](1+a_{1})(1+a_{2})+...+(1+a_{n})[/tex] for n = 3 and noticed that it would cancel all the terms on the right side making it a bunch of terms greater than or equal to zero, I just couldn't generalize it for n and n+1.

I haven't started on the second part yet.


Thanks!
 
Physics news on Phys.org
BustedBreaks said:
1) By writing a = (a+b) + (-b) use the Triangle Inequality to obtain |a| - |b| [tex]\leq[/tex] |a+b|. Then interchange a and b to show that ||a| - |b|| [tex]\leq[/tex] |a+b|.

The replace b by -b to obtain ||a| - |b|| [tex]\leq[/tex] |a - b|.
Okay. I am a bit lost.

I started out by plugging in what they give me for a in the first line into the Triangle Inequality, but that just reduces back to the Triangle Inequality. I'm just not sure where to start.

|a+b+(-b)| = |(a-b) + b| <= |a-b| + |b|

Can you see how to finish that off?
2) Let n be a natural number and [tex]a_{1}, a_{2}, ... a_{n}[/tex]be positive numbers. Prove that [tex](1+a_{1})(1+a_{2})+...+(1+a_{n}) \geq 1+a_{1}+a_{2}+...+a_{n}.[/tex]

and that

[tex](a_{1}+a_{2}+...+a_{n})(a_{1}^{-1}+a_{2}^{-1}+...+a_{n}^{-1}) \geq n^{2})[/tex]
For the first part of this problem I started out by expanding [tex](1+a_{1})(1+a_{2})+...+(1+a_{n})[/tex] for n = 3 and noticed that it would cancel all the terms on the right side making it a bunch of terms greater than or equal to zero, I just couldn't generalize it for n and n+1.

I haven't started on the second part yet.

Do it by induction. If the result holds for n terms, does it hold for n+1? (1+a1)*...*(a+an+1) = (1+a2)...(1+an)*1 + (1+a2)...(1+an)*an+1. Use the inductive hypothesis after doing this distribution