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

If $n>2$, $a_2,\cdots,a_n\in\mathbb R^+$ and $a_2a_3\cdots a_n=1$, then $(1+a_2)^2(1+a_3)^3\cdots(1+a_n)^n>n^n$

Assume $n>2$, $n\in\mathbb{Z}$, and $a_2,a_3,...a_n\in\mathbb{R}^+$ such that $a_2a_3\cdots a_n=1$. Prove: $$(1+a_2)^2(1+a_3)^3...(1+a_n)^n>n^n.$$ My attempt: I have used AM-GM for inquality so the condition follows…
3
votes
7 answers

How to demonstrate this inequality?

I have this statement: If $x > 0 , y > 0$, prove that $\frac{1}{x}+\frac{1}{y} > \frac{2}{x+y}$ I will get the hypothesis? (That's what my teacher calls him, I do not know if it's correct) $\frac{1}{x}+\frac{1}{y} - \frac{2}{x+y}> 0$ $\frac{x^2 +…
ESCM
  • 3,161
3
votes
2 answers

$ \frac{1}{3a^2+1}+\frac{1}{3b^2+1}+\frac{1}{3c^2+1}+\frac{1}{3d^2+1} \geq \frac{16}{7}$

Let $a,b,c,d >0$ and $a+b+c+d=2$. Prove this: $$ \frac{1}{3a^2+1}+\frac{1}{3b^2+1}+\frac{1}{3c^2+1}+\frac{1}{3d^2+1} \geq \frac{16}{7}$$
Haruboy15
  • 990
3
votes
2 answers

How to prove that $1 + a + 4 \sqrt{1+a^{2} + b^{2}} \leq 4 \sqrt{1+a^{2}} + \sqrt{a^{2}+b^{2}} + \sqrt{1+b^{2}} + 2b $ for $a, b > 0$?

I wonder how to prove that $$1 + a + 4 \sqrt{1+a^{2} + b^{2}} \leq 4 \sqrt{1+a^{2}} + \sqrt{a^{2}+b^{2}} + \sqrt{1+b^{2}} + 2b.$$ For $a, b > 0$. The inequality arises in the context of stochastic cooperative game theory. If it holds, I can show…
Max Muller
  • 7,006
3
votes
1 answer

Proving $\frac{a}{a^2-a+1}+\frac{b}{b^2-b+1}+\frac{c}{c^2-c+1}+\frac{d}{d^2-d+1}\le \frac{8}{3}$ given $a+b+c+d=2$

Let $a,b,c,d\in \mathbb{R}$ and $a+b+c+d=2$. Prove that $$\frac{a}{a^2-a+1}+\frac{b}{b^2-b+1}+\frac{c}{c^2-c+1}+\frac{d}{d^2-d+1}\le \frac{8}{3}.$$ We have $$\frac{a}{a^2-a+1}\le \frac{4}{3}a\Longleftrightarrow…
Word Shallow
  • 1,898
3
votes
2 answers

Inequality with positive reals

For each $x,y,z>0$, define $$ f(x,y,z)=\frac{3x^2(y+z)+2xyz}{(x+y)(y+z)(z+x)}. $$ Fix also $a,b,c,d>0$ with $a\le b$. How can we prove "reasonably" the following inequality? $$ \frac{f(a,b,d)+f(c,b,d)}{f(b,a,d)+f(c,a,d)} \le \frac{a+c}{b+c}. $$
user207096
3
votes
1 answer

Inequality : $ \sqrt{\frac{a}{b+1}} + \sqrt{\frac{b}{c+1}} +\sqrt{\frac{c}{a+1}} \le \frac{3}{2} $

$a+b+c =1$ , $a, b, c>0 $ Prove $$ \sqrt{\frac{a}{b+1}} + \sqrt{\frac{b}{c+1}} + \sqrt{\frac{c}{a+1}} \le \frac{3}{2}$$ When I meet the inequality with square root symbols, I don't have any idea. It's my tragedy. I know the triangular inequality…
c-2785
  • 361
3
votes
4 answers

Help with Inequality

Given that $x, y, z$ are nonnegative real numbers such that : $$x^2 + y^2 + z^2 + xyz = 4$$ Prove that $0 ≤ xy + yz + zx − xyz ≤ 2$
3
votes
1 answer

Inequality with powers of sums

Let $x_i$ be real numbers with $\sum_{i=1}^N x_i = 0$. Show the following inequality: $$ N (\sum _{i=1}^N x_i^4) (\sum _{i=1}^N x_i^2) \ge (\sum _{i=1}^N x_i^2)^3 + N (\sum _{i=1}^N x_i^3)^2 $$ Edit: Note this particular form of the…
Andreas
  • 15,175
3
votes
2 answers

Specific inequality

Let $x,y,z$ be different real numbers . Prove that: $$\frac{x^2y^2+1}{(x-y)^2}+\frac{y^2z^2+1}{(y-z)^2}+\frac{z^2x^2+1}{(x-z)^2} \geq \frac{3}{2}$$
Haruboy15
  • 990
3
votes
1 answer

Proving the Cauchy-Schwarz inequality, spivak's calculus

I'm working on a problem concerning the Cauchy-Schwarz inequality from Spivak's calculus 3rd edition. The problem consists of completing three equivalent proofs of the inequality. In one of the proofs the inequality can be deduced from the fact…
3
votes
2 answers

Elementary Inequality from a local olympiad test

The problem I'm stuck with is the following : Let $a$, $b$, $c$, $x$, $y$ and $z$ be real numbers such that $a+x \ge b+y \ge c+z \ge 0 $ and $ a+ b+c = x+y+z$ Prove that $ay+bx \ge ac+xz$ As easy as it sounds, I didn't achieve any significant…
3
votes
4 answers

Bohr's Inequality

Can anyone point me to any reference on the following inequality: Let $c>0, a,b \in \Bbb{R}$ $$ \|a+b\|^2 \leq (1+c)\|a\|^2+(1+{\textstyle\frac{1}{c}})\|b\|^2 $$ I'm not even sure if "Bohr's Inequality" is this inequality's name, since I can't…
3
votes
0 answers

Prove this inequality $\sum_{cyc}\frac{x+y}{4+yz}\ge \frac{3}{2}$

Let $x,y,z$ are non-negative numbers such that $x^2+y^2+z^2=12$.Prove that $$\frac{x+y}{4+yz}+\frac{y+z}{4+xz}+\frac{x+z}{4+xy}\ge \frac{3}{2}$$ $$\frac{x+y}{4+yz}\ge…
Word Shallow
  • 1,898
3
votes
0 answers

Inequalities to prove that $ \frac1n \int_0^\pi\pi f'(x) \cos(nx)\, dx → 0 $

Assume that $f:[0,\pi] \to \mathbb{R}$ is a continuously differentiable function. I've been trying to prove that $$ \frac1n \int_0^\pi f'(x) \cos(nx)\, dx$$ tends to 0 and n tends to infinity. To do this, I've been told that I must show the…
mimyo
  • 198
  • 10