Suppose we have a ring R. We can define E as the class of functions from R to R such that
$$ \forall f \in E. \, x y \in R. \, f (x \cdot y) = f (x) \cdot f(y) $$ $$ \forall f \in E. \, x \in R. \, n \in \mathbb{N} . \, f (x^n) = (f (x))^n $$
Where exponention by naturals is defined as repeated multiplication.
We can then define
$$ E_0 (x) = R_1 $$ $$ E_1 (x) = x $$ $$ \forall f g \in E. \, x \in R. \, (f \cdot g)(x) = f(g(x)) $$ $$ \forall f g \in E. \, x \in R. \, (f + g)(x) = f(x) \cdot g(x) $$
Where $R_1$ is the identity element.
$$ E_0 (x) \cdot E_0 (y) = R_1 \cdot R_1 = R_1 = E_0 (x \cdot y) $$ $$ (E_0 (x))^n = (R_1)^n = R_1 = E_0 (x^n) $$
So $E_0$ is in $E$.
$$ E_1 (x) \cdot E_1 (y) = x \cdot y = E_1 (x \cdot y) $$ $$ (E_1 (x))^n = x^n = E_1 (x^n) $$
So $E_1$ is in $E$.
$$ (f \cdot g) (x) \cdot (f \cdot g) (y) = f (g (x)) \cdot f (g (y) = f (g (x) \cdot g(y)) = f(g(x \cdot y)) = (f \cdot g) (x \cdot y)$$ $$ ((f \cdot g) (x))^n = f (g(x))^n = f (g(x)^n) = f(g(x^n)) = (f \cdot g) (x ^n) $$
So $(f \cdot g)$ takes two $E$ to $E$.
$$ (f + g) (x) \cdot (f + g) (y) = f (x) \cdot g(x) \cdot f (y) \cdot g (y) = f (x \cdot y) \cdot g(x \cdot y) = (f + g)(x \cdot y)$$ $$ ((f + g) (x))^n = f (x)^n \cdot g(x)^n = f (x^n) \cdot g(x^n) = (f + g)(x^n) $$
So $(f + g)$ takes two $E$ to $E$.
I think $E$ is isomorphic to the reals when the ring is reals and just functions $\lambda x. x^a$.
Is $E$ always isomorphic to $R$? What would $E$ be for more complicated rings such as the ring of square matrices?
I think it is important to note that
$$ \ln f (e^{x + y}) = \ln f (e^x) + \ln f(e^y) $$ $$ \ln f (e^{nx}) = n \ln f (e^x) $$
so
$$ g(x) = \ln f(e^x) $$
is a linear map if appropriate logarithm and exponential functions are defined.