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
4
votes
4 answers

Inequality. $ab^2+bc^2+ca^2 \geq a+b+c.$

Using rearrangement inequalities prove the following inequality: Let $a,b,c$ be positive real numbers satisfying $abc=1$. Prove that $$ab^2+bc^2+ca^2 \geq a+b+c.$$ Thanks :)
Iuli
  • 6,790
4
votes
5 answers

How to show $\frac{c}{n} \leq \log(1+\frac{c}{n-c})$

How to show $\frac{c}{n} \leq \log(1+\frac{c}{n-c})$ for any positive constant $c$ such that $0 < c < n$? I'm considering the Taylor expansion, but it does not work...
zxzx179
  • 1,507
4
votes
0 answers

Prove inequality $\frac{1}{1+2b^2c}+\frac{1}{1+2c^2a}+\frac{1}{1+2a^2b}\ge1$

Let $a,b,c>0$ and $a+b+c=3$. Prove that $$\frac{1}{1+2b^2c}+\frac{1}{1+2c^2a}+\frac{1}{1+2a^2b}\ge1.$$ My attempts: 1) I use Titu's Lemma: $$\frac{1}{1+2b^2c}+\frac{1}{1+2c^2a}+\frac{1}{1+2a^2b}\ge\frac{(1+1+1)^2}{3+2(a^2b+b^2c+c^2a)}$$ 2) I use…
Roman83
  • 17,884
  • 3
  • 26
  • 70
4
votes
2 answers

Minimum of $ f(\alpha) = \left(1+\frac{1}{\sin^{n}\alpha}\right)\cdot \left(1+\frac{1}{\cos^{n}\alpha}\right)$

Minimum value of $\displaystyle f(\alpha) = \left(1+\frac{1}{\sin^{n}\alpha}\right)\cdot \left(1+\frac{1}{\cos^{n}\alpha}\right)\;,$ Where $n\in \mathbb{N}$ and $\displaystyle \alpha \in \left(0,\frac{\pi}{2}\right)$ I have solved It using…
juantheron
  • 53,015
4
votes
3 answers

Prove that $\frac{1}{4\cdot 1976^3}-\frac{1}{16\cdot 1976^7}>10^{-19.76}$

Prove that $\frac{1}{4\cdot 1976^3}-\frac{1}{16\cdot 1976^7}>10^{-19.76}$ without using a calculator. I rearraged to get $4 \cdot 1976^4-1 > 10^{-19.76} \cdot 16 \cdot 1976^7$ and so we have to prove that $4 \cdot 1976^4-1-10^{-19.76} \cdot 16…
Puzzled417
  • 6,956
4
votes
3 answers

How to prove this inequality? $a^{2}+b^{2}+c^{2}\leq 3$

How to prove this inequality? If $a^{2}+b^{2}+c^{2}\leq 3$ and $a,b,c\in \Bbb R^+$, then $$\left( a+b+c\right) \left( a+b+c-abc\right)\geq 2\left( a^{2}b+b^{2}c+c^{2}a\right) $$ I tried AM>GM but I couldn't get result
FMath
  • 941
4
votes
2 answers

How does one construct a 'sign chart' when solving inequalities?

I'm working on solving inequalities for an assignment. The instructions also request that I draw a 'sign chart' along with each solution. I've never heard of a 'sign chart' before, and the internet also seems to have a limited amount of information.…
Mark V.
  • 147
  • 1
  • 1
  • 4
4
votes
1 answer

Show that $\sum_{i=1}^{n}\left(\frac{1}{1+a_{i}}\right)^n\ge \frac{n}{2^n}$

Let $a_{1},a_{2},\cdots,a_{n}(n\ge 2)$ be postive real numbers,such that $$a_{1}a_{2}\cdots a_{n}=1$$show that $$\sum_{i=1}^{n}\left(\dfrac{1}{1+a_{i}}\right)^n\ge \dfrac{n}{2^n}$$ In fact,the function $$f(x)=\dfrac{1}{(e^x+1)^n}$$can't convex…
math110
  • 93,304
4
votes
3 answers

If $a,b>0$ and $a+b=1\;,$ Then minumum value of $(a+\frac{1}{a})^2+(b+\frac{1}{b})^2$ is

If $a,b>0$ and $a+b=1\;,$ Then minumum value of $\displaystyle \left(a+\frac{1}{a}\right)^2+\left(b+\frac{1}{b}\right)^2$ is $\bf{My\; Try::}$ Let $a=\sin^2 \theta$ and $b=\cos^2 \theta\;,$ Then We have to minimize $$\displaystyle f(\theta) =…
juantheron
  • 53,015
4
votes
2 answers

Prove $(x+y+z) \cdot \left( \frac1x +\frac1y +\frac1z\right) \geqslant 9 + \frac{4(x-y)^2}{xy+yz+zx}$

$x,y,z >0$, prove $$(x+y+z) \cdot \left( \frac1x +\frac1y +\frac1z\right) \geqslant 9 + \frac{4(x-y)^2}{xy+yz+zx}$$ The term $\frac{4(x-y)^2}{xy+yz+zx}$ made this inequality tougher. It remains me of this inequality. I think one can prove it by…
HN_NH
  • 4,361
4
votes
1 answer

Tricky Multivariable Inequality

Given 100 positive real numbers $x_1, x_2, \cdots, x_n$ that satisfy $x_1^2+x_2^2+\cdots+x_n^2>10000$ and $x_1+x_2+\cdots x_n\le 300$, prove that there exist three numbers from this set such that the sum of these three numbers is larger than 100. I…
mssmath
  • 95
4
votes
1 answer

For positive $a$, $b$, $c$ with $a^4+b^4+c^4=3$, then $\sum_{cyc}\frac{a^2}{b^3+1}\geq \frac32$

If $a$, $b$, $c$ $\in (0, \infty)$, $a^4+b^4+c^4=3$, then: $$\sum_{cyc}\frac{a^2}{b^3+1}\geq \frac32$$ original problem image I have been into inequalities lately and I am stuck with this. I used a famous inequality at first…
user321656
4
votes
1 answer

How do I prove that $\left | \sum_{j=1}^n a_j \right |^2 + \left | \sum_{j=1}^n (-1)^j a_j \right |^2 \le (n+2) \sum_{j=1}^n a_j^2$?

For any $a_j \in \Bbb R, \, j = 1, 2, \cdots, n$, one has the bound $$\left | \sum_{j = 1}^n a_j \right |^2 + \left | \sum_{j = 1}^n (-1)^j a_j \right |^2 \le (n + 2) \sum_{j =1}^n a_j^2.$$ This is an exercise from Cauchy's inequality. My first…
Yuxiao Xie
  • 8,536
4
votes
1 answer

Inequality with Square roots and Condition

Given $a+b+c=1$, prove that $\sqrt{a+\frac{(b-c)^2}4}+\sqrt{b}+\sqrt{c}\le \sqrt{3}$. So far, I have tried to apply cauchy schwarz somehow because this works well with square roots and the inequality signs match up. However, this nonhomogeneity is…