Vtgyjfy

From the very definition (one of many, I know):

$$e:=lim_{ntoinfty}left(1+frac{1}{n}right)^n$$

we can try the following, depending on what you have read so far in this subject:

(1) Deduce that

$$e=lim_{ntoinfty}left(1+frac{1}{f(n)}right)^{f(n)};,;;text{as long as};;f(n)xrightarrow[ntoinfty]{}infty$$

and then from here ($,xneq0,$ , but this is only a light technicality)

$$left(1+frac{x}{n}right)^n=left[;left(1+frac{1}{frac{n}{x}}right)^frac{n}{x};right]^xxrightarrow[ntoinfty]{}e^x$$

2) For $,x>0,$ , substitute $,mx=n,$ . Note that $,ntoinftyimplies mtoinfty,$ , and

$$left(1+frac{x}{n}right)^n=left(left(1+frac{1}{m}right)^mright)^xxrightarrow[ntoinftyiff mtoinfty]{}e^x$$

I'll leave it to you to work out the case $,x<0,$ (hint: arithmetic of limits and "going" to denominators)

I would like to cite here an awesome German mathematician, Konrad Königsberger. He writes in his book ,,Analysis I'' as follows:

Fundamentallemma. For every sequence of complex numbers $w_n$ with a limit $w$ it is true that $$lim_{n to infty} Bigl(1 + frac{w_n}{n}Bigr)^n = sum_{k=0}^infty frac{w^k}{k!}.$$ Proof. For every $varepsilon > 0$ and sufficiently large index $K$ we have the following estimations: $$sum_{k=K}^infty frac{(|w|+1)^k}{k!} < frac varepsilon 3 quadmbox{and}quad |w_n| le |w|+1.$$Therefore if $n ge K$ then $$left|Bigl(1 + frac{w_n}{n}Big)^n - exp w right| le sum_{k=0}^{K-1} left|{n choose k}frac{w_n^k}{n^k} - frac{w^k}{k!}right| + sum_{k=K}^n{nchoose k} frac{|w_n|^k}{n^k} + sum_{k=K}^infty frac{|w|^k}{k!}.$$ The third sum is smaller than $varepsilon / 3$ based on our assumptions. We can find an upper bound for the middle one using $${n choose k} frac 1 {n^k} = frac{1}{k!} prod_{i = 1}^{k-1} Bigl(1 - frac i n Bigr) le frac 1 {k!}.$$ Combining this with $|w_n| le |w| + 1$, $$sum_{k=K}^n {n choose k} frac{|w_n|^k}{n^k} < sum_{k=K}^n frac{(|w|+1)^k}{k!} < frac varepsilon 3$$ Finally, the first sum converges to $0$ due to $w_n to w$ and ${n choose k} n^{-k} to frac 1 {k!}$. We can choose $N > K$ such that it's smaller than $varepsilon / 3$ as soon as $n > N$.

Really brilliant.

Firstly, let us give a definition to the exponential function, so we know the function has various properties:

$$ exp(x) := sum_{n=0}^{infty} frac{x^n}{n!}$$

so that we can prove that (as exp is a power series) :

• The exponential function has radius of convergence $infty$, and is thus defined on all of $mathbb R$


• As a power series is infinitely differentiable inside its circle of convergence, the exponential function is infinitely differentiable on all of $mathbb R$


