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

How to prove this inverse of Holder inequality?

How to prove inverse of Hölder inequality? Let $p,q>0,a,b,x,y>0$, and such $$\dfrac{1}{p}+\dfrac{1}{q}=1$$ show that $$\left(a^p+b^p\right)^{\frac{1}{p}}\left(x^q+y^q\right)^{\frac{1}{q}}\le \max{(ax,by)}+\max{(ay,bx)}$$ For this inequality I…
user246384
8
votes
3 answers

If $x+y+z=3$, then $\sum_{\text{cyc}}\frac{x^2}{2y^2-y+3}\ge\frac{3}{4}$

Let $x,y,z>0$, be such that $x+y+z=3$. Show that $$\dfrac{x^2}{2y^2-y+3}+\dfrac{y^2}{2z^2-z+3}+\dfrac{z^2}{2x^2-x+3}\ge\dfrac{3}{4}.$$ I've tried many things but all have…
user246384
8
votes
3 answers

Prove that $\frac{x}{y}+\frac{y}{z}+\frac{z}{x} \geq 3$ for $x,y,z>0$

By considering that $$\frac{x}{y}+\frac{y}{x} \geq 2$$I can show that $$\frac{x}{y}+\frac{y}{x}+\frac{x}{z}+\frac{z}{x}+\frac{y}{z}+\frac{z}{y} \geq 6$$ But how would one go from here to prove the required result? It feels like I'm almost there but…
Trogdor
  • 10,331
8
votes
2 answers

The sum of the squares is less than or equal to the square of the sums for all $n$

I am trying to understand this proof. Rather an important part of the proof. I have already shown this is true for $n=2$ and am assuming the $a_n$ case is true. $$(a_1^2 +a_2^2 +\ldots +a_n^2) \le (a_1 +a_2 +\ldots +a_n)^2$$ Want to show…
Zeta10
  • 787
8
votes
3 answers

Minimizing Sum of Reciprocals

Find the minimum value, in terms of $k$ of $\frac{1}{x_1}+…+\frac{1}{x_n}$ if $x_1^2+x_2^2+…+x_n^2=n$ and $x_1+x_2+…+x_n=k$, where $\sqrt{n} < k \leq n$. I tried the am-hm, but how to relate with the sum of squares?
user198454
8
votes
1 answer

Inequality $\frac{1}{1-abc} + \frac{1}{1-bcd} + \frac{1}{1-cda} + \frac{1}{1-dab} \le \frac{32}{7}$

If $a,b,c,d$ are positive real numbers such that $a^2+b^2+c^2+d^2 = 1$, Prove that: $$\frac{1}{1-abc} + \frac{1}{1-bcd} + \frac{1}{1-cda} + \frac{1}{1-dab} \le \dfrac{32}{7}$$ I saw this problem is very similar to the problem I have got but with…
sciona
  • 3,700
8
votes
2 answers

Why this power inequality for sums of real numbers holds?

$$\left|\sum_{i=1}^nx_i\right|^p \leq \begin{cases} \sum_{i=1}^n|x_i|^p & p\in(0,1]\\ n^{p-1}\sum_{i=1}^n|x_i|^p & p>1 \end{cases}$$ Can it be generalized for arbitrary sequences $\{x_i\}_{i=1}^n$ in Hilbert spaces in case $p=2$?
Laimond
  • 541
7
votes
2 answers

minimize a function using AM-GM inequality

I want to minimize the function $$ \frac{x}{1-x^2} + \frac{y}{1-y^2} + \frac{z}{1-z^2} $$ subject to the constraint $$x^2 + y^2 + z^2 = 1 \space\text{and} \space x,y,z > 0$$ Wolfram Alpha tells me that the minimum occurs at…
7
votes
3 answers

If $a+b+c=1$ and $abc>0$, then $ab+bc+ac<\frac{\sqrt{abc}}{2}+\frac{1}{4}.$

Question: For any $a,b,c\in \mathbb{R}$ such that $a+b+c=1$ and $abc>0$, show that $$ab+bc+ac<\dfrac{\sqrt{abc}}{2}+\dfrac{1}{4}.$$ My idea: let $$a+b+c=p=1, \quad ab+bc+ac=q,\quad abc=r$$ so that $$\Longleftrightarrow…
math110
  • 93,304
7
votes
1 answer

Inequality involving square roots

I need help with this inequality: $\sqrt x +\sqrt{x+7} + 2\sqrt{x^2+7x} <35-2x$ It doesn't seem solvable. All roots of the corresponding equation are irrational.
chen h.
  • 723
7
votes
1 answer

Linear inequality problem: $2x + 1 > 10$

$2x + 1 > 10$ $2x > 9$ $x > 4.5$ The answer in the book says: $x\lt 4.5$. Am I doing it wrong?
Akshat
  • 73
7
votes
2 answers

How to prove $\prod_{i=1}^{r}\left(1+\frac{1}{x_{i}}\right)\le \frac{2^{2^r}-1}{2^{2^r-1}}$?

Let $x_{1},x_{2},\cdots,x_{r}$ be positive integers such that $$1\le x_{1}\le x_{2}\le \cdots\le x_{r}$$ and $$\prod_{i=1}^{r}\left(1+\dfrac{1}{x_{i}}\right)<2.$$ then Show that $$\prod_{i=1}^{r}\left(1+\dfrac{1}{x_{i}}\right)\le…
math110
  • 93,304
7
votes
2 answers

If $a_1a_2\cdots a_n=1$, then the sum $\sum_k a_k\prod_{j\le k} (1+a_j)^{-1}$ is bounded below by $1-2^{-n}$

I am having trouble with an inequality. Let $a_1,a_2,\ldots, a_n$ be positive real numbers whose product is $1$. Show that the sum $$…