The problem of recognizing when a complicated mathematical expression equals zero has great importance in symbolic mathematics. This paper gives two algorithms which can be applied to many such problems, and discusses a concrete example.
The algorithms are based on the recognition that many interesting functions (such as exponentiation) are eigenvectors of well studied transformations (such as differentiation).