In mathematics, Nesbitt's inequality is a special case of the Shapiro inequality. It states that for positive real numbers a, b and c we have:
![{\displaystyle {\frac {a}{b+c}}+{\frac {b}{a+c}}+{\frac {c}{a+b}}\geq {\frac {3}{2}}.}](https://wikimedia.org/api/rest_v1/media/math/render/svg/ec8cddcaf162a1509f22053e879df555a0c28ab1)
Proof
First proof
Starting from Nesbitt's inequality(1903)
![{\displaystyle {\frac {a}{b+c}}+{\frac {b}{a+c}}+{\frac {c}{a+b}}\geq {\frac {3}{2}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/737dc7c5bb8921099d374bc927bceb2f026da3c6)
we transform the left hand side:
![{\displaystyle {\frac {a+b+c}{b+c}}+{\frac {a+b+c}{a+c}}+{\frac {a+b+c}{a+b}}-3\geq {\frac {3}{2}}.}](https://wikimedia.org/api/rest_v1/media/math/render/svg/0fe02b86433f10c5e309d4502106a21101df5de7)
Now this can be transformed into:
![{\displaystyle ((a+b)+(a+c)+(b+c))\left({\frac {1}{a+b}}+{\frac {1}{a+c}}+{\frac {1}{b+c}}\right)\geq 9.}](https://wikimedia.org/api/rest_v1/media/math/render/svg/a51dae5603a59d18958ff8369251f46111181fec)
Division by 3 and the right factor yields:
![{\displaystyle {\frac {(a+b)+(a+c)+(b+c)}{3}}\geq {\frac {3}{{\frac {1}{a+b}}+{\frac {1}{a+c}}+{\frac {1}{b+c}}}}.}](https://wikimedia.org/api/rest_v1/media/math/render/svg/991416d6ab3338fdb0db26649a976ea66a830382)
Now on the left we have the arithmetic mean and on the right the harmonic mean, so this inequality is true.
We might also want to try to use GM for three variables.
Second proof
Suppose
, we have that
![{\displaystyle {\frac {1}{b+c}}\geq {\frac {1}{a+c}}\geq {\frac {1}{a+b}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/dab7606fbd34e0ddf57a20d8b5784cf711e4a241)
define
![{\displaystyle {\vec {x}}=(a,b,c)}](https://wikimedia.org/api/rest_v1/media/math/render/svg/74c8cf41f8da636d22ee3e5442cd620279c63e80)
![{\displaystyle {\vec {y}}=\left({\frac {1}{b+c}},{\frac {1}{a+c}},{\frac {1}{a+b}}\right)}](https://wikimedia.org/api/rest_v1/media/math/render/svg/0bcb0b6f70a864d09d74ba570dbbb852ea2c2153)
The scalar product of the two sequences is maximum because of the Rearrangement inequality if they are arranged the same way, call
and
the vector
shifted by one and by two, we have:
![{\displaystyle {\vec {x}}\cdot {\vec {y}}\geq {\vec {x}}\cdot {\vec {y}}_{1}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/2bc9bdb34f232abd401e43fae13bf8d97e1a76ca)
![{\displaystyle {\vec {x}}\cdot {\vec {y}}\geq {\vec {x}}\cdot {\vec {y}}_{2}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/76050040cc8890cadfb01bdfa96b6e4524e07948)
Addition yields Nesbitt's inequality.
Third proof
The following identity is true for all
![{\displaystyle {\frac {a}{b+c}}+{\frac {b}{a+c}}+{\frac {c}{a+b}}={\frac {3}{2}}+{\frac {1}{2}}\left({\frac {(a-b)^{2}}{(a+c)(b+c)}}+{\frac {(a-c)^{2}}{(a+b)(b+c)}}+{\frac {(b-c)^{2}}{(a+b)(a+c)}}\right)}](https://wikimedia.org/api/rest_v1/media/math/render/svg/fb25b43cda866b24d1cf64148a109ba93a883159)
This clearly proves that the left side is no less than
for positive a,b and c.
Note: every rational inequality can be solved by transforming it to the appropriate identity, see Hilbert's seventeenth problem.
Fourth proof
Starting from Nesbitt's inequality(1903)
![{\displaystyle {\frac {a}{b+c}}+{\frac {b}{a+c}}+{\frac {c}{a+b}}\geq {\frac {3}{2}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/737dc7c5bb8921099d374bc927bceb2f026da3c6)
We add
to both sides.
![{\displaystyle {\frac {a+b+c}{b+c}}+{\frac {a+b+c}{a+c}}+{\frac {a+b+c}{a+b}}\geq {\frac {3}{2}}+3}](https://wikimedia.org/api/rest_v1/media/math/render/svg/76216cb165b330dba8e1311ee7ed412434f75370)
Now this can be transformed into:
![{\displaystyle (a+b+c)\left({\frac {1}{b+c}}+{\frac {1}{a+c}}+{\frac {1}{a+b}}\right)\geq {\frac {9}{2}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/f98de27dabe5cf9b7f5f4c75be6007114ff0f254)
Multiply by
on both sides.
![{\displaystyle ((b+c)+(a+c)+(a+b))\left({\frac {1}{b+c}}+{\frac {1}{a+c}}+{\frac {1}{a+b}}\right)\geq 9}](https://wikimedia.org/api/rest_v1/media/math/render/svg/87dd341494df5b8ed00ff5298b49df81ede6bbac)
Which is true by the Cauchy-Schwarz inequality.
Fifth proof
Starting from Nesbitt's inequality (1903)
,
we substitute a+b=x, b+c=y, c+a=z.
Now, we get
![{\displaystyle {\frac {x+z-y}{2y}}+{\frac {y+z-x}{2x}}+{\frac {x+y-z}{2z}}\geq {\frac {3}{2}};}](https://wikimedia.org/api/rest_v1/media/math/render/svg/09ed04b605d79dde9466d4070ab79cb4ace86acb)
this can be transformed to
![{\displaystyle {\frac {x+z}{y}}+{\frac {y+z}{x}}+{\frac {x+y}{z}}\geq {\frac {6}{1}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/26215108a8d8c6da2f7796de5c0dc015c4cee21d)
which is true, by inequality of arithmetic and geometric means.
References
External links