Solvability of Matrix-Exponential Equations

We consider a continuous analogue of (Babai et al. 1996)'s and (Cai et al. 2000)'s problem of solving multiplicative matrix equations. Given k + 1 square matrices A(1),...,A(k),C, all of the same dimension, whose entries are real algebraic, we examine the problem of deciding whether there exist non- negative reals t(1,...,)t(k) such that Pi(k)(i=1) exp(A(i)t(i)) = C. We show that this problem is undecidable in general, but decidable under the assumption that the matrices A(1,...,)A(k) commute. Our results have applications to reachability problems for linear hybrid automata. Our decidability proof relies on a number of theorems from algebraic and transcendental number theory, most notably those of Baker, Kronecker, Lindemann, and Masser, as well as some useful geometric and linear-algebraic results, including the MinkowskiWeyl theorem and a new (to the best of our knowledge) result about the uniqueness of strictly upper triangular matrix logarithms of upper unitriangular matrices. On the other hand, our undecidability result is shown by reduction from Hilbert's Tenth Problem.