• C++ Programming for Financial Engineering
    Highly recommended by thousands of MFE students. Covers essential C++ topics with applications to financial engineering. Learn more Join!
    Python for Finance with Intro to Data Science
    Gain practical understanding of Python to read, understand, and write professional Python code for your first day on the job. Learn more Join!
    An Intuition-Based Options Primer for FE
    Ideal for entry level positions interviews and graduate studies, specializing in options trading arbitrage and options valuation models. Learn more Join!

Rewriting an inequality

Joined
11/18/22
Messages
1
Points
1
I'm looking at chapter 1 problem 7 in the solution manual of Dan Stefanica's A Primer for the Mathematics of Financial Engineering. There's a step I don't quite understand, it's[math]x\ln(1+\frac{1}{x}) < 1 < (x + 1)\ln(1 + \frac{1}{x})[/math]
which can be written as
[math]\frac{1}{x+1} < \ln(1 + \frac{1}{x}) < \frac{1}{x}[/math].
I don't understand what happened here and have been trying a bunch of simple operations to get from the first line to the second line. Any help on this would be much appreciated. Also, I was curious as to where I could ask for help for the book problems on this forum.
 
An interestig follow-on is to prove the individual inequalities in step 1. :cool:
I think that one part of the second inequality is to prove that :

[math]\left(1+\frac{1}{x}\right)^x < e[/math]

I can write the binomial expansion of the left-hand side, and of course the right hand side is [imath]\sum_{n=0}^{ \infty}\frac{1}{n!}[/imath]. I am not able to bound the left-hand side.
 
Pick an arbitrary but fixed [imath]x > 0[/imath]. We can bound the expression [imath]\left(1+\frac{1}{x}\right)^x[/imath] as:

[math]\left(1 + \frac{1}{x}\right)^x = 1 + x \cdot \frac{1}{x} + \frac{x(x-1)}{2!}\frac{1}{x^2}+\ldots+\frac{1}{x^x}[/math]

which implies that

[math]\left(1 + \frac{1}{x}\right)^x \leq 1 + |x| \cdot \frac{1}{x} + \frac{|x||x-1|}{2!}\frac{1}{x^2}+\ldots+\frac{1}{x^x}[/math]

Since [imath]|x - 1| \leq |x| + 1 < |x|[/imath] and in general [imath]|x -n| \leq |x| + n < |x|[/imath], it follows that:

[math]\left(1 + \frac{1}{x}\right)^x< 1 + \frac{|x|}{x}+\frac{1}{2!}\cdot\frac{|x|^2}{x^2}+\frac{1}{3!}\frac{|x|^3}{x^3}+\ldots+\frac{1}{x!}\cdot \frac{|x|^x}{x^x}[/math]

Since [imath]x > 0[/imath], [imath]|x|=x[/imath], so

[math]\left(1 + \frac{1}{x}\right)^x < \sum_{n=0}^x\frac{1}{n!} \leq \sum_{n=0}^{\infty}\frac{1}{n!} = e[/math]

for all [imath]x >0[/imath].

Of course, the domain of the definition is [imath](-\infty,-1)\cup(0,\infty)[/imath], so there has to be additional work.
 
Last edited:
If x is real, then x! is probably wrong. But by trying you get more insights into related stuff.

I think that there is an error in one of your inequalities.

what about asymptotic values of x? 0, -\infty, + \infty

 
Last edited:
If x is real, then x! is probably wrong. But by trying you get more insights into related stuff.
Precisely.

Yeah, the proof attempt is pretty dodgy. Firstly, Newton's binomial expansion theorem is only applicable [imath]\forall n \in \mathbb{N}[/imath]. [imath](1+1/x)^{-n}[/imath] has a power-series representation.

I think the below would do the job for [imath]x > 1[/imath] (the interval of convergence of the infinite series [imath]\sum_{n=1}^{\infty}\frac{(-1)^n y^n}{n}[/imath] is [imath](-1,1][/imath]). Consider:

[math]\log\left(1+\frac{1}{x}\right) = \frac{1}{x}-\frac{1}{2x^2}+\frac{1}{3x^3}-\frac{1}{4x^4}+\ldots[/math]

Rewriting as:

[math]\log\left(1+\frac{1}{x}\right) = \frac{1}{x}-\left[\left(\frac{1}{2x^2}-\frac{1}{3x^3}\right)+\left(\frac{1}{4x^4}-\frac{1}{5x^5}\right)+\ldots\right][/math]

Therefore,

[math]x\log\left(1+\frac{1}{x}\right) = 1-\left[\left(\frac{1}{2x}-\frac{1}{3x^2}\right)+\left(\frac{1}{4x^3}-\frac{1}{5x^4}\right)+\ldots\right][/math]

Now, each pair of terms in the round brackets are non-negative. Hence, [imath]x(1+1/x)^x[/imath] has upper bound [imath]1[/imath] (atleast for x > 1).

Also, [imath]\lim_{x \to \infty}\log(1+1/x)^x = 1[/imath].
 
Last edited:
Back
Top