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

How find this maximum $f(a,b,c,x,y,z)=(a-b)z+(b-c)x+(c-a)y$

let $a,b,c,x,y,z\ge 0$,and $a+b+c=x+y+z=1$,find this maximum $$f(a,b,c,x,y,z)=(a-b)z+(b-c)x+(c-a)y$$ Thank you everyone
math110
  • 93,304
2
votes
1 answer

Prove that for positive $a_n$, and $b_n$ any rearrangement of $a_n$, one has $\sum \frac{a_i}{b_i} \geq n $

Prove that for any rearrangement of $b_1, b_2, \cdots, b_n$ of the positive numbers $a_1,a_2,\cdots,a_n$ one has $\sum\limits_{i=1}^n \dfrac{a_i }{b_i} \geq n$. Attempt: First, one can write $\sum \frac{a_i}{b_i} = \sum \dfrac{a_i + b_i }{b_i} - n…
James
  • 3,997
2
votes
2 answers

Inequality: $\frac{a^2+b^2}{(a+b)^4}+\frac{b^2+c^2}{(b+c)^4}+\frac{c^2+d^2}{(c+d)^4}+\frac{d^2+a^2}{(d+a)^4} \leq \frac{1}{abcd}$

If $ab+bc+cd+da\leq 8$ and $a,b,c,d \in \mathbb{R}_{+},$how can I prove the following inequality : $$\frac{a^2+b^2}{(a+b)^4}+\frac{b^2+c^2}{(b+c)^4}+\frac{c^2+d^2}{(c+d)^4}+\frac{d^2+a^2}{(d+a)^4} \leq \frac{1}{abcd}$$ I use : $$\frac{a+b}{2}\geq…
Iuli
  • 6,790
2
votes
1 answer

If $a,b,c>0$ prove that $\frac{a^3}{b}+\frac{b^3}{c}+\frac{c^3}{a} \ge ab+bc+ca$

If $a,b,c>0$ prove that $\frac{a^3}{b}+\frac{b^3}{c}+\frac{c^3}{a} \ge ab+bc+ca$ Simplifying yields $a^4c+b^4a+c^4b \ge ab^2c^2+a^2b^2c+a^2bc^2$ Which readily follows from muirhead. I read some where that all muirhead 'like' inequalities can be…
2
votes
0 answers

How prove this inequality with $x_{1}+x_{2}+\cdots+x_{n}=n$

Let $x_{1},x_{2},\cdots,x_{n}>0$,and $x_{1}+x_{2}+\cdots+x_{n}=n$,show that $$\sum_{i=1}^{n}\dfrac{i}{1+x_{i}+x^2_{i}+\cdots+x^{i-1}_{i}}\le\sum_{i=1}^{n}\dfrac{i+1}{1+x_{i}+x^2_{i}+\cdots+x^i_{i}}\tag{1}$$ I try prove…
math110
  • 93,304
2
votes
1 answer

The biggest whole number that is a solution of $x^2+(\sqrt3-\sqrt2)x-\sqrt6>0$

I should find the biggest whole number that is a solution of $x^2+(\sqrt3-\sqrt2)x-\sqrt6>0$. We can find that the discriminant $D=(\sqrt2+\sqrt3)^2$ and the roots are $x_1=-\sqrt3$ and $x_2=\sqrt2$. So I think the solutions are $x\in…
2
votes
2 answers

How prove this inequality $\frac{a^2}{b}+\frac{b^2}{c}+\frac{c^2}{a}<6$

let $a,b,c\ge\dfrac{1}{3}$,and such $$a^2+b^2+c^2=a+b+c$$ show that $$\dfrac{a^2}{b}+\dfrac{b^2}{c}+\dfrac{c^2}{a}<6$$ I try:$$a-a^2=(b^2-b)+(c^2-c)\ge-\dfrac{1}{4}-\dfrac{1}{4}=-\dfrac{1}{2}$$ so we have $$a^2-a-\dfrac{1}{2}\le 0\Longrightarrow…
math110
  • 93,304
2
votes
0 answers

An inequality involving 2n complex numbers

This is a problem I saw on another website and that didn't have a solution. I also suspect it doesn't have a trivial solution, hence why I post it here: let $\{x_i\}_{i=1}^n$ and $\{y_i\}_{i=1}^n$ be complex. Then, the following inequality…
Ivan
  • 2,324
2
votes
2 answers

Inequality replacement of numbers

I'm looking for a contradiction or a proof. Suppose we have the following inequality: $a\cdot j \leq b \cdot h$ Where $a,b,j,h \in \mathbb{N}$. We now replace $a$ with $a_{1}$ and $b$ with $b_{1}$, where $a_{1}, b_{1} \in \mathbb{N}$. We also have…
user11775
  • 333
2
votes
3 answers

how to prove this inequality with $a,b,c\in [1,3]$

let $a,b,c\in [1,3]$,show that $$3\left(\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}\right)+\dfrac{45}{a+b+c}\ge 16\left(\dfrac{1}{a+b}+\dfrac{1}{b+c}+\dfrac{1}{c+a}\right)$$ I had found this simaler…
math110
  • 93,304
2
votes
1 answer

How prove this inequality with $\{x_{i}\}$

if $n>3$ be give positive integers,let $x_{i}>0$ and $x_{i}\notin Z,i=1,2,\cdots,,n$,such $x_{1}+x_{2}+\cdots+x_{n}=n$,find in closed form the best constant $C_{1}(n),C_{2}(n)$ such $$C_{1}(n)\le \sum_{i=1}^{n}\dfrac{x_{i}\{x_{i}\}}{1+x_{i}}\le…
math110
  • 93,304
2
votes
2 answers

$|x+y|^p \leq |x|^p + |y|^p$ for $0 < p < 1$.

How can I prove the inequality $|x+y|^p \leq |x|^p+ |y|^p$ for $0 < p < 1$ and $x,y \in \mathbb{C}$. I have an idea when $x,y \in \mathbb{R}$: then I can prove the equivalent $$(1+s)^p \leq 1+ s^p$$ where $s > 0$ but for the complex case I don't…
user745578
2
votes
5 answers

maximum value of $ac+bd$

If $a,b,c,d\in \mathbb{R}$ and $a^2+b^2\leq 2$ and $c^2+d^2\leq 4.$ Then maximum value of $ac+bd$ is what i…
jacky
  • 5,194
2
votes
4 answers

Tough multivariable inequality: Minimize $a^2 + b^3 + c^4$ given $a + b^2 + c^3 = \frac{325}{9}$

Let $a,$ $b,$ and $c$ be positive real numbers such that $a + b^2 + c^3 = \frac{325}{9}.$ Find the minimum value of $a^2 + b^3 + c^4.$
doingmath
  • 419
2
votes
2 answers

Find the minimum of $a + b + c$

Let $a, b, c$ be non-negative real numbers such that $$abc[(a − b)(b − c)(c − a)]^2 = 1$$ Find the minimum of $a + b + c$. Source: https://cms.math.ca/crux/v43/n5/public_Chow_et_al_43_5.pdf My Attempt: $a \mapsto \frac{x+y}{2}$ $b \mapsto…
Taha Direk
  • 1,220