Littlewood's algorithm and quaternion matrices
โ Scribed by Dennis I. Merino; Vladimir V. Sergeichuk
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 137 KB
- Volume
- 298
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
A strengthened form of Schur's triangularization theorem is given for quaternion matrices with real spectrum (for complex matrices it was given by Littlewood). It is used to classify projectors (A 2 = A) and self-annihilating operators (A 2 = 0) on a quaternion unitary space and examples of unitarily wild systems of operators on such a space are presented. Littlewood's algorithm for reducing a complex matrix to a canonical form under unitary similarity is extended to quaternion matrices whose eigenvalues have geometric multiplicity 1.
๐ SIMILAR VOLUMES
Determinants of matrices over a field are multiplicative. Does there exist an extension of the definition of determinants of real matrices to quaternion matrices, such that the multiplication theorem holds? This paper proves there does not exist such an extension. We give a universal property on mul
By using the LITTLEWOOD matrices B g n we generalize CLAEKSON'S inequelitiee, or equivalently, we determine the norms IIAzn : Z,2"(Lp) + Zr(Lp)ll completely. The result is compared with the norms IIAp : 1,2" -+ Zrl l , which are calculated implicitly in PIETSOE [el.