Questions tagged [inequality]

Questions on proving, manipulating and applying inequalities. Do not use this tag just because an inequality appears somewhere in your question.

An inequality is a mathematical relation between two quantities that are not necessarily equal, but bigger or smaller.

To prove inequalities, a number of proven inequalities can be used, including:

  • The AM-GM inequality

    Let $x_i>0$, $\alpha_i>0$ such that $\alpha_1+\alpha_2+...+\alpha_n=1$. Prove that $$\alpha_1x_1+\alpha_2x_2+...+\alpha_nx_n\geq x_1^{\alpha_1}x_2^{\alpha_2}...x_n^{\alpha_n}$$

For $\alpha_1=\alpha_2=...=\alpha_n=\frac{1}{n}$ we obtain the well-known $$\frac{x_1+x_2+\cdots+x_n}{n} \ge \sqrt[n]{x_1x_2\cdots x_n}$$

  • The Power Mean inequality (P-M).

    Let $a_1, a_2,\cdots, a_n$ be positive numbers and $p>q$. Then $$\left(\frac{a_1^p+a_2^p+\cdots+a_n^p}{n}\right)^{\frac{1}{p}} \geq \left(\frac{a_1^q+a_2^q+\cdots+a_n^q}{n}\right)^{\frac{1}{q}}$$

  • The Rearrangement inequality (R).

    Let $a_1\le\dots\le a_n$ and $b_1\le\dots\le b_n$. For all permutations $\sigma\in S_n$, $$\sum_{i=1}^na_ib_{n-i+1}\le\sum_{i=1}^na_ib_{\sigma(i)}\leq\sum_{i=1}^na_ib_i.$$

The rearrangement generalizes similar for more than two sequences of numbers.

  • The Cauchy-Schwarz inequality (C-S).

    If $a_1, a_2, \cdots, a_n$ and $b_1, b_2,\cdots, b_n$ are two sequences of real numbers, then $$\sum^{n}_{i=1} a_i^2 \sum^{n}_{i=1} b_i^2\geq\left(\sum^{n}_{i=1} a_ib_i \right)^2$$

  • The H$\ddot o$lder inequality (H).

    Let $a_1$, $a_2$,..., $a_n$, $b_1$, $b_2$,..., $b_n$, $\alpha$ and $\beta$ be positive numbers. Then $$\left(\sum_{i =1}^n a_i\right )^\alpha \left(\sum_{i =1}^n b_i \right )^\beta\geq \left(\sum_{i =1}^n (a_ib_i)^\frac{1}{\alpha+\beta}\right )^{\alpha+\beta} $$

  • The Schur inequalities (S):

    Let $x$, $y$ and $z$ be positive numbers and $t$ is a real number. Prove that:$$x^t(x-y)(x-z)+y^t(y-z)(y-x)+z^t (z-x)(z-y)\ge 0$$

  • Muirhead inequalities

    A sequence $a_1 \geq a_2 \geq \dots \geq a_n$ majorizes a sequence $b_1 \geq b_2 \geq \dots \geq b_n$ if $$\sum_{i=1}^k a_i \geq\sum_{i=1}^k a_i $$ for all $1\leq k < n$ and $$\sum_{i=1}^n a_i =\sum_{i=1}^n a_i $$ If sequence $(a_i)$ majorizes $(b_i)$ (notated as $a_i \succ b_i$), then $$\sum_{\text{sym}}x_1^{a_1}x_2^{a_2}\dots x_n^{a_n}\geq \sum_{\text{sym}}x_1^{b_1}x_2^{b_2}\dots x_n^{b_n}$$

30160 questions
3
votes
2 answers

Prove the inequality $\tan{\frac{\pi\sin{x}}{4\sin{\alpha}}}+\tan{\frac{\pi\cos{x}}{4\cos{\alpha}}} > 1$

Prove the inequality $$\tan{\dfrac{\pi\sin{x}}{4\sin{\alpha}}}+\tan{\dfrac{\pi\cos{x}}{4\cos{\alpha}}} > 1$$ for any $x, \alpha$ with $0 \leq x \leq \dfrac{\pi}{2}$ and $\dfrac{\pi}{6} < \alpha < \dfrac{\pi}{3}$. The best idea I had was to use…
user19405892
  • 15,592
3
votes
3 answers

Show the following inequality holds

I want to show that $( 1 + x_1 ) (1 + x_2 )... ( 1 + x_n ) \ge ( 1 + (x_1 x_2 ... x_n ) ^\frac {1} {n } ) ^ n $ for all $x_i > 0$. I started by taking logarithm on both sides and trying to use the concavity of logarithm but this reverses the…
3
votes
4 answers

Prove that if $a$ and $b$ are nonnegative real numbers, then $(a^7+b^7)(a^2+b^2) \ge (a^5+b^5)(a^4+b^4)$

Prove that if $a$ and $b$ are nonnegative real numbers, then $(a^7+b^7)(a^2+b^2) \ge (a^5+b^5)(a^4+b^4)$ My try My book gives as a hint to move everything to the left hand side of the inequality and then factor and see what I get in the long…
Mr. Y
  • 2,637
3
votes
1 answer

Prove the following sum inequality