• We can then prove that the function is strictly increasing, and thus by the inverse function theorem (http://en.wikipedia.org/wiki/Inverse_function_theorem) we can define what we know as the "log" function

Knowing all of this, here is hopefully a sufficiently rigorous proof (at least for positive a):

As $log(x)$ is continuous and differentiable on $(0,infty)$, we have that $log(1+x)$ is continuous and differentiable on $[0,frac{a}{n}]$, so by the mean value theorem we know there exists a $c in [0,frac{a}{n}]$ with

$$f'(c) = frac {log(1+ frac{a}{n} ) - log(1)} {frac {a}{n} - 0 } $$
$$ Longrightarrow log[{(1+frac{a}{n})^n}] = frac{a}{1+c}$$
$$ Longrightarrow (1+frac{a}{n})^n = exp({frac{a}{1+c}})$$

for some $c in [0,frac{a}{n}]$ . As we then want to take the limit as $n rightarrow infty$, we get that:

• As $c in [0,frac{a}{n}]$ and $frac{a}{n} rightarrow 0$ as $n rightarrow infty$, by the squeeze theorem we get that $ c rightarrow 0$ as $n rightarrow infty$


• As $ c rightarrow 0$ as $n rightarrow infty$, $frac{a}{1+c} rightarrow a$ as $n rightarrow infty$


• As the exponential function is continuous on $mathbb R$, the limit can pass inside the function, so we get that as $frac{a}{1+c} rightarrow a$ as $n rightarrow infty$

$$ exp(frac{a}{1+c}) rightarrow exp(a) $$
as $n rightarrow infty$. Thus we can conclude that

$$ lim_{n to infty} (1+frac{a}{n})^n = e^a$$

(Of course, this is ignoring that one needs to prove that $exp(a)=e^a$, but this is hardly vital for this question)

Aaah... The sweet sound of silent revenge downvotes... Always a pleasure!

Consider the functions $u$ and $v$ defined for every $|t|ltfrac12$ by
$$
u(t)=t-log(1+t),qquad v(t)=t-t^2-log(1+t).
$$
The derivative of $u$ is $u'(t)=frac{t}{1+t}$, which has the sign of $t$, hence $u(t)geqslant0$. The derivative of $v$ is $v'(t)=1-2t-frac{1}{1+t}$, which has the sign of $(1+t)(1-2t)-1=-t(1+2t)$ which has the sign of $-t$ on the domain $|t|ltfrac12$ hence $v(t)leqslant0$.
Thus:

For every $|t|ltfrac12$,
$$
t-t^2leqslantlog (1+t)leqslant t.
$$

The function $zmapstoexp(nz)$ is nondecreasing on the same domain hence
$$
expleft(nt-nt^2right)leqslant(1+t)^nleqslantexpleft(ntright).
$$
In particular, using this for $t=x/n$, one gets:

For every $|x|<frac12n$,
$$
expleft(x-frac{x^2}{n}right)leqslantleft(1+frac{x}nright)^nleqslantmathrm e^x.
$$

Finally, $x^2/nto 0$ when $ntoinfty$ and the exponential is continuous at $0$, hence we are done.

Facts/Definitions used:

• The logarithm has derivative $tmapsto1/t$.


• The exponential is the inverse of the logarithm.

Another answer, assuming $x>0$:

Let $f(x)=ln(x)$. Then we know that $f'(x)=1/x$. Also, by the definition of derivative, we can write
$$
begin{align}
f'(x)&=lim_{hto 0}frac{f(x+h)-f(x)}{h}\
&=lim_{hto 0}frac{ln(x+h)-ln(x)}{h}\
&=lim_{hto 0}frac{1}{h}lnfrac{x+h}{x}\
&=lim_{h to 0}lnleft(frac{x+h}{x}right)^frac{1}{h}\
&=lim_{hto 0}lnleft(1+frac{h}{x}right)^frac{1}{h}
end{align}
$$
Then, using the fact that $ln(x)$ is a continuous function for all $x$ in its domain, we can exchange the $lim$ and $ln$:
$$
f'(x)=lnlim_{hto 0}left(1+frac{h}{x}right)^frac{1}{h}
$$
Now, let $m=1/h$. Then $mtoinfty$ as $hto 0^+$, and
$$
f'(x)=lnlim_{mtoinfty}left(1+frac{1}{mx}right)^m
$$
Now, assuming $x>0$, define $n=mx^2$, and so $ntoinfty$ as $mtoinfty$. Then we can write
$$
f'(x)=lnlim_{ntoinfty}left[left(1+frac{x}{n}right)^nright]^{1/x^2}
$$
and from before, we still have $f'(x)=1/x$, so
$$
lnlim_{ntoinfty}left[left(1+frac{x}{n}right)^nright]^{1/x^2}=frac{1}{x}
$$
Exponentiating both sides, we find
$$
lim_{ntoinfty}left[left(1+frac{x}{n}right)^nright]^{1/x^2}=e^{1/x}
$$
Finally, raising both sides to the $x^2$, we find
$$
lim_{ntoinfty}left(1+frac{x}{n}right)^n=e^x
$$
EDIT: This idea actually works for all reals—if we use $f(x)=ln|x|$ instead, then we get eventually get:
$$
e^x=lim_{ntoinfty}left|1+frac{x}{n}right|^{n}=lim_{ntoinfty}left(1+frac{x}{n}right)^n
$$
Where the last equality come from the fact that $n$ always eventually dominates $x$, so that the absolute value function becomes redundant.

This leaves the case where $x=0$, but that is a trivial matter.

$ (1+x/n)^n = sum_{k=0}^n binom{n}{k}frac{x^k}{n^k} $

Now just prove that $binom{n}{k}frac{x^k}{n^k}$ approaches $frac{x^k}{k!}$ as n approaches infinity, and you will have proven that your limit matches the Taylor series for $exp(x)$

For any fixed value of $x$, define

$$f(u)= {ln(1+ux)over u}$$

By L'Hopital's Rule,

$$lim_{urightarrow0^+}f(u)=lim_{urightarrow0^+}{x/(1+ux)over1}=x$$

Now exponentiate $f$:

$$e^{f(u)}=(1+ux)^{1/u}$$

By continuity of the exponential function, we have

$$lim_{urightarrow0^+}(1+ux)^{1/u}=lim_{urightarrow0^+}e^{f(u)}=e^{lim_{urightarrow0^+}f(u)}=e^x$$

All these limits have been shown to exist for the (positive) real variable $u$ tending to $0$, hence they must exist, and be the same, for the sequence of reciprocals of integers, $u=1/n$, as $n$ tends to infinity, and the result follows:

$$lim_{nrightarrowinfty}left(1+{xover n}right)^n = e^x$$

This one of the ways in which it is defined. The equivalence of the definitions can be proved easily, I guess.
If for example you take the exponential function to be the inverse of the logarithm:

$log(lim_n(1 + frac{x}{n})^n) = lim_n n log(1 + frac{x}{n}) = lim_n n cdot[frac{x}{n} - frac{x^2}{2n^2} + dots] = x$

EDIT: The logarithm is defined as usual: $log x = int_1^x frac{dt}{t}$. The first identity follows from the continuity of the logarithm, the second it's just an application of one of the property of the logarithm ($log a^b = b log a $), while to obtain the third it sufficies to have the Taylor expansion of $log(1+x)$.

There is at most one function $g$ on $mathbb{R}$ such that
$$g'(x)=g(x)text{ for all } xtext{ in }mathbb{R}quadtext{and}quad g(0)=1,.$$
If you let $f_n(x)=(1+x/n)^n$ and you can demonstrate that it compactly converges to some function $f$, you can demonstrate that $f'(x)=f(x)$ and $f(0)=1$. Likewise, if you take $f_n(x)=sum_{k=0}^n x^k/k!$ and demonstrate this sequence converges compactly, you can show that this limit satisfies the same conditions. Thus it doesn't matter what your definition is. The uniqueness criteria is what you should probably have in mind when you think of "the exponential".