Minimality of the exponential-recovery identity

Determine whether the displayed identity recovering $e^z$ from the activation function $F(z)=e^z+\ln z$ and rational operations is the simplest construction of its kind.

Background

The proposed Möbius-layer architecture uses the complex activation $F(z)=e^z+\ln z=\eml(z,z^{-1})$. A rational identity involving F(z)F(z), F(2z)F(2z), and F(3z)F(3z) recovers the exponential, after which the logarithm and the original EML operator can also be recovered.

The identity has relatively high reverse-Polish complexity, and the paper explicitly leaves unresolved whether a simpler identity exists. This is a concrete symbolic-complexity problem independent of the broader question of whether the resulting network can be optimized efficiently.

References

The constants used in identity, namely $1,2,3,\ln{2},\ln{3}$ are needed as written but are likely redundant. The complexity of identity in RPN form is K=23, far beyond direct enumeration reach, and it is not known whether it is the simplest possible construction of this kind.

Diversity of EML-type operators  (2609.11210 - Odrzywołek, 10 Sep 2026) in Section 4, “Möbius layer neural networks”