MHB Proof of Triangle Inequality for $n$ Natural Numbers

AI Thread Summary
The discussion focuses on proving the triangle inequality for a sum of $n$ natural numbers. The inequality states that the expression $\dfrac{|a_1+...+a_n|}{1+|a_1+...+a_n|}$ is less than or equal to the sum of individual terms $\dfrac{|a_1|}{1+|a_1|} + ... + \dfrac{|a_n|}{1+|a_n|}$. The proof begins by establishing a base case and then using induction to extend the result to $n$ terms. It demonstrates that dividing both sides of the inequality by a positive quantity maintains the inequality. The conclusion confirms that the inequality holds for all values of the natural numbers involved.
solakis1
Messages
407
Reaction score
0
Prove for all $n\in N$

$\dfrac{|a_1+...a_n|}{1+|a_1+...+a_n|}\leq\dfrac{|a_1|}{1+|a_1|}+...\dfrac{|a_n|}{1+|a_n|}$
 
Mathematics news on Phys.org
First step is to prove the inequality when $n=2$ and both the numbers are positive. So we want to show that if $a,b\geqslant0$ then $$\frac{a+b}{1+a+b}\leqslant \frac a{1+a} + \frac b{1+b}.$$ Write that as $$1 - \frac1{1+a+b} \leqslant 1-\frac1{1+a} + 1 - \frac1{1+b},$$ $$ \frac1{1+a} + \frac1{1+b} \leqslant 1 + \frac1{1+a+b} = \frac{2+a+b}{1+a+b}.$$ Multiply out the fractions to get $$(2+a+b)(1+a+b) \leqslant (2+a+b)(1+a+b+ab).$$ That last inequality is clearly true, and all the steps are reversible. Therefore the first inequality is true.

The next step is to prove the given inequality in the case when $a_1,\ldots,a_n$ are all positive. This is done by induction, the base case $n=2$ being covered by Step 1 above. For the inductive step, suppose that $$\frac{a_1 + \ldots + a_{n-1}}{1+a_1 + \ldots + a_{n-1}} \leqslant \frac{a_1}{1+a_1} + \ldots + \frac{a_{n-1}}{1+a_{n-1}},$$ and apply the Step 1 inequality with $a=a_1+\ldots+a_{n-1}$ and $b=a_n$ to get $$\frac{a_1 + \ldots + a_n}{1+a_1 + \ldots + a_n} \leqslant \frac{a_1 + \ldots + a_{n-1}}{1+a_1 + \ldots + a_{n-1}} + \frac{a_n}{1+a_n}.$$ The result then follows from the inductive hypothesis.

Finally, suppose that $a_1,\ldots,a_n$ are arbitrary real (or even complex) numbers. For $x\geqslant0$, the function $\dfrac x{1+x}$ is an increasing function. Since $|a_1+\ldots+a_n| \leqslant |a_1| + \ldots + |a_n|$ it follows that $$\frac{|a_1 + \ldots + a_n|}{1+|a_1 + \ldots + a_n|} \leqslant \frac{|a_1| + \ldots + |a_n|}{1+|a_1| + \ldots + |a_n|}.$$ It then follows from Step 2 applied to the positive numbers $|a_1|,\ldots,|a_n|$ that $$\frac{|a_1 + \ldots + a_n|}{1+|a_1 + \ldots + a_n|} \leqslant \frac{|a_1| + \ldots + |a_n|}{1+|a_1| + \ldots + |a_n|} \leqslant \frac{|a_1|}{1+|a_1|} + \ldots + \frac{|a_n|}{1+|a_n|}.$$
 
Opalg said:
First step is to prove the inequality when $n=2$ and both the numbers are positive. So we want to show that if $a,b\geqslant0$ then $$\frac{a+b}{1+a+b}\leqslant \frac a{1+a} + \frac b{1+b}.$$ Write that as $$1 - \frac1{1+a+b} \leqslant 1-\frac1{1+a} + 1 - \frac1{1+b},$$ $$ \frac1{1+a} + \frac1{1+b} \leqslant 1 + \frac1{1+a+b} = \frac{2+a+b}{1+a+b}.$$ Multiply out the fractions to get $$(2+a+b)(1+a+b) \leqslant (2+a+b)(1+a+b+ab).$$ That last inequality is clearly true, and all the steps are reversible. Therefore the first inequality is true.

The next step is to prove the given inequality in the case when $a_1,\ldots,a_n$ are all positive. This is done by induction, the base case $n=2$ being covered by Step 1 above. For the inductive step, suppose that $$\frac{a_1 + \ldots + a_{n-1}}{1+a_1 + \ldots + a_{n-1}} \leqslant \frac{a_1}{1+a_1} + \ldots + \frac{a_{n-1}}{1+a_{n-1}},$$ and apply the Step 1 inequality with $a=a_1+\ldots+a_{n-1}$ and $b=a_n$ to get $$\frac{a_1 + \ldots + a_n}{1+a_1 + \ldots + a_n} \leqslant \frac{a_1 + \ldots + a_{n-1}}{1+a_1 + \ldots + a_{n-1}} + \frac{a_n}{1+a_n}.$$ The result then follows from the inductive hypothesis.

Finally, suppose that $a_1,\ldots,a_n$ are arbitrary real (or even complex) numbers. For $x\geqslant0$, the function $\dfrac x{1+x}$ is an increasing function. Since $|a_1+\ldots+a_n| \leqslant |a_1| + \ldots + |a_n|$ it follows that $$\frac{|a_1 + \ldots + a_n|}{1+|a_1 + \ldots + a_n|} \leqslant \frac{|a_1| + \ldots + |a_n|}{1+|a_1| + \ldots + |a_n|}.$$ It then follows from Step 2 applied to the positive numbers $|a_1|,\ldots,|a_n|$ that $$\frac{|a_1 + \ldots + a_n|}{1+|a_1 + \ldots + a_n|} \leqslant \frac{|a_1| + \ldots + |a_n|}{1+|a_1| + \ldots + |a_n|} \leqslant \frac{|a_1|}{1+|a_1|} + \ldots + \frac{|a_n|}{1+|a_n|}.$$
[sp]To follow your way We have:

$(a+b)\leq a+b$ Divide both sides by 1+a+b>0 and we have:

$\dfrac{(a+b)}{1+(a+b)}\leq\dfrac{a+b}{1+a+b}\leq\dfrac{a}{1+a}+\dfrac{b}{1+b}$

Now for the induction.

Since $(a_1+.....a_n)\leq a_1+.......a_n)$

Divide both sides by $(1+a_1.......a_n)$ and you have the desired result

Now substitute all the a's with there corresponding absolute value since they are positive and we have the desired inequality which holds for all values of a's[/sp]
 
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...

Similar threads

Back
Top