Characterizations of the exponential function

Template:Short description In mathematics, the exponential function can be characterized in many ways. This article presents some common characterizations, discusses why each makes sense, and proves that they are all equivalent.

The exponential function occurs naturally in many branches of mathematics. Walter Rudin called it "the most important function in mathematics".Template:R It is therefore useful to have multiple ways to define (or characterize) it. Each of the characterizations below may be more or less useful depending on context. The "product limit" characterization of the exponential function was discovered by Leonhard Euler.Template:R

Characterizations

The six most common definitions of the exponential function $\exp (x)=e^x$ for real values $x\in ℝ$ are as follows.

1. Product limit. Define $e^x$ by the limit:$$e^x=\underset{n\to \mathrm{\infty }}{\lim }{(1+\frac{x}{n})}^n.$$
2. Power series. Define Template:Math as the value of the infinite series $$e^x=\sum _{n=0}^{\mathrm{\infty }}\frac{x^n}{n!}=1+x+\frac{x^2}{2!}+\frac{x^3}{3!}+\frac{x^4}{4!}+\cdots$$ (Here Template:Math denotes the factorial of Template:Mvar. One [[proof that e is irrational|proof that Template:Math is irrational]] uses a special case of this formula.)
3. Inverse of logarithm integral. Define $e^x$ to be the unique number Template:Math such that $$\underset{1}{\overset{y}{\int }}\frac{dt}{t}=x.$$ That is, $e^x$ is the inverse of the natural logarithm function $x=\ln (y)$, which is defined by this integral.
4. Differential equation. Define $y(x)=e^x$ to be the unique solution to the differential equation with initial value:$$y^{\prime }=y,y(0)=1,$$ where $y^{\prime }=\frac{dy}{dx}$ denotes the derivative of Template:Mvar.
5. Functional equation. The exponential function $e^x$ is the unique function Template:Math with the multiplicative property $f(x+y)=f(x)f(y)$ for all $x,y$ and $f^{\prime }(0)=1$. The condition $f^{\prime }(0)=1$ can be replaced with $f(1)=e$ together with any of the following regularity conditions:Template:Unordered list For the uniqueness, one must impose some regularity condition, since other functions satisfying $f(x+y)=f(x)f(y)$ can be constructed using a basis for the real numbers over the rationals, as described by Hewitt and Stromberg.
6. Elementary definition by powers. Define the exponential function with base $a>0$ to be the continuous function $a^x$ whose value on integers $x=n$ is given by repeated multiplication or division of $a$, and whose value on rational numbers $x=n/m$ is given by $a^{n/m}=\sqrt[m]{\phantom{A^2}{a}^n}$. Then define $e^x$ to be the exponential function whose base $a=e$ is the unique positive real number satisfying: $$\underset{h\to 0}{\lim }\frac{e^h-1}{h}=1.$$

Larger domains

One way of defining the exponential function over the complex numbers is to first define it for the domain of real numbers using one of the above characterizations, and then extend it as an analytic function, which is characterized by its values on any infinite domain set.

Also, characterisations (1), (2), and (4) for $e^x$ apply directly for $x$ a complex number. Definition (3) presents a problem because there are non-equivalent paths along which one could integrate; but the equation of (3) should hold for any such path modulo $2\pi i$. As for definition (5), the additive property together with the complex derivative $f^{\prime }(0)=1$ are sufficient to guarantee $f(x)=e^x$. However, the initial value condition $f(1)=e$ together with the other regularity conditions are not sufficient. For example, for real x and y, the function$$f(x+iy)=e^x(\cos (2y)+i\sin (2y))=e^{x+2iy}$$satisfies the three listed regularity conditions in (5) but is not equal to $\exp (x+iy)$. A sufficient condition is that $f(1)=e$ and that $f$ is a conformal map at some point; or else the two initial values $f(1)=e$ and $f(i)=\cos (1)+i\sin (1)$ together with the other regularity conditions.

One may also define the exponential on other domains, such as matrices and other algebras. Definitions (1), (2), and (4) all make sense for arbitrary Banach algebras.

Proof that each characterization makes sense

