Questions on proving, manipulating and applying inequalities.

learn more… | top users | synonyms (1)

7
votes
10answers
393 views

How to prove that $\log(x)<x$ when $x>1$?

It's very basic but I'm having trouble to find a way to prove this inequality $\log(x)<x$ when $x>1$ ($\log(x)$ is the natural logarithm) I can think about the two graphs but I can't find ...
49
votes
9answers
4k views

Comparing $\pi^{e}$ and $e^{\pi}$

How can I calculate without calculator or something like this the values of $\pi^{e}$ and $e^{\pi}$ in order to compare them ?
6
votes
1answer
2k views

Inequality involving $\limsup$ and $\liminf$: $ \liminf(a_{n+1}/a_n) \le \liminf((a_n)^{(1/n)}) \le \limsup((a_n)^{(1/n)}) \le \limsup(a_{n+1}/a_n)$

This may have been asked before, however I was unable to find any duplicate. This comes from pg. 52 of "Mathematical Analysis: An Introduction" by Browder. Problem 14: If $(a_n)$ is a sequence in ...
18
votes
2answers
41k views

Reverse Triangle Inequality Proof

I've seen the full proof of the Triangle Inequality \begin{equation*} |x+y|\le|x|+|y|. \end{equation*} However, I haven't seen the proof of the reverse triangle inequality: \begin{equation*} ...
18
votes
7answers
7k views

How to prove and interpret $\operatorname{rank}(AB) \leq \operatorname{min}(\operatorname{rank}(A), \operatorname{rank}(B))$?

Let $A$ and $B$ be two matrices which can be multiplied. Then $$\operatorname{rank}(AB) \leq \operatorname{min}(\operatorname{rank}(A), \operatorname{rank}(B)).$$ I proved ...
43
votes
13answers
3k views

Proofs of AM-GM inequality

The arithmetic - geometric mean inequality states that $$\frac{x_1+ \ldots + x_n}{n} \geq \sqrt[n]{x_1 \cdots x_n}$$ I'm looking for some original proofs of this inequality. I can find the usual ...
23
votes
1answer
1k views

How do you prove Gautschi's inequality for the gamma function?

A few answers here on math.SE have used as an intermediate step the following inequality that is due to Walter Gautschi: $$x^{1-s} < \frac{\Gamma(x+1)}{\Gamma(x+s)} < (x+1)^{1-s},\qquad x > ...
18
votes
2answers
4k views

On the equality case of the Hölder and Minkowski inequalites

I'm following the book Measure and Integral of Richard L. Wheeden and Antoni Zygmund. This is the problem 4 of chapter 8. Consider $E\subseteq \mathbb{R}^n$ a measurable set. In the following all the ...
14
votes
4answers
3k views

Is the Euler phi function bounded below?

I am working on a question for my number theory class that asks: Prove that for every integer $n \geq 1$, $\phi(n) \geq \frac{\sqrt{n}}{\sqrt{2}}$. However, I was searching around Google, and on ...
49
votes
21answers
4k views

Simplest or nicest proof that $1+x \le e^x$

The elementary but very useful inequality that $1+x \le e^x$ for all real $x$ has a number of different proofs, some of which can be found online. But is there a particularly slick, intuitive or ...
16
votes
1answer
713 views

Prove that $(p+q)^m \leq p^m+q^m$

If $p,q$ are positive quantities and $0 \leq m\leq 1$ then Prove that $$(p+q)^m \leq p^m+q^m$$ Trial: For $m=0$, $(p+q)^0=1 < 2= p^0+q^0$ and for $m=1$, $(p+q)^1=p+q =p^1+q^1$. So, For ...
13
votes
4answers
39k views

Proof of triangle inequality

I understand intuitively that this is true, but I'm embarrassed to say I'm having a hard time constructing a rigorous proof that $|a+b| \leq |a|+|b|$. Any help would be appreciated :)
12
votes
6answers
3k views

Proving $\sum\limits_{k=1}^{n}{\frac{1}{\sqrt{k}}\ge\sqrt{n}}$ with induction

I am just starting out learning mathematical induction and I got this homework question to prove with induction but I am not managing. $$\sum\limits_{k=1}^{n}{\frac{1}{\sqrt{k}}\ge\sqrt{n}}$$ ...
4
votes
17answers
648 views

