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

prove or disprove $\ln{(1+x^2)}\cdot\ln{(1+y^2)}\ge \ln^2{(1+xy)}$

let $x,y>0$.prove or disprove $$\ln{(1+x^2)}\cdot\ln{(1+y^2)}\ge \ln^2{(1+xy)}$$ By this inequality it seem Cauchy-Schwarz inequality $$(1+x^2)(1+y^2)\ge (1+xy)^2$$ But this is Log function.so How to prove it? Thanks
math110
  • 93,304
2
votes
1 answer

Inequality for two-variable functions

Let $y\geq x\geq 1$ and $k \in \mathbb{N} \geq 1$. I want to find $f_{x,y} \geq \dfrac{1}{x^k}$ such that: $f(x,x) = \dfrac{1}{x^k}$ (This condition is to avoid trivial answers like $ y^2 \geq \dfrac{1}{x}$ for instance.) This condition gives the…
Ahmad
  • 1,380
  • 1
  • 18
  • 37
2
votes
3 answers

Prove that $\frac{a}{a+\sqrt{2013a+bc}}+\frac{b}{b+\sqrt{2013b+ca}}+\frac{c}{c+\sqrt{2013c+ab}}\leq 1$

For positive real numbers satisfying $a+b+c=2013$. Prove that $$\frac{a}{a+\sqrt{2013a+bc}}+\frac{b}{b+\sqrt{2013b+ca}}+\frac{c}{c+\sqrt{2013c+ab}}\leq 1$$ This is my attempt. We…
2
votes
5 answers

For a,b satisfying $a^2+b^2=2$. Prove that $3a+3b+ab\geq -5$.

For a,b satisfying $a^2+b^2=2$. Prove that $3a+3b+ab\geq -5$. My attempt: We have $$2(a^2+b^2)\geq (a+b)^2$$ so $$-2\leq a+b \leq 2$$ In other hand $$ab=\frac{(a+b)^2-2}{2}=(a+b)^2-1$$
2
votes
1 answer

Establish inequalities between sum of numbers in $(0,1)$

Consider six numbers in $(0,1)$ $\{a,b,c,d,e,f\}$. Suppose $$ a
Star
  • 222
2
votes
1 answer

doubt in Solving an inequality

I took upon following question- Find the values of $m$ for which given equation has real roots $\sin^2 x-(m-3)\sin x+m=0 $ So I started by first satisfying $ D>=0$ and found that $m$ should range from $(-\infty,1] \cup [9,\infty)$ However after…
Lalit Tolani
  • 3,426
2
votes
2 answers

Stronger statement for $x^{2(1-x)}+(1-x)^{2x}\leq 1$

It's an attempt to solve the problem cited here https://www.isr-publications.com/jnsa/articles-1795-a-stronger-inequality-of-cirtoajes-one-with-power-exponential-functions Problem : Let $0
2
votes
1 answer

Prove that $a^ab^bc^cd^d\geq\frac{1}{16}(ab+c+d+1)^2$

Given $a, b, c, d\in\mathbb{R^+}$ such that $abcd = 1$. Prove that $a^ab^bc^cd^d\geq\frac{1}{16}(ab+c+d+1)^2$ I've tried, $a^ab^bc^cd^d=(abcd)^ab^{b-a}c^{c-a}d^{d-a}=b^{b-a}c^{c-a}d^{d-a}\geq\frac{1}{16}(ab+c+d+1)^2$ i'm stucked
Kuhaku
  • 85
2
votes
1 answer

Given $a_1,a_2,...,a_n>0$ where $n\in\mathbb N$$, a_1+a_2+...+a_n=n$. Is this true? $a_1a_2+a_2a_3+...+a_na_1\leq n$

Given $a_1,a_2,...,a_n>0$ where $n\in\mathbb N$$, a_1+a_2+...+a_n=n$. Is this true? $$a_1a_2+a_2a_3+...+a_na_1\leq n$$ By observing: When $n=1$, this is trivial; When $n=2$, $ab\leq(\frac {a+b} 2)^2=1\leq2$; When $n=3$, $ab+bc+ca\leq(\frac {a+b}…
JSCB
  • 13,456
  • 15
  • 59
  • 123
2
votes
3 answers

How to prove/show $1- (\frac{2}{3})^{\epsilon} \geq \frac{\epsilon}{4}$, given $0 \leq \epsilon \leq 1$?

How to prove/show $1- (\frac{2}{3})^{\epsilon} \geq \frac{\epsilon}{4}$, given $0 \leq \epsilon \leq 1$? I found the inequality while reading a TCS paper, where this inequality was taken as a fact while proving some theorems. I'm not a math major,…
TCSGrad
  • 403
2
votes
7 answers

Proving that for all numbers $a, b\in\mathbb{R}$, $\min \{a, b\} \le (a+b)/2$

Can anyone help me solve the two cases that are derived from this problem?
saurs
  • 23
2
votes
4 answers

Proof involving a simple inequality

I'm struggling to prove the following inequality (for $0 \leq a \leq c$ and $0 \leq b \leq c$) $$|a-b| \leq c.$$ I see that it is true by drawing a number line and putting the numbers $a, b$ and $c$ there, but I have no idea how to prove it…
AJB
  • 99
2
votes
2 answers

Algebraic proof of an inequality being given different constraints on 2 variables

Let $x,y \in \mathbb R$ and $$(1+x+x^2)(1+y+y^2)=2x^2y^2-1$$ and assume that $2
thestar
  • 169
  • 11
2
votes
1 answer

Inequality using Bernoulli's inequality?

Let $0
maomao
  • 1,201
2
votes
1 answer

Brutal Estimate for multinomial expression

For $a,b,c\in \mathbb{R}_{+}$ and $1
Student
  • 9,196
  • 8
  • 35
  • 81