Some of these definitions require justification to demonstrate that they are well-defined. For example, when the value of the function is defined as the result of a limiting process (i.e. an infinite sequence or series), it must be demonstrated that such a limit always exists.

Characterization 1

The error of the product limit expression is described by:$${(1+\frac{x}{n})}^n=e^x(1-\frac{x^2}{2n}+\frac{x^3(8+3x)}{24n^2}+\cdots ),$$ where the polynomial's degree (in x) in the term with denominator n^k is 2k.

Characterization 2

Since $$\underset{n\to \mathrm{\infty }}{\lim }\left|\frac{x^{n+1}/(n+1)!}{x^n/n!}\right|=\underset{n\to \mathrm{\infty }}{\lim }\left|\frac{x}{n+1}\right|=0<1.$$ it follows from the ratio test that ${\sum }_{n=0}^{\mathrm{\infty }}\frac{x^n}{n!}$ converges for all x.

Characterization 3

Since the integrand is an integrable function of Template:Mvar, the integral expression is well-defined. It must be shown that the function from ${ℝ}^{+}$ to $ℝ$ defined by $$x\mapsto \underset{1}{\overset{x}{\int }}\frac{dt}{t}$$ is a bijection. Since Template:Math is positive for positive Template:Mvar, this function is strictly increasing, hence injective. If the two integrals $$\begin{array}{cc}\underset{1}{\overset{\mathrm{\infty }}{\int }}\frac{dt}{t}& =\mathrm{\infty }\\ \underset{1}{\overset{0}{\int }}\frac{dt}{t}& =-\mathrm{\infty }\end{array}$$ hold, then it is surjective as well. Indeed, these integrals do hold; they follow from the integral test and the divergence of the harmonic series.

Characterization 6

The definition depends on the unique positive real number $a=e$ satisfying: $$\underset{h\to 0}{\lim }\frac{a^h-1}{h}=1.$$This limit can be shown to exist for any $a$, and it defines a continuous increasing function $f(a)=\ln (a)$ with $f(1)=0$ and $\underset{a\to \mathrm{\infty }}{\lim }f(a)=\mathrm{\infty }$, so the Intermediate value theorem guarantees the existence of such a value $a=e$.

Equivalence of the characterizations

The following arguments demonstrate the equivalence of the above characterizations for the exponential function.

Characterization 1 ⇔ characterization 2

The following argument is adapted from Rudin, theorem 3.31, p. 63–65.

Let $x\ge 0$ be a fixed non-negative real number. Define $$t_n={(1+\frac{x}{n})}^n,s_n=\sum _{k=0}^n\frac{x^k}{k!},e^x=\underset{n\to \mathrm{\infty }}{\lim }{s}_n.$$

By the binomial theorem, $$\begin{array}{cc}{t}_n& =\sum _{k=0}^n(\genfrac{}{}{0ex}{}{n}{k})\frac{x^k}{n^k}=1+x+\sum _{k=2}^n\frac{n(n-1)(n-2)\cdots (n-(k-1))x^k}{k!n^k}\\ & =1+x+\frac{x^2}{2!}(1-\frac{1}{n})+\frac{x^3}{3!}(1-\frac{1}{n})(1-\frac{2}{n})+\cdots \\ & \cdots +\frac{x^n}{n!}(1-\frac{1}{n})\cdots (1-\frac{n-1}{n})\le s_n\end{array}$$ (using x ≥ 0 to obtain the final inequality) so that: $$\underset{n\to \mathrm{\infty }}{\mathrm{lim\; sup}}{t}_n\le \underset{n\to \mathrm{\infty }}{\mathrm{lim\; sup}}{s}_n=e^x$$ One must use lim sup because it is not known if t_n converges.

For the other inequality, by the above expression for t_n, if 2 ≤ m ≤ n, we have: $$1+x+\frac{x^2}{2!}(1-\frac{1}{n})+\cdots +\frac{x^m}{m!}(1-\frac{1}{n})(1-\frac{2}{n})\cdots (1-\frac{m-1}{n})\le t_n.$$

