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

find the minimum of the positive real value $c$ such $x_{1}+x_{2}+\cdots+x_{n}=1$

Given the odd positive integer $n>1$, find the minimum positive real value of $c$ such that for all $x_{i}\in \Bbb R$ with $$x_{1}+x_{2}+\cdots+x_{n}=1,$$ it holds that $$c\left(\sum_{i=1}^{n}x^2_{i}\right)^3\ge…
math110
  • 93,304
8
votes
1 answer

Prove that inequality Hardy inequality

Suppose $n$ is a positive integer, $2n$ reals $x_i, y_i (1\le i \le n) $ satisfy $$\sum_{i=1}^n x_i^2 = \sum_{i=1}^n y_i^2 = 1.$$ positive reals $0 < \lambda_1 \le \lambda_2 \le ... \le \lambda_n, \ 1 \in [\lambda_1, \lambda_n].$ Prove that …
math110
  • 93,304
8
votes
4 answers

Is there a way to generate a list of distinct numbers such that no two subsets ever have an equal sum?

I'm trying to figure out a way to assign weights to a group of servers (a galera cluster of database servers), and I want to always be able to compute a quorum, meaning no set of weights should ever be allowed to add up to exactly 50% (a quorum in…
Stephen S
  • 193
8
votes
2 answers

Which is bigger $(n!)^m$ or $(m!)^n$?

Assume $m>n$, which is bigger $(m!)^n$ or $(n!)^m$? This question came about during a Taylor series approximation. Considering plot of $(n!)^{1/n}$ and Stirling's formula one guesses larger base wins.
Maesumi
  • 3,702
8
votes
1 answer

range of a fractional function

I encountered the following problem and was hinted to consider the edge case. Determine all possible values of $$S = \frac{a}{a+b+d}+\frac{b}{a+b+c}+\frac{c}{b+c+d}+\frac{d}{a+c+d}$$ where $a$, $b$, $c$ and $d$ are arbitrary positive numbers.
Hans
  • 9,804
8
votes
2 answers

prove $2 \geqslant a^{k_ob^2}+b^{k_oc^2}+c^{k_oa^2}$

$a,b,c >0$ and $a+b+c=1$, prove $$2 \geqslant a^{k_ob^2}+b^{k_oc^2}+c^{k_oa^2}$$ where $$k_o = 9 \left( \frac{\ln3-\ln2}{\ln3} \right) \approx 3.32163$$ I don't know if this inequality is true or not. Thousand of Excel calculations do not yield any…
HN_NH
  • 4,361
8
votes
4 answers

Prove inequality: When $n > 2$, $n! < {\left(\frac{n+2}{\sqrt{6}}\right)}^n$

Prove: When $n > 2$, $$n! < {\left(\frac{n+2}{\sqrt{6}}\right)}^n$$ PS: please do not use mathematical induction method. EDIT: sorry, I forget another constraint, this problem should be solved by algebraic mean inequality. Thanks.
Jichao
  • 8,008
8
votes
2 answers

An Inequality Involving $n$ positive real numbers and their sum

Consider the following problem from Problems from the Book proposed by Gabriel Dospinescu Let $a_1, a_2, \dots, a_n$ be positive real numbers and let $S = a_1 + a_2 + \dots + a_n$ be their sum. Prove that $$ \frac{1}{n} \sum_{i = 1}^n \frac{1}{a_i}…
8
votes
2 answers

Prove that $\sqrt{a}\leq\frac{1+a}{2}$

I have a math homework where it's being asked to prove that : $$\forall a \geq 0,\sqrt{a}\leq\frac{1+a}{2}$$ However, I don't have any idea how I should start this one... Any idea ?
Cydonia7
  • 891
8
votes
2 answers

To prove this log inequality (middle school)

This following Problem is from a book introduce Telescopic Sums,the book introduce the idea is use identities to write the sum in the form $$\sum_{k=2}^{n}[F(k)-F(k-1)]$$ then cansel out terms to obtain $F(n)-F(1)$. Exercise: How to show that…
math110
  • 93,304
8
votes
1 answer

Minkowski's inequality

Minkowski's inequality says the following: For every sequence of scalars $a = (a_i)$ and $b = (b_i)$, and for $1 \leq p \leq \infty$ we have: $||a+b||_{p} \leq ||a||_{p}+ ||b||_{p}$. Note that $||x||_{p} = \left(\smash{\sum\limits_{i=1}^{\infty}}…
8
votes
7 answers

Prove that if $a,b,$ and $c$ are positive real numbers, then $\frac{a^3}{b}+\frac{b^3}{c}+\frac{c^3}{a} \geq ab + bc + ca$.

Prove that if $a,b,$ and $c$ are positive real numbers, then $\dfrac{a^3}{b}+\dfrac{b^3}{c}+\dfrac{c^3}{a} \geq ab + bc + ca$. I tried AM-GM and it doesn't look like AM-GM or Cauchy-Schwarz work here. The $ab+bc+ca$ reminds of a cyclic expression,…
Jacob Willis
  • 1,601
8
votes
1 answer

How to prove this inequality $a+b+c\ge \sqrt{3}+\frac{1}{4}c^2(a-b)^2$

Let $a,b,c\ge 0,ab+bc+ca=1$, show that (1):$$a+b+c\ge \sqrt{3}$$ (2): $$a+b+c\ge \sqrt{3}+\dfrac{1}{4}c^2(a-b)^2$$ for $(1)$,I have proof,First see that: $$(a-b)^2+(b-c)^2+(c-a)^2\ge 0$$ Hence $$a^2+b^2+c^2\ge ab+bc+ca\Longrightarrow…
user246688
8
votes
1 answer

Prove that inequality $\sqrt{|a-b|}+\sqrt{|b-c|}+\sqrt{|c-d|}+\sqrt{|d-e|}+\sqrt{|e-a|}\le 3+\sqrt{2}$

let $a,b,c,d,e\in [0,1]$, show that $$\sqrt{|a-b|}+\sqrt{|b-c|}+\sqrt{|c-d|}+\sqrt{|d-e|}+\sqrt{|e-a|}\le 3+\sqrt{2}$$ I have tried to use AM-GM inequality, but get no result as follows: $$(|a-b|+|b-c|+|c-d|+|d-e|+|e-a|)(1+1+1+1)\ge…
user237685
8
votes
1 answer

Problem with inequality $\min (x_1,x_2,\ldots,x_n)$

let $0\le x_i$, $i=1,2,\ldots,n$, and $a_i=1+(i-1)d$, $d\in[0,2],\forall i\in\{1,2,3,\ldots,n\}$, show that $$(1+a_n)\left(x_1+x_2+\cdots+x_n\right)^2\ge 2n \min(x_1,x_2,\ldots,x_n) \left(\sum_{i=1}^n a_i x_i\right)$$ $n=1,2,3$ is not hard to prove…
user253631