How does one prove that $$ a^{n+m} = a^{n} a^{m} $$ for $a,n,m \in \mathbb R$.
I can prove this for integers but how can one prove this for real numbers?
How does one prove that $$ a^{n+m} = a^{n} a^{m} $$ for $a,n,m \in \mathbb R$.
I can prove this for integers but how can one prove this for real numbers?
You need $a > 0$ for this to make sense.
Hint:
If you meant for $a>0$, then
$$a^{n+m}=\exp\left[(n+m)\ln{a}\right]$$
Now use some knowledge of $\log$ to finish proving.
Define
$$F(z) := x^{z+a}x^{-z}x^{-a} \qquad a,x,z \in \Bbb R$$
and assume $x > 0$. Then
$$F'(z) = 0$$
so $F(z)$ is a constant function, which means $F(z) = F(0)$ for all $z$. Now set $a = 0$ and we get
$$F(z) = x^z x^{-z} = F(0) = x^0 x^0 = 1 \iff x^z x^{-z} = 1 \iff x^{-z} = \frac{1}{x^z} \qquad (1)$$
Furthermore, we encounter
$$F(z) = x^{z+a}x^{-z}x^{-a} = F(0) = x^a x^{-a} \underset{(1)}{=} 1$$
Hence
$$F(z) = x^{z+a}x^{-z}x^{-a} = 1$$
which is
$$x^{z+a} = x^z x^a$$