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

Inequality (Minkowski)

Given $T:\mathbb{R}^{2}\to \mathbb{R}$ s.t. \begin{eqnarray*} |T(x)|\leq \sum_{k=1}^{2}|x_{k}|\,and\,|T(x)-T(y)|\leq \sum_{k=1}^{2}|x_{k}-y_{k}| \end{eqnarray*} for all $x=(x_{1},x_{2}),\,y=(y_{1},y_{2})\in \mathbb{R}^{2}$ Assumption1: For all $i…
ko4
  • 541
3
votes
1 answer

Stronger version of AM-GM with condition

If $a,b,c>0$ and $a^2+b^2+c^2=3$, prove that $$a+b+c\ge 3(abc)^{13/76}.$$ I was thinking of using AM-GM :P but clearly some clever trick is needed. I was thinking about expanding but that is not feasible too. Note I would like a non-computational…
shadow10
  • 5,616
3
votes
2 answers

Showing $(a^{2}+2)(b^{2}+2)(c^{2}+2)\geq 9(ab+bc+ca)$

Let $a$, $b$, $c$ be nonnegative real numbers. Prove $(a^{2}+2)(b^{2}+2)(c^{2}+2)\geq 9(ab+bc+ca)$.
chloe_shi
  • 2,855
3
votes
2 answers

Which Inequality? $\sum_{i=1}^{n}\frac{1}{x_i}\geqslant1$

Can we prove this? What is the name for this inequality? Or is there a counter example? $$\forall\;x_i\gt0\mid\prod_{i=1}^{n}x_i=1,\;\;\;\;\;\sum_{i=1}^{n}\dfrac{1}{x_i}\geqslant1.$$
x.y.z...
  • 1,150
3
votes
3 answers

Prove this inequality: If $|x+3|< 0.5$, show that $|4x+13| < 3$

If $|x + 3| < 0.5$, show that $|4x + 13| < 3$ This is what I've got so far: $|4x + 13| = |(x + 3) + (3x + 10)|$ by the Triangle Inequality: $|(x + 3) + (3x + 10)| \le |x + 3| + |3x + 10|$ Now I continue to apply the Triangle Inequality to reach:…
3
votes
1 answer

Preserving the order of a sequence of real numbers

If a have a sequence of real numbers ordered from greatest to smallest $Y_o\geq Y_1 \geq...\geq Y_k$ and I divide each number of the sequence by $\delta<0$, is the order of the sequence flipped, i.e. $\frac{Y_0}{\delta}\leq…
Star
  • 222
3
votes
1 answer

Is there a constant that reverses Jensen's inequality?

The general Jensen's inequality states: $\varphi\left(\mathbb{E}[X]\right) \leq \mathbb{E}\left[\varphi(X)\right]$. I'm wondering if there is a constant $c$ (function of $\varphi$), such that $c\varphi\left(\mathbb{E}[X]\right) \geq…
Thomas Ahle
  • 4,612
3
votes
0 answers

Prove that $x_1x_2x_3\cdots x_n>y_1y_2y_3\cdots y_m$ with some given conditions

$x_1, x_2, x_3,.\cdots ,x_n$ and $y_1, y_2, y_3,\ldots,y_m$ are two series of positive integers, such that $m\not=n$. Given that $1 y_1+ y_2+ y_3+\cdots+y_m$,…
Satvik Mashkaria
  • 3,636
  • 3
  • 19
  • 37
3
votes
4 answers

Proving inequality $x^{10}-x^6+x^2-x+1>0$

How can the inequality $x^{10}-x^6+x^2-x+1>0$ be proved a) using elementary mathematical methods? b) using higher mathematical methods?
3
votes
3 answers

How to prove $||A| - |B|| \le |A -B|$

Suppose A and B are real numbers, prove following inequality: $$ ||A| - |B|| \leq |A - B| $$ How to prove this inequality? Thanks.
3
votes
3 answers

Proving $\left(A-1+\frac1B\right)\left(B-1+\frac1C\right)\left(C-1+\frac1A\right)\leq1$

$A,B,C$ are positive reals with product 1. Prove that $$\left(A-1+\frac1B\right)\left(B-1+\frac1C\right)\left(C-1+\frac1A\right)\leq1$$ How can I prove this inequality. I just need a hint to get me started. Thanks
Ryan214
  • 31
3
votes
3 answers

Finding an inequality for a word problem

A little bit of background - I am currently in high school learning system of equations and inequalities. We've done things like linear inequalities, inequalities with parabolas, and a combination of those points. I have a homework problem that I am…
DMan
  • 209
3
votes
1 answer

proving $\frac{1+a}{1-a}+\frac{1+b}{1-b}+\frac{1+c}{1-c}\leq 2(\frac{b}{a}+\frac{c}{b}+\frac{a}{c})$

For $a+b+c=1; a,b,c>0$, prove that $$ \frac{1+a}{1-a}+\frac{1+b}{1-b}+\frac{1+c}{1-c} \leq 2\left(\frac{b}{a}+\frac{c}{b}+\frac{a}{c}\right). $$
jdth
  • 31
3
votes
2 answers

How prove this $100+5(a^2+b^2+c^2)-2(a^2b^2+b^2c^2+a^2c^2)-a^2b^2c^2\ge 0$

let $a,b,c\ge 0$, and such $$a+b+c=6$$ show that $$100+5(a^2+b^2+c^2)-2(a^2b^2+b^2c^2+a^2c^2)-a^2b^2c^2\ge 0$$ My idea:…
math110
  • 93,304