67. Remarkable algebraic/geometrical inequalities (1).
by Virgil Nicula, Jul 22, 2010, 11:12 PM
I. Remarkable inequalities: 0
(Weitzenbock - see here).
Method I.
and the Cebasev's inequality 
Otherwise.
.
Remark.



Method II.
what is true.
Method III.

Method IV. I"ll use the inequality
thus:

Using same inequality
can obtain a stronger inequality. Indeed,


Method V. We use the inequality
thus :
.
Method VI. We use two inequalities
Prove easily that
But
Therefore,
(the Weitsenbock's inequality is "weakly" ! ).
Method VII. I"ll use the inequality
Indeed, add the inequalities
etc. 

Method VIII.
si


Method IX.
because 
Generalization.
with the equality iff
and 
Proof.

we have the equality
si 
and
and in this case we find the well-known identity
Remark.
. Thus, exists the following inequalities: ![$ 36r^2\le 4S\sqrt 3\le\ 6r\sqrt [3]{4Rp^2}\le$](//latex.artofproblemsolving.com/4/6/d/46de19df782f3bc9db70f9233481db648608df55.png)
and

(Hadwiger-Finsler - see here).
Method I.
Denote 
But
Hence
, what is true.
Method II. I"ll show that the Hadwiger-Finsler's inequality is equivalently with the well-known inequality
Indeed, 

Method III. Prove easily that
Thus,
and the inequality
becomes
But
I"ll show that ![$3\cdot\sqrt[3]{4Rp^2r^3}\ \ge\ 2S\sqrt 3\ .$](//latex.artofproblemsolving.com/4/d/c/4dc134c078fd1418314d51117e16d00db4a5d232.png)
Indeed, this inequality is equivalently with
Therefore, we proved an stronger inequality, ![$ \sum a^2\ \ge\ \sum (b-c)^2+6r\cdot\sqrt[3]{4Rp^2}\ .$](//latex.artofproblemsolving.com/b/0/b/b0be04efac82798fede9826a805194c4d80bbcd1.png)
Method IV.
because
is convex and Jensen's 
A strengthening of the Hadwiger-Finsler's inequality:
.
Proof. Suppose w.l.o.g.
. We need to prove that
. I"ll use
,
and
,
where
which is true by AM-GM. Prove easily that
reverse of the Hadwiger-Finsley's inequality. i.e.
.
Remark. Here Cezar Lupu & Cosmin Pohoata presented a "strengthening" of the Hadwiger-Finsler's inequality :
, unde
Denote
Se observa ca
(Gerretsen) si
I"ll present a stronger inequality,
Indeed,

, i.e.
,
what is true. An weak inequality:
Thus, exist the inequalities with the Hadwiger - Finsler's :
Some applications of the inequality
which appear here.








I used the identities :



Remark.

Blundon's inequality. 
Proof. Denote
. Then the Blundon's inequality becomes
This remarkable inequality has proved by E. Rouche in 1851.
It is the fundamental inequality of
. Let
and symmetric homogenous polynomial 
.
Remark. Prove easily that
si
i.e.
,
, 
verify the equation
This chain of the equivalencies allows passing (directly and inverse) from one inequality
with positive
to an inequality
and finally to
what can be proved with the fundamental Blundon's inequality. Thus can prove the following chain 
For
say :
, where
Therefore,
. In conclusion, in these examples proved : 
Example III. (Gazeta Matematica B, 12, 2003). For any
exists the bilateral inequality
, where
![$ \left\|\begin{array}{c}
u=\frac 1m\cdot\left[- (1 - m)^{2}R^{2} + 2(m^{2} + 5m + 2)Rr - (4 + m)r^{2}\right]=-mR(R-2r)+\alpha-\frac 1m\cdot (R-2r)^2\\\\
v=\frac 1m\cdot\left[(m + 1)^{2}R^{2} - 2(m^{2} - 5m + 2)Rr + (4 - m)r^{2}\right]=mR(R-2r)+\alpha +\frac 1m\cdot (R-2r)^2\end{array}\right\|\ .$](//latex.artofproblemsolving.com/3/d/6/3d667133ed07ab2372961bc31f175e3af0958cd1.png)
Proof. Observe that
. Denote
Remain to show only
But ![$ \delta=mR(R-2r)+\frac 1m\cdot (R-2r)^2=\frac 1m\cdot (R-2r)\left[\left(1+m^2\right)R-2r\right]\ge 0\ .$](//latex.artofproblemsolving.com/6/6/3/66363f3ae368551c3a664f4ea538b8b8270602de.png)
In conclusion,
![$ \left[\left(1+m^2\right)R-2r\right]^2-\left[2m\sqrt {R(R-2r)}\right]^2\ge 0$](//latex.artofproblemsolving.com/d/0/1/d015ef12d8c12a8384a8ba978e833a38f692a8f4.png)
, what is true.
Example IV. If numbers
,
,
are pozitive, then exists the inequality 
Method 1. For positive
,
,
exists
so that
and
Observe that
,
a.s.o. and the inequality 
becomes
I"ll use the well-known inequalities
,
and
Thus, the inequality
is equivalently with ![$ 8\left(pr^2\right)^2+4Rpr\cdot\left[p^3-p^2\cdot 2(a+b+c)+p\cdot 4(ab+bc+ca)-8abc\right]\ge 0$](//latex.artofproblemsolving.com/5/5/8/55878fd28d1df1e9a153495e1ac49f55efed69a7.png)
Therefore,
I"ll use the fundamental inequality Blundon (only left) :
I"ll show
Indeed,


, what is true. Thus,
, i.e.
is true. Since
, i.e.
is true.
Method 2. For the positive
,
,
exists the real
,
,
so that
Observe that
,
a.s.o. and the inequality
becomes
Thus,
Remark (Mateescu Constantin). Blundon's inequality is, in fact, a simple consequence of the triangle inequality !

Short proof. I will use the well-known distances in a triangle
, where
,
and
are the incenter , circumcenter and the Nagel's point
of the triangle
. Now, one can easily show that Blundon's inequality reduces to
, which is just the triangle inequality applied in
.
(Neuberg-Pedoe's inequality - see here), where
are the sides of
with the area 
Proof.

We have the equality
and
and
.
Remark. Let
,
be sides for
,
with the areas
,
respectively
exists Oppenheim's inequality
.
Indeed, observe that
,
si
Therefore,

Using the Neuberg-Pedoe's inequality
obtain that
Prove similarly the extension of
the Oppenheim's inequality : if
,
,
and
,
are the lengths of the sides of
,
with the areas
,
respectively, then there is the inequality
See here and here

Method I.


Otherwise.

![$ \left[\sum\left(b^2+c^2-a^2\right)\right]^2=$](http://latex.artofproblemsolving.com/9/7/7/977421a4bf8adf5a668e38ff8a43af8846cb7d8e.png)


Remark.











Method II.





Method III.






Method IV. I"ll use the inequality









Method V. We use the inequality








Method VI. We use two inequalities


![$ 4S\sqrt 3\ \le\ 3\cdot\sqrt[3]{a^2b^2c^2}\ .$](http://latex.artofproblemsolving.com/f/e/6/fe66f6747b38ce5e6d8efb470f72ceb13847b2e9.png)
![$ 3\cdot\sqrt[3]{a^2b^2c^2}=3\cdot\sqrt[3]{ab\cdot bc\cdot ca}\ \le\ ab+bc+ca\ .$](http://latex.artofproblemsolving.com/0/c/a/0ca1238b928e2ebd63eb13295d91643aa082a5d1.png)
![$ \boxed {\ 4S\sqrt 3\ \le\ 3\cdot\sqrt[3] {(abc)^2}\ \le\ ab+bc+ca\ \le\ a^2+b^2+c^2\ }$](http://latex.artofproblemsolving.com/b/0/1/b01f285cd216e4324abfef783a012c10d5a889a7.png)
Method VII. I"ll use the inequality







Method VIII.








Method IX.



Generalization.



Proof.








Remark.

![$ 36r^2\le 4S\sqrt 3\le\ 6r\sqrt [3]{4Rp^2}\le$](http://latex.artofproblemsolving.com/4/6/d/46de19df782f3bc9db70f9233481db648608df55.png)
![$ 4r(4R+r)\le 3\cdot\sqrt [3]{(abc)^2}\le$](http://latex.artofproblemsolving.com/8/0/8/808edd516a719039f48b39b83148c2aab420bc84.png)





Method I.
![$ \sum a^2\ge \sum (b-c)^2+4S\sqrt 3\ \Longleftrightarrow\ \sum\left[a^2-(b-c)^2\right]\ \ge 4S\sqrt 3\ \Longleftrightarrow$](http://latex.artofproblemsolving.com/5/d/1/5d1c27d5c101483b2263c612e9c4a6664d035d88.png)


But


Method II. I"ll show that the Hadwiger-Finsler's inequality is equivalently with the well-known inequality


![$4S\sqrt 3\ \le\ \sum \left[a^2-(b-c)^2\right]\ \Longleftrightarrow$](http://latex.artofproblemsolving.com/4/e/1/4e1453c3301db739c8231ad252be5ecc46e2898c.png)

Method III. Prove easily that



becomes

![$ \sum a(p-a)\ge 3\cdot\sqrt [3]{abc(p-a)(p-b)(p-c)}=3\cdot \sqrt [3]{4Rp^2r^3}\ .$](http://latex.artofproblemsolving.com/5/9/c/59c16d4d576123dc349ff9edf00532f7fa100907.png)
![$3\cdot\sqrt[3]{4Rp^2r^3}\ \ge\ 2S\sqrt 3\ .$](http://latex.artofproblemsolving.com/4/d/c/4dc134c078fd1418314d51117e16d00db4a5d232.png)
Indeed, this inequality is equivalently with

![$ \sum a^2\ \ge\ \sum (b-c)^2+6r\cdot\sqrt[3]{4Rp^2}\ .$](http://latex.artofproblemsolving.com/b/0/b/b0be04efac82798fede9826a805194c4d80bbcd1.png)
Method IV.





Proof. Suppose w.l.o.g.





where


reverse of the Hadwiger-Finsley's inequality. i.e.

Remark. Here Cezar Lupu & Cosmin Pohoata presented a "strengthening" of the Hadwiger-Finsler's inequality :














what is true. An weak inequality:



















I used the identities :










Remark.
![$ 4S\sqrt 3\ \le\ \left\{\begin{array}{c}
6r\sqrt [3]{4Rp^2}\\\\
4SP\ \le\ 4SKP\end{array}\right\|\le\ 4r(4R+r)$](http://latex.artofproblemsolving.com/7/9/e/79e2351a07c7b30f3ea9e2f3d77284217c9f2f3b.png)
![$\le 3\cdot\sqrt [3]{(abc)^2}\le$](http://latex.artofproblemsolving.com/9/f/9/9f98b0d1f440f93ea01ef852b0bccf27a7e87ae3.png)





Proof. Denote


It is the fundamental inequality of




![$ = - 4r^{2}[(p^{2} - 2R^{2} - 10Rr + r^{2})^{2} - 4r(R - 2r)^{3}]\ge 0$](http://latex.artofproblemsolving.com/f/f/c/ffc22ed79f9f0c1785634d4d89cb623674457199.png)


Remark. Prove easily that
![$ \left\|\begin{array}{c}
ab+bc+ca=p^2+r(4R+r)\\\\
a^2+b^2+c^2=2\left[p^2-r(4R+r)\right]\\\\
a^3+b^3+c^3=2p\left[p^2-3r(2R+r)\right]\\\\
a^4+b^4+c^4=2\cdot\left(\sum bc\right)^2-16p^2r(2R+r)\end{array}\right\|$](http://latex.artofproblemsolving.com/4/2/9/429f26abd7c3bf00d5821c7d10dff39b86f2b53f.png)








verify the equation















Example III. (Gazeta Matematica B, 12, 2003). For any
![$ m\in (0,1]$](http://latex.artofproblemsolving.com/6/6/3/6639fe5944afe6d9988c96dcdf5c8f532e497f9b.png)

![$ \left\|\begin{array}{c}
u=\frac 1m\cdot\left[- (1 - m)^{2}R^{2} + 2(m^{2} + 5m + 2)Rr - (4 + m)r^{2}\right]=-mR(R-2r)+\alpha-\frac 1m\cdot (R-2r)^2\\\\
v=\frac 1m\cdot\left[(m + 1)^{2}R^{2} - 2(m^{2} - 5m + 2)Rr + (4 - m)r^{2}\right]=mR(R-2r)+\alpha +\frac 1m\cdot (R-2r)^2\end{array}\right\|\ .$](http://latex.artofproblemsolving.com/3/d/6/3d667133ed07ab2372961bc31f175e3af0958cd1.png)
Proof. Observe that



![$ \delta=mR(R-2r)+\frac 1m\cdot (R-2r)^2=\frac 1m\cdot (R-2r)\left[\left(1+m^2\right)R-2r\right]\ge 0\ .$](http://latex.artofproblemsolving.com/6/6/3/66363f3ae368551c3a664f4ea538b8b8270602de.png)
In conclusion,


![$ \left[\left(1+m^2\right)R-2r\right]^2-\left[2m\sqrt {R(R-2r)}\right]^2\ge 0$](http://latex.artofproblemsolving.com/d/0/1/d015ef12d8c12a8384a8ba978e833a38f692a8f4.png)

![$ \left(1-m^2\right)^2R^2-4\left(1-m^2\right)Rr+4r^2=\left[\left(1-m^2\right)R-2r\right]^2\ \ge\ 0$](http://latex.artofproblemsolving.com/f/0/7/f073393a16794aafb6430043a2fd82fd596ffa37.png)
Example IV. If numbers




Method 1. For positive









becomes
![$8\left[(p-a)(p-b)(p-c)\right]^2+$](http://latex.artofproblemsolving.com/3/5/f/35f5afbf5bd504028ba6e6e043da3b7e78aeaf11.png)





![$ 8\left(pr^2\right)^2+4Rpr\cdot\left[p^3-p^2\cdot 2(a+b+c)+p\cdot 4(ab+bc+ca)-8abc\right]\ge 0$](http://latex.artofproblemsolving.com/5/5/8/55878fd28d1df1e9a153495e1ac49f55efed69a7.png)

![$ 8p^2r^4+4Rpr\left[p^3-4p^3+4p(p^2+r^2+4Rr)-8\cdot 4Rpr\right]\ge 0$](http://latex.artofproblemsolving.com/b/3/c/b3c033e24226917ed23b44682c48cda9306d942f.png)

![$ 2r^3+R\left[p^2-4r(4R-r)\right]\ge 0$](http://latex.artofproblemsolving.com/8/8/7/88745c7ea50e396025904cbe8b3cc15663de4221.png)




















Method 2. For the positive













Remark (Mateescu Constantin). Blundon's inequality is, in fact, a simple consequence of the triangle inequality !

Short proof. I will use the well-known distances in a triangle




of the triangle







Proof.















Remark. Let








Indeed, observe that



![$ 64R^2=\sum\left(a^2+x^2\right)\cdot\left[\left(b^2+c^2-a^2\right)+\left(y^2+z^2-x^2\right)\right]=$](http://latex.artofproblemsolving.com/a/2/b/a2ba6fb6a1d579ce91f000131b39fb69fc4173e4.png)







the Oppenheim's inequality : if










See here and here
This post has been edited 111 times. Last edited by Virgil Nicula, Feb 25, 2019, 7:27 PM