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
1 answer

Prove one case of the Reverse Triangle Inequality $|x-y|≥|x|-|y|$ for all reals $x$ and $y$

Prove this inequality for all reals $x$ and $y$: $$|x-y|≥|x|-|y|$$
DER
  • 3,011
3
votes
1 answer

Maximum and minimum of $\sum\limits_{k=1}^{n-1}(x_{k}-a)(x_{k+1}-a)$ on $\sum\limits_{k=1}^{n-1}x_{k}=na$ and $x_k\ge 0$

Fix $a$ some positive number and $n$ some positive integer,and assume that $$x_{1}+x_{2}+\cdots+x_{n}=na,x_{i}\ge 0,i=1,2,\cdots,n$$ Find this function maximum and minimum $$f=\sum_{k=1}^{n-1}(x_{k}-a)(x_{k+1}-a)$$ My try: let…
math110
  • 93,304
3
votes
1 answer

How prove this $\sqrt{a^2(\cos{x}+\cos{y})^2+b^2(\sin{x}+\sin{y})^2}+\sqrt{a^2(\cos{x}-\cos{y})^2+b^2(\sin{x}-\sin{y})^2}\le 2\sqrt{a^2+b^2}$

let $a,b>0$ is give numbers,for any $x,y\in R$,show that $$\sqrt{a^2(\cos{x}+\cos{y})^2+b^2(\sin{x}+\sin{y})^2}+\sqrt{a^2(\cos{x}-\cos{y})^2+b^2(\sin{x}-\sin{y})^2}\le 2\sqrt{a^2+b^2}$$ maybe can use Cauchy-Schwarz inequality to solve it. This…
math110
  • 93,304
3
votes
2 answers

How prove $3(a^4+b^4+c^4)+2(a+b+c)abc\ge 5(a^2b^2+b^2c^2+a^2c^2)$

let $a,b,c>0$ and such $abc=1$,show that $$3(a^4+b^4+c^4)+2(a+b+c)\ge 5\left(\dfrac{1}{a^2}+\dfrac{1}{b^2}+\dfrac{1}{c^2}\right)$$ my idea: maybe can use AM-GM inequality, $$3(a^4+b^4+c^4)a^2b^2c^2+2(a+b+c)(a^2b^2c^2)\ge…
math110
  • 93,304
3
votes
1 answer

Proving an inequality or finding a counter example

I'm trying to prove that the following inequality holds for any $0\leq a_1,a_2,b_1,b_2\leq 1$: $$|a_1a_2-b_1b_2|\leq |a_1-b_1|+|a_2-b_2|$$ Does anybody have an idea for proving this, or has a counter-example. Thanks,
Alt
  • 2,592
3
votes
1 answer

How prove this $\prod\limits_{cyc}(a^3+2b+\frac{2}{a^2+1})\ge 64$

let $a,b,c>0$ and such $$abc\ge 1$$ show that $$\left(a^3+2b+\dfrac{2}{a^2+1}\right)\left(b^3+2c+\dfrac{2}{b^2+1}\right)\left(c^3+2a+\dfrac{2}{c^2+1}\right)\ge 64$$ my try: $$\sum_{cyc}\ln{\left(a^3+2b+\dfrac{2}{a^2+1}\right)}\ge 6\ln{2}$$ Then I…
math110
  • 93,304
3
votes
1 answer

How to show this crazy inequality of logarithms and constant number?

Is there any way to solve this inequality? I asked my friend for help, but he couldn't do it. I can't use even derivatives and his solution was including them. So, after many transformations i have to show this inequality : $$\frac{\ln x}{t} + \ln…
3
votes
1 answer

Minimum value of $P=\sqrt{2x^2+2y^2-2x+2y+1}+\sqrt{2x^2+2y^2+2x-2y+1}+\sqrt{2x^2+2y^2+4x+4y+4}$

Let $x,y∈R$ . Find the minimum value of this expression: $P=\sqrt{2x^2+2y^2-2x+2y+1}+\sqrt{2x^2+2y^2+2x-2y+1}+\sqrt{2x^2+2y^2+4x+4y+4}$ We have:…
abcdxyz
  • 430
3
votes
2 answers

Does $a_k,b_k>0$ imply $\left(\sum_{k=1}^n \frac{a_k}{n}\right)^2+\left(\sum_{k=1}^n \frac{b_k}{n}\right)^2\ge \prod_{k=1}^n(a_k^2+b_k^2)^{1/n}$?

Does $$a_k,b_k>0$$ imply that $$\left(\sum_{k=1}^n \frac{a_k}{n}\right)^2+\left(\sum_{k=1}^n \frac{b_k}{n}\right)^2\ge \prod_{k=1}^n(a_k^2+b_k^2)^{1/n}$$?
Sunni
  • 4,536
3
votes
2 answers

How prove this $\frac{a-b}{a+2b+c}+\frac{b-c}{b+2c+d}+\frac{c-d}{c+2d+e}+\frac{d-e}{d+2e+a}+\frac{e-a}{e+2a+b}\ge 0$

Let $a,b,c,d,e$ are postive real numbers,show that $$\dfrac{a-b}{a+2b+c}+\dfrac{b-c}{b+2c+d}+\dfrac{c-d}{c+2d+e}+\dfrac{d-e}{d+2e+a}+\dfrac{e-a}{e+2a+b}\ge 0$$ My try:…
math110
  • 93,304
3
votes
1 answer

How find this maximum of the $|(z-a)^2(z+b)|$

let $a,b$ is give postive numbers,let $z\in C$, and such $$|z|=1$$ Find the maximum $$u=|(z-a)^2(z+b)|,a,b>0$$ My try: since $$z=x+yi,|z|=1\Longrightarrow x^2+y^2=1$$ then we have $$(|((x-a)+yi)^2((x+b)+yi)|$$ and then it's very ugly,Have someone…
user94270
3
votes
2 answers

Prove that at least two of these inequalities are true: $|a-b|\le2$, $|b-c|\le2$, $|c-a|\le2$.

It's given that: $$\begin{cases}a,b,c>0\\a+b+c\le4\\ab+bc+ac\ge4\end{cases}$$ Prove without using calculus that it's true that at least two of these are correct inequalities:$$\begin{cases}|a-b|\le2\\|b-c|\le2\\|c-a|\le2\end{cases}$$ If you think…
user26486
  • 11,331
3
votes
1 answer

Simple inequality question with division.

In this inequality, why do the typical rules for inequalities not hold up? $$(x/y) > 1 \quad x > y$$ However, it leaves out : $$-x < -y$$ When there is division involved in inequalities, do I need to be extra careful?
Jwan622
  • 5,704
3
votes
2 answers

Is $ x \log x = O(x^{1+\epsilon})$ for every $\epsilon > 0$?

I am an amateur. Claim $$ x \log x = O(x^{1+\epsilon}) \qquad (A) $$ for every $\epsilon > 0$, $x \in \mathbb{R} \;, x > 2$. Tried to disproof this, but doubt the proof is correct. Basic idea: Define $f(x,\epsilon)= \frac{x \log…
elluser
  • 130