On the Toeplitz and polar decompositions of an involutive matrix (Q2218186)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7296551
Language Label Description Also known as
default for all languages
No label defined
    English
    On the Toeplitz and polar decompositions of an involutive matrix
    scientific article; zbMATH DE number 7296551

      Statements

      On the Toeplitz and polar decompositions of an involutive matrix (English)
      0 references
      15 January 2021
      0 references
      The Toeplitz decomposition of a square complex matrix \(A\) is its representation in the form \(A=B+iC, B=B^\ast , C=C^\ast.\) The Hermitian matrices \(B\) and \(C\) are determined uniquely by the formulas \(B={\frac{1}{2}}(A+A^\ast), C={\frac{1}{2i}}(A-A^\ast).\) The polar decompositions of \(A\) are its representations of the form \(A = PU = UQ.\) Here, \(U\) is a unitary matrix, and the Hermitian matrices \(P\) and \(Q\) are positive semi-definite. Moreover, \(P=(AA^\ast)^{1/2} , \,\, Q=(A^\ast A)^{1/2}.\) The main result that the author obtains is the following: Theorem. Assume that an involution \(A\) is not a Hermitian matrix. Then, by a unitary similarity transformation, \(A\) can be brought to a block diagonal matrix in which the first order blocks are either \(1\) or \(-1\). The other blocks have even orders. Every block of order \(2k\) is associated with a pair of eigenvalues \(\pm\cosh t\) of the matrix \(B\) and the corresponding pair of eigenvalues \(\pm\sinh t\) of \(C\). Each of these eigenvalues is of multiplicity \(k\).
      0 references
      involutive matrix
      0 references
      Toeplitz decomposition
      0 references
      polar decomposition
      0 references
      unitary similarity transformation
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references