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

Establish the inequality $\frac{1}{n}\sum_{i=1}^{n}x_{i}x_{n-i+1} < \left(\frac{1}{n}\sum_{i=1}^{n}x_{i}\right)^2$

Given a finite increasing sequence of real numbers $\{x_i\}_{i=1}^n$ consisting of at least two elements, how can we show that $$ \frac{1}{n}\sum_{i=1}^{n}x_{i}x_{n-i+1} < \left(\frac{1}{n}\sum_{i=1}^{n}x_{i}\right)^2 $$ without expanding. I…
venrey
  • 535
3
votes
2 answers

Backwards Compound Inequalities?

Some textbooks I've seen declare inequalities such as $-2>x>2$ to have no solution, or to be ill-defined, which I disagree with. I'm curious to know if anyone else thinks the same. Inequalities can always be written two ways. For example, $x>2$ is…
3
votes
1 answer

Inequality Question

Assume that $a_1, \dots,a_n $ and $b_1, \dots,b_n$ are $2n$ non-negative real numbers. We have $$\sum_{i=1}^na_i = \sum_{i=1}^nb_i$$ We're to prove that $$\sqrt2 \sum_{i=1}^n (\sqrt{a_i}-\sqrt {b_i})^2 \ge \sum_{i=1}^n|a_i-b_i|.$$ Can anyone…
3
votes
3 answers

the inequality $2x^p - x^{p-1} - x + 2 \ge 0 \quad (x>0, \; p \ge 1)$

Calling the left member $f(x)$, I have $f'(x) = 2px^{p-1} - (p-1) x^{p-2} - 1 = 0$ as the equation for the critical point(s). There appears to be only one, in the interval $[0,1]$, but that's just an observation from plotting $f(x)$ for a few…
3Wave
  • 143
3
votes
3 answers

Sharp Constant in this Inequality

Suppose $x\geq0$, $\epsilon>0$ and $p\in (1,\infty)$. How can i find the best constant ( if it exists!) $C>0$ in the inequality ($p$ and $\epsilon$ fixed):$$\frac{(\epsilon^2+x^2)^\frac{p-2}{2}}{\epsilon^{p-2}+x^{p-2}}\leq C,\ x\geq 0$$ Thanks Edit:…
Tomás
  • 22,559
3
votes
0 answers

How prove this inequality with $xyz\ge 1$

Let $x,y,z>0$ and such $xyz\ge 1$,show that $$\sum_{cyc}\dfrac{2}{2+x+3y}\le\sum_{cyc}\dfrac{1}{2+x}$$I tried C-S,Jenson inequality but without success.
wightahtl
  • 739
  • 3
  • 12
3
votes
1 answer

Inequality with constraint

I've been trying to prove the following inequality without success. For $a,b,c \in \mathbb{R}$ such that $abc=1$, prove that: $$\frac{1}{a^2+a+1}+\frac{1}{b^2+b+1} + \frac{1}{c^2+c+1} \geq 1$$
Adam
  • 835
  • 2
  • 8
  • 14
3
votes
1 answer

General cyclic inequality in $n$ variables.

Consider positive numbers $ x_0,\ldots, x_{n-1}$, and extend the sequence cyclicly by setting $ x_i=x_{i\,{\rm mod}\,n}$. Now, for $1\le k\le n$ we define $ f_k(t_0,t_1,\ldots, t_{k-1})=\prod_{j=0}^{k-1}t_j$ and we set…
Felix Klein
  • 1,871
3
votes
2 answers

Proof of Rearrangement Inequality

Let $a_1 \ge a_2 \ge \cdots \ge a_n$ and $b_1 \ge b_2 \ge ... \ge b_n$. Then $a_1b_1 + a_2b_2 + \cdots + a_nb_n \ge a_1b_{\pi(1)} + a_2b_{\pi(2)} + \cdots + a_nb_{\pi(n)}$ The proof I'm reading uses an exchange argument. Consider a permutation…
user137481
  • 2,605
3
votes
1 answer

Prove Alexander Kovaćec inequality

Let $x_{1},x_{2},\cdots,x_{n}>0$,show that $$n\left(\dfrac{3-2\sqrt{2}}{2\sqrt{2}}\right)\min_{1\le i\le…
math110
  • 93,304
3
votes
1 answer

how prove this nice inequality $\max\{|z_{1}z_{2}|^2-2|z_{1}|^2-|z_{3}|^2,\cdots\}\}\ge 2016$

Let three complex numbers $z_{1},z_{2},z_{3}$,such $$ \{|z_{1}+z_{2}+z_{3}|,|-z_{1}+z_{2}+z_{3}|,|z_{1}-z_{2}+z_{3}|,|z_{1}+z_{2}-z_{3}|\}=\{98,84,42,28\} $$ show…
math110
  • 93,304
3
votes
2 answers

Proving $ \frac{1-(e^{-2})^x}{1-e^{-2}} \ge x $, for $0 \le x \le 1$.

How to prove that, for any real number $0 \le x \le 1$, this inequality holds ? $$ \frac{1-(e^{-2})^x}{1-e^{-2}} \ge x $$ I tried using wolfram alpha to solve for getting some idea, but the exact solution is very complex : here is the link. Thank…
eig
  • 773
3
votes
1 answer

The inequality $\frac{3\sqrt{3}}{2}\frac{27(A+B)(B+C)(C+A)}{8(A+B+C)^3}\ge \sin{A}+\sin{B}+\sin{C}$

In $\triangle ABC$, show that $$\dfrac{3\sqrt{3}}{2}\dfrac{27(A+B)(B+C)(C+A)}{8(A+B+C)^3}\ge \sin{A}+\sin{B}+\sin{C}$$ My attempt: Since $A+B+C=\pi$, it suffices to show that $$\dfrac{3\sqrt{3}}{2}\cdot…
math110
  • 93,304
3
votes
3 answers

Inequality involving AM - GM: $\sum_{i=1}^n \frac{1}{1+a_i} \ge \frac{n}{1+{{(a_1.a_2...a_n)}}^{1/n}}$

given that $a_i > 1$, how do I prove that $$\sum_{i=1}^n \frac{1}{1+a_i} ≥ \frac{n}{1+{{(a_1.a_2...a_n)}}^{1/n}}$$ by applying AM - GM inequality? Thanks in advance!
user405919
  • 494
  • 3
  • 8
3
votes
3 answers

How can I show without induction that $n^3\geq 3n^2$ for $n\geq3$?

How can I show without induction that $n^3\geq 3n^2$ for $n\geq3$? ($n$ is a natural number). My solution $f(x)=x^3-3x^2\geq0$ for $x\geq 3$ so it follows that $n^3\geq 3n^2$ for $n\geq3$. Any other solutions? The inequality can be generalized as…
user214302