Fix m, and let n approach infinity. Then $$s_m=1+x+\frac{x^2}{2!}+\cdots +\frac{x^m}{m!}\le \underset{n\to \mathrm{\infty }}{\mathrm{lim\; inf}}{t}_n$$ (again, one must use lim inf because it is not known if t_n converges). Now, take the above inequality, let m approach infinity, and put it together with the other inequality to obtain: $$\underset{n\to \mathrm{\infty }}{\mathrm{lim\; sup}}{t}_n\le e^x\le \underset{n\to \mathrm{\infty }}{\mathrm{lim\; inf}}{t}_n$$ so that $$\underset{n\to \mathrm{\infty }}{\lim }{t}_n=e^x.$$

This equivalence can be extended to the negative real numbers by noting ${(1-\frac{r}{n})}^n{(1+\frac{r}{n})}^n={(1-\frac{r^2}{n^2})}^n$ and taking the limit as n goes to infinity.

Characterization 1 ⇔ characterization 3

Here, the natural logarithm function is defined in terms of a definite integral as above. By the first part of fundamental theorem of calculus, $$\frac{d}{dx}\ln x=\frac{d}{dx}\underset{1}{\overset{x}{\int }}\frac{1}{t}dt=\frac{1}{x}.$$

Besides, $\ln 1={\int }_1^1\frac{dt}{t}=0$

Now, let x be any fixed real number, and let $$y=\underset{n\to \mathrm{\infty }}{\lim }{(1+\frac{x}{n})}^n.$$

Template:Math, which implies that Template:Math, where Template:Math is in the sense of definition 3. We have $$\ln y=\ln \underset{n\to \mathrm{\infty }}{\lim }{(1+\frac{x}{n})}^n=\underset{n\to \mathrm{\infty }}{\lim }\ln {(1+\frac{x}{n})}^n.$$

Here, the continuity of ln(y) is used, which follows from the continuity of 1/t: $$\ln y=\underset{n\to \mathrm{\infty }}{\lim }n\ln (1+\frac{x}{n})=\underset{n\to \mathrm{\infty }}{\lim }\frac{x\ln (1+(x/n))}{(x/n)}.$$

Here, the result lnaⁿ = nlna has been used. This result can be established for n a natural number by induction, or using integration by substitution. (The extension to real powers must wait until ln and exp have been established as inverses of each other, so that a^b can be defined for real b as e^{b lna}.) $$=x\cdot \underset{h\to 0}{\lim }\frac{\ln (1+h)}{h}\text{ where }h=\frac{x}{n}$$ $$=x\cdot \underset{h\to 0}{\lim }\frac{\ln (1+h)-\ln 1}{h}$$ $$=x\cdot \frac{d}{dt}\ln t{|}_{t=1}$$ $$=x.$$

Characterization 1 ⇔ characterization 4

Let

$y(t)$

denote the solution to the initial value problem

$y^{\prime }=y,y(0)=1$

. Applying the simplest form of Euler's method with increment

$\mathrm{\Delta }t=\frac{x}{n}$

and sample points

$t=0,\mathrm{\Delta }t,2\mathrm{\Delta }t,\dots ,n\mathrm{\Delta }t$

gives the recursive formula:

$y(t+\mathrm{\Delta }t)\approx y(t)+y^{\prime }(t)\mathrm{\Delta }t=y(t)+y(t)\mathrm{\Delta }t=y(t)(1+\mathrm{\Delta }t).$

This recursion is immediately solved to give the approximate value

$y(x)=y(n\mathrm{\Delta }t)\approx (1+\mathrm{\Delta }t{)}^n$

, and since Euler's Method is known to converge to the exact solution, we have:

$y(x)=\underset{n\to \mathrm{\infty }}{\lim }{(1+\frac{x}{n})}^n.$

Characterization 2 ⇔ characterization 4

Let n be a non-negative integer. In the sense of definition 4 and by induction, $\frac{d^{n}y}{d{x}^n}=y$.

Therefore $\frac{d^{n}y}{d{x}^n}{|}_{x=0}=y(0)=1.$

Using Taylor series, $$y=\sum _{n=0}^{\mathrm{\infty }}\frac{f^{(n)}(0)}{n!}{x}^n=\sum _{n=0}^{\mathrm{\infty }}\frac{1}{n!}{x}^n=\sum _{n=0}^{\mathrm{\infty }}\frac{x^n}{n!}.$$ This shows that definition 4 implies definition 2.

