1. Introduction and Preliminaries
The
tropical semiring is the set
equipped with the operations of tropical addition
and tropical multiplication
where 0 and
are the multiplicative neutral element and the additive neutral element, respectively. The completed tropical semiring
is the tropical semiring augmented with an extra element
(see [
1]). Note that, by definition,
Let
denote the set of
matrices with entries in
. As in conventional linear algebra, we can extend the operations ⊕ and ⊗ on the tropical semiring
to
Indeed, if
, then we have
for all
(
), where
and
denote the
-th entries of the matrices
and
, respectively. For brevity, we usually write
in place of
for a product of matrices. It is easy to check that
is an idempotent semiring. The additive neutral element of
is the tropical
matrix whose entries are all
, denoted by
, and the multiplicative neutral element of
is the tropical identity matrix whose diagonal entries are 0 and off-diagonal ones are
, denoted by
. We are interested in studying the multiplicative structure of the tropical matrices. There is a series of papers in the literature studying the multiplicative structure of this semiring (see [
2,
3,
4,
5]).
Recall that a tropical matrix
is said to be
idempotent if
and a tropical matrix
is said to be
normal if
and
for all
(see [
1,
6]). Since we never refer to classical matrices in this paper, the following matrices refer to tropical matrices. A matrix
is said to be
strongly regular if the system
has a unique solution for some
. It is well known that an
matrix
is strongly regular if and only if it has a strong permanent (see [
1] [Proposition 6.2.2])—that is, there exists a unique
such that
where
is called the
permanent of
A. Throughout this paper,
and
stand for the set of all idempotent
matrices and all idempotent normal
matrices, respectively.
stands for the set of all strongly regular idempotent normal matrices and
stands for the set of all idempotent normal matrices that are not strongly regular (that is,
). For more details about idempotent normal matrices, the reader is referred to [
2,
7,
8,
9,
10,
11].
An
matrix is called
diagonal—notation
—if its diagonal entries are
and the off-diagonal entries are
. A matrix is said to be a
permutation matrix (
generalized permutation matrix, respectively) if it is formed from the identity matrix (the diagonal matrix, respectively) by reordering its columns and/or rows. Let
and
denote the set of all generalized permutation matrices and the set of all permutation matrices in
, respectively. It is easy to see that
and
are subgroups of the semigroup
. In fact, the position of generalized permutation matrices in max-algebra is slightly more special than in conventional linear algebra as they are the only matrices having an inverse (see ([
1], Theorem 1.1.3)). Let
. Define
where
denotes an
permutation matrix whose
i-th row is equal to the
-th row of
for any
. It is easy to check that
,
, where
will be called the
generalized centralizer group of
A and
(or
) will be called the
centralizer group of
A (see [
11]).
There are a series of papers in the literature that study tropical matrix groups. In 2011, Johnson and Kambites [
5] studied the algebraic structure of the multiplicative semigroup of all tropical
matrices. They described completely the structures of maximal subgroups of this semigroup. In 2012, Shitov [
3] gave a complete description of the subgroups of the multiplicative semigroup of tropical
matrices up to isomorphism. They showed that every group of tropical matrices is isomorphic to a subgroup of
and therefore embeds into the permutation wreath product
. In 2018, Izhakian et al. [
12] studied the structure of the maximal subgroups of finitary tropical
matrices. They showed that the maximal subgroup containing a tropical idempotent matrix
E is isomorphic to
. Moreover, the maximal subgroup is, up to isomorphism, exactly the direct product of
and
. In 2018, Yang [
4,
13] studied the generalized centralizer groups of nonsingular tropical idempotent matrices. In particular, a decomposition of the generalized centralizer groups of nonsingular symmetric tropical idempotent matrices was given. In 2022, Deng et al. [
11] studied the generalized centralizer groups and centralizer groups of tropical
matrices. They proved that the centralizer group of a tropical matrix is isomorphic to the centralizer group of an idempotent normal matrix
E. Moreover, the structure of the centralizer group of
E is given when
E is not strongly regular. In this paper, by means of the introduction of the equivalent standard form of idempotent strongly definite matrices, we obtain that the centralizer group of every not strongly regular idempotent normal matrix is equal to the centralizer group of some strongly regular idempotent normal matrix. Further, a structural description of the centralizer groups of partial strongly regular idempotent normal matrices is given. Our results generalize and enrich corresponding results about idempotent normal matrices and their centralizer groups (see [
11]).
In the remainder of this section, we recall some notions and results related to the weighted digraph
of a matrix
A (see [
1]), which will be required later. Let
. The
weighted digraph associated with A is
, where the node set
and the edge set
with weights
for all
. Suppose that
is a path in
; then, the
weight of
is defined to be
if
and
if
. The number
is called the
length of
, denoted by
. Recall that a path
is called a
cycle if
and
, and it is called an
elementary cycle if, moreover,
for any
and
The
maximum cycle mean of
A, denoted by
, is defined by
where the maximization is taken over all elementary cycles in
and
denotes the mean of a cycle
A cycle in is called critical if its cycle mean is equal to . The nodes and the edges of that belong to some critical cycles are called critical. The critical digraph of A is the digraph where and denote the set of critical nodes and critical edges of , respectively. If belong to the same critical cycle, then i and j are called equivalent in and we write Clearly, is an equivalence relation on
A matrix
A is called
definite if
. Thus, a matrix is definite if and only if all cycles in
are non-positive (i.e., its cycle mean is non-positive) and at least one has weight zero. A matrix
is called
increasing if
for all
, and is called
strongly definite if it is definite and increasing. Since the diagonal entries of
A are the weights of cycles (loops), we have that
for all
if
A is strongly definite. In the following,
stands for the set of all idempotent strongly definite matrices. For more details about idempotent strongly definite matrices, the reader is referred to ([
1], Section 6.2).
In addition to this introduction and preliminaries, this paper comprises two sections. In
Section 2, we give some characterizations of
and introduce the equivalent standard forms of
E, where
. In particular, we give the observation of the equivalent standard forms of
. In
Section 3, by using the centralizer groups of idempotent normal matrices we introduce an equivalence relation
on
. We prove that every
-class contains at least one strongly regular idempotent normal matrix. Let
. A new idempotent normal matrix
is constructed from
E, where
is an off-diagonal entry of
E. We give the equivalent conditions for which
is not strongly regular. Further, a structural description of
is given when
is not strongly regular.
For other notations and terminologies not given in this article, the reader is referred to the books [
1,
14,
15].
2. The Equivalent Standard Forms of Idempotent Strongly Definite Matrices
Let
denote the set of all
n-tuples
x with entries in
. We write
for the
i-th component of
x. For any
, we define
where
. We set
and
for any
. The map
is a residuation operator in the sense of residuation theory [
16], and is ubiquitous in tropical algebra. Notice that
if and only if
.
if and only if there exists
such that
and
.
As a consequence of ([
7], Lemma 5.3), we have the following:
Lemma 1. Suppose that . Let denote the rows of E and denote the columns of E. Then,
- (i)
for any
- (ii)
If , then and for all .
Proof. Part (i) is a direct consequence of ([
7], Lemma 5.3).
To prove part (ii), let . Suppose that for some . Then, . Since for any , it is implied that . Hence, for all . This contradicts . Thus, for all . Similarly, for all . □
Furthermore, we have the following lemma.
Lemma 2. Let and . Then, the following are equivalent:
- (i)
;
- (ii)
for all ;
- (iii)
for all .
Proof. We need only to prove the equivalence of and , since the equivalence of and may be showed dually.
. Suppose that . Then, by Lemma 1 and , and where and denote the i-th and j-th row of E, respectively. Moveover, , and so . That is, for all .
. Suppose that for all . Setting , we have . Setting , we have . Thus, . □
Let . It is easily seen that the maximum cycle mean and that every node of is critical, since all the diagonal entries of E are equal to 0. That is, . So, is an equivalence relation on .
Note that
. It is clear that Lemma 2 generalizes the part results of ([
11], Lemma 3.2), which asserts that if
and
, then
if and only if
. Now, let
. If
, then
by
. However, the inverse of this result is not true. In fact, for idempotent strongly definite matrices, we have the following:
Proposition 1. Let and . Then, the following are equivalent:
- (i)
;
- (ii)
;
- (iii)
for all ;
- (iv)
for all .
Proof. We need only to prove the equivalence of , , and , since the equivalence of , , and may be showed dually.
. Suppose that . Then, there is a critical cycle containing both i and j in . We shall write where and . Moreover, . Since E is idempotent, it follows that and . Thus, , and so .
. Suppose that
. Then, by Lemma 1,
, and so
—i.e.,
This means that
for any
. Putting
, we deduce that
for all
.
. Suppose that for all . Putting , we obtain that . Thus, is a critical cycle with length two in . Consequently, . □
It is clear that the above proposition is a generalization of ([
11], Lemma 3.2). As usual,
(resp. ∇) stands for the equality relation (resp. universal relation).
Proposition 2. Let . Then, E is not strongly regular ⟺.
Proof. Suppose that E is not strongly regular. Then, there exists such that . Write as a product of non-trivial disjoint cycles, say, . Then, any such cycle , say, , satisfies . Since E is idempotent, it follows that . Moreover, . By , which implies that . It follows from Proposition 1 that , and so .
Assume that
. Then, by Proposition 1,
for some
and
. It follows from ([
7], Lemma 3.3) that
. Hence, the transposition
attains the permanent of
E, as required. □
Let
. Recall that
is called
a block for
G if for each
either
or
, where
. Clearly, for each
,
is also a block for
G (see [
14]).
A G-congruence on
is an equivalence relation ∼ on
with the property that
Let
G be transitive on
and
a block for
G. Then,
is a partition of
and
for each
.
is called
a system of blocks for
G containing
. If ∼ is a
G-congruence on
, then the equivalence classes of ∼ form a system of blocks for
G (see ([
14], Exercise 1.5.4)).
Proposition 3. Let and be the set of all classes of . Then, is a -congruence on . Also, is a system of blocks for if is transitive on .
Proof. Suppose that
. Then, for any
This shows that
is a
-congruence on
, and so
is a system of blocks for
if
acts transitively on
. □
Now, suppose that and is the set of all classes of where If E is not strongly regular, then by Proposition 2. Without loss of generality, let and for any . That is, and . It follows from Proposition 1 that for any and , and .
Next, for each
we shall write
Take
such that
for each
. Further, by permuting simultaneously the rows and columns of
E with
, we obtain the following block matrix,
:
where
, for each
,
is an antisymmetric
matrix, and for any
and
,
is an
matrix with
for any
and
for any
. In fact, since
, we have that
and
for any
. Then, for each
,
This implies that
is the set of all classes of
and
for any
. That is to say,
is an antisymmetric
matrix for each
. Also,
and
for any
and
. Moreover, for any
with
,
is an
matrix with
for any
and
for any
.
Now, we shall call the block matrix the equivalent standard form of It is easy to see that every idempotent strongly definite matrix E can be transformed in linear time by simultaneous permutations of the rows and columns to an equivalent standard form as above.
In particular, let
Then,
E is equivalent to the following equivalent standard form
:
where
and
is an
matrix with all entries
for any
with
In fact, since
for any
and
, it follows that
for any
and
by
. Thus, all diagonal blocks of
are 0. Moreover, for any
with
,
for any
and
for any
. Thus, all entries of
are equal.
Notice that if
for some
with
then
. In fact, suppose that
. Then,
and
. That is,
for any
and
This follows from ([
11], Lemma 3.2) that
for any
and
This contradicts the fact that
and
are two different
-classes.
Remark 1. In general, the equivalent standard forms of E are not unique. For instance, letIt is easy to see that . If we take , then is an equivalent standard form of E as follows:If we take , then is also an equivalent standard form of E as follows: In fact, for a general idempotent strongly definite matrix
E, the diagonal blocks of the equivalent standard form of
E are determined uniquely up to a simultaneous permutation of the rows and columns. Any such form is essentially determined by the critical components of
. The form forms an interesting correspondence with the Frobenius normal form of
E, which is essentially determined by the strongly connected components of
(see [
1]).
3. The Centralizer Groups of Idempotent Normal Matrices
In this section, we shall study the centralizer groups of tropical matrices. By ([
11], Proposition 3.1), we know that the centralizer group of every tropical matrix equals the centralizer group of some idempotent normal matrix. Based on this fact, we need only to consider the centralizer groups of idempotent normal matrices.
Define a binary relation
on
by
Clearly,
is an equivalence relation on
. It is easy to check that
, and
if and only if all off-diagonal entries of
A are
, where
. Furthermore, we have immediately the following result.
Lemma 3. where denotes the ρ-class containing .
Let denote the set Then, there exists a natural bijection between and . That is, A corresponds to a, where a is the off-diagonal entries of A.
Suppose that and is the equivalent standard form of E related to , i.e., . Then, . Further, . Therefore, in order to study the centralizer group , we need only to consider up to isomorphism.
Now, let
be in the form (2). By replacing all diagonal blocks
matrix 0 of
with
matrix
A, where
and all off-diagonal entries are
, we can obtain the following block matrix
.
where
,
is an
matrix with all entries
and
with
For each
, we let
Note that for any
and
,
implies
. Thus,
for all
. Suppose that
is the set of all entries in
, where
. We shall write
Since
T is finite and
for all
we have that
by the denseness of the real numbers.
Lemma 4. Let be in the form (2) and be defined as above. If , then .
Proof. It is clear that
is a normal matrix. Now, we shall show that
is idempotent. By
, it is implied that
for all
. Hence, for any
,
For any
and
, without loss the generality, let
Since
is idempotent, it follows that
It is easy to check that
. Moreover, we have
This shows that
is idempotent. That is,
. It follows from the construction of
that either
or
for any
with
. Thus, by ([
11], Lemma 3.2),
, and so
by ([
11], Lemma 3.3). □
Furthermore, we have the following theorem.
Theorem 1. Let be in the form (2) and as above. Then, Moreover,
Proof. Suppose that and . If for some , then by Proposition 3, for some . Thus, and for any with .
If and for some with , then and for some and . In fact, suppose that . Then, That is, Since is a -congruence, it implies that by . That is, and so , yielding a contradiction. Clearly, and Notice that . This implies that . We conclude that for any . Consequently, Thus,
On the other hand, suppose that Then, for any . If for some , then and for . By , it is implied that . Therefore, for some , and so .
If and for some with , then . Since , it implies that and so . By , it follows that . Thus, there exist and such that and . Moreover, Consequently, . This shows that for any . Hence, and so Thus, This completes the proof. □
From the above theorem, we know that every -class contains at least one strongly regular idempotent normal matrix. Therefore, to study the centralizer groups of idempotent normal matrices, we need only to consider the centralizer groups of strongly regular idempotent normal matrices up to isomorphism.
Now, let
and
be the set of all off-diagonal entries of
E, where
. By replacing only all diagonal entries 0 of
E with some
, we can obtain an
matrix
as follows:
It is easy to check that
. We define an equivalence relation
on
by
That is,
if and only if the
i-th row and the
j-th row of
are equal and so are the
i-th column and the
j-th column. In the following, we shall give the equivalent conditions of
. Further, a structural description of the centralizer group
is obtained.
Suppose that is the set of all -classes for some , where . Let denote the principal submatrix of where the row indices and the column indices are taken from for each . It is clear that all entries of are . In fact, for any , by . By replacing with 0 for all , we can obtain an matrix That is to say, for any and , and for any and , where and . Moreover, we obtain a preliminary lemma.
Lemma 5. Suppose that and is defined as above. Then, .
Proof. Clearly, is a normal matrix. Now, we shall show that is idempotent, i.e., for any .
Suppose that for some . Then, . If , then . If , then . Since E is idempotent, it implies that for any , and so . Thus, .
Assume that and , where and . Then, . If , then . Since , i.e., , we have that . Thus, . If , then . Since , i.e., , we have that . Thus, . If , then . Since E is idempotent, it implies that , and so . Consequently, . This shows that for any , as required. □
Now, we have the following:
Theorem 2. Let and be defined as above. Then, .
Proof. Suppose that
for any
. Then,
for some
. Thus,
. By
and ([
11], Lemma 3.2), it follows that
. Thus,
.
On the other hand, assume that
for any
. It follows from ([
11], Lemma 3.2) that
and
for all
. Now, we shall show that
, i.e.,
, where
and
denote the
-classes containing
i and
j, respectively.
Suppose that
. For any
i.e.,
, we have
. Moreover, by ([
11], Lemma 3.2),
Since
, it implies that
and so
. Note that
, which implies that
and
. Moreover,
. It follows from ([
11], Lemma 3.2) that
. Therefore,
—a contradiction. Consequently,
. That is,
. Thus,
, and so
. □
Corollary 1. Suppose that and . Then, By
, ([
11], Theorem 3.7, Lemma 4.4) and Corollary 1, we have immediately the following theorem.
Theorem 3. Let . If there exists such that , then is a split extension of by , i.e., , whereand Example 1. Consider the centralizer group of the following strongly regular idempotent normal matrix:where are distinct. By ([12], Theorem 5.10), it follows that . It is easy to check that and . Thus, . Remark 2. According to Corollary 1 and Theorem 3, we give a structural description of the centralizer groups of partial idempotent normal matrices. The characterization of the centralizer groups of the remaining idempotent normal matrices, which are strongly regular idempotent normal matrices E satisfying for all , is still an unsolved problem. It is well known that G is a finite two-closed permutation group if and only if G equals to , where E is idempotent normal matrix. The polycirculant conjecture, which is important in graph theory, asserts that every non-trivial finite transitive two-closed permutation group contains a fixed-point-free element of prime order. By Theorem 3, it is clear that the centralizer groups of partial idempotent normal matrices contains a fixed-point-free element of prime order. Furthermore, the main results of this paper may be helpful for further research on the polycirculant conjecture.