How to prove this inequality $ x + \frac{1}{x} \geq 2 $

I was asked to prove that: $$x + \frac{1}{x}\geqslant 2$$ for all values of $ x > 0 $ I tried substituting random numbers into $x$ and I did get the answer greater than $2$. But I have a ...
11
votes
2answers
639 views

If $\sigma_n=\frac{s_1+s_2+\cdots+s_n}{n}$ then $\operatorname{{lim sup}}\sigma_n \leq \operatorname{lim sup} s_n$

This is a question from the book Methods of Real Analysis by R. R. Goldberg. If $(s_n)$ is a sequence of real numbers and if $$\sigma_n=\frac{s_1+s_2+\cdots+s_n}{n}$$ then prove that: ...
12
votes
2answers
9k views

Proof of upper-tail inequality for standard normal distribution

$X \sim \mathcal{N}(0,1)$, then to show that for $x > 0$, $$ \mathbb{P}(X>x) \leq \frac{\exp(-x^2/2)}{x \sqrt{2 \pi}} \>. $$
14
votes
2answers
3k views

How do you show that $l_p \subset l_q$ for $p \leq q$?

I can't seem to work out the inequality $(\sum |x_n|^q)^{1/q} \leq (\sum |x_n|^p)^{1/p}$ for $p \leq q$ (which I'm assuming is the way to go about it).
28
votes
6answers
2k views

Proving : $ \bigl(1+\frac{1}{n+1}\bigr)^{n+1} \gt (1+\frac{1}{n})^{n} $

How could we prove that this inequality holds $$ \left(1+\frac{1}{n+1}\right)^{n+1} \gt \left(1+\frac{1}{n} \right)^{n} $$ where $n \in \mathbb{N}$, I think we could use the AM-GM inequality ...
7
votes
4answers
6k views

lim sup inequality $\limsup ( a_n b_n ) \leq \limsup a_n \limsup b_n $

I´m not sure how to start with this proof, how can I do it? $$ \limsup ( a_n b_n ) \leqslant \limsup a_n \limsup b_n $$ I also have to prove, if $ \lim a_n $ exists then: $$ \limsup ( a_n b_n ) = ...
13
votes
10answers
1k views

Prove by induction that for all $n \geq 3$: $n^{n+1} > (n+1)^n$

I am currently helping a friend of mine with his preperations for his next exam. A big topic of the exam will be induction, thus I told him he should practice this a lot. As at the beginning he had no ...
26
votes
4answers
6k views

Purely “algebraic” proof of Young's Inequality

Young's inequality states that if $a, b \geq 0$, $p, q > 0$, and $\frac{1}{p} + \frac{1}{q} = 1$, then $$ab\leq \frac{a^p}{p} + \frac{b^q}{q}$$ (with equality only when $a^p = b^q$). Back when I ...
11
votes
4answers
5k views

Prove $\limsup\limits_{n \to \infty} (a_n+b_n) \le \limsup\limits_{n \to \infty} a_n + \limsup\limits_{n \to \infty} b_n$

I am stuck with the following problem. Prove that $$\limsup_{n \to \infty} (a_n+b_n) \le \limsup_{n \to \infty} a_n + \limsup_{n \to \infty} b_n$$ I was thinking of using the triangle inequality ...
9
votes
3answers
5k views

Proof by induction of Bernoulli's inequality: $(1 + x)^n \geq 1 + nx$

I'm asked to used induction to prove Bernoulli's Inequality: If $1+x>0$, then $(1+x)^n\geq 1+nx$ for all $n\in\mathbb{N}$. This what I have so far: Let $n=1$. Then $1+x\geq 1+x$. This is true. Now ...
6
votes
2answers
4k views

Prove the inequality $n! \geq 2^n$ by induction

I'm having difficulty solving an exercise in my course. The question is: Prove that $n!\geq 2^n$. We have to do this by induction. I started like this: The lowest natural number where the ...
11
votes
2answers
541 views

Prove $(a_1+b_1)^{1/n}\cdots(a_n+b_n)^{1/n}\ge \left(a_1\cdots a_n\right)^{1/n}+\left(b_1\cdots b_n\right)^{1/n}$

