-2
$\begingroup$

Famous $e^x$ function obeys the following well-known property: $$ e^{-x} = \frac{1}{e^x}. $$

I am concerned about the following. What if we didn't know that property in advance. Is it possible to derive this property considering only the formal power series definition: $$ e^{-x} \equiv \sum_{k=0}^{\infty} \frac{(-1)^k x^k}{k!}. $$

I mean some constructive proof. Not just formally expanding $e^{-x}$ and $\frac{1}{e^x}$ and matching resulting series between each other. What if we don't know that we are going to obtain $\frac{1}{e^x}$ as a result.

$\endgroup$
7
  • 1
    $\begingroup$ "What if (insert list of axioms, here)", followed by consequences, would be a mathematical question. A speculative "What if we don't know...", followed by even more arbitrary limitations, like "constructive" (definition?) or "Not just formally expanding" is not mathematics $\endgroup$ Commented Nov 14 at 10:08
  • 1
    $\begingroup$ So you mean something in the direction that one has a differential equation and somebody gives you a function but does not tell you how he found this function. By just inserting it in the equation and checking whether it solves it one can easily prove that it is a solution. But you want to know how to generate solutions, so bottom-up instead of top-down? You should clarify your assumptions and insert more details in your question. $\endgroup$ Commented Nov 14 at 11:39
  • 1
    $\begingroup$ You ask us not to match $x^k$ coefficients in a product of two series. Is that because expressions like $\sum_{i=0}^k\frac{(-1)^i}{i!(k-i)!}$ are tricky to evaluate? If so, it's probably best to use the binomial theorem to check $x^iy^j$ coefficients in $e^xe^y=e^{x+y}$ match, then take $y=-x$. (Mind you, the "tricky" part is also amenable to the binomial theorem.) $\endgroup$ Commented Nov 14 at 12:30
  • 1
    $\begingroup$ @J.G. I believe (s)he means that, if we do not know $\exp(-x)=\dfrac{1}{\exp(x)}$ in the first place, we would not think to compare the coefficients. That is why I do it by $\exp(x)\exp(y)=\exp(x+y)$. $\endgroup$ Commented Nov 14 at 12:50
  • $\begingroup$ What is OP's definition of $a^{-b}$ for positive $a,b?$ If OP doesn't define $a^{-b},$ then they shouldn't write "$a^{-b}$" at all. $\endgroup$ Commented Nov 14 at 13:30

5 Answers 5

7
$\begingroup$

Right, so what are we allowed to know?

Let's say we know that $$e^x=\sum_{i=0}^\infty\frac{x^i}{i!}$$ and $$e^{-x}=\sum_{i=0}^\infty\frac{(-1)^ix^i}{i!}$$

Multiply these together, and we get

$$e^xe^{-x}=\left(\sum_{i=0}^\infty\frac{x^i}{i!}\right)\left(\sum_{i=0}^\infty\frac{(-1)^ix^i}{i!}\right)$$

which equals

$$ \sum_{i=0}^\infty\sum_{j=0}^\infty\frac{x^i}{i!}\frac{(-1)^jx^j}{j!} =\sum_{i=0}^\infty\sum_{j=0}^\infty\frac{(-1)^jx^{i+j}}{i!j!} $$

writing $k=i+j$, and we get

$$\sum_{k=0}^\infty\sum_{j=0}^k\frac{(-1)^jx^{k}}{(k-j)!j!}=\sum_{k=0}^\infty\sum_{j=0}^k\frac{x^k}{k!}\frac{(-1)^jk!}{(k-j)!j} =\sum_{k=0}^\infty\left[\sum_{j=0}^k\frac{(-1)^jk!}{(k-j)!j}\right]\frac{x^k}{k!}$$

The binomial theorem helps us simplify the square bracket. We know that

$$\sum_{j=0}^k\frac{a^jk!}{(k-j)!j}=(1+a)^k$$

with the special case $a=-1$ and $k=0$ yielding $1$. That is,

$$ \sum_{j=0}^k \frac{(-1)^j k!}{(k-j)! j} = \begin{cases} 1, & \text{if } k=0, \\ 0, & \text{otherwise}. \end{cases} $$

So $$\sum_{k=0}^\infty\left[\sum_{j=0}^k\frac{(-1)^jk!}{(k-j)!j}\right]\frac{x^k}{k!}=1{\cdot}\frac{x^0}{0!}+\sum_{k=1}^\infty0{\cdot}\frac{x^k}{k!}=1+0=1$$

