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

Find the maximal value of $c^2 - ca + a^2 - \frac{(b + 1)^2(b - 2)}{c + a}$ in terms of $c^3 + a^3 = m$ where $a, b$ and $c$ are positives.

Let $a, b$ and $c$ be positive real numbers such that $c^3 + a^3 = m$ and $$[(b^3 - abc) + ab(a + b) - c(a^2 + b^2)][(abc - b^3) - bc(b + c) + a(b^2 + c^2)] \le 0.$$ Find the maximal value of $$c^2 - ca + a^2 - \frac{(b + 1)^2(b - 2)}{c + a}$$ in…
3
votes
0 answers

prove this inequality for $a_{1}a_{2}\cdots a_{n}=1$

Let $a_{1},a_{2},\cdots,a_{n}>0(n>1)$,such $a_{1}a_{2}\cdots a_{n}=1$,show that $$\dfrac{a_{1}}{a_{2}}+\dfrac{a_{2}}{a_{3}}+\cdots+\dfrac{a_{n}}{a_{1}}\ge a_{1}+a_{2}+\cdots+a_{n}$$ when $n=2$,$$\dfrac{a_{1}}{a_{2}}+\dfrac{a_{2}}{a_{1}}\ge…
math110
  • 93,304
3
votes
3 answers

Solve $\frac{1}{x-1}+ \frac{2}{x-2}+ \frac{3}{x-3}+\cdots+\frac{10}{x-10}\geq\frac{1}{2} $

I would appreciate if somebody could help me with the following problem: Q: find $x$ $$\frac{1}{x-1}+ \frac{2}{x-2}+ \frac{3}{x-3}+\cdots+\frac{10}{x-10}\geq\frac{1}{2} $$
Young
  • 5,492
3
votes
1 answer

An estimation in mathematical analysis

I have encountered a simple problem in my research, but I cannot solve it. we need not to have much knowledge to think this problem. Let $1<\beta_1\,,\beta_2<2$ and $\beta_1\beta_2\leq2$ , set…
Tao
  • 530
  • 2
  • 11
3
votes
2 answers

Prove $a\sqrt[3]{a+b}+b\sqrt[3]{b+c}+c\sqrt[3]{c+a} \ge 3 \sqrt[3]2$

Prove $a\sqrt[3]{a+b}+b\sqrt[3]{b+c}+c\sqrt[3]{c+a} \ge 3 \sqrt[3]2$ with $a + b+c=3 \land a,b,c\in \mathbb{R^+}$ I tried power mean inequalities but I still can't prove it.
Xeing
  • 2,967
3
votes
1 answer

Can we use QM-AM inequality to solve this?

There are two sequences (${a_1,a_2,a_3,....,a_n })$ and $( {b_1,b_2,b_3,....,b_n})$ such that $$\sum_{i=1}^n a_i = \sum_{i=1}^n b_i$$ Prove that: $$\sum_{i=1}^n \frac{a_i^2}{a_i+b_i} \ge \frac{1}{2} \sum_{i=1}^n a_i$$ P.S I can do it…
3
votes
8 answers

How do you prove inequalities like $x^2 + xy + y^2 \ge 0$?

This is what I am asking. I do not want you to prove these inequalities for me; instead, I would like you to teach me a general method with which I can prove the inequality: $$x^2 + xy + y^2 \ge 0$$ If you could prove a similar inequality to…
Job H
  • 31
  • 4
3
votes
1 answer

Inequality: $x^2+y^2+z^2+t(xy+yz+zx) \geq 0$

Prove that $x^2+y^2+z^2+t(xy+yz+zx) \geq 0$ for any $x,y,z \in \mathbb{R}$ and any $t \in [-1,2].$ One try: for $t=-1$: $x^2+y^2+z^2-xy-yz-zx \geq 0$ is true . for $t=2$: $x^2+y^2+z^2+2(xy+yz+zx) \geq 0$ is true also for $t=0$. But how can prove for…
Iuli
  • 6,790
