×

Cyclic decomposition of unitary spaces. (English) Zbl 0539.51008

The main result of the present paper is: If \(\pi\) is a unitary transformation that is similar to its inverse, then the vector space V is an orthogonal sum of regular \(\pi\)-cyclic and \(\pi\)-bicyclic subspaces. For arbitrary unitary spaces this does not imply that \(\pi\) is a product of two unitary involutions, although \(\pi\) is a product of involutions in GL(V). But a unitary transformation \(\pi\) of a complex inner product space is a product of two unitary involutions if the spectrum of \(\pi\) is symmetric to the real axis.

MSC:

51F25 Orthogonal and unitary groups in metric geometry
20H20 Other matrix groups over fields
Full Text: DOI

References:

[1] C. Davis. Separation of two linear subspaces, Acta Szeged 19 (1958), 172–187. · Zbl 0090.32603
[2] E.W. Ellers. Bireflectionality in classical groups, Canadian J. Math. 29 (1977), 1157–1162. · Zbl 0371.15009 · doi:10.4153/CJM-1977-115-2
[3] E.W. Ellers and W. Nolte. Bireflectionality of orthogonal and symplectic groups, Arch. Math. 39 (1982), 113–118. · Zbl 0491.51019 · doi:10.1007/BF01899190
[4] R. Gow. Products of two involutions in classical groups of characteristic 2, J. Algebra 71 (1981), 583–591. · Zbl 0464.20029 · doi:10.1016/0021-8693(81)90198-8
[5] B. Huppert. Isometrien von Vektorräumen 1,2, Arch. Math. 35 (1980), 164–176; Math. Z. 175 (1980), 5–20. · Zbl 0438.15013 · doi:10.1007/BF01235335
[6] N. Jacobson. Lectures in Abstract Algebra., Vol. II, D. Van Nostrand, Princeton, N.J., 1953.
[7] M.J. Wonenburger. Transformations which are products of two involutions, J. Math./Mech. 16 (1966), 327–338. · Zbl 0168.03403
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.