It is a simple matter to compute the function of a Clifford number or any square matrix if the function is a polynomial. However difficulties arise for more complicated functions. In the course of dealing with square roots of Clifford numbers, Garret Sobczyk became acquainted with some of the literature on the generalized spectraldecompositions of a linear operator. This decomposition removes these difficulties. Since this approach is not well known, Sobczyk has published a sequence of elegant expository articles to popularize the application of this method. He has also introduced an improved algorithm to deal with the case for which there are multiple roots in the minimal polynomical for the linear operator. In this paper we will carry this slightly further to obtain an explicit formula for the projection operators.

jsnygg@post.harvard.edu