In the sense of definition 2, $$\begin{array}{cc}\frac{d}{dx}{e}^x& =\frac{d}{dx}(1+\sum _{n=1}^{\mathrm{\infty }}\frac{x^n}{n!})=\sum _{n=1}^{\mathrm{\infty }}\frac{n{x}^{n-1}}{n!}=\sum _{n=1}^{\mathrm{\infty }}\frac{x^{n-1}}{(n-1)!}\\ & =\sum _{k=0}^{\mathrm{\infty }}\frac{x^k}{k!},\text{ where }k=n-1\\ & =e^x\end{array}$$

Besides, $e^0=1+0+\frac{0^2}{2!}+\frac{0^3}{3!}+\cdots =1.$ This shows that definition 2 implies definition 4.

Characterization 2 ⇒ characterization 5

In the sense of definition 2, the equation $\exp (x+y)=\exp (x)\exp (y)$ follows from the term-by-term manipulation of power series justified by uniform convergence, and the resulting equality of coefficients is just the Binomial theorem. Furthermore: $$\begin{array}{cc}{\exp }^{\prime }(0)& =\underset{h\to 0}{\lim }\frac{e^h-1}{h}\\ & =\underset{h\to 0}{\lim }\frac{1}{h}((1+h+\frac{h^2}{2!}+\frac{h^3}{3!}+\frac{h^4}{4!}+\cdots )-1)\\ & =\underset{h\to 0}{\lim }(1+\frac{h}{2!}+\frac{h^2}{3!}+\frac{h^3}{4!}+\cdots )=1.\\ \end{array}$$

Characterization 3 ⇔ characterization 4

Characterisation 3 first defines the natural logarithm:

$$\log x\stackrel{\text{def}}{=}\underset{1}{\overset{x}{\int }}\frac{dt}{t},$$

then

$\exp$

as the inverse function with

$x=\log (\exp x)$

. Then by the Chain rule:

$1=\frac{d}{dx}[\log (\exp (x))]={\log }^{\prime }(\exp (x))\cdot {\exp }^{\prime }(x)=\frac{{\exp }^{\prime }(x)}{\exp (x)},$

i.e.

${\exp }^{\prime }(x)=\exp (x)$

. Finally,

$\log (1)=0$

, so

${\exp }^{\prime }(0)=\exp (0)=1$

. That is,

$y=\exp (x)$

is the unique solution of the initial value problem

$\frac{dy}{dx}=y$

,

$y(0)=1$

of characterization 4. Conversely, assume

$y=\exp (x)$

has

${\exp }^{\prime }(x)=\exp (x)$

and

$\exp (0)=1$

, and define

$\log (x)$

as its inverse function with

$x=\exp (\log x)$

and

$\log (1)=0$

. Then:

$1=\frac{d}{dx}[\exp (\log (x))]={\exp }^{\prime }(\log (x))\cdot {\log }^{\prime }(x)=\exp (\log (x))\cdot {\log }^{\prime }(x)=x\cdot {\log }^{\prime }(x),$

i.e.

${\log }^{\prime }(x)=\frac{1}{x}$

. By the Fundamental theorem of calculus,

$$\underset{1}{\overset{x}{\int }}\frac{1}{t}dt=\log (x)-\log (1)=\log (x).$$

Characterization 5 ⇒ characterization 4

The conditions Template:Math and Template:Math imply both conditions in characterization 4. Indeed, one gets the initial condition Template:Math by dividing both sides of the equation $$f(0)=f(0+0)=f(0)f(0)$$ by Template:Math, and the condition that Template:Math follows from the condition that Template:Math and the definition of the derivative as follows: $$\begin{array}{ccccccc}{f}^{\prime }(x)& =& \lim {\mathrm{\backslash limits}}_{h\to 0}\frac{f(x+h)-f(x)}{h}& =& \lim {\mathrm{\backslash limits}}_{h\to 0}\frac{f(x)f(h)-f(x)}{h}& =& \lim {\mathrm{\backslash limits}}_{h\to 0}f(x)\frac{f(h)-1}{h}\\ & =& f(x)\lim {\mathrm{\backslash limits}}_{h\to 0}\frac{f(h)-1}{h}& =& f(x)\lim {\mathrm{\backslash limits}}_{h\to 0}\frac{f(0+h)-f(0)}{h}& =& f(x)f^{\prime }(0)=f(x).\end{array}$$

