Questions on proving and manipulating inequalities.

learn more… | top users | synonyms (1)

5
votes
1answer
757 views

Inequality involving $\limsup$ and $\liminf$

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 ...
16
votes
6answers
2k 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 ?
13
votes
8answers
3k 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 $\operatorname{rank}(AB) \leq ...
9
votes
2answers
1k 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).
16
votes
1answer
583 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 > ...
14
votes
2answers
725 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 ...
2
votes
1answer
11k views

Reverse Triangle Inequality Proof

I've seen the full proof of the Triangle Inequality $|x+y|\le|x|+|y| $ However, I haven't seen the proof of the reverse triangle inequality: $||x|-|y||\le|x-y|$ Could you please prove this using ...
9
votes
3answers
1k 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 ...
4
votes
3answers
2k 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 ) = ...
5
votes
2answers
4k 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}} \>. $$
1
vote
1answer
1k views

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

I'm having difficulity solving an exercise in my course. The question is: Prove that $n!\geq 2^n$. We have to do this with induction. I started like this: The lowest natural number where the ...
27
votes
6answers
1k 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 ...
10
votes
2answers
459 views

An inequality : is it true if it is then how to prove it?

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 ...
19
votes
4answers
2k 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 ...
9
votes
4answers
1k 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
5answers
2k 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 ...
13
votes
7answers
781 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. ...
4
votes
3answers
3k 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 ...
3
votes
2answers
1k 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
1answer
296 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: ...
54
votes
3answers
2k 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 ...
17
votes
1answer
464 views

How prove this inequality $(a^2+bc^4)(b^2+ca^4)(c^2+ab^4) \leq 64$

Question: If $a,b,c$ are nonnegative real numbers such that $a+b+c=3,$ then $$(a^2+bc^4)(b^2+ca^4)(c^2+ab^4) \leq 64$$ My try: I found this inequality is only if $(a,b,c)=(2,0,1)$ But I ...
4
votes
12answers
402 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 ...
10
votes
6answers
1k 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}}$$ ...
6
votes
2answers
2k views

How to use triangle inequality to establish Reverse triangle inequality

I need to use $|a+b| \leq |a|+|b|$ to show that $||a|-|b|| \leq |a-b|$. I have tried to represent $||a|-|b||$ as $||a|+(-|b|)|$, and then get $||a|+(-|b|)| \leq |a|+|-|b||$, but that isn't leading ...
4
votes
4answers
255 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)$.
2
votes
5answers
2k views

Prove by mathematical induction that $2n ≤ 2^n$, for all integer $n≥1$?

I need to prove $2n \leq 2^n$, for all integer $n≥1$ by mathematical induction? This is how I prove this: Prove:$2n ≤ 2^n$, for all integer $n≥1$ Proof: $2+4+6+...+2n=2^n$ $i.)$ Let $P(n)=1 ...
14
votes
1answer
540 views

How prove this inequality $\frac{a}{b+3}+\frac{b}{c+3}+\frac{c}{d+3}+\frac{d}{a+3}\le 1$

Question: let $a,b,c,d\ge 0$,such $$a^2+b^2+c^2+d^2=4$$ show that $$\dfrac{a}{b+3}+\dfrac{b}{c+3}+\dfrac{c}{d+3}+\dfrac{d}{a+3}\le 1$$ My try: By Cauchy-Schwarz inequality,we have ...
14
votes
5answers
3k views

Prove $(-a+b+c)(a-b+c)(a+b-c) \leq abc$, where $a, b$ and $c$ are positive real numbers

I have tried the arithmetic-geometric inequality on $(-a+b+c)(a-b+c)(a+b-c)$ which gives $$(-a+b+c)(a-b+c)(a+b-c) \leq \left(\frac{a+b+c}{3}\right)^3$$ and on $abc$ which gives $$abc \leq ...
12
votes
1answer
788 views

Factorial Inequality problem

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
10
votes
2answers
324 views

Inequality $\sum_{1\le k\le n}\frac{\sin kx}{k}\ge 0$

Show the following inequality for any $x\in [0, \pi]$ and $n\in \mathbb{N}^*$, $$ \sum_{1\le k\le n}\frac{\sin kx}{k}\ge 0. $$ I have this question a very long time ago from a book or magazine but I ...
4
votes
1answer
501 views

Sobolev embedding for $W^{1,\infty}$?

From the Evans'PDE book I learned $W^{1,\infty}(U)$ coincide with Lipschitz continuous $C^{0,1}(U)$ with $U\in\Bbb{R}^n(n\geqslant1)$ is bounded and $\partial U\in C^1$. I wonder the counterpart ...
3
votes
5answers
413 views

Why $x<\tan{x}$ while $0<x<\frac{\pi}{2}$?

In proof of $\displaystyle\lim_{x\rightarrow0}\frac{\sin{x}}{x}=1$ is assumed that $\sin{x}\leq{x}\leq\tan{x}$ while $0<x<\frac{\pi}{2}$. First comparison is clear, arc length must be greater ...
2
votes
2answers
230 views

variance inequality

