Matrices similar to partial isometries
Stephan Ramon Garcia, David Sherman

TL;DR
This paper characterizes when a matrix can be transformed into a partial isometry through similarity, refining previous mathematical results.
Contribution
It provides a refined criterion for matrix similarity to partial isometries, advancing understanding in operator theory.
Findings
Established new necessary and sufficient conditions for similarity to partial isometries.
Improved upon previous results by Halmos--McLaughlin.
Enhanced theoretical framework for matrix classification.
Abstract
We determine when a matrix is similar to a partial isometry, refining a result of Halmos--McLaughlin.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms
Matrices similar to partial isometries
Stephan Ramon Garcia
Department of Mathematics, Pomona College, 610 N. College Ave., Claremont, CA 91711
[email protected] http://pages.pomona.edu/~sg064747 and
David Sherman
Department of Mathematics, University of Virginia, P.O. Box 400137, Charlottesville, VA 22904-4137
[email protected] http://people.virginia.edu/~des5e/
Abstract.
We determine when a matrix is similar to a partial isometry, refining a result of Halmos–McLaughlin.
Key words and phrases:
Partial isometry; partially isometric matrix; similarity; Jordan form
2010 Mathematics Subject Classification:
15A21
The authors acknowledge the support of NSF grants DMS-1265973 and DMS-1201454.
1. Introduction
A Hilbert space operator is a partial isometry if the restriction of to is isometric. For a complex matrix, this means that all of its singular values are in , or in other words, the positive semidefinite factor in its polar decomposition is an orthogonal projection. These properties are not preserved by similarity; for example
[TABLE]
are similar, since both matrices have the same Jordan canonical form. The first is a partial isometry since its nonzero columns are orthonormal, but the second is not. Which matrices are similar to a partial isometry?
The basic features of partial isometries were laid out over fifty years ago [6, 2, 7], and the similarity question is not new – but most work has focused on the (still unresolved) infinite-dimensional case, e.g., [3]. In the finite-dimensional case, the best result was a theorem of Halmos–McLaughlin stating that the characteristic polynomial of a nonunitary partial isometry can be any monic polynomial whose roots lie in the closed unit disk and include zero [6, Theorem 3]. The referee pointed out that this can be deduced directly from the Weyl–Horn inequalities [8, 13], which say that there exists an matrix with prescribed singular values and eigenvalues , indexed so that , if and only if
[TABLE]
and
[TABLE]
For an partial isometry of rank , we have
[TABLE]
Hence any points (with possible repetition) in the closed unit disk can be its eigenvalues, so long as at least of them are zero.
Of course the characteristic polynomial is a similarity invariant for matrices, but not a complete one. Here we go further and determine the possible Jordan forms of a partially isometric matrix. One interesting feature of this question is that the property “similar to a partial isometry” does not pass to direct summands: the matrix , a direct summand of the second matrix in (1), is not similar to a partial isometry.
In what follows, , , denote the open unit disk, the closed unit disk, and the unit circle, respectively. We write for similarity and for unitary similarity. The spectrum of a matrix is denoted ; here denotes the set of complex matrices. We let denote the Jordan matrix with eigenvalue , and we remind the reader that the nullity of is exactly the number of Jordan blocks for the eigenvalue .
Theorem 1**.**
* is similar to a partial isometry if and only if the following conditions hold:*
- (a)
; 2. (b)
if , then its algebraic and geometric multiplicities are equal; 3. (c)
* for each .*
It is classical (e.g., [7, Lemma 1]) that partial isometries are exactly the operator solution set of the *-polynomial equation After proving Theorem 1, we make a few remarks on similarity orbits of such “noncommutative *-varieties.”
2. Proof of Theorem 1
Before proving Theorem 1, we prepare a few lemmas. The first is a variation of the Halmos–McLaughlin result quoted earlier [6, Theorem 3], restricting to tuples in and obtaining the extra condition (c).
Lemma 2**.**
For any , there exists an upper triangular partial isometry such that
- (a)
the diagonal of is ; 2. (b)
the columns are orthonormal; 3. (c)
the entries of on the first superdiagonal are all nonzero.
Proof.
We proceed by induction on . In the base case ,
[TABLE]
is a partial isometry with the desired properties. Now suppose that the theorem has been proved for some . Given , there exists a partial isometry of the form
[TABLE]
such that the columns are orthonormal. Now select a vector of norm that is orthogonal to . Let
[TABLE]
Since the nonzero columns of are orthonormal, it follows that is an upper triangular partial isometry that satisfies (a) and (b). If , then
[TABLE]
so that the upper right submatrix has orthogonal nonzero columns, which is impossible. Thus , which completes the induction. ∎
Lemma 3**.**
If is upper triangular with , and the entries on the first superdiagonal of are all nonzero, then .
Proof.
By hypothesis, . Thus the Jordan canonical form of consists of the single block . ∎
The following lemma is [10, Theorem 2.4.6.1]:
Lemma 4**.**
Suppose that is block upper triangular, and each is upper triangular with all diagonal entries equal to . If for , then .
Proof of Theorem 1.
() Conditions (a), (b), and (c) are invariant under similarity, so it suffices to show that they are satisfied by any partial isometry . Since is a contraction, it follows that . This is (a).
Now suppose that has algebraic multiplicity . By Schur’s Theorem on unitary triangularization [10, Theorem 2.3.1], we may assume that has the form
[TABLE]
in which and are upper triangular, , and . This entails that the diagonal entries of are all . Since is a contraction, each of its columns and rows has norm at most one, forcing and . Then . Since , it follows that the algebraic and geometric multiplicities of , as an eigenvalue of , are equal. Thus (b) holds.
Finally, let and write for some unitary and projection of rank . If , then is nonsingular and hence
[TABLE]
Thus , or in other words . This proves (c).
() Suppose that satisfies (a), (b), and (c). If , in which are distinct and have algebraic multiplicities , respectively, then
[TABLE]
in which (it is possible that is vacuous, in which case is similar to a unitary matrix). Since each summand is an isometry, is similar to a partial isometry if is. We therefore assume that . This ensures that has an eigenvalue in , so (c) implies that .
Let , which equals the number of Jordan blocks for the eigenvalue [math] in the Jordan canonical form of . Condition (c) ensures that the Jordan canonical form of has at most Jordan blocks corresponding to any nonzero eigenvalue of . It therefore suffices to show that any matrix of the form
[TABLE]
in which are distinct, is similar to a partial isometry. Indeed, is similar to a direct sum of matrices of the form (2).
Lemma 2 ensures that there exists a partial isometry with nonzero entries on the first superdiagonal, whose diagonal entries are (in order)
[TABLE]
Partition conformally with , so that . Lemma 3 ensures that , so by Lemma 4. ∎
Remark. A general result about spectral matrices implies that a partial isometry satisfies (b) of Theorem 1. A matrix is spectral if its spectral radius equals its numerical radius. A partial isometry that has an eigenvalue of unit modulus has spectral radius and numerical radius and is therefore spectral. If the multiplicity of is , then [4, Theorem 1] ensures that , in which is an upper triangular partial isometry that does not have as an eigenvalue. See also [9, Section 1.5, Problems 24 & 27].
3. Noncommutative *-varieties
The common operator solution set of a finite collection of *-polynomial equations in some number of variables is a *noncommutative -variety; when the polynomials do not involve adjoints, it is a noncommutative variety. (This term is in general use, although the precise definition varies from paper to paper.) Noncommutative varieties are invariant under similarity, but noncommutative *-varieties typically are invariant only under unitary similarity. Theorem 1 describes the similarity orbit of the matricial part of the noncommutative *-variety determined by the polynomial .
Many other sets can be described as *-varieties. Hermitian operators correspond to , normal operators to . It is easy to describe the similarity orbit of the normal matrices: since these are unitarily diagonalizable, it means exactly that for each eigenvalue, the algebraic and geometric multiplicities are equal. For Hermitian matrices, one adds the requirement that all eigenvalues are real. Here is another example that is not too different from Theorem 1, making one small change to the *-polynomial determining partial isometries.
Proposition 5**.**
A matrix is similar to a solution of if and only if
- (a)
the spectrum of is contained in ; 2. (b)
for each eigenvalue, the geometric and algebraic multiplicities are equal; 3. (c)
the nullity of is at least as great as the sum of the nullities of for all .
Proof.
By [11, Theorem 8], the noncommutative *-variety determined by consists exactly of products of pairs of orthogonal projections. We proceed by determining the Jordan form of a product of two orthogonal projections .
From Halmos’ two projections theorem ([5, Theorem 2], see also [1, Theorem 1.1 and Corollary 2.2]), we deduce that
[TABLE]
where , , and . Thus
[TABLE]
which is similar to
[TABLE]
In a basis of eigenvectors of , each eigenvector for is paired with an eigenvector for [math]. This yields (a), (b), and (c).
Conversely, any Jordan form satisfying (a), (b), and (c) can be written as in (3) and is similar to the product of orthogonal projections and as above. ∎
Remark. Taking the similarity orbit is one way to change a noncommutative *-variety. Another way is to replace the defining equalities with similarities. This generally produces a different set, not necessarily smaller or larger than the similarity orbit, and also not canonical because it requires a choice about how to write the original equations. For instance, the same *-variety is determined by or ; it could become (which is still just the set of Hermitian operators) or . The latter set has been much studied, sometimes under the name generalized Hermitian operators, and is larger than the similarity orbit of the Hermitian operators. Here is one comparison: a matrix is similar to its adjoint if and only if it is the product of two Hermitian matrices, while it is similar to a Hermitian matrix if and only if it is the product of a positive definite and a Hermitian [14, 11]. See [12] for a modern treatment of generalized Hermitian operators.
Applying this variation to our Theorem 1, let be the set of matrices satisfying . Unlike the other sets considered in this paper, it appears that might not have an alternative easy description. It contains (not a partial isometry), but it does not contain , which is similar to the partial isometry . Thus is distinct from the set of partially isometric matrices and its similarity orbit, and in fact is not closed under similarity.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Böttcher and I. M. Spitkovsky. A gentle guide to the basics of two projections theory. Linear Algebra Appl. , 432(6):1412–1459, 2010.
- 2[2] I. Erdélyi. On partial isometries in finite-dimensional Euclidean spaces. SIAM J. Appl. Math. , 14:453–467, 1966.
- 3[3] L. A. Fialkow. Which operators are similar to partial isometries? Proc. Amer. Math. Soc. , 56:140–144, 1976.
- 4[4] M. Goldberg, E. Tadmor, and G. Zwas. The numerical radius and spectral matrices. Linear and Multilinear Algebra , 2:317–326, 1975.
- 5[5] P. R. Halmos. Two subspaces. Trans. Amer. Math. Soc. , 144:381–389, 1969.
- 6[6] P. R. Halmos and J. E. Mc Laughlin. Partial isometries. Pacific J. Math. , 13:585–596, 1963.
- 7[7] J. Z. Hearon. Partially isometric matrices. J. Res. Nat. Bur. Standards Sect. B , 71B:225–228, 1967.
- 8[8] A. Horn. On the eigenvalues of a matrix with prescribed singular values. Proc. Amer. Math. Soc. , 5:4–7, 1954.