3
votes
2 answers

For $x, y > 0$, can you show that $\frac{x(2x-y)}{y(2z + x)} + \frac{y(2y-z)}{z(2x+y)}+\frac{z(2z-x)}{x(2y+z)}\geqslant 1$

I tried going for a common denominator but then it turned the whole inequality into a big muddle... I also tried multiplying the brackets out but to not much avail... I also browsed through some known inequalities such as Cauchy and AM-GM (I only…
mathsnoob
  • 667
3
votes
0 answers

$(a+b+c+d+e)^p \leq 2^p(1+\frac{1}{\varepsilon})(b^p+c^p+d^p+e^p)+(1+\varepsilon)^{\frac{p}{2}} a^p.$

Can anyone offer some guidance on proving the following inequality? For any $a,b,c,d,e \geq 0$ ,$p > 1$ and $ \varepsilon > 0$, the following holds: $$(a+b+c+d+e)^p \leq 2^p(1+\frac{1}{\varepsilon})(b^p+c^p+d^p+e^p)+(1+\varepsilon)^{\frac{p}{2}}…
unicornki
  • 1,210
3
votes
1 answer

Find the maximum of $\prod_{cyc}(a^2_{1}+a^2_{2})$

Let $n$ be an odd number, and $a_{i}\ge 0$ such that $$a_{1}+a_{2}+\cdots+a_{n}=n$$ Find the maximum of the value $$f(n)=(a^2_{1}+a^2_{2})(a^2_{2}+a^2_{3})\cdots(a^2_{n}+a^2_{1})$$ Now I have solved the case $n=3$: Let…
math110
  • 93,304
3
votes
2 answers

minimum value of $(8a^2+b^2+c^2)\cdot (a^{-1}+b^{-1}+c^{-1})^2$

If $a,b,c>0.$ Then minimum value of $(8a^2+b^2+c^2)\cdot (a^{-1}+b^{-1}+c^{-1})^2$ Try: Arithmetic geometric inequality $8a^2+b^2+c^2\geq 3\cdot 2\sqrt{2}(abc)^{1/3}$ and $(a^{-1}+b^{-1}+c^{-1})\geq 3(abc)^{-1/3}$ so $(8a^2+b^2+c^2)\cdot…
DXT
  • 11,241
3
votes
2 answers

Prove that the functional is non-negative for $x_i\geq 0$

Consider the following functional $\Phi:\mathbb R^n\to\mathbb R $: $$ \Phi(x)=\sum_{i=1}^{n-1}(1+x_i)(x_i-x_n)^2(2(1+x_i+x_n)+x_i x_n-x_1). $$ The computer experiments show that it is non-negative for all $x_i\geq 0$. I need to prove this. Note that…
3
votes
1 answer

show this sum $\sum(x_{i})^{x_{i+1}}\le n^{(n-1)/n}$

conjectures let $x_{i}(i=1,2,\cdots,n)$,and such $x_{1}+x_{2}+\cdots+x_{n}=1$,show that $$(x_{1})^{x_{2}}+(x_{2})^{x_{3}}+\cdots+(x_{n})^{x_{1}}\le n^{\frac{n-1}{n}}$$ It seem use Jensen inequality:because when $x_{i}=\dfrac{1}{n}$ this inequality…
math110
  • 93,304
3
votes
4 answers

$\frac{|a|}{|b-c|} + \frac{|b|}{|c-a|} + \frac{|c|}{|b-a|} \geq 2$

If $a, b, c$ are distinct real numbers then you demonstrate that: $$ S=\frac{|a|}{|b-c|} + \frac{|b|}{|c-a|} + \frac{|c|}{|b-a|} \geq 2.$$ Using inequality $ |x-y|\leq |x|+|y|$ we showed that $ S >\frac{3}{2}.$ For $b = 2a, c = 3a, S=5,$ that is,…
medicu
  • 4,482