Abstract
We show that the spectral theorem – which we understand to be a statement that every self-adjoint matrix admits a certain type of canonical form under unitary similarity – admits analogues over other ∗ -algebras distinct from the complex numbers. If these ∗ -algebras contain nilpotents, then it is shown that there is a consistent way in which many classic matrix decompositions – such as the Singular Value Decomposition, the Takagi decomposition, the skew-Takagi decomposition, and the Jordan decomposition, among others – are immediate consequences of these. If producing the relevant canonical form of a self-adjoint matrix were a subroutine in some programming language, then the corresponding classic matrix decomposition would be a 1-line invocation with no additional steps. We also suggest that by employing operator overloading in a programming language, a numerical algorithm for computing a unitary diagonalization of a complex self-adjoint matrix would generalize immediately to solving problems like SVD or Takagi. While algebras without nilpotents (like the quaternions) allow for similar unifying behaviour, the classic matrix decompositions which they unify are never obtained as easily. In the process of doing this, we develop some spectral theory over Clifford algebras of the form C l p , q , 0 ( R ) and C l p , q , 1 ( R ) where the former is admittedly quite easy. We propose a broad conjecture about spectral theorems.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.