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

Maximize product $(a^3-a^2+2)(b^3-b^2+2)(2c^3+5c^2+9)$

Consider three real variables such that $a^2+5b^2+5c^2 = 21$. Maximize the product: $$P = (a^3-a^2+2)(b^3-b^2+2)(2c^3+5c^2+9)$$ My attempt (ideas): I suppose the first step is to give an argument that the maximum is reached when the variables are…
LHF
  • 8,491
2
votes
2 answers

Given reals $a_1, a_2, \cdots, a_{n - 1}, a_n$ such that $\sum_{i = 1}^na_1^2 = 1$. Calculate the maximum value of $\sum_{cyc}|a_1 - a_2|$.

Given reals $a_1, a_2, \cdots, a_{n - 1}, a_n$ such that $a_1^2 + a_2^2 + \cdots + a_{n - 1}^2 + a_n^2 = 1$ $(n \in \mathbb N, n \ge 3)$. Calculate the maximum value of $$\large |a_1 - a_2| + |a_2 - a_3| + \cdots + |a_{n - 1} - a_n| + |a_n -…
2
votes
1 answer

Substituting into an upper bound

I'm looking at the following excerpt from The Probabilistic Method by Alon and Spencer: I'm probably missing something very obvious, but I don't see how $f(n) < \log_2 n + \log_2 \log_2 n + O(1)$ follows from $2^{f(n)} < nf(n)$. Clearly when you…
kanso37
  • 358
2
votes
3 answers

For inequalities, such as $-p<-q$ should I square both sides or multiply both sides by -1

I am quite confused with this, if I multiply both sides with -1, the sign should be reversed; if I square it first, the sign would not be reversed. May I know what operation should I do? Thank you so much for your reply.
Henry Cai
  • 633
2
votes
2 answers

$(a_1+2a_2+\cdots+na_n)(a_1^2+\cdots+a_n^2)\geq \frac49(a_1+\cdots+a_n)^3$ for non-negative real $a_i$

For any integer $n$ and any nonnegative real numbers $a_1,\ldots,a_n$ we have $$(a_1+2a_2+\cdots+na_n)(a_1^2+\cdots+a_n^2)\geq \frac49(a_1+\cdots+a_n)^3$$ It seems to use Holder inequality, but I can't get the $\frac{4}{9}$. Thanks.
math110
  • 93,304
2
votes
1 answer

How to solve this AMM problem with 10737

This problem is from AMM 10737 (1999-05) proposed by Hassan Ali Shah Ali,Tehran,Iran. Let $m$ and $n$ be postive integers with $n\ge 2m$, and let $a_{1}\le a_{2}\le\cdots\le a_{n}$ be postive integers such…
math110
  • 93,304
2
votes
1 answer

Inequality with positive numbers and reciprocals

There are 2011 positive numbers with both their sum and the sum of their reciprocals equal to 2012. Let $x$ be one of these numbers. Find the maximum value of $x + \frac{1}{x}.$
doingmath
  • 419
2
votes
2 answers

Show that $(1+x)^p\leq1+x^p$ iff $0\leq p<1$ and $x>0$

Show that $$ (1+x)^p\leq1+x^p $$ iff $0\leq p<1$ and $x>0$ $$ f(x)=1+x^p-(1+x)^p\geq0\\ f'(x)=px^{p-1}-p(1+x)^{p-1}=p\big[x^{p-1}-(1+x)^{p-1}\big] $$ I do not see any clue of how the conditions for the above inequality can be derived ? Note: My…
Sooraj S
  • 7,573
2
votes
3 answers

Is this inequality true $xy(x^{2}+y^{2})\le\frac{(x+y)^{4}}{8}$?

Is this inequality true ? $$xy(x^{2}+y^{2})≤\dfrac{(x+y)^{4}}{8}$$ $x,y>0$ If true how ? And which inequality has use it ? I know that : $xy≤\dfrac{(x+y)^{2}}{4}$ by Am-Gm But is $x^{2}+y^{2}≤\dfrac{(x+y)^{2}}{2}$ ? In first in this rule :…
Ellen Ellen
  • 2,319
2
votes
0 answers

How prove this $\dfrac{x^y}{y^x}\ge (1+\ln{3})x-(1+\ln{3})y+1$?

let $x>0,y>0,z>0$, and $x+y+z=1$,prove that $$\dfrac{x^y}{y^x}+\dfrac{y^z}{z^y}+\dfrac{z^x}{x^z}\ge 3$$ my idea: let $f(x,y)=\dfrac{x^y}{y^x}$ then we consider $$f(x,y)\ge g(x,y)=px+qy+r$$ so $$p=\dfrac{\partial f(x,y)}{\partial…
math110
  • 93,304
2
votes
1 answer

Knowing that $a,b,c\ge0$, prove that $\sum_\text{cyc}a^2 \cdot \left[\sum_\text{cyc}\frac{1}{(b - c)^2}\right] \ge\frac{11 + 5\sqrt5}{2}$.

Knowing that $a$, $b$ and $c$ are non-negatives, prove that a/ $$(bc + ca + ab) \cdot \left[\frac{1}{(b - c)^2} + \frac{1}{(c - a)^2} + \frac{1}{(a - b)^2}\right] \ge 4$$ b/ $$(a^2 + b^2 + c^2) \cdot \left[\frac{1}{(b - c)^2} + \frac{1}{(c - a)^2}…
2
votes
2 answers

Prove that $\sum_{k=n^2+1}^{n^2+2n+1}\sqrt{k}\le 2n^2+2n+\frac{7}{6}$

prove that: $$\displaystyle\sum_{k=n^2+1}^{n^2+2n+1}\sqrt{k}\le 2n^2+2n+\dfrac{7}{6},n\ge 1$$ I find this inequality is very strong. Thank you! such:when $n=100$,we use the mathmatic $$\displaystyle\sum_{k=10001}^{10201}\approx…
math110
  • 93,304
2
votes
1 answer

Proof of an equality with products

Let $\lambda_{1},\lambda_{2},\cdots,\lambda_{n}$ be $n$ distinct real numbers. For $r=1,2,\cdots,n$, show that: $$L(r)=\sum_{p,q=1,p\neq q;p,q\neq r}\dfrac{1}{(\lambda_{r}-\lambda_{p})(\lambda_{r}-\lambda_{q})\cdot\prod_{k=1,k\neq…
math110
  • 93,304
2
votes
1 answer

Find this $f(x,y)_\min=x+2y$

let $x,y\in R$, and such as $$y\ge\displaystyle\sum_{j=0}^{50}\dfrac{1}{2^{50-j}}|x-2^{j}|+\displaystyle\sum_{j=1}^{50}\dfrac{1}{2^{j}}|x-2^{50+j}|$$ then find $$f(x,y)_\min=x+2y$$ my idea: I think we use this inequality $$|x|+|y|\ge |x+y|$$
math110
  • 93,304