Next Article in Journal
On the Pricing of Vulnerable Foreign Equity Options with Stochastic Volatility in an Intensity-Based Model
Next Article in Special Issue
Lie Ideals and Homoderivations in Semiprime Rings
Previous Article in Journal
Multiscale 1D-CNN for Damage Severity Classification and Localization Based on Lamb Wave in Laminated Composites
Previous Article in Special Issue
An Introduction to i-Commutative Rings
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Equivalent Standard Forms of a Class of Tropical Matrices and Centralizer Groups

School of Mathematics, Northwest University, Xi’an 710127, China
Mathematics 2025, 13(3), 399; https://doi.org/10.3390/math13030399
Submission received: 8 January 2025 / Revised: 24 January 2025 / Accepted: 24 January 2025 / Published: 25 January 2025
(This article belongs to the Special Issue Advanced Research in Pure and Applied Algebra)

Abstract

:
In this paper, the equivalent standard forms of tropical idempotent strongly definite matrices are introduced. In particular, the observation of the equivalent standard forms of tropical idempotent normal matrices is given. An equivalence relation ρ on the set of all tropical idempotent normal matrices, which is relevant to their centralizer groups, is introduced and studied. It is proved that every ρ -class contains at least one strongly regular tropical idempotent normal matrix. Furthermore, a structural description of the centralizer groups of partial strongly regular tropical idempotent normal matrices is given.

1. Introduction and Preliminaries