If $x_1,x_2,\ldots,x_n$ are positive real numbers such that $\displaystyle \sum_{i = 1}^n x_i = 1$, prove that $$\displaystyle \sum_{i = 1}^n \dfrac{x_i}{\sqrt{1-x_i}} \geq \dfrac{\displaystyle \sum_{i = 1}^n \sqrt{x_i}}{\sqrt{n-1}}.$$ Seeing the…
3
votes
1 answer

Prove that $n\sum_{i=1}^n a_ib_i \geq \sum_{i=1}^n a_i \cdot \sum_{i = 1}^n b_i.$

Let $a_1 \leq a_2 \leq \cdots \leq a_n$ and $b_1 \leq b_2 \leq \cdots \leq b_n$, then prove that $$n\sum_{i=1}^n a_ib_i \geq \sum_{i=1}^n a_i \cdot \sum_{i = 1}^n b_i.$$ Attempt The $n\displaystyle \sum_{i=1}^n a_ib_i$ makes me think of…
user19405892
  • 15,592
3
votes
2 answers

For all nonnegative real numbers $x,y$ and $z$, prove that $\dfrac{(x+y+z)^2}{3} \geq x\sqrt{yz}+y\sqrt{xz}+z\sqrt{xy}.$

For all nonnegative real numbers $x,y$ and $z$, prove that $$\frac{(x+y+z)^2}{3} \geq x\sqrt{yz}+y\sqrt{xz}+z\sqrt{xy}.$$ It seems like AM-GM works here. We have $\dfrac{(x+y+z)^2}{3} \geq \dfrac{(2\sqrt{xy}+z)(2\sqrt{xz}+y)(2\sqrt{xy}+z)}{3}$.…
Jacob Willis
  • 1,601
3
votes
3 answers

Find maximum value without calculus

Let $f(x)=4x^3-x^2-4x+2$ where $x\in[-1,1]$. Is it possible to find the maximum value of $f(x)$ without using calculus. Possibly through a series of inequality.
1-___-
  • 1,674
3
votes
3 answers

Prove that $\frac{a}{(1+b)(1+c)}+\frac{b}{(1+a)(1+c)}+\frac{c}{(1+a)(1+b)} \geq \frac{3}{4}.$

Let $a,b,c$ be positive numbers that satisfy $abc = 1$, prove that $$\dfrac{a}{(1+b)(1+c)}+\dfrac{b}{(1+a)(1+c)}+\dfrac{c}{(1+a)(1+b)} \geq \dfrac{3}{4}.$$ Attempt I tried doing $$\dfrac{a}{(1+b)(1+c)}+\dfrac{b}{(1+a)(1+c)}+\dfrac{c}{(1+a)(1+b)} …
Jacob Willis
  • 1,601
3
votes
3 answers

$(x^2+1)(y^2+1)(z^2+1) + 8 \geq 2(x+1)(y+1)(z+1)$

The other day I came across this problem: Let $x$, $y$, $z$ be real numbers. Prove that $$(x^2+1)(y^2+1)(z^2+1) + 8 \geq 2(x+1)(y+1)(z+1)$$ The first thought was power mean inequality, more exactly : $AM \leq SM$ ( we noted $AM$ and $SM$ as…
scummy
  • 989
3
votes
3 answers

Prove that $\frac{1+ab}{1+a}+\frac{1+bc}{1+b}+\frac{1+ac}{1+c} \geq 3.$

Let $a,b,c$ be positive real numbers such that $abc = 1$. Prove that $$\dfrac{1+ab}{1+a}+\dfrac{1+bc}{1+b}+\dfrac{1+ac}{1+c} \geq 3.$$ This looks symmetric, so should I prove it for just $a \leq b \leq c$ and then the other cases follow?
user19405892
  • 15,592
3
votes
2 answers

Prove that: $2^a+3^b<3a+4b$

Let be $a, b$ in $(0,1)$ such that $a+b>1$. I need to prove that: $$2^a+3^b<3a+4b$$ I'm looking for an elementary proof that doesn't resort to the calculus tools.
user 1591719
  • 44,216
  • 12
  • 105
  • 255
3
votes
9 answers

Prove that $\frac{{a}^{2}}{b-1}+\frac{{b}^{2}}{a-1}\geq8$

I need to prove that for any real number $a>1$ and $b>1$ the following inequality is true: $$\frac{{a}^{2}}{b-1}+\frac{{b}^{2}}{a-1}\geq8$$
user 1591719
  • 44,216
  • 12
  • 105
  • 255
3
votes
3 answers

Inequality regarding the logarithm

I have found the inequality $$ x\leq cy+\frac{1}{\log(c)}(x-y)\log(x/y), $$ for all $x,y>0$ and $c>1$. Why is this inequality true?
guacho
  • 1,414
3
votes
2 answers

Comparing $n^n$ and $n!^2$

I tried to prove that if $n>2$ then $(n!)^2>n^n$ but did not managed. That is the trick to compare those as both grows rapidly? Induction seems hard: $((n+1)!)^2=(n+1)^2(n!)^2>(n+1)^2n^n$ but why $(n+1)^2n^n>(n+1)^{n+1}$? I also noted that…
novice
  • 33
3
votes
3 answers

How to prove an inequality using the Mean value theorem

I've been trying to prove that $\frac{b-a}{1+b}<\ln(\frac{1+b}{1+a})<\frac{b-a}{1+a}$ using the Mean value theorem. What I've tried is setting $f(x)=\ln x$ and using the Mean value theorem on the interval $[1,\frac{1+b}{1+a}]$. I managed to prove…
nono
  • 323