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

How prove this inequality $3b+8c+abc\le 12$ if $a^2+4b^2+9c^2=14$

let $a,b,c>0$ and such $$a^2+4b^2+9c^2=14$$show that $$3b+8c+abc\le 12$$ My idea: since \begin{align*}3b+8c+abc&=3b+c(8+ab)=3b+\dfrac{1}{9}\cdot 9c(8+ab)\le…
math110
  • 93,304
4
votes
1 answer

Inequality problem $(a+b+c)^5\geq27(ab+bc+ca)(ab^2+bc^2+ca^2)$

While solving one inequality, I arrived at a much simpler, but still nontrivial inequality $$(a+b+c)^5\geq27(ab+bc+ca)(ab^2+bc^2+ca^2)$$ where $a,b,c$ are positive real numbers. It apparently holds, but I can't seem to find a proof. The problem is…
user2345215
  • 16,422
4
votes
2 answers

How prove this set inequality $|B|\ge 2|A|^2-1$

let $A$ is a finite set ,and the element are positive integers,and let $$B=\{\dfrac{a+b}{c+d}|a,b,c,d\in A\}$$ show that $$|B|\ge 2|A|^2-1$$ where $|X|$ is define finite set$X$ numbers This is a 2014 china TST .and I see this reslut is…
math110
  • 93,304
4
votes
6 answers

How do I prove $\sqrt{x^2 + y^2} \le |x| + |y|$?

Only a hint on how to prove this, if not a complete proof, would also be appreciated.
4
votes
5 answers

Prove that, $\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}\ge 4$ where we do not use AM-GM inequality on the given statement to prove it.

Prove that, $\dfrac{a}{b}+\dfrac{b}{c}+\dfrac{c}{d}+\dfrac{d}{a}\ge 4$ where we do not use AM-GM inequality on the given statement to prove it. Typically, I am actually looking for a little advanced and elegant solution. EDIT: $a,b,c,d>0$
Hawk
  • 6,540
4
votes
4 answers

$a+b+c=3, a,b,c>0$, Prove that $a^2b^2c^2\ge (3-2a)(3-2b)(3-2c)$

$a+b+c=3, a,b,c>0$, Prove that $$a^2b^2c^2\ge (3-2a)(3-2b)(3-2c)$$ My work: From the given inequality, we can have, $a^2b^2c^2\ge 27-18(a+b+c)+12(ab+bc+ca)-8abc$ We can also have,$abc\le \bigg(\dfrac{a+b+c}{3}\bigg)^3=1$ So, $0\ge…
Hawk
  • 6,540
4
votes
2 answers

Simple Inequality Proof

Prove the following inequality $\ xX + yY \leq \sqrt{ x^2 + y^2}\cdot\sqrt {X^2 + Y^2}$ where $x, y, X$ and $Y$ are real numbers.
Ben
  • 41
4
votes
0 answers

How prove this sum equality?$\le\prod_{i=1}^{n}\left(\sum_{k=1}^{m}a_{k,i}\right)$

consider this matrix $$\begin{bmatrix} a_{1,1}&a_{1,2}&\cdots,&a_{1,n}\\ a_{21}&a_{2,2}&\cdots&a_{2,n}\\ \cdots&\cdots&\cdots&\cdots\\ a_{m,1}&a_{m,2}&\cdots&a_{m,n} \end{bmatrix}$$ where $a_{i,j}>0$, and define $$S^{(k)}_{i}=\sum_{1\le…
math110
  • 93,304
4
votes
1 answer

How prove $\sum\limits_{cyc}(f(x^3)+f(xyz)-f(x^2y)-f(x^2z))\ge 0$

let $x,y,z\in (0,1)$, and the function $$f(x)=\dfrac{1}{1-x}$$ show that $$f(x^3)+f(y^3)+f(z^3)+3f(xyz)\ge f(x^2y)+f(xy^2)+f(y^2z)+f(yz^2)+f(z^2x)+f(zx^2)$$ For this problem simlar this Schur…
math110
  • 93,304
4
votes
2 answers

If $\sum x_k=\frac12$, then $\prod\frac{1-x_k}{1+x_k}\geq\frac13$

The question is this The sum of positive numbers $x_1,x_2,x_3,\dotsc,x_n$ is $\frac{1}{2}$. Prove that $$\frac{1-x_1}{1+x_1}\cdot\frac{1-x_2}{1+x_2}\cdot\frac{1-x_3}{1+x_3}\cdots\frac{1-x_n}{1+x_n}\geq\frac{1}{3}.$$ My process was something like…
4
votes
1 answer

prove $ b^6c^8-b^5c^7+b^8c^6-b^3c^6+b^2c^6-b^7c^5-b^6c^3+b^6c^2-bc^2+c^2-b^2c+b^2 \ge 0$

$b>0,c>0, $ prove $g(b,c)=b^6c^8-b^5c^7+b^8c^6-b^3c^6+b^2c^6-b^7c^5-b^6c^3+b^6c^2-bc^2+c^2-b^2c+b^2 \ge 0$ this is from a middle process of a inequality. (I am sure it is correct because the inequality is proved.) edit: the inequality is :…
chenbai
  • 7,581
4
votes
3 answers

Ineqaulity about a convex function. $(e^x-1)\cdot \ln(x+1) >x^2$ $(x \gt 0)$?

How can I solve this inequality $(e^x-1)\cdot \ln(x+1) >x^2$ ($x > 0$)?
mathlover
  • 333
4
votes
2 answers

Inequality involving arithmetic means: $\prod_{\text{cyc: } a,b,c,d} \frac{a+b}{2} \le \prod_{\text{cyc: } a,b,c,d} \frac{a+b+c}{3}$

Let $a\geq b \geq c\geq d \geq 0$ (ordering matters). Prove that: $$\dfrac{a+b}{2}\dfrac{b+c}{2}\dfrac{c+d}{2}\dfrac{d+a}{2}\leq \dfrac{a+b+c}{3}\dfrac{b+c+d}{3}\dfrac{c+d+a}{3}\dfrac{d+a+b}{3}$$ Note: if $a=b=c=d$, then the result is a direct…
4
votes
1 answer

Prove that $\left(\frac{a}{p}\right)^p\left(\frac{b}{q}\right)^q\leq\left(\frac{a+b}{p+q}\right)^{p+q}$

Suppose $p,q> 0$ and $a,b\geq 0$, prove the following inequality $\left(\frac{a}{p}\right)^p\left(\frac{b}{q}\right)^q\leq\left(\frac{a+b}{p+q}\right)^{p+q}$ I tried taking log on both sides but this does not make things easier. Is there a more neat…
Kato yu
  • 1,621
  • 13
  • 23