consider positive numbers $a_1,a_2,a_3,\ldots,a_n$ and $b_1,b_2,\ldots,b_n$. does the following in-equality holds and if it does then how to prove it ...
9
votes
4answers
715 views

$X_n\leq Y_n$ implies $\liminf X_n \leq \liminf Y_n$ and $\limsup X_n \leq \limsup Y_n$

Can anyone prove this question? I tried but I didn't get any I idea, so I hope someone can solve it. Let $X_n\leq Y_n$ for each $n\in \Bbb N$. Show that $\liminf X_n \leq \liminf Y_n$ and $\limsup ...
5
votes
5answers
14k views

Proof that $n^2 < 2^n$

How do I prove the following statement by induction? $$n^2 \lt 2^n$$ $P(n)$ is the statement $n^2 \lt 2^n$ Claim: For all $n \gt k$, where $k$ is any integer, $P(n)$ (since $k$ is any integer, I ...
9
votes
5answers
9k views

how to strictly prove $\sin x<x$ for $0<x<\frac{\pi}{2}$

$$\sin x<x\,(0<x<\frac{\pi}{2})$$ In most textbooks, to prove this inequality is based on geometry illustration (draw a circle, compare arc length and chord ), but I think that strict proof ...
9
votes
3answers
638 views

How to prove $a^2 + b^2 + c^2 \ge ab + bc + ca$?

How can the following inequation be proven? $$a^2 + b^2 + c^2 \ge ab + bc + ca$$
74
votes
6answers
3k views

Prove $\left(\dfrac{2}{5}\right)^{\frac{2}{5}}<\ln{2}$

Inadvertently, I find this interesting inequality,But this problem have nice solution? prove that $$\ln{2}>(\dfrac{2}{5})^{\frac{2}{5}}$$ This problem have nice solution? Thank you. ago,I find ...
11
votes
5answers
5k views

Proving $(1 + 1/n)^{n+1} \gt e$

I'm trying to prove that $$ \left(1 + \frac{1}{n}\right)^{n+1} > e $$ It seems that the definition of $e$ is going to be important here but I can't work out what to do with the limit in the ...
7
votes
3answers
6k views

Properties of $\liminf$ and $\limsup$ of sum of sequences

Let $\{s_n\}$ and $\{t_n\}$ be sequences. I've noticed this inequality in a few analysis textbooks that I have come across, so I've started to think this can't be a typo: $\limsup\limits_{n ...
14
votes
1answer
2k views

Factorial Inequality problem $\left(\frac n2\right)^n > n! > \left(\frac n3\right)^n$

I met an inequality, I ask, do not mathematical induction to prove that: Prove \[ \left(\frac n2\right)^n > n! > \left(\frac n3\right)^n \] without using induction
6
votes
3answers
179 views

How to prove the inequality $2\sqrt{n + 1} − 2 \le 1 +\frac 1 {\sqrt 2}+\frac 1 {\sqrt 3}+ \dots +\frac 1 {\sqrt n} \le 2\sqrt n − 1$?

Prove that for any positive integer $n$, $$2\sqrt{n + 1} − 2 \le 1 +\frac 1 {\sqrt 2}+\frac 1 {\sqrt 3}+ \dots +\frac 1 {\sqrt n} \le 2\sqrt n − 1$$ Progress I think Riemann sum should be used for ...
5
votes
3answers
786 views

How do you prove ${n \choose k}$ is maximum when k is $ \lceil \frac n2 \rceil$ or $ \lfloor \frac n2\rfloor $?

How do you prove ${n \choose k}$ is maximum when k is $ \lceil \frac{n}{2} \rceil $ or $ \lfloor \frac{n}{2} \rfloor$ ? This link provides a proof of sorts but it is not satisfying. From what I ...
5
votes
4answers
620 views

Prove that $n^k < 2^n$ for all large enough $n$

If $k\ge 2$ is an integer, prove by elementary means (no calculus or limits) that there is a $N(k)$ such that $n^k < 2^n$ for all integers $n \ge N(k)$. Give an explicit form for $N(k)$.
6
votes
2answers
449 views

Show $\operatorname{rank}(A) + \operatorname{rank}(B) \ge \operatorname{rank}(A+B)$

Show $\operatorname{rank}(A) + \operatorname{rank}(B) \ge \operatorname{rank}(A+B)$, where $A,B \in M_{m\times n}(\mathbb{F})$. I'm trying to think in terms of linear transformations. We can ...
10
votes
4answers
2k views

Showing the inequality $|\alpha + \beta|^p \leq 2^{p-1}(|\alpha|^p + |\beta|^p)$

I have a small question that I think is very basic but I am unsure how to tackle since my background in computing inequalities is embarrasingly weak - I would like to show that, for a real number $p ...
9
votes
3answers
581 views

A series to prove $\frac{22}{7}-\pi>0$

After T. Piezas answered Is there a series to show $22\pi^4>2143\,$? a natural question is Is there a series that proves $\frac{22}{7}-\pi>0$? One such series may be found combining ...
19
votes
5answers
2k views

A natural proof of the Cauchy-Schwarz inequality

Most of the proofs of the Cauchy-Schwarz inequality on a pre-Hilbert space use a fact that if a quadratic polynomial with real coefficients takes positive values everywhere on the real line, then its ...
15
votes
7answers
1k views

What does $\ll$ mean?

I saw two less than signs on this Wikipedia article and I was wonder what they meant mathematically. http://en.wikipedia.org/wiki/German_tank_problem EDIT: It looks like this can use TeX commands. ...
2
votes
5answers
173 views

Proving $ 1+\frac{1}{4}+\frac{1}{9}+\cdots+\frac{1}{n^2}\leq 2-\frac{1}{n}$ for all $n\geq 2$ by induction

Question: Let $P(n)$ be the statement that $1+\dfrac{1}{4}+\dfrac{1}{9}+\cdots +\dfrac{1}{n^2} <2- \dfrac{1}{n}$. Prove by mathematical induction. Use $P(2)$ for base case. Attempt at ...
3
votes
7answers
246 views

Show that if $n>2$, then $(n!)^2>n^n$.

Show that if $n>2$, then $(n!)^2>n^n$. My work: I tried to apply induction. So, at the induction step, I need to prove, $n^n>(n+1)^{n-1}$ Here, I tried to use induction again without ...
6
votes
2answers
283 views

Prove QM-AM inequality

$$\dfrac{x_1^2+ x_2^2 + \cdots + x_n^2}n \geq \left(\dfrac{x_1+x_2+\cdots+x_n}n\right)^2$$ I don't think AM, GM can be used here. And simple expansion doesn't help too. What should I do?
3
votes
2answers
2k views

Subadditivity of the limit superior

$$ \limsup \left(f(h)+g(h)\right) \leq \limsup f(h)+ \limsup g(h).$$ How can we prove this? Any help would be appreciated.
6
votes
4answers
2k views

Showing inequality for harmonic series.

I want to show that $$\log N<\sum_{n=1}^{N}\frac{1}{n}<1+\log N.$$ But I don't know how to show this.
6
votes
5answers
348 views

Proving the AM-GM inequality for 2 numbers $\sqrt{xy}\le\frac{x+y}2$

I am having trouble with this problem from my latest homework. Prove the arithmetic-geometric mean inequality. That is, for two positive real numbers $x,y$, we have $$ \sqrt{xy}≤ \frac{x+y}{2} .$$ ...
3
votes
4answers
343 views

Does $|x|^p$ with $0<p<1$ satisfy the triangle inequality on $\mathbb{R}$?

I am curious about whether $|x|^p$ with $0<p<1$ satisfy $|x+y|^p\leq|x|^p+|y|^p$ for $x,y\in\mathbb{R}$. So far my trials show that this seems to be right... So can anybody confirm whether ...
2
votes
6answers
144 views

Prove by induction that $n^2<n!$

How can I show that $n^2<n!$ for all $n\geq 4$ Step 1 For $n=1$, the LHS=$4^2=16$ and RHS=$4!=24$. So LHS$<$ RHS. Step 2 Suppose the result be true for $n=k$ i.e., $k^2<k!$ Step 3 ...
1
vote
1answer
238 views

Series and integrals for inequalities and approximations to $\pi$

Fundamentals Two beautiful expressions that relate $\pi$ to its convergents are Dalzell integral $$\frac{22}{7}-\pi=\int_0^1\frac{x^4(1-x)^4}{1+x^2}dx$$ (see Why do we need an integral to prove ...