Show that. for any discrete random variable X that takes on values in the range [0,1]. Var[X] $\le$ 1/4. I translate it into a inequality like this: $x_1, x_2, x_3 \cdots ,x_n$ where $0 \le x_i \le ...
7
votes
0answers
464 views

Enestrom-Kakeya Theorem [duplicate]

The Enestrom-Kakeya theorem states that all roots of the polynomial: $$p(z):=\sum_{k=0}^n a_kz^k$$ lie outside the open unit disk if the sequence $(a_k)$ is positive and decreasing. A proof can be ...
6
votes
4answers
733 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.
5
votes
2answers
980 views

How to prove $a^n < n!$ for all $n$ sufficiently large, and $n! \leq n^n$ for all $n$, by induction?

I have a couple things I want to prove. I'm pretty sure a proof by induction is the best route for these. First, I need to show that $5^n < n!$ from some $n_{0} > 0$. I'm choosing $n_{0} = ...
3
votes
3answers
206 views

$(W_1+W_2+\cdots+W_n)^a \leq W_1^a +\cdots + W_n^a$ for $n$ integer, $n\geq 2$, $W\gt 0$ and $a$ constant, real, $0\lt a\lt 1$

I am looking for a proof that this inequality: $$(W_1+W_2+\cdots+W_n)^a \leq W_1^a +\cdots + W_n^a$$ is valid. I have a power function $f(W)=W^a$ where $a$ is a real number, constant but usually ...
2
votes
3answers
2k 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 :)
28
votes
18answers
2k 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 ...
6
votes
2answers
910 views

Challenging inequality: $abcde=1$, show that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}+\frac{1}{e}+\frac{33}{2(a+b+c+d+e)}\ge{\frac{{83}}{10}}$

Let $a,b,c,d,e$ be positive real numbers which satisfy $abcde=1$. How can one prove that: $$\frac{1}{a} + \frac{1}{b} + \frac{1}{c} + \frac{1}{d} +\frac{1}{e}+ \frac{33}{2(a + b + c + d+e)} ...
14
votes
4answers
532 views

How find this inequality $\max{\left(\min{\left(|a-b|,|b-c|,|c-d|,|d-e|,|e-a|\right)}\right)}$

let $a,b,c,d,e\in R$,and such $$a^2+b^2+c^2+d^2+e^2=1$$ find this value $$A=\max{\left(\min{\left(|a-b|,|b-c|,|c-d|,|d-e|,|e-a|\right)}\right)}$$ I use computer have this $$A=\dfrac{2}{\sqrt{10}}$$ ...
8
votes
3answers
1k views

Hardy's Inequality for Integrals

I am trying to prove Hardy's Inequality for integrals: Let $f:(0,\infty) \rightarrow \mathbb R$ be in $L^p$. Let $F(x) = \frac{1}{x} \int_0 ^x f(t)dt$. Then $F \in L^p$ and $\|F\|_p \leq ...
8
votes
2answers
262 views

Proving Integral Inequality

I am working on proving the below inequality, but I am stuck. Let $g$ be a differentiable function such that $g(0)=0$ and $0<g'(x)\leq 1$ for all $x$. For all $x\geq 0$, prove that ...
7
votes
1answer
573 views

Another way to go about proving the limit of Fibonacci's sequence quotient.

It is not difficult to inductively prove that $$\eqalign{ & \phi = \phi + 0 \cr & {\phi ^2} = \phi + 1 \cr & {\phi ^3} = 2\phi + 1 \cr & {\phi ^4} = 3\phi + 2 ...
6
votes
1answer
307 views

Inequality concerning inverses of positive definite matrices

I don't find a way to prove this: given $A$, $B$, symmetric and positive definite: $$A>B \Rightarrow A^{-1} < B^{-1},$$ where $A>B$ means that $A-B$ is positive definite.
5
votes
2answers
177 views

Does $y(y+1) \leq (x+1)^2$ imply $y(y-1) \leq x^2$?

Can anyone see how to prove the following? If $x$ and $y$ are real numbers with $y\geq 0$ and $y(y+1) \leq (x+1)^2$ then $y(y-1) \leq x^2$. It seems it is true at least according to Mathematica.
12
votes
1answer
274 views

Chebyshev: Proof $\prod \limits_{p \leq 2k}{\;} p > 2^k$

How do I prove the following: $$\prod_{p \leq 2k} \; p > 2^k \text{ with } p \in \mathbb{P}$$ I tried induction, but I didn't know how to go on because I don't have a look at all numbers. ...
10
votes
1answer
283 views

Why does Group Theory not come in here?

Here is a list of questions that I find quite similar, for the one and only reason that they all show much "symmetry". Which is at the same time my problem, because I don't have a very precise notion ...
11
votes
3answers
1k views

Lower bound for $\phi(n)$: Is $n/5 < \phi (n) < n$ for all $n > 1$?

Is it true that : $\frac {n}{5} < \phi (n) < n$ for all $n > 1$ where $\phi (n)$ is Euler's totient function . Since $\phi(n)$ has maximum value when $n$ is a prime it follows that ...