Characterization 5 ⇒ characterization 4

Assum characterization 5, the multiplicative property together with the initial condition ${\exp }^{\prime }(0)=1$ imply that: $$\begin{array}{ccc}\frac{d}{dx}\exp (x)& =& \underset{h\to 0}{\lim }\frac{\exp (x+h)-\exp (x)}{h}\\ & =& \exp (x)\cdot \underset{h\to 0}{\lim }\frac{\exp (h)-1}{h}\\ & =& \exp (x){\exp }^{\prime }(0)=\exp (x).\end{array}$$

Characterization 5 ⇔ characterization 6

By inductively applying the multiplication rule, we get: $$f{\left(\frac{n}{m}\right)}^m=f(\frac{n}{m}+\cdots +\frac{n}{m})=f(n)=f(1{)}^n,$$ and thus $$f\left(\frac{n}{m}\right)=\sqrt[m]{f(1{)}^n}\stackrel{\text{def}}{=}{a}^{n/m}$$ for $a=f(1)$. Then the condition $f^{\prime }(0)=1$ means that $\underset{h\to 0}{\lim }\frac{a^h-1}{h}=1$, so $a=e$ by definition.

Also, any of the regularity conditions of definition 5 imply that $f(x)$ is continuous at all real $x$ (see below). The converse is similar.

Characterization 5 ⇒ characterization 6

Let $f(x)$ be a Lebesgue-integrable non-zero function satisfying the mulitiplicative property $f(x+y)=f(x)f(y)$ with $f(1)=e$. Following Hewitt and Stromberg, exercise 18.46, we will prove that Lebesgue-integrability implies continuity. This is sufficient to imply $f(x)=e^x$ according to characterization 6, arguing as above.

First, a few elementary properties:

1. If $f(x)$ is nonzero anywhere (say at $x=y$), then it is non-zero everywhere. Proof: $f(y)=f(x)f(y-x)\ne 0$ implies $f(x)\ne 0$.
2. $f(0)=1$. Proof: $f(x)=f(x+0)=f(x)f(0)$ and $f(x)$ is non-zero.
3. $f(-x)=1/f(x)$. Proof: $1=f(0)=f(x-x)=f(x)f(-x)$.
4. If $f(x)$ is continuous anywhere (say at $x=y$), then it is continuous everywhere. Proof: $f(x+\delta )-f(x)=f(x-y)[f(y+\delta )-f(y)]\to 0$ as $\delta \to 0$ by continuity at $y$.

The second and third properties mean that it is sufficient to prove $f(x)=e^x$ for positive x.

Since$f(x)$ is a Lebesgue-integrable function, then we may define $g(x)={\int }_0^{x}f(t)dt$. It then follows that $$g(x+y)-g(x)=\underset{x}{\overset{x+y}{\int }}f(t)dt=\underset{0}{\overset{y}{\int }}f(x+t)dt=f(x)g(y).$$

Since $f(x)$ is nonzero, some Template:Mvar can be chosen such that $g(y)\ne 0$ and solve for $f(x)$ in the above expression. Therefore: $$\begin{array}{cc}f(x+\delta )-f(x)& =\frac{[g(x+\delta +y)-g(x+\delta )]-[g(x+y)-g(x)]}{g(y)}\\ & =\frac{[g(x+y+\delta )-g(x+y)]-[g(x+\delta )-g(x)]}{g(y)}\\ & =\frac{f(x+y)g(\delta )-f(x)g(\delta )}{g(y)}=g(\delta )\frac{f(x+y)-f(x)}{g(y)}.\end{array}$$

The final expression must go to zero as $\delta \to 0$ since $g(0)=0$ and $g(x)$ is continuous. It follows that $f(x)$ is continuous.

References

• Walter Rudin, Principles of Mathematical Analysis, 3rd edition (McGraw–Hill, 1976), chapter 8.
• Edwin Hewitt and Karl Stromberg, Real and Abstract Analysis (Springer, 1965).