Abstract
McDonald and Paparella [Linear Algebra Appl. 498 (2016), 145–159] gave a necessary condition on the structure of Jordan chains of -cyclic matrices. In this work, that necessary condition is shown to be sufficient. As a consequence, we provide a spectral characterization of nonsingular, -cyclic matrices. In addition, we provide results for the Jordan chains corresponding to the eigenvalue zero of singular matrices. Along the way, a new characterization of circulant matrices is given.
keywords:
digraph , bipartite digraph , cyclically
-partite digraph , circulant matrix
1 Introduction
A celebrated result in spectral graph theory states that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric (i.e., is an eigenvalue whenever is). However, as noted by Nikiforov [6, p. 3], a bipartite digraph can not, in general, be characterized by its spectrum alone and restrictions on the Jordan structure of the matrix must be considered.
Recall that a directed graph (or digraph, for brevity) consists of a finite, nonempty set of vertices, together with a set of arcs. If is an -by- matrix with entries over a field , then the digraph of , denoted by , has vertex set and arc set .
A digraph is called -partite if there is a partition of such that, for each arc , there are positive integers such that and . A digraph is called cyclically -partite if there is a partition of such that, for each arc , there is a positive integer such that and (where, for convenience, ). Notice that there is no distinction between a cyclically bipartite digraph and a bipartite digraph, but there is if . Furthermore, notwithstanding its more restrictive nature, characterizing the spectral properties of cyclically -partite digraphs subsumes the case of bipartite digraphs.
A matrix is called -cyclic or cyclically -partite if is cyclically -partite. McDonald and Paparella [4, Lemma 4.1] showed that if is a nonsingular, -cyclic matrix with complex entries, then a given Jordan chain corresponding to an eigenvalue of determines a Jordan chain corresponding to , , where (for full details, see Lemma 4.10 below). As an immediate consequence, if the nonsingular Jordan block appears in any Jordan canonical form of , then the nonsingular Jordan block also appears in any Jordan canonical form of , [4, Corollary 4.2].
The central aim of this work is to establish a converse of this result—i.e., if a given Jordan chain corresponding to an eigenvalue of a matrix determines a Jordan chain chain for , for every eigenvalue of , then is -cyclic (see Theorem 4.14 below). As a consequence, we provide a spectral characterization of nonsingular, -cyclic matrices. In addition, we provide results for Jordan chains corresponding to the eigenvalue zero of singular matrices and implicitly provide an algorithm on computing these chains. Along the way, we provide a new characterization of circulant matrices and use this characterization to provide a more rigorous proof of a result by McDonald and Paparella [4, Lemma 4.3].
2 Notation and Background
For , denote by: the set ; the set ; and the complex number .
The algebra of -by- matrices over a field is denoted by ; when , the set is abbreviated to . If , then the -entry of is denoted by , , or .
If and , , then denotes the submatrix of whose rows and columns are indexed by and , respectively.
If , then the Hadamard product of and , denoted by , is the matrix such that .
If , then the -by- Jordan block with eigenvalue , denoted by , is defined by
|
|
|
where is the -by- matrix whose -entry equals one and zero otherwise.
2.1 Cyclically -partite matrices
If is cyclically -partite with partition , then is said to be h-cyclic with partition or that describes the -cyclic structure of A. The partition is consecutive if , . If is -cyclic with consecutive partition , then is of the form
|
|
|
(2) |
where , [1, p. 71]. If is not consecutive, then there is a permutation matrix such that is -cyclic with consecutive partition [1, p. 71]. Given that the eigenvalues of a matrix do not change with respect to permuatition similarity, hereinafter it is assumed, without loss generality, that every -cyclic matrix is of the form (2).
If and
|
|
|
where , then is said to be conformably partitioned with (or ).
Suppose that . Recall that if is an eigenvector corresponding to and , , then is called a Jordan chain of corresponding to . Furthermore, it can be shown that if is a Jordan chain, then is linearly independent and , .
The following partial products of submatrices of an -cyclic matrix will be of use in the sequel.
Definition 2.1.
Let and suppose that is of the form (2). For and , let
|
|
|
where is the -cycle of order defined by . For ease of notation, the matrix is abbreviated to . Notice that is a square matrix of order .
Remark 2.2.
Notice that
|
|
|
and is defined if since is an invertible map.
If is of the form (2), then
|
|
|
(3) |
(see, e.g., Brualdi and Ryser [1, p. 73]).
We note the following useful theorem due to Mirsky.
Theorem 2.3 (Mirsky [5, Theorem 1]).
Let and suppose that is of the form (2). If are the nonzero eigenvalues of , then the spectrum of consists of zeros and the -th roots of .
2.2 Circulant Matrices
We digress to briefly discuss circulant matrices (for a general reference, see Davis [2]).
Definition 2.4 ([2, p. 66]).
If , where , , and , then is called a circulant or a circulant matrix with reference vector , denoted , if
|
|
|
for every .
Definition 2.5.
Denote by the th canonical basis vector of . For , , the basic circulant of order , denoted by , is the circulant matrix defined by .
For example,
|
|
|
|
|
|
and, in general,
|
|
|
The following result, although unsurprising, provides a characterization of circulant matrices that, to the best of our knowledge, has not appeared previously in the literature.
Theorem 2.6.
If , then is a circulant matrix if and only if for all , where is the equivalence relation defined by
|
|
|
Proof.
Suppose that . If , then
|
|
|
as desired.
Conversely, suppose that for all and let
|
|
|
If and , then
|
|
|
i.e., . Thus,
|
|
|
as desired.
∎
4 Main Results
Given that it will be used in several of the subsequent results, hereinafter, , and .
The following result was established by McDonald and Paparella [4, Lemma 4.1] for nonsingular matrices; however, examining the proof reveals that the supposition is unnecessary.
Lemma 4.10 ([4, Lemma 4.1]).
Let and suppose that is of the form (2).
-
1.
If is a right Jordan chain corresponding to , where is partitioned conformably with respect to as
|
|
|
then, for , the set
|
|
|
is a right Jordan chain corresponding to .
-
2.
If is a left Jordan chain corresponding to , where is partitioned conformably with respect to as
|
|
|
then, for , the set
|
|
|
is a left Jordan chain corresponding to .
Remark 4.11.
Although McDonald and Paparella stated the aforementioned result for nonzero eigenvalues, the proof given is valid when . However, if any Jordan canonical form of has a singular Jordan block of size -by-, then the result does not yield another Jordan block (it does, at least, yield a different Jordan chain for that eigenvalue).
For example, consider the -cyclic matrix defined by
|
|
|
Since , it follows that the nonzero eigenvalues of are , , and . Furthermore, since
|
|
|
and
|
|
|
it follows that
|
|
|
is Jordan chain of length two associated with the eigenvalue zero. By Lemma 4.10,
|
|
|
is also a Jordan chain corresponding to zero, but any Jordan canonical form of has one Jordan block of order two and one Jordan block of order one.
The following results were presented by McDonald and Paparella [4, Lemma 4.3 and Remark 4.4]. We repeat the results for the sake of completeness and to give more rigorous proofs that utilize the novel characterization of circulant matrices given in Theorem 2.6.
Lemma 4.12 (c.f. [4, Lemma 4.3]).
If and , then
|
|
|
|
|
|
|
|
and
|
|
|
|
|
|
|
|
Proof.
The following facts are easily established:
|
|
|
|
(4) |
|
|
|
|
(5) |
|
|
|
|
(6) |
If and , then
|
|
|
|
|
|
|
|
(by (4)) |
|
|
|
|
(by (5)) |
|
|
|
|
(by (4)) |
|
|
|
|
(by (6)) |
If , then
|
|
|
so that, by Theorem 2.6, is a circulant. Since
|
|
|
it follows that
|
|
|
as desired.
For the second claim, notice that
|
|
|
|
|
|
|
|
(by (6)) |
|
|
|
|
(by (4)) |
|
|
|
|
(by (5)) |
|
|
|
|
(by (6)) |
|
|
|
|
as desired.
∎
Lemma 4.13 (c.f. [4, Remark 4.4]).
If and
|
|
|
(7) |
then
|
|
|
Proof.
Follows from the fact that circulant matrices are closed with respect to addition [2, Theorem 3.24] and the fact that
|
|
|
if and
|
|
|
whenever .
∎
Theorem 4.14.
Let and let be a partition of .
-
(i)
Suppose that, for every eigenvalue with corresponding right Jordan chain , and whenever the vector is partitioned conformably with respect to as
|
|
|
the set
|
|
|
is a right Jordan chain corresponding to for every .
-
(ii)
Suppose that, for every eigenvalue with corresponding left Jordan chain , and whenever the vector is partitioned conformably with respect to as
|
|
|
the set
|
|
|
is a left Jordan chain corresponding to for every
If the above hold, then is -cyclic with partition .
Proof.
By hypothesis, any Jordan canonical form of is of the form
|
|
|
For , let
|
|
|
and , where denotes the block-diagonal matrix with block-diagonal entries .
For , let be defined as in (7). By Lemmas 4.12 and 4.13 and properties of the Hadamard product, notice that
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
where
|
|
|
, and, for convenience, .
Clearly, the matrices are -cyclic with partition and since , it follows that is -cyclic with partition .
∎
Example 4.15.
Consider the matrices
|
|
|
and
|
|
|
where .
If and , then satisfies the hypotheses of Theorem 4.14, so is bipartite. Indeed, a calculation via a computer algebra system reveals that
|
|
|
The following result yields a complete characterization of the Jordan structure for invertible -cyclic matrices.
Theorem 4.16.
If is nonsingular and is a partition of , then is -cyclic with partition if and only if the Jordan chains of satisfy conditions (i) and (ii) of Theorem 4.14.
Proof.
Follows by Lemma 4.10 and Thereom 4.14.
∎