That is, $e^xe^{-x}=1$, so we can conclude $e^{-x}=\frac1{e^x}$.

$\endgroup$
2
  • 2
    $\begingroup$ Fine, but wouldn‘t that be exactly the „matching resulting series between each other“ the OP felt free to forbid? $\endgroup$ Commented Nov 14 at 11:29
  • $\begingroup$ Well, I didn't actually calculate the series for $1/e^x$, let alone match its terms with that of $e^{-x}$. I assumed that it's somehow known that $e^x$ and $e^{-x}$ are equal to their respective series, and that the series for $1$ sums to $1$. I didn't assume that functions in general equal their series (which would be overstepping, since they don't: eg $f(x)=e^{-1/x^2}$ with $f(0)$ defined to be $0$ does not equal its series except at $x=0$). But yes, you raise a good point. Hence my question: what are we allowed to assume? $\endgroup$ Commented Nov 17 at 5:01
3
$\begingroup$

This property can be naturally generated from $\exp(x+y)=\exp(x)\exp(y)$, by taking $y=-x$ to show $\exp(x)\exp(-x)=\exp(0)=1$.

As for $\exp(x+y)=\exp(x)\exp(y)$, it is natural enough “matching resulting series between each other”. Or you can try to show that $f(y)=\dfrac{\exp(x+y)}{\exp(x)}$ satisfies the definition of $\exp(y)$.

$\endgroup$
0
2
$\begingroup$

You know that $u:=\exp$ is the unique solution of $f'-f = 0$ and $f(0) = 1$. Hence $v:x \mapsto \exp(-x)$ is the unique solution of $f'+f = 0$ and $f(0) = 1$ (both can be shown by differentiating the power series). Hence $uv: x\mapsto \exp(x)\exp(-x)$ is the unique solution of $f' = 0$ and $f(0) = 1$ since $(uv)' = u'v+uv' = uv - uv = 0$. But a solution is obviously also the constant function $1$. Hence $uv = 1$, i.e., $e^{-x} = \dfrac{1}{e^x}$ for all $x \in \mathbb{R}$.

$\endgroup$
1
$\begingroup$

Let us start with the definition of the $\exp$ function: \begin{align*} \exp(x) = \sum_{n=0}^{\infty}\frac{x^{n}}{n!} \end{align*} which converges for every $x\in\mathbb{R}$. Now we shall prove that $\exp(x + y) = \exp(x)\exp(y)$. Indeed, \begin{align*} \exp(x)\exp(y) & = \sum_{n=0}^{\infty}\sum_{k=0}^{n}\frac{x^{k}}{k!}\frac{y^{n - k}}{(n - k)!}\\ & = \sum_{n = 0}^{\infty}\frac{1}{n!}\sum_{k=0}^{n}\frac{n!}{k!(n - k)!}x^{k}y^{n - k}\\ & = \sum_{n = 0}^{\infty}\frac{(x + y)^{n}}{n!}\\ & = \exp(x + y) \end{align*} Thus, $1 = \exp(0) = \exp(x + (-x)) = \exp(x)\exp(-x)$, from whence the desired relation holds.

Hopefully this helps!

$\endgroup$
1
$\begingroup$

You can make an ansatz: invert the formal power series $\sum_{n \geq 0} a_nX^n$. So find $\sum_{n \geq 0} b_n X^n$ with $1 = (\sum_{n \geq 0} a_n X^n)(\sum_{n \geq 0} b_n X^n) = \sum_{n \geq 0} \sum_{k = 0}^n a_kb_{n-k} X^n$, i.e., $a_0 b_0 = 1$ and $\sum_{k=0}^n a_kb_{n-k} = 0$ for $n \geq 1$. Hence $b_0 = 1/a_{0}$ and $b_n = -\frac{1}{a_0}\sum_{k=1}^n a_k b_{n-k}$ for $n \geq 1$.

For $\exp$ it is $a_n = \frac{1}{n!}$. Hence $b_0 = 1/a_0 = 1$ and $b_n = -\sum_{k = 1}^n \frac{b_{n-k}}{k!}$. Hence $b_0 = 1$, $b_1 = -b_0/1! = -1$, $b_2 = -b_1/1! - b_0/2! = 1-1/2 = 1/2 = 1/2!$, $b_3 = -b_2/1!-b_1/2!-b_0/3! = -1/2+1/2-1/3! = -1/3!$, $\dots$ So claim that $b_{n} = (-1)^{n}/n!$ and show it by induction.

$\endgroup$

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.