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

Upper bound on $x_{i+1} = x_i (1-(1-\frac{1}{n})^{x_{i}-1})$ with $x_0=n$

I am trying to upper bound the convergence speed of $x_{i+1} = x_i (1-(1-\frac{1}{n})^{x_{i}-1})$ with $x_0=n$ to below $1$. I can get a "trivial" upper bound using $$x_{i+1} = x_i (1-(1-\frac{1}{n})^{x_{i}-1}) \leq x_i(1-\frac{1}{e}) \leq ... \leq…
AspiringMat
  • 2,483
  • 1
  • 17
  • 32
2
votes
1 answer

“exponential function converts addition to multiplication” from Wikipedia

In Inequality of arithmetic and geometric means, it says: "Intuitively this corresponds to the fact that the exponential function, which converts addition to multiplication, is strictly convex ...". How is this meant?
Basti
  • 21
2
votes
3 answers

how solve the inequality $−1\leq \leq1$?

How can we solve this equation graphically ? why we talk about the two hyperbole $\frac{1}{x}$ and $\frac{-1}{x}$ ? I divided this equation on two sub-equations $$ xy\leq1$$ and $$xy\geq-1$$. For the first sub-equation I have two cases when x is…
2
votes
2 answers

Is $3\le 11$ a true statement?

$$3(x+1) \le 3x+11$$ simplified: $3 \le 11$. What is $x$ solution in bracket form? I think that the expected answer is $(-\infty,\infty)$ a true statement, but it does not feel quite right to me because $3$ is always inferior to $11$ but never…
2
votes
1 answer

Refinement about :$\left(\left(1-x\right)^{-\left(2x\right)}-1\right)\left(\left(x\right)^{-\left(2\left(1-x\right)\right)}-1\right)\geq 1$

Claim : Let $0.5\leq x<1$ then it seems we have : $$\left(\left(1-x\right)^{-2x}-\frac{\left(1-x\right)^{2x}\left(x\right)^{2\left(1-x\right)}}{2^{4}\left(x\left(1-x\right)\right)^{3}}\right)\left(x^{-2\left(1-x\right)}-1\right)\geq 1$$ Background…
2
votes
2 answers

Proof for: If $x>-a$ for $a>0$, then $x\geq0$

I came across a claim that If $$ x>-a \text{ }\forall \text{ } a>0 $$ then $$ x\geq0 $$ This claim is mentioned here (the answer). When graphed, $x$ does occupy places between $-a$ and $0$ and therefore I don't understand how $x\geq0$ except when…
2
votes
2 answers

How to solve this inequality where two zeroes of different factors of the numerator are the same? How do we solve this using sign-scheme method?

$\dfrac{(e^x-1)x^{49}(1-x)(x-3)^{50}}{(x-2)(x-4)}\geqslant0$ Here, when I find zeroes of $(e^x-1)$ and $x^{49}$, both of them are zero. The solution set for this inequality in my book is given as $x\in(-\infty, 1] ∪ (2,3]$ but I can't figure out if…
2
votes
1 answer

The maximum of squared summation of fixed number of elements

For $n (n\geq1)$ non-negative real numbers $x_1,x_2,\cdots,x_n$, if their summation is fixed $$ \sum_{i=1}^{n}x_i=a, $$ please prove $$ \sum_{i=1}^nx_i^2\leq a^2. $$ My solution: I prove this question using mathematical induction. Suppose in the…
2
votes
1 answer

Question on a symmetric inequality

Let $a, b,c $ are positive real number satisfying $a^2+b^2+c^2+2abc=1$. How can I prove that $a+b+c\ge \dfrac{3}{2}$ ?
Arsenaler
  • 3,930
2
votes
1 answer

How to show $x_k \in \mathbb R, \frac {\sum{x_k}}{n} \leq \left(\frac{\sum{x_k}^2}{n}\right)^n$?

Prove that, for arbitrary real numbers $x_1,x_2,x_3...,x_n$ $$\frac{x_1+x_2+x_3...+x_n}{n} \leq \left(\frac{x_1^2+x_2^2+x_3^2...+x_n^2}{n}\right)^n$$ What theorem would you use to prove the following inequality? I would also like to know how to…
Adienl
  • 1,069
2
votes
1 answer

Inequality proof $\prod_{cyc} (ab+1)$

Prove that if for positive reals $a,b,c$ with $a^2+b^2+c^2+ab+bc+ca \le 2$ and $a+b+c=1$ then $$(ab+1)(bc+1)(ca+1)\ge ((1-a)(1-b)(1-c))^2.$$ I've tried expanding and i've noticed that $a+b+c=1$ and $a^2+b^2+c^2+ab+bc+ca\le 4$ imply $a^2+b^2+c^2 \le…
2
votes
1 answer

Simple proof that $\sum_{k = 1}^\infty \sum_{n = 1}^\infty a_k b_n / (k + n) \lesssim (\sum_k a_k^2)^{1/2} (\sum_n b_n^2)^{1/2}$

I have a complicated proof involving real interpolation + restricted bounds on operators, but I can only imagine there is a simpler proof of this statement involving some combinations of basic inequalities, such as Cauchy-Schwartz.
Jacob Denson
  • 2,129
2
votes
2 answers

A bounded 6 variable multinomial inequality

I am trying to show the following inequality: $$2-DBC-AEC-ABF+ABCDEF\geq 0$$ where $A,B,C,D,E,F\in[0,1]$. It seems to be true from desmos and it passes a million random test cases on Mathematica. If it helps, we can also assume that $A>D,B>E,C>F$,…
Isaac Browne
  • 8,076
2
votes
2 answers

Prove that:$(x+y)(y+z)(z+x)\ge8(x+y+z)\sqrt[3]{x^2y^2z^2}$

Let $x,y,z>0$ Prove that:$$(x+y)(y+z)(z+x)\ge8(x+y+z)\sqrt[3]{x^2y^2z^2}$$ Again, I think of Schur, and the inequality is reversed again. By Schur, $$(x+y)(y+z)(z+x)\ge 8xyz$$ and we need to prove $$xyz\ge(x+y+z)\sqrt[3]{x^2y^2z^2}$$ But in fact,…