The tropical semiring  R ¯ is the set R { } equipped with the operations of tropical addition a b : = m a x { a , b } and tropical multiplication a b : = a + b , where 0 and are the multiplicative neutral element and the additive neutral element, respectively. The completed tropical semiring R ¯ ¯ is the tropical semiring augmented with an extra element + (see [1]). Note that, by definition,
( ) ( + ) = ( + ) ( ) = .
Let M n ( R ¯ ) denote the set of n × n matrices with entries in R ¯ . As in conventional linear algebra, we can extend the operations ⊕ and ⊗ on the tropical semiring R ¯ to M n ( R ¯ ) . Indeed, if A = ( a i j ) , B = ( b i j ) M n ( R ¯ ) , then we have
( A B ) i j = a i j b i j , ( A B ) i j = k = 1 n a i k b k j ,
for all i , j [ n ] ( = { 1 , 2 , , n } ), where ( A B ) i j and ( A B ) i j denote the ( i , j ) -th entries of the matrices A B and A B , respectively. For brevity, we usually write A B in place of A B for a product of matrices. It is easy to check that ( M n ( R ¯ ) , , ) is an idempotent semiring. The additive neutral element of M n ( R ¯ ) is the tropical n × n matrix whose entries are all , denoted by Z n , and the multiplicative neutral element of M n ( R ¯ ) is the tropical identity matrix whose diagonal entries are 0 and off-diagonal ones are , denoted by I n . 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 E M n ( R ¯ ) is said to be idempotent if E 2 = E and a tropical matrix A = ( a i j ) M n ( R ¯ ) is said to be normal if a i j 0 and a i i = 0 for all i , j [ n ] (see [1,6]). Since we never refer to classical matrices in this paper, the following matrices refer to tropical matrices. A matrix A M n ( R ¯ ) is said to be strongly regular if the system A x = b has a unique solution for some b R n . It is well known that an n × n matrix A = ( a i j ) is strongly regular if and only if it has a strong permanent (see [1] [Proposition 6.2.2])—that is, there exists a unique σ S n such that
m a p e r ( A ) = a 1 , 1 σ a 2 , 2 σ a n , n σ ,
where m a p e r ( A ) = σ S n a 1 , 1 σ a 2 , 2 σ a n , n σ is called the permanent of A. Throughout this paper, M n I and M n I N stand for the set of all idempotent n × n matrices and all idempotent normal n × n matrices, respectively. M n S R stands for the set of all strongly regular idempotent normal matrices and M n N S R stands for the set of all idempotent normal matrices that are not strongly regular (that is, M n N S R = M n I N M n S R ). For more details about idempotent normal matrices, the reader is referred to [2,7,8,9,10,11].
An n × n matrix is called diagonal—notation d i a g ( λ 1 , λ 2 , , λ n ) —if its diagonal entries are λ 1 , λ 2 , , λ n R 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 G L n ( R ¯ ) and P n ( R ¯ ) denote the set of all generalized permutation matrices and the set of all permutation matrices in M n ( R ¯ ) , respectively. It is easy to see that G L n ( R ¯ ) and P n ( R ¯ ) are subgroups of the semigroup ( M n ( R ¯ ) , ) . 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 A = ( a i j ) M n ( R ¯ ) . Define
U n ( A ) : = { P G L n ( R ¯ ) | P A = A P } , P n ( A ) : = { P σ P n ( R ¯ ) | P σ A = A P σ } ,
where P σ denotes an n × n permutation matrix whose i-th row is equal to the i σ -th row of I n for any i [ n ] . It is easy to check that P n ( A ) U n ( A ) , P n ( A ) G A , where
G A : = { σ S n | ( i , j [ n ] ) a i σ , j σ = a i j } .
U n ( A ) will be called the generalized centralizer group of A and P n ( A ) (or G A ) 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 2 × 2 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 n × n matrices up to isomorphism. They showed that every group of tropical matrices is isomorphic to a subgroup of G L n ( R ¯ ) and therefore embeds into the permutation wreath product R S n . In 2018, Izhakian et al. [12] studied the structure of the maximal subgroups of finitary tropical n × n matrices. They showed that the maximal subgroup containing a tropical idempotent matrix E is isomorphic to U n ( E ) . Moreover, the maximal subgroup is, up to isomorphism, exactly the direct product of G E and R . 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 n × n 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 D ( A ) of a matrix A (see [1]), which will be required later. Let A = ( a i j ) M n ( R ¯ ) . The weighted digraph associated with A is D ( A ) = ( N ( A ) , E ( A ) , w ) , where the node set N ( A ) = [ n ] and the edge set E ( A ) = { ( i , j ) | a i j > } with weights w ( i , j ) = a i j for all ( i , j ) E ( A ) . Suppose that π = ( i 1 , i 2 , , i p ) is a path in D ( A ) ; then, the weight of π is defined to be w ( π , A ) = a i 1 , i 2 + a i 2 , i 3 + + a i p 1 , i p if p > 1 and w ( π , A ) = if p = 1 . The number p 1 is called the length of π , denoted by ( π ) . Recall that a path ( i 1 , i 2 , , i p ) is called a cycle if p > 1 and i 1 = i p , and it is called an elementary cycle if, moreover, i k i for any k , [ p 1 ] and k . The maximum cycle mean of A, denoted by λ ( A ) , is defined by
λ ( A ) = m a x σ μ ( σ , A ) ,
where the maximization is taken over all elementary cycles in D ( A ) and
μ ( σ , A ) = w ( σ , A ) ( σ )
denotes the mean of a cycle σ .
A cycle in D ( A ) is called critical if its cycle mean is equal to λ ( A ) . The nodes and the edges of D ( A ) that belong to some critical cycles are called critical. The critical digraph of A is the digraph C ( A ) = ( N c ( A ) , E c ( A ) ) , where N c ( A ) and E c ( A ) denote the set of critical nodes and critical edges of D ( A ) , respectively. If i , j N c ( A ) belong to the same critical cycle, then i and j are called equivalent in D ( A ) and we write i A j . Clearly, A is an equivalence relation on N c ( A ) .
A matrix A is called definite if λ ( A ) = 0 . Thus, a matrix is definite if and only if all cycles in D ( A ) are non-positive (i.e., its cycle mean is non-positive) and at least one has weight zero. A matrix A = ( a i j ) M n ( R ¯ ) is called increasing if a i i 0 for all i [ n ] , 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 a i i = 0 for all i [ n ] if A is strongly definite. In the following, M n I S D 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 E and introduce the equivalent standard forms of E, where E M n I S D . In particular, we give the observation of the equivalent standard forms of E M n I N . In Section 3, by using the centralizer groups of idempotent normal matrices we introduce an equivalence relation ρ on M n I N . We prove that every ρ -class contains at least one strongly regular idempotent normal matrix. Let E M n S R . A new idempotent normal matrix E ( e t ) is constructed from E, where e t is an off-diagonal entry of E. We give the equivalent conditions for which E ( e t ) is not strongly regular. Further, a structural description of G E is given when E ( e t ) 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 R ¯ n denote the set of all n-tuples x with entries in R ¯ . We write x i for the i-th component of x. For any x , y R ¯ n , we define
x | y : = m a x { λ R ¯ ¯ | λ x y } = m i n i [ n ] { y i x i } ,
where λ x = ( λ + x 1 , λ + x 2 , , λ + x n ) . We set ( ) a = , a ( ) = + and ( ) ( ) = + for any a R . The map ( x , y ) x | y is a residuation operator in the sense of residuation theory [16], and is ubiquitous in tropical algebra. Notice that x | y = + if and only if x = . x | y = if and only if there exists j [ n ] such that y j = and x j .
As a consequence of ([7], Lemma 5.3), we have the following:
Lemma 1.
Suppose that E = ( e i j ) M n I . Let r 1 , r 2 , , r n denote the rows of E and c 1 , c 2 , , c n denote the columns of E. Then,
(i)
e i j m i n { r j | r i , c i | c j } for any i , j [ n ] ;
(ii)
If e i i = 0 , then e i j = c i | c j and e j i = r i | r j for all j [ n ] .
Proof. 
Part (i) is a direct consequence of ([7], Lemma 5.3).
To prove part (ii), let e i i = 0 . Suppose that e i j < c i | c j for some j [ n ] . Then, e i j < c i | c j e i i . Since x | y x y for any x , y R ¯ n , it is implied that c i | c j c i c j . Hence, c i | c j e k i e k j for all k [ n ] . This contradicts e i j < c i | c j e i i . Thus, e i j = c i | c j for all j [ n ] . Similarly, e j i = r i | r j for all j [ n ] . □
Furthermore, we have the following lemma.
Lemma 2.
Let E = ( e i j ) M n I S D and i , j [ n ] . Then, the following are equivalent:
(i)
e i j = e j i = 0 ;
(ii)
e i k = e j k for all k [ n ] ;
(iii)
e k i = e k j for all k [ n ] .
Proof. 
We need only to prove the equivalence of ( i ) and ( i i ) , since the equivalence of ( i ) and ( i i i ) may be showed dually.
( i ) ( i i ) . Suppose that e i j = e j i = 0 . Then, by Lemma 1 and E M n I S D , e i j = r j | r i and e j i = r i | r j , where r i and r j denote the i-th and j-th row of E, respectively. Moveover, r j | r i = r i | r j = 0 , and so r i = r j . That is, e i k = e j k for all k [ n ] .
( i i ) ( i ) . Suppose that e i k = e j k for all k [ n ] . Setting k = i , we have e j i = e i i = 0 . Setting k = j , we have e i j = e j j = 0 . Thus, e i j = e j i = 0 . □
Let E = ( e i j ) M n I S D . It is easily seen that the maximum cycle mean λ ( E ) = 0 and that every node of D ( E ) is critical, since all the diagonal entries of E are equal to 0. That is, N c ( E ) = [ n ] . So, E is an equivalence relation on [ n ] .
Note that M n I N M n I S D . It is clear that Lemma 2 generalizes the part results of ([11], Lemma 3.2), which asserts that if E = ( e i j ) M n I N and i , j [ n ] , then i E j if and only if e i j = e j i = 0 . Now, let E = ( e i j ) M n I S D . If e i j = e j i = 0 , then i E j by λ ( E ) = 0 . However, the inverse of this result is not true. In fact, for idempotent strongly definite matrices, we have the following:
Proposition 1.
Let E = ( e i j ) M n I S D and i , j [ n ] . Then, the following are equivalent:
(i)
i E j ;
(ii)
e i j + e j i = 0 ;
(iii)
e i k e j k = e i j for all k [ n ] ;
(iv)
e k j e k i = e i j for all k [ n ] .
Proof. 
We need only to prove the equivalence of ( i ) , ( i i ) , and ( i i i ) , since the equivalence of ( i ) , ( i i ) , and ( i v ) may be showed dually.
( i ) ( i i ) . Suppose that i E j . Then, there is a critical cycle π containing both i and j in D ( E ) . We shall write π = ( i 1 i 2 i s i p ) , where i 1 = i and i s = j . Moreover, w ( π , E ) = e i 1 , i 2 + + e i s 1 , i s + e i s , i s + 1 + + e i p , i 1 = 0 . Since E is idempotent, it follows that e i 1 , i 2 + + e i s 1 , i s e i j and e i s , i s + 1 + + e i p , i 1 e j i . Thus, w ( π , E ) e i j + e j i 0 , and so e i j + e j i = 0 .
( i i ) ( i i i ) . Suppose that e i j + e j i = 0 . Then, by Lemma 1, r j | r i + r i | r j = 0 , and so r j | r i = r i | r j —i.e.,
m i n k [ n ] { e i k e j k } = m a x k [ n ] { e i k e j k } .
This means that e i k e j k = e i e j for any k , [ n ] . Putting = j , we deduce that e i k e j k = e i j for all k [ n ] .
( i i i ) ( i ) . Suppose that e i k e j k = e i j for all k [ n ] . Putting k = i , we obtain that e i j + e j i = 0 . Thus, τ = ( i j ) is a critical cycle with length two in D ( E ) . Consequently, i E j . □
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 E = ( e i j ) M n I S D . Then, E is not strongly regular ⟺ E Δ .
Proof. 
Suppose that E is not strongly regular. Then, there exists τ S n { 1 } such that e 1 , τ ( 1 ) e 2 , τ ( 2 ) e n , τ ( n ) = 0 . Write τ as a product of non-trivial disjoint cycles, say, τ = τ 1 τ 2 τ ( < n ) . Then, any such cycle τ i ( i [ ] ) , say, τ i = ( j 1 j 2 j k ) , satisfies e j 1 , j 2 e j 2 , j 3 e j k , j 1 = 0 . Since E is idempotent, it follows that e j 1 , j k e j 1 , j 2 e j k 1 , j k = e j k , j 1 . Moreover, e j 1 , j k + e j k , j 1 0 . By e j 1 , j k e j k , j 1 e j 1 , j 1 = 0 , which implies that e j 1 , j k + e j k , j 1 = 0 . It follows from Proposition 1 that j 1 E j k , and so E Δ .
Assume that E Δ . Then, by Proposition 1, e i j + e j i = 0 for some i , j [ n ] and i j . It follows from ([7], Lemma 3.3) that m a p e r ( E ) = 0 . Hence, the transposition ( i j ) S n attains the permanent of E, as required. □
Let G S n . Recall that Γ [ n ] is called a block for G if for each σ G either Γ σ = Γ or Γ σ Γ = , where Γ σ = { i σ | i Γ } . Clearly, for each σ G , Γ σ is also a block for G (see [14]). A G-congruence on [ n ] is an equivalence relation ∼ on [ n ] with the property that
i j i σ j σ for all σ G .
Let G be transitive on [ n ] and Γ a block for G. Then, { Γ σ | σ G } is a partition of [ n ] and | Γ σ |   =   | Γ | for each σ G . { Γ σ | σ G } is called a system of blocks for G containing Γ . If ∼ is a G-congruence on [ n ] , then the equivalence classes of ∼ form a system of blocks for G (see ([14], Exercise 1.5.4)).
Proposition 3.
Let E = ( e i j ) M n I S D and { Γ 1 , Γ 2 , , Γ m } be the set of all classes of E . Then, E is a G E -congruence on [ n ] . Also, { Γ 1 , Γ 2 , , Γ m } is a system of blocks for G E if G E is transitive on [ n ] .
Proof. 
Suppose that σ G E . Then, for any i , j [ n ] ,
i E j e i k e j k = e i j ( by Proposition 1 ) e i σ , k σ e j σ , k σ = e i σ , j σ ( sin ce σ G E ) i σ E j σ .
This shows that E is a G E -congruence on [ n ] , and so { Γ 1 , Γ 2 , , Γ m } is a system of blocks for G E if G E acts transitively on [ n ] . □
Now, suppose that E M n I S D and { Γ 1 , Γ 2 , , Γ m } is the set of all classes of E , where 1 m n . If E is not strongly regular, then m n by Proposition 2. Without loss of generality, let 1     | Γ 1 |     | Γ 2 |     | Γ m |     n and | Γ k |   =   t k for any k [ m ] . That is, 1 t 1 t 2 t m n and t 1 + t 2 + + t m = n . It follows from Proposition 1 that for any i , j Γ k and k [ m ] , c j = e i j c i and r i = e i j r j .
Next, for each k [ m ] , we shall write
Ω k = { i = 1 k 1 t i + 1 , i = 1 k 1 t i + 2 , , i = 1 k t i } .
Take τ S n such that Ω k τ = Γ k for each k [ m ] . Further, by permuting simultaneously the rows and columns of E with τ , we obtain the following block matrix, E ¯ = P τ E P τ 1 :
E ¯ = ( e ¯ i j ) n × n = E ¯ 1 E ¯ 12 E ¯ 1 m E ¯ 21 E ¯ 2 E ¯ 2 m E ¯ m 1 E ¯ m 2 E ¯ m ,
where 1 m n , for each k [ m ] , E ¯ k is an antisymmetric t k × t k matrix, and for any k , [ m ] and k , E ¯ k is an t k × t matrix with c j ( E ¯ k ) = e ¯ i j c i ( E ¯ k ) for any i , j Ω and r i ( E ¯ k ) = e ¯ i j r j ( E ¯ k ) for any i , j Ω k . In fact, since E ¯ = P τ E P τ 1 , we have that E ¯ M n I S D and e ¯ i j = e i τ , j τ for any i , j [ n ] . Then, for each k [ m ] ,
i , j Ω k i τ , j τ Γ k i τ E j τ e i τ , j τ + e j τ , i τ = 0 e ¯ i j + e ¯ j i = 0 i E ¯ j .
This implies that { Ω 1 , Ω 2 , , Ω m } is the set of all classes of E ¯ and e ¯ i j = e ¯ j i for any i , j Ω k . That is to say, E ¯ k is an antisymmetric t k × t k matrix for each k [ m ] . Also, c j ( E ¯ ) = e ¯ i j c i ( E ¯ ) and r i ( E ¯ ) = e ¯ i j r j ( E ¯ ) for any i , j Ω k and k [ m ] . Moreover, for any k , [ m ] with k , E ¯ k is an t k × t matrix with c j ( E ¯ k ) = e ¯ i j c i ( E ¯ k ) for any i , j Ω and r i ( E ¯ k ) = e ¯ i j r j ( E ¯ k ) for any i , j Ω k .
Now, we shall call the block matrix E ¯  the equivalent standard form of E M n I S D . It is easy to see that every idempotent strongly definite n × n matrix E can be transformed in linear time by simultaneous permutations of the rows and columns to an equivalent standard form E ¯ as above.
In particular, let E = ( e i j ) M n I N . Then, E is equivalent to the following equivalent standard form E ¯ :
E ¯ = ( e ¯ i j ) n × n = 0 E ¯ 12 E ¯ 1 m E ¯ 21 0 E ¯ 2 m E ¯ m 1 E ¯ m 2 0 ,
where 1 m n and E ¯ k is an t k × t matrix with all entries e ^ k 0 , for any k , [ m ] with k . In fact, since e ¯ i j = e ¯ j i for any i , j Ω k and k [ m ] , it follows that e ¯ i j = 0 for any i , j Ω k and k [ m ] by E M n I N . Thus, all diagonal blocks of E ¯ are 0. Moreover, for any k , [ m ] with k , c j ( E ¯ k ) = c i ( E ¯ k ) for any i , j Ω and r j ( E ¯ k ) = r i ( E ¯ k ) for any i , j Ω k . Thus, all entries of E ¯ k are equal.
Notice that if e ^ k = 0 for some k , [ m ] with k , then e ^ k < 0 . In fact, suppose that e ^ k = 0 . Then, E ¯ k = 0 and E ¯ k = 0 . That is, e ¯ i j = e ¯ j i = 0 for any i Ω k and j Ω . This follows from ([11], Lemma 3.2) that i E ¯ j for any i Ω k and j Ω . This contradicts the fact that Ω k and Ω are two different E ¯ -classes.
Remark 1.
In general, the equivalent standard forms of E are not unique. For instance, let
E = 0 2 1 1 2 1 0 2 2 0 2 1 0 0 1 2 1 0 0 1 1 0 2 2 0 .
It is easy to see that E M n I N M n I S D . If we take τ 1 = ( 35 ) S 5 , then E ¯ = P τ 1 E P τ 1 1 is an equivalent standard form of E as follows:
E ¯ = 0 2 2 1 1 1 0 0 2 2 1 0 0 2 2 2 1 1 0 0 2 1 1 0 0 .
If we take τ 2 = ( 24 ) S 5 , then E ¯ ¯ = P τ 2 E P τ 2 1 is also an equivalent standard form of E as follows:
E ¯ ¯ = 0 1 1 2 2 2 0 0 1 1 2 0 0 1 1 1 2 2 0 0 1 2 2 0 0 .
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 C ( E ) . The form forms an interesting correspondence with the Frobenius normal form of E, which is essentially determined by the strongly connected components of D ( E ) (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 M n I N by
A ρ B G A G B .
Clearly, ρ is an equivalence relation on M n I N . It is easy to check that G I n = S n , and G A = S n if and only if all off-diagonal entries of A are a 0 , where A M n I N . Furthermore, we have immediately the following result.
Lemma 3.
I n ρ = { A = ( a i j ) M n I N | a i j = a for any i , j [ n ] with i j , a 0 } , where I n ρ denotes the ρ-class containing I n .
Let [ , 0 ] denote the set { a R ¯ | a 0 } . Then, there exists a natural bijection between I n ρ and [ , 0 ] . That is, A corresponds to a, where a is the off-diagonal entries of A.
Suppose that E M n I N and E ¯ is the equivalent standard form of E related to τ S n , i.e., E ¯ = P τ E P τ 1 . Then, G E ¯ = G P τ E P τ 1 = τ G E τ 1 . Further, G E ¯ G E . Therefore, in order to study the centralizer group G E , we need only to consider G E ¯ up to isomorphism.
Now, let E ¯ = ( e ¯ i j ) M n N S R be in the form (2). By replacing all diagonal blocks t k × t k matrix 0 of E ¯ with t k × t k matrix A, where A I t k ρ and all off-diagonal entries are a < 0 , we can obtain the following block matrix E ˜ .
E ˜ = ( e ˜ i j ) n × n = A E ¯ 12 E ¯ 1 m E ¯ 21 A E ¯ 2 m E ¯ m 1 E ¯ m 2 A ,
where 1 m < n , E ¯ k is an t k × t matrix with all entries e ^ k 0 , and k , [ m ] with k .
For each k [ m ] , we let
d k = [ m ] { k } ( e ^ k e ^ k ) .
Note that for any k , [ m ] and k , e ^ k = 0 implies e ^ k < 0 . Thus, d k < 0 for all k [ m ] . Suppose that T = { e 1 , e 2 , , e h } is the set of all entries in E ¯ , where 1 h m 2 m + 1 . We shall write
Σ : = { a 0 | a T and a > d k for all k [ m ] } .
Since T is finite and d k < 0 for all k [ m ] , we have that Σ by the denseness of the real numbers.
Lemma 4.
Let E ¯ M n N S R be in the form (2) and E ˜ be defined as above. If a Σ , then E ˜ M n S R .
Proof. 
It is clear that E ˜ is a normal matrix. Now, we shall show that E ˜ is idempotent. By a Σ , it is implied that a > d k for all k [ m ] . Hence, for any k [ m ] ,
E ¯ k 1 E ¯ 1 k E ¯ k 2 E ¯ 2 k A 2 E ¯ k m E ¯ m k = A 2 = A .
For any k , [ m ] and k , without loss the generality, let k < . Since E ¯ is idempotent, it follows that
E ¯ k 1 E ¯ 1 E ¯ k 2 E ¯ 2 0 E ¯ k E ¯ k 0 E ¯ k m E ¯ m = E ¯ k .
It is easy to check that A E ¯ k = E ¯ k A = 0 E ¯ k = E ¯ k 0 = E ¯ k . Moreover, we have
E ¯ k 1 E ¯ 1 E ¯ k 2 E ¯ 2 A E ¯ k E ¯ k A E ¯ k m E ¯ m = E ¯ k .
This shows that E ˜ is idempotent. That is, E ˜ M n I N . It follows from the construction of E ˜ that either e ˜ i j = 0 or e ˜ j i = 0 for any i , j [ n ] with i j . Thus, by ([11], Lemma 3.2), E ˜ = Δ , and so E ˜ M n S R by ([11], Lemma 3.3). □
Furthermore, we have the following theorem.
Theorem 1.
Let E ¯ = ( e ¯ i j ) M n N S R be in the form (2) and E ˜ = ( e ˜ i j ) M n S R as above. Then, G E ¯ = G E ˜ . Moreover, E ˜ E ¯ ρ .
Proof. 
Suppose that σ G E ¯ and i , j [ n ] . If i , j Ω k for some k [ m ] , then by Proposition 3, i σ , j σ Ω for some [ m ] . Thus, e ˜ i i = e ˜ i σ , i σ = 0 and e ˜ i j = e ˜ i σ , j σ = a for any i , j Ω k with i j .
If i Ω k and j Ω for some k , [ m ] with k , then i σ Ω u and j σ Ω v for some u , v [ m ] and u v . In fact, suppose that u = v . Then, i σ , j σ Ω u . That is, i σ E ¯ j σ . Since E ¯ is a G E ¯ -congruence, it implies that ( i σ ) σ 1 E ¯ ( j σ ) σ 1 by σ 1 G E ¯ . That is, i E ¯ j and so Ω k = Ω , yielding a contradiction. Clearly, e ˜ i j = e ¯ i j and e ˜ i σ , j σ = e ¯ i σ , j σ . Notice that e ¯ i j = e ¯ i σ , j σ . This implies that e ˜ i j = e ˜ i σ , j σ . We conclude that e ˜ i j = e ˜ i σ , j σ for any i , j [ n ] . Consequently, σ G E ˜ . Thus, G E ¯ G E ˜ .
On the other hand, suppose that σ G E ˜ . Then, e ˜ i j = e ˜ i σ , j σ for any i , j [ n ] . If i , j Ω k for some k [ m ] , then e ˜ i σ , i σ = e ˜ i i = 0 and e ˜ i σ , j σ = e ˜ i j = a for i j . By a Σ , it is implied that a T . Therefore, i σ , j σ Ω for some [ m ] , and so e ¯ i σ , j σ = e ¯ i j = 0 .
If i Ω k and j Ω for some k , [ m ] with k , then e ˜ i σ , j σ = e ˜ i j = e ¯ i j . Since a T , it implies that e ¯ i j a and so e ˜ i σ , j σ a . By i j , it follows that i σ j σ . Thus, there exist u , v [ m ] and u v such that i σ Ω u and j σ Ω v . Moreover, e ˜ i σ , j σ = e ¯ i σ , j σ . Consequently, e ¯ i σ , j σ = e ¯ i j . This shows that e ¯ i σ , j σ = e ¯ i j for any i , j [ n ] . Hence, σ G E ¯ , and so G E ˜ G E ¯ . Thus, G E ¯ = G E ˜ . 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 E = ( e i j ) M n S R and O ( E ) = { e 1 , e 2 , , e r } be the set of all off-diagonal entries of E, where 1 r n 2 n . By replacing only all diagonal entries 0 of E with some e t O ( E ) , we can obtain an n × n matrix E e t as follows:
E e t = ( e i j e t ) n × n = e t e 12 e 1 n e 21 e t e 2 n e n 1 e n 2 e t .
It is easy to check that G E = G E e t . We define an equivalence relation E e t on [ n ] by
i E e t j e i k e t = e j k e t and e k i e t = e k j e t for all k [ n ] .
That is, i E e t j if and only if the i-th row and the j-th row of E e t are equal and so are the i-th column and the j-th column. In the following, we shall give the equivalent conditions of E e t Δ . Further, a structural description of the centralizer group G E is obtained.
Suppose that { Σ 1 , Σ 2 , , Σ s } is the set of all E e t -classes for some e t O ( E ) , where 1 s n . Let E e t [ Σ k ] denote the principal submatrix of E e t where the row indices and the column indices are taken from Σ k for each k [ s ] . It is clear that all entries of E e t [ Σ k ] are e t . In fact, for any i , j Σ k , e i j e t = e i i e t = e t by i E e t j . By replacing E e t [ Σ k ] with 0 for all k [ s ] , we can obtain an n × n matrix E ( e t ) = ( e i j ( e t ) ) . That is to say, e i j ( e t ) = 0 for any i , j Σ k and k [ s ] , and e i j ( e t ) = e i j e t = e i j for any i Σ k and j Σ , where k , [ s ] and k . Moreover, we obtain a preliminary lemma.
Lemma 5.
Suppose that E = ( e i j ) M n S R and E ( e t ) is defined as above. Then, E ( e t ) M n I N .
Proof. 
Clearly, E ( e t ) is a normal matrix. Now, we shall show that E ( e t ) is idempotent, i.e., e i j ( e t ) = m a x k [ n ] { e i k ( e t ) + e k j ( e t ) } for any i , j [ n ] .
Suppose that i , j Σ for some [ s ] . Then, e i j ( e t ) = 0 . If k Σ , then e i k ( e t ) + e k j ( e t ) = 0 . If k Σ , then e i k ( e t ) + e k j ( e t ) = e i k + e k j . Since E is idempotent, it implies that e i k + e k j e i j for any k [ n ] , and so e i k ( e t ) + e k j ( e t ) e i j 0 . Thus, m a x k [ n ] { e i k ( e t ) + e k j ( e t ) } = e i j ( e t ) = 0 .
Assume that i Σ 1 and j Σ 2 , where 1 , 2 [ s ] and 1 2 . Then, e i j ( e t ) = e i j . If k Σ 1 , then e i k ( e t ) + e k j ( e t ) = e k j ( e t ) = e k j . Since i , k Σ 1 , i.e., i E e t k , we have that e k j = e i j . Thus, e i k ( e t ) + e k j ( e t ) = e i j . If k Σ 2 , then e i k ( e t ) + e k j ( e t ) = e i k ( e t ) = e i k . Since j , k Σ 2 , i.e., j E e t k , we have that e i k = e i j . Thus, e i k ( e t ) + e k j ( e t ) = e i j . If k Σ 1 Σ 2 , then e i k ( e t ) + e k j ( e t ) = e i k + e k j . Since E is idempotent, it implies that e i k + e k j e i j , and so e i k ( e t ) + e k j ( e t ) e i j . Consequently, m a x k [ n ] { e i k ( e t ) + e k j ( e t ) } = e i j ( e t ) = e i j . This shows that e i j ( e t ) = m a x k [ n ] { e i k ( e t ) + e k j ( e t ) } for any i , j [ n ] , as required. □
Now, we have the following:
Theorem 2.
Let E = ( e i j ) M n S R and E ( e t ) be defined as above. Then, E e t = E ( e t ) .
Proof. 
Suppose that i E e t j for any i , j [ n ] . Then, i , j Σ for some [ s ] . Thus, e i j ( e t ) = e j i ( e t ) = 0 . By E ( e t ) M n I N and ([11], Lemma 3.2), it follows that i E ( e t ) j . Thus, E e t E ( e t ) .
On the other hand, assume that i E ( e t ) j for any i , j [ n ] . It follows from ([11], Lemma 3.2) that e i k ( e t ) = e j k ( e t ) and e k i ( e t ) = e k j ( e t ) for all k [ n ] . Now, we shall show that i E e t j , i.e., Σ ( i ) = Σ ( j ) , where Σ ( i ) and Σ ( j ) denote the E e t -classes containing i and j, respectively.
Suppose that Σ ( i ) Σ ( j ) . For any k Σ ( i ) , i.e., i E e t k , we have e i k ( e t ) = e k i ( e t ) = 0 . Moreover, by ([11], Lemma 3.2), i E ( e t ) k . Since i E ( e t ) j , it implies that k E ( e t ) j and so e j k ( e t ) = e k j ( e t ) = 0 . Note that Σ ( k ) Σ ( j ) , which implies that e j k ( e t ) = e j k e t = e j k and e k j ( e t ) = e k j e t = e k j . Moreover, e j k = e k j = 0 . It follows from ([11], Lemma 3.2) that j E k . Therefore, E M n N S R —a contradiction. Consequently, Σ ( i ) = Σ ( j ) . That is, i E e t j . Thus, E ( e t ) E e t , and so E e t = E ( e t ) . □
Corollary 1.
Suppose that E M n S R and e t O ( E ) . Then,
E e t Δ E ( e t ) Δ E ( e t ) M n N S R .
By G E = G E e t , ([11], Theorem 3.7, Lemma 4.4) and Corollary 1, we have immediately the following theorem.
Theorem 3.
Let E = ( e i j ) M n S R . If there exists e t O ( E ) such that E ( e t ) M n N S R , then G E is a split extension of G ˜ E e t by H E e t , i.e., G E = G ˜ E e t H E e t , where
G ˜ E e t : = { σ S n | P σ E e t = E e t P σ = E e t }
and
H E e t : = { σ G E e t | ( k [ s ] ) ( i , j Σ k ) i j i σ j σ } .
Example 1.
Consider the centralizer group of the following strongly regular idempotent normal matrix:
E = 0 d d x x d 0 d x x d d 0 x x y y y 0 u y y y u 0 ,
where x , y , d , u [ 1.1 , 0.9 ] are distinct. By ([12], Theorem 5.10), it follows that E M n I N . It is easy to check that G ˜ E d S 3 and H E d S 2 . Thus, G E = S 3 S 2 .
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 E ( e t ) M n S R for all e t O ( E ) , 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 G E , 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.

Funding

This paper was supported by the National Natural Science Foundation of China (11971383, 11571278) and Shaanxi Fundamental Science Research Project for Mathematics and Physics (Grant No. 22JSY023).

Data Availability Statement

All data generated or analyzed during this study are included in this published work.

Acknowledgments

The authors would like to express their gratitude to the academic editor and the anonymous reviewers for their valuable remarks and suggestions that helped to improve this work.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Butkovič, P. Max-Linear Systems: Theory and Algorithms; Springer: London, UK, 2010. [Google Scholar]
  2. Johnson, M.; Kambites, M. Green’s J -order and the rank of tropical matrices. J. Pure Appl. Algebra 2013, 217, 280–292. [Google Scholar] [CrossRef]
  3. Shitov, Y. Tropical matrices and group repersentations. J. Algebra 2012, 370, 1–4. [Google Scholar] [CrossRef]
  4. Yang, L. Regular D-classes of the semigroup of n × n tropical matrices. Turk. J. Math. 2018, 42, 2061–2070. [Google Scholar] [CrossRef]
  5. Johnson, M.; Kambites, M. Multiplicative structrue of 2 × 2 tropical matrices. Linear Algebra Appl. 2011, 435, 1612–1625. [Google Scholar] [CrossRef]
  6. Butkovič, P. Max-algebra: The linear algebra of combinatorics. Linear Algebra Appl. 2003, 367, 313–335. [Google Scholar] [CrossRef]
  7. Johnson, M.; Kambites, M. Idempotent tropical matrices and finite metric spaces. Adv. Geom. 2014, 14, 253–276. [Google Scholar]
  8. Izhakian, Z.; Johnson, M.; Kambites, M. Pure dimension and projectivity of tropical polytopes. Adv. Math. 2016, 303, 1236–1263. [Google Scholar] [CrossRef]
  9. Linde, J.; Puente, M.J.d. Matrices commuting with a given normal tropical matrix. Linear Algebra Appl. 2015, 482, 101–121. [Google Scholar] [CrossRef]
  10. Yu, B.M.; Zhao, X.Z.; Zeng, L.L. A congruence on the semiring of normal tropical matrices. Linear Algebra Appl. 2018, 555, 321–335. [Google Scholar] [CrossRef]
  11. Deng, W.N.; Zhao, X.Z.; Cheng, Y.L.; Yu, B.M. On the groups associated with a tropical n × n matrix. Linear Algebra Appl. 2022, 639, 1–17. [Google Scholar] [CrossRef]
  12. Izhakian, Z.; Johnson, M.; Kambites, M. Tropical matrix groups. Semigroup Forum. 2018, 96, 178–196. [Google Scholar] [CrossRef]
  13. Yang, L. The tropical matrix groups with symmetric idempotents. Discret. Dyn. Nat. Soc. 2018, 2018, 1–9. [Google Scholar] [CrossRef]
  14. Dixon, J.D.; Mortimer, B. Permutation Groups; Springer: New York, NY, USA, 1996. [Google Scholar]
  15. Cameron, P.J. Permutation Groups (London Mathematical Society Student Texts Vol 45); Cambridge University Press: Cambridge, UK, 1999. [Google Scholar]
  16. Blyth, T.S.; Janowitz, M.F. Residuation Theory; Pergamon Press: Oxford, UK, 1972. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Cheng, Y. The Equivalent Standard Forms of a Class of Tropical Matrices and Centralizer Groups. Mathematics 2025, 13, 399. https://doi.org/10.3390/math13030399

AMA Style

Cheng Y. The Equivalent Standard Forms of a Class of Tropical Matrices and Centralizer Groups. Mathematics. 2025; 13(3):399. https://doi.org/10.3390/math13030399

Chicago/Turabian Style

Cheng, Yanliang. 2025. "The Equivalent Standard Forms of a Class of Tropical Matrices and Centralizer Groups" Mathematics 13, no. 3: 399. https://doi.org/10.3390/math13030399

APA Style

Cheng, Y. (2025). The Equivalent Standard Forms of a Class of Tropical Matrices and Centralizer Groups. Mathematics, 13(3), 399. https://doi.org/10.3390/math13030399

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop