Solvability of meromorphic equations in elementary functions

An equation $f(x)=a$, where $f$ is a complex meromorphic function and $a\in\mathbb{C}$ is a parameter, is solvable in elementary functions if the inverse map $x=f^{-1}(a)$ can be expressed as a finite composition of arithmetic operations (addition, subtraction, multiplication, and division), the exponential function, the complex logarithm, and constants. Specific functions such as $\tan x - x$, $\exp x + x$, $x^x$ have been proven to be unsolvable by Kanel-Belov, Malistov, Zaytsev, while almost all entire surjective functions of at most exponential growth have been covered by Zelenko. All these rely on one-dimensional topological Galois theory, developed by Khovanskii. We generalize to provide a proof for the unsolvability of all elementary meromorphic functions $f$ such that the derivative of $f$ has infinitely many roots $x_i$ and the set of distinct values $f(x_i)$ is infinite.

💡 Research Summary

The paper investigates the solvability of equations of the form (f(x)=a) when (f) is a complex meromorphic function and (a) is a complex parameter, under the restriction that a solution must be expressible by a finite composition of the elementary operations (addition, subtraction, multiplication, division), the exponential function, and the complex logarithm. The authors extend previous isolated results—such as the unsolvability of (\tan x - x), (e^{x}+x), and (x^{x}) proved by Kanel‑Belov, Malistov, and Zaytsev, and the broad class of entire surjective functions of at most exponential growth treated by Zelenko—by establishing a general theorem that covers all elementary meromorphic functions whose derivative possesses infinitely many zeros and whose corresponding critical values form an infinite set.

The theoretical framework is built on one‑dimensional topological Galois theory, originally formulated by Khovanskii. In this setting, the inverse function (f^{-1}) is regarded as an (S)-function: a multivalued analytic function whose singularities are confined to a countable set. Each branch of (f^{-1}) can be analytically continued along paths in the complex plane that avoid the singular set. Continuation along a closed loop induces a permutation of the branches; the collection of all such permutations constitutes the monodromy group of (f). The paper reviews the necessary group‑theoretic background, notably the concepts of primitive group actions, blocks, and Wielandt’s theorem: for an infinite set (S), any primitive group containing a non‑identity permutation with finite support must contain the alternating group (\operatorname{Alt}(S)).

The main hypothesis is that (f) is an elementary meromorphic function (i.e., it can be built from rational functions by a finite tower of exponential and logarithmic extensions) and that the set of critical values
(B={a\in\mathbb{C}\mid \exists x,; f(x)=a,; f’(x)=0})
is infinite. Equivalently, the derivative (f’) has infinitely many distinct zeros ({x_i}) and the values (f(x_i)) are pairwise distinct. For each critical point (x_i) of order (m_i) (the first non‑vanishing derivative is the ((m_i+1))‑st), a small loop around the corresponding critical value produces a cycle of length (m_i+1) in the monodromy action. Consequently, the monodromy group (G_f) acts primitively on an infinite set of branches and contains permutations with finite support (the cycles just described).

Applying Wielandt’s theorem yields (\operatorname{Alt}(S)\subseteq G_f). Since the alternating group on an infinite set is non‑abelian and, in particular, not solvable, any group that contains it cannot be built from a finite sequence of abelian extensions. On the other hand, Proposition 4.3 of the paper shows that if the inverse function can be expressed by a tower of elementary extensions of depth at most (N), then its monodromy group must be solvable (the proof proceeds by induction on (N) and uses the fact that the monodromy groups of (\exp) and (\ln) are abelian). The presence of (\operatorname{Alt}(S)) therefore contradicts the possibility of a finite‑depth elementary representation of (f^{-1}).

Thus the authors conclude that for any elementary meromorphic function whose derivative has infinitely many zeros with infinitely many distinct critical values, the equation (f(x)=a) is unsolvable in elementary functions. This result subsumes the earlier specific examples and extends the unsolvability frontier to a broad class of transcendental equations. The paper also discusses the relationship with prior work: the functions treated by Kanel‑Belov et al. are special cases where the set of critical values is infinite, while Zelenko’s theorem applies when the function is entire, surjective, and of at most exponential growth but with a finite critical value set. By handling the infinite critical value scenario, the present work completes the picture for elementary meromorphic functions.

In summary, the authors combine topological Galois theory, the structure of primitive permutation groups, and differential‑field extensions to prove a sweeping unsolvability theorem. Their method shows that the presence of infinitely many distinct critical values forces the monodromy group to be large enough (containing the infinite alternating group) to preclude any representation by a finite composition of elementary operations, exponentials, and logarithms. This deepens our understanding of why many transcendental equations resist closed‑form solutions and delineates the precise algebraic‑topological obstruction behind such resistance.