Skip to Content
MathematicsMathematics
  • Article
  • Open Access

14 April 2026

23 Pages

Transitive Closure Preservers for Matrices over a Class of Semirings

and
1
School of Mathematics and Statistics, Huanghuai University, Zhumadian 463000, China
2
School of Mathematics and Statistics, Weinan Normal University, Weinan 714099, China
*
Author to whom correspondence should be addressed.
This article belongs to the Section C: Mathematical Analysis

Abstract

We introduce the transitive closure operator Γ on the set of square matrices over a class of semirings, and then define the transitive closure of a matrix. We characterize the surjective linear transformations of matrices preserving (strongly preserving) transitive closures, and show that a surjective linear transformation preserves the transitive closures if and only if it commutes with Γ , which is equivalent to preserving the kernel of Γ . We also deduce that the strong linear preservers of transitive closure on 2 × 2 matrices over certain inclines are surjective. In particular, we provide a complete characterization of strong linear preservers of transitive closure on n × n matrices over the binary Boolean semiring.
MSC:
15A86; 16Y60

1. Introduction

Linear preserver problems (LPPs) concern the characterization of linear transformations on matrix spaces that leave certain functions, subsets, relations etc., invariant. LPPs have been a classical and active topic in matrix algebra and operator theory (see [1,2]). Over the past few years, extensive results have been obtained for matrices over fields or various semirings. For instance, Beasley et al. [3,4] characterized linear preservers of matrix rank. Catalano et al. [5] described linear transformations preserving products equal to a diagonalizable matrix. Chen et al. [6] studied strong commutativity linear preservers of strictly triangular matrix Lie algebras. Costara [7] investigated linear transformations preserving fixed values of products of matrices at fixed vectors. Guterman et al. [8] classified linear isomorphisms preserving Green’s relations for matrices over anti-negative semifields. Kang et al. [9,10] studied linear preservers of regularity. Nikita et al. [11] characterized linear transformations preserving square roots of idempotent and rank-one nilpotent matrices. Pshenitsyna [12] classified linear preservers of invertibility. Deng et al. [13] investigated linear preservers of Kleene stars on matrices over inclines.
Despite these advances, some issues concerning linear preservers on matrices over inclines remain unresolved. Inclines are a special and important class of idempotent semirings that have wide applications in areas such as automata theory, the design of switching circuits, logic of binary relations, Markov chains, information systems, and fuzzy mathematics [14,15]. Transitive closure is a fundamental concept in graph theory and combinatorial matrix theory, which records the existence of paths between vertices in the associated digraph. The transitive closure can be naturally extended to matrices over semirings. While transitive closure linear preservers have been studied on tropical matrices [16], the case of incline matrices has not been systematically investigated. This paper aims to fill this gap.
The main contributions of this paper are as follows. In Section 3, we introduce the transitive closure operator Γ for matrices over commutative inclines without zero divisors, and define the transitive closure of such a matrix. In Section 4, we characterize the surjective linear transformations preserving (or strongly preserving) transitive closures (see Theorem 1). In Section 5, we prove that a surjective linear transformation preserves transitive closures if and only if it commutes with Γ , if and only if it preserves the kernel of Γ (see Theorem 4). In Section 6, we show that strong linear preservers of transitive closure on 2 × 2 matrices over certain inclines are surjective (see Theorems 6 and 7). In particular, we completely characterize strong linear preservers of transitive closure on square matrices over the binary Boolean semiring (see Theorem 8). These results extend the theory of linear preserver problems to incline matrices and enrich the connections between semiring matrix theory and graph-theoretic closure operations.

2. Preliminaries

A semiring is a nonempty set R together with two binary operations + (addition) and · (multiplication) such that ( R , + ) is a commutative monoid with identity 0, ( R , · ) is a monoid with identity 1, multiplication distributes over addition from either side, and r · 0 = 0 · r = 0 for all r ∈ R . For simplicity we denote a · b by a b .
Let R be a semiring and a ∈ R . a is a left zero divisor (right zero divisor, respectively) if a b = 0 ( b a = 0 , respectively) for some b ∈ R ∖ { 0 } and a is a zero divisor if it is both a left and a right zero divisor. The semiring R is commutative if a b = b a for all a , b ∈ R , R is anti-negative if a + b = 0 implies that a = b = 0 for all a , b ∈ R , R is idempotent if a + a = a for all a ∈ R (see [3,17]). An idempotent semiring R is called an incline if a + a b = a and b + a b = b for all a , b ∈ R (see [14]). It is easily seen that if a semiring R is idempotent, then R is anti-negative and so the incline is anti-negative.
Now define a binary relation ≤ on an idempotent semiring R by
a ≤ b ⟺ a + b = b .
Then ≤ is a partial order on R (see [18]). Also, ≤ is compatible with + and ·, that is, for any a , b , x ∈ R ,
a ≤ b ⟹ a + x ≤ b + x , a x ≤ b x and x a ≤ x b .
In the sequel, S always denotes the commutative incline without zero divisors and with multiplicative identity 1, where 1 ≠ 0 . Clearly,
( ∀ a ∈ S ) a + 1 = 1 + a = 1 .
As defined in (1), ≤ is a partial order on S, and 0 ≤ a ≤ 1 for all a ∈ S . Moreover, for any a 1 , … , a k , b 1 , … , b k + 1 ∈ S ,
b 1 a 1 ⋯ b k a k b k + 1 ≤ b 1 ⋯ b k b k + 1 .
It is well known that the binary Boolean semiring B = ( { 0 , 1 } , + , · ) , the fuzzy semiring F = ( [ 0 , 1 ] , + , · ) (where a + b = max { a , b } and a · b = min { a , b } ), R = ( R ≤ 0 ∪ { − ∞ } , + , · ) (where R ≤ 0 is the set of non-positive real numbers, a + b = max { a , b } and a · b is defined as the arithmetic sum of a and b) are examples of such incline S (see [4,9,15,19]).
Let M n ( S ) denote the set of all n × n matrices over S. For A = ( a i j ) , B = ( b i j ) ∈ M n ( S ) and x ∈ S , define A + B , A B , x A by
A + B = ( a i j + b i j ) , A B = ( ∑ k = 1 n a i k b k j ) , x A = ( x a i j ) .
Notice that ( S , + ) and ( S , · ) are both commutative. Then A + B = B + A and A x = x A . With respect to the above addition and multiplication, M n ( S ) forms an idempotent semiring with an additive identity element Z n (the n × n matrix with all entries 0) and a multiplicative identity element I n (the n × n matrix with all diagonal entries 1 and all off-diagonal ones 0). Also, with respect to the above addition and scalar multiplication, M n ( S ) forms a S-semimodule.
Let [ n ] denote the set { 1 , 2 , … , n } . For any A = ( a i j ) , B = ( b i j ) ∈ M n ( S ) , if A ≤ B in the sense of (1), then
A ≤ B ⟺ ( ∀ i , j ∈ [ n ] ) a i j ≤ b i j .
By (2), for any A , B , X ∈ M n ( S ) ,
A ≤ B ⟹ A + X ≤ B + X , X A ≤ X B and A X ≤ B X .
Denote by E n the n × n matrix with all entries 1. Obviously, Z n ≤ A ≤ E n for all A ∈ M n ( S ) . An n × n matrix is called a permutation matrix if it is formed from the identity matrix I n by reordering its columns and/or rows. Let Sym ( [ n ] ) denote the symmetric group on [ n ] . Then for any n × n permutation matrix P = ( p i j ) , there exists a unique σ ∈ Sym ( [ n ] ) such that p i i σ = 1 for all i ∈ [ n ] and other entries of P are all 0. We usually denote P by P σ . Clearly, P σ P σ − 1 = P σ − 1 P σ = I n . Thus the inverse matrix of P σ is P σ − 1 , i.e., P σ − 1 = P σ − 1 . For A ∈ M n ( S ) , denote by A T the transpose of A and by A k the iterated product A A ⋯ A , in which A occurs k times. Since S is commutative, it follows that ( A T ) k = ( A k ) T for any k ∈ [ n ] .
Let T be a linear transformation on M n ( S ) , that is, for any A , B ∈ M n ( S ) and x ∈ S ,
T ( A + B ) = T ( A ) + T ( B ) and T ( x A ) = x T ( A ) .
Suppose that P ⊆ M n ( S ) and that ∼ is an equivalence relation on M n ( S ) . We say that T preserves P if A ∈ P implies that T ( A ) ∈ P and say that T strongly preserves P if A ∈ P if and only if T ( A ) ∈ P . We say that T preserves ∼ if A ∼ B implies that T ( A ) ∼ T ( B ) and say that T strongly preserves ∼ if A ∼ B if and only if T ( A ) ∼ T ( B ) .

3. Transitive Closures

Recall that a digraph (see [20]) is a pair D = ( V , E ) where V is a nonempty finite set whose elements are called the vertices of D, and E is a subset of V × V whose elements are called the arcs of D. Any arc of the form ( i , i ) is a loop. A sequence π = ( i 1 , i 2 , … , i p ) of vertices in D is a path (in D) if p = 1 or p > 1 and ( i s , i s + 1 ) ∈ E for all s ∈ [ p − 1 ] . We also say that π is a path from i 1 to i p . The transitive closure of the digraph D is a digraph which contains an arc ( i , j ) whenever there is a path from i to j in D.
Let A = ( a i j ) ∈ M n ( S ) . The digraph associated with A is denoted by D A = ( V ( A ) , E ( A ) ) , where V ( A ) = [ n ] is the vertex set and E ( A ) = { ( i , j ) ∈ [ n ] × [ n ] ∣ a i j ≠ 0 } is the arc set. Define a mapping Γ : M n ( S ) → M n ( S ) by
Γ ( A ) = ∑ k = 1 n A k .
We shall verify later that the transitive closure of digraph D A is D Γ ( A ) . Motivated by this result, we say that Γ is the transitive closure operator on M n ( S ) , and say that Γ ( A ) is the transitive closure of A. Firstly, we have
Proposition 1.
Suppose that A = ( a i j ) ∈ M n ( S ) and Γ be defined as above. Let Γ ( A ) = ( a i j ★ ) . Then for any i , j ∈ [ n ] ,
a i j ★ = a i j + ∑ k 1 ∈ [ n ] ∖ { i , j } a i k 1 a k 1 j + ⋯ + ∑ k 1 , … , k n − 1 ∈ [ n ] ∖ { i , j } are distinct a i k 1 a k 1 k 2 ⋯ a k n − 1 j .
Proof. 
Notice that Γ ( A ) = A + A 2 + ⋯ + A n . Then for any i , j ∈ [ n ] ,
a i j ★ = a i j + ∑ i 1 ∈ [ n ] a i i 1 a i 1 j + ⋯ + ∑ i 1 , … , i n − 1 ∈ [ n ] a i i 1 a i 1 i 2 ⋯ a i n − 1 j .
We deduce that the conclusion holds by (1) and (3). □
Proposition 2.
Let A ∈ M n ( S ) and Γ be defined as above. Then A k ≤ Γ ( A ) for all k ≥ 1 . Moreover, Γ ( A ) = ∑ k = 1 m A k for all m ≥ n .
Proof. 
Let A = ( a i j ) . If 1 ≤ k ≤ n , then A k ≤ Γ ( A ) by the definition of Γ . Now suppose that k ≥ n + 1 . Let A k = ( a i j ( k ) ) and Γ ( A ) = ( a i j ★ ) . Then for any i , j ∈ [ n ] ,
a i j ( k ) = ∑ i 1 , i 2 , ⋯ , i k − 1 ∈ [ n ] a i i 1 a i 1 i 2 ⋯ a i k − 1 j .
Since k ≥ n + 1 , we deduce that i , i 1 , i 2 , … , i k − 1 are not pairwise different in [ n ] . By (3), a i j ( k ) ≤ a i j ★ . Thus A k ≤ Γ ( A ) . Hence Γ ( A ) = ∑ k = 1 m A k for all m ≥ n . □
Proposition 3.
Let A ∈ M n ( S ) . Then the transitive closure of D A is D Γ ( A ) .
Proof. 
Let A = ( a i j ) and Γ ( A ) = ( a i j ★ ) . Then
D A = ( [ n ] , E ( A ) ) and D Γ ( A ) = ( [ n ] , E ( Γ ( A ) ) ) ,
where
E ( A ) = { ( i , j ) ∈ [ n ] × [ n ] ∣ a i j ≠ 0 } , E ( Γ ( A ) ) = { ( i , j ) ∈ [ n ] × [ n ] ∣ a i j ★ ≠ 0 } .
Suppose that u , v ∈ [ n ] . If there exist u 1 , … , u k − 1 ∈ [ n ] such that ( u , u 1 , … , u k − 1 , v ) is a path in D A , then ( u , u 1 ) , … , ( u k − 1 , v ) ∈ E ( A ) and so a u u 1 , … , a u k − 1 v ≠ 0 . Thus a u u 1 … a u k − 1 v ≠ 0 since S has no zero divisors. Let A k = ( a i j k ) . Then a u v k ≠ 0 since S is anti-negative. By Proposition 2, A k ≤ Γ ( A ) and so a u v ★ ≠ 0 . Hence ( u , v ) ∈ E ( Γ ( A ) ) . This shows that the transitive closure of the digraph D A is D Γ ( A ) . □
Denote by M n c the set of images of matrices under Γ , i.e., M n c = { Γ ( A ) ∣ A ∈ M n ( S ) } . As a consequence of Proposition 2, we immediately have
Corollary 1.
Let A ∈ M n ( S ) . Then A ∈ M n c if and only if A 2 ≤ A .
By Corollary 1, it is easily seen that A ∈ M n c if and only if A k ≤ A for all k ≥ 1 . Thus Γ ( A ) = A for any A ∈ M n c , that is, the restriction of Γ to M n c is the identity mapping. In particular, Γ ( I n ) = I n . Notice that I n is a permutation matrix; it is natural to consider the images of all permutation matrices under Γ . In general, for any permutation matrix P σ ∈ M n ( S ) , write σ ∈ Sym ( [ n ] ) as a product of m disjoint permutation cycles with lengthes r 1 , r 2 , … , r m , that is
σ = ( i 1 ⋯ i r 1 ) ( i r 1 + 1 ⋯ i r 1 + r 2 ) ⋯ ( i r 1 + ⋯ + r m − 1 + 1 ⋯ i n ) ,
where { i 1 , … , i n } = [ n ] and r 1 + r 2 + ⋯ + r m = n . Let us denote
N 1 = { i 1 , … , i r 1 } , N 2 = { i r 1 + 1 , … , i r 1 + r 2 } , N m = { i r 1 + ⋯ + r m − 1 + 1 , … , i n } .
Let Γ ( P σ ) = ( x i j ) . Since Γ ( P σ ) = P σ + P σ 2 + ⋯ + P σ n , we deduce that
x i j = 1 , if ( i , j ) ∈ ⋃ k = 1 m N k × N k , 0 , otherwise .
That is, for any k ∈ [ m ] , the ( N k , N k ) -submatrix of Γ ( P σ ) is an r k × r k matrix with all entries 1, and for any k , ℓ ∈ [ m ] with k ≠ ℓ , the ( N k , N ℓ ) -submatrix of Γ ( P σ ) is an r k × r ℓ matrix with all entries 0. Now we immediately have
Proposition 4.
Let P σ be a permutation matrix in M n ( S ) . Then Γ ( P σ ) = E n if and only if σ is a permutation cycle of order n.
Let T : M n ( S ) → M n ( S ) be a linear transformation and Γ be the transitive closure operator. We say that T commutes with Γ if Γ ( T ( A ) ) = T ( Γ ( A ) ) for any A ∈ M n ( S ) . Denote by ρ c the kernel of Γ , that is,
A ρ c B ⟺ Γ ( A ) = Γ ( B ) .
Clearly, ρ c is an equivalence relation on M n ( S ) .
Proposition 5.
Let T : M n ( S ) → M n ( S ) be a linear transformation. Then T commutes with Γ if and only if T preserves M n c and preserves ρ c .
Proof. 
Suppose that T commutes with Γ . Let A ∈ M n c . Then Γ ( A ) = A and so T ( A ) = T ( Γ ( A ) ) = Γ ( T ( A ) ) ∈ M n c . Thus T preserves M n c . Now suppose that A , B ∈ M n ( S ) and A ρ c B . Then Γ ( A ) = Γ ( B ) and so T ( Γ ( A ) ) = T ( Γ ( B ) ) . Hence Γ ( T ( A ) ) = Γ ( T ( B ) ) and so T ( A ) ρ c T ( B ) . This shows that T preserves ρ c .
Conversely, suppose that T preserves M n c and preserves ρ c . Let A ∈ M n ( S ) . Notice that Γ ( A ) ∈ M n c . Then T ( Γ ( A ) ) ∈ M n c and so Γ ( T ( Γ ( A ) ) ) = T ( Γ ( A ) ) . Since A ρ c Γ ( A ) , we have T ( A ) ρ c T ( Γ ( A ) ) and so Γ ( T ( A ) ) = Γ ( T ( Γ ( A ) ) ) . Thus Γ ( T ( A ) ) = T ( Γ ( A ) ) . This shows that T commutes with Γ . □

4. Surjective Linear Preservers of M n c

In this section, we consider surjective linear transformations on M n ( S ) that preserve M n c . Let E i , j denote the n × n matrix with 1 in the ( i , j ) -th position and 0 elsewhere. It is easily seen that
E i , j E k , ℓ = E i , ℓ , if j = k , 0 , if j ≠ k .
For A = ( a i j ) ∈ M n ( S ) , we have A = ∑ i , j ∈ [ n ] a i j E i , j . Let T be a linear transformation on M n ( S ) . Then T ( A ) = ∑ i , j ∈ [ n ] a i j T ( E i , j ) . This implies that T is completely determined by the images T ( E i , j ) . Beasley and Guterman have given a characterization of surjective linear transformations on matrices over anti-negative semirings without zero divisors (see [3] (Theorem 2.14)).
Lemma 1
([3], Theorem 2.14). Let R be an anti-negative semiring without zero divisors and T : M m , n ( R ) → M m , n ( R ) be a linear transformation. Then the following statements are equivalent:
(i) 
T is bijective;
(ii) 
T is surjective;
(iii) 
There exists a permutation σ ∈ S y m ( [ m ] × [ n ] ) and units x i , j ∈ Z ( R ) such that T ( E i , j ) = x i , j E ( i , j ) σ for all i ∈ [ m ] , j ∈ [ n ] , where Z ( R ) is the center of R.
Notice that the incline S which we consider in this paper is commutative, anti-negative and has no zero divisors. Also, we can verify that S contains the unique unit 1 (in fact, if a ∈ S and a b = 1 , then a = a 1 = a ( 1 + b ) = a + a b = a + 1 = 1 and so b = 1 ). Now we have the following result which is a special case of Lemma 1.
Lemma 2.
Let T : M n ( S ) → M n ( S ) be a linear transformation. Then the following statements are equivalent:
(i) 
T is bijective;
(ii) 
T is surjective;
(iii) 
There exists σ ∈ Sym ( [ n ] × [ n ] ) such that T ( E i , j ) = E ( i , j ) σ for all i , j ∈ [ n ] .
Let T be a surjective linear transformation on M n ( S ) . By Lemma 2, T ( E n ) = E n . In particular, if n = 1 , then M 1 ( S ) = S and T ( 1 ) = 1 . Thus T is the identity transformation on M 1 ( S ) . In the following, we always assume that n ≥ 2 . Let
D n = { E i , i ∣ i ∈ [ n ] } and E n = { E i , j ∣ i , j ∈ [ n ] and i ≠ j } .
Then D n and E n are both finite sets. For A = ( a i j ) ∈ M n ( S ) , let us denote
A i , ∗ = ∑ ℓ ∈ [ n ] a i ℓ E i , ℓ and A ∗ , i = ∑ ℓ ∈ [ n ] a ℓ i E ℓ , i .
Proposition 6.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving M n c . Then T ( I n ) = I n . Moreover, T ( D n ) = D n and T ( E n ) = E n .
Proof. 
By Lemma 2, there exists σ ∈ Sym ( [ n ] × [ n ] ) such that
T ( I n ) = T ( E 1 , 1 + ⋯ + E n , n ) = E ( 1 , 1 ) σ + ⋯ + E ( n , n ) σ .
This implies that T ( I n ) has exactly n entries equal to 1, and all other entries are 0. We claim that T ( I n ) = ( y i j ) is a permutation matrix. Otherwise, there are two possibilities of T ( I n ) .
Case 1. ( T ( I n ) ) p , ∗ = Z n for some p ∈ [ n ] . Then there exists q ∈ [ n ] ∖ { p } such that y q k , y q ℓ ≠ 0 for some k , ℓ ∈ [ n ] with k ≠ ℓ . Since T is surjective, by Lemma 2, E p , q = T ( E s , t ) for some s , t ∈ [ n ] with s ≠ t . Let A = I n + E s , t . Then A 2 = A and so A ∈ M n c . Let T ( A ) = ( z i j ) and ( T ( A ) ) 2 = ( w i j ) . Then z p q = 1 and z p u = 0 for all u ∈ [ n ] ∖ { q } . Also, w p k = w p ℓ = 1 . Notice that k ≠ ℓ . Then T ( A ) ∉ M n c by Corollary 1. This contradicts that T preserves M n c .
Case 2. ( T ( I n ) ) ∗ , p = Z n for some p ∈ [ n ] . Then there exists q ∈ [ n ] ∖ { p } such that y k q , y ℓ q ≠ 0 for some k , ℓ ∈ [ n ] with k ≠ ℓ . Since T is surjective, by Lemma 2, E q , p = T ( E s , t ) for some s , t ∈ [ n ] with s ≠ t . Let A = I n + E s , t . Then A 2 = A and so A ∈ M n c . A similar argument as in Case 1 establishes that T ( A ) ∉ M n c , a contradiction.
From the above discussion, T ( I n ) is a permutation matrix. Since I n ∈ M n c , we have T ( I n ) ∈ M n c and so ( T ( I n ) ) 2 ≤ T ( I n ) . Thus T ( I n ) = I n . Moreover, notice that D n , E n are both finite sets. Then T ( D n ) = D n and T ( E n ) = E n . □
Lemma 3.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving M n c , i , j ∈ [ n ] and i ≠ j . Then the following statements hold:
(i) 
If T ( E i , i ) = E p , p and T ( E i , j ) = E s , t , then either s = p , t ≠ p or s ≠ p , t = p ;
(ii) 
If T ( E i , i ) = E p , p and T ( E j , i ) = E s , t , then either s = p , t ≠ p or s ≠ p , t = p .
Proof. 
Suppose that T ( E i , i ) = E p , p and T ( E i , j ) = E s , t . If s = p , then t ≠ p by Proposition 6. If s ≠ p , we assert t = p . Otherwise, assume that t ≠ p and T ( E u , v ) = E t , s . Then u ≠ v and ( u , v ) ≠ ( i , j ) . We consider the following two possibilities of u:
Case 1. u = j . Firstly, we show that v = i . Otherwise, if v ≠ i , let A = E i , j + E j , v + E i , v . Then A ∈ M n c . Since T preserves M n c , we have T ( A ) ∈ M n c and so ( T ( A ) ) 2 ≤ T ( A ) . Suppose that T ( E i , v ) = E h , k , h ≠ k , then T ( A ) = E s , t + E t , s + E h , k . Notice that the ( t , t ) -entry of T ( A ) is 0 and the ( t , t ) -entry of T ( A ) 2 is 1; this contradicts with ( T ( A ) ) 2 ≤ T ( A ) . Thus v = i . Now let
B = E i , i + E i , j + E j , i + E j , j and T ( E j , j ) = E q , q , q ≠ p .
Then B ∈ M n c and T ( B ) = E p , p + E s , t + E t , s + E q , q . Since T preserves M n c , we have T ( B ) ∈ M n c and so ( T ( B ) ) 2 ≤ T ( B ) . Thus p = s or p = t . It is a contradiction.
Case 2. u ≠ j . Firstly, we shall show that v ≠ i . Otherwise, if v = i , let A = E i , j + E u , i + E u , j . Then A ∈ M n c . Since T preserves M n c , we have T ( A ) ∈ M n c and so ( T ( A ) ) 2 ≤ T ( A ) . Suppose that T ( E u , j ) = E h , k , h ≠ k , then T ( A ) = E s , t + E t , s + E h , k . Notice that the ( t , t ) -entry of T ( A ) is 0 and the ( t , t ) -entry of T ( A ) 2 is 1; this contradicts with ( T ( A ) ) 2 ≤ T ( A ) . Thus v ≠ i . Now let
B = E i , i + E i , j + E u , v + E i , v and T ( E i , v ) = E q , r , q ≠ r .
Then B ∈ M n c and T ( B ) = E p , p + E s , t + E t , s + E q , r . Since T preserves M n c , we have T ( B ) ∈ M n c and so ( T ( B ) ) 2 ≤ T ( B ) . Thus p = s or p = t . It is a contradiction.
We have shown (i) holds. A similar argument as in (i) establishes (ii). □
Lemma 4.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving M n c ; i , j , k ∈ [ n ] are pairwise different. Then the following statements hold:
(i) 
If T ( E i , j ) = E p , q and T ( E i , k ) = E s , t , then either s = p , t ≠ q or s ≠ p , t = q ;
(ii) 
If T ( E i , j ) = E p , q and T ( E k , j ) = E s , t , then either s = p , t ≠ q or s ≠ p , t = q .
Proof. 
Suppose that T ( E i , j ) = E p , q and T ( E i , k ) = E s , t , then p ≠ q and s ≠ t by Proposition 6. If s = p , then t ≠ q since T is bijective. If s ≠ p , we assert t = q . Otherwise, if t ≠ q , let A = E i , i + E i , j + E i , k , then A ∈ M n c . Since T preserves M n c , we have T ( A ) ∈ M n c . Notice that T ( E i , j ) = E p , q , then T ( E i , i ) = E p , p or T ( E i , i ) = E q , q by Lemma 3.
If T ( E i , i ) = E p , p , then T ( A ) = E p , p + E p , q + E s , p ∉ M n c , a contradiction. If T ( E i , i ) = E q , q , then T ( A ) = E q , q + E p , q + E q , t ∉ M n c , a contradiction. Thus, s ≠ p , t = q and (i) holds. The proof of (ii) follows by a similar argument as in (i). □
Lemma 5.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving M n c and T ( E i , i ) = E p , p . Then
(i) 
T ( E n ) i , ∗ = ( E n ) p , ∗ or T ( E n ) i , ∗ = ( E n ) ∗ , p ;
(ii) 
T ( E n ) ∗ , i = ( E n ) ∗ , p or T ( E n ) ∗ , i = ( E n ) p , ∗ .
Proof. 
(i) Suppose T ( E i , j ) = E s , t , j ∈ [ n ] ∖ { i } . Then s = p , t ≠ p or s ≠ p , t = p . If n = 2 , then (i) holds. Now suppose that n ≥ 3 . For any k ∈ [ n ] ∖ { i , j } , let T ( E i , k ) = E u , v , then u ≠ v . By Lemmas 3 and 4, if s = p , t ≠ p , then u = p ; if s ≠ p , t = p , then v = p . Thus (i) holds.
(ii) Suppose T ( E j , i ) = E s , t , j ∈ [ n ] ∖ { i } . Then s = p , t ≠ p or s ≠ p , t = p . If n = 2 , then (i) holds. Now suppose that n ≥ 3 . For any k ∈ [ n ] ∖ { i , j } , let T ( E k , i ) = E u , v , then u ≠ v . By Lemmas 3 and 4, if s = p , t ≠ p , then u = p ; if s ≠ p , t = p , then v = p . Thus (ii) holds. □
Lemma 6.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving M n c and i ∈ [ n ] . Then the following statements hold:
(i) 
If T ( E n ) i , ∗ = ( E n ) p , ∗ , then for any j ∈ [ n ] ∖ { i } , there exists h ∈ [ n ] ∖ { p } such that T ( E n ) j , ∗ = ( E n ) h , ∗ ;
(ii) 
If T ( E n ) ∗ , i = ( E n ) ∗ , p , then for any j ∈ [ n ] ∖ { i } , there exists h ∈ [ n ] ∖ { p } such that T ( E n ) ∗ , j = ( E n ) ∗ , h ;
(iii) 
If T ( E n ) i , ∗ = ( E n ) ∗ , p , then for any j ∈ [ n ] ∖ { i } , there exists h ∈ [ n ] ∖ { p } such that T ( E n ) j , ∗ = ( E n ) ∗ , h ;
(iv) 
If T ( E n ) ∗ , i = ( E n ) p , ∗ , then for any j ∈ [ n ] ∖ { i } , there exists h ∈ [ n ] ∖ { p } such that T ( E n ) ∗ , j = ( E n ) h , ∗ .
Proof. 
We shall show that (i) holds. The proofs of (ii), (iii) and (iv) are similar to those of (i). If T ( E n ) i , ∗ = ( E n ) p , ∗ , then T ( E i , i ) = E p , p . For any j ∈ [ n ] ∖ { i } , let T ( E j , j ) = E h , h , h ≠ p . We assert T ( E n ) j , ∗ = ( E n ) h , ∗ . Otherwise, T ( E n ) j , ∗ = ( E n ) ∗ , h by Lemma 5. Thus there exist s , t ∈ [ n ] such that T ( E i , s ) = E p , h and T ( E j , t ) = E p , h . This contradicts that T is bijective. Thus (i) holds. □
Lemma 7.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving M n c . Then for any i ∈ [ n ] ,
(i) 
T ( E n ) i , ∗ = ( E n ) p , ∗ if and only if T ( E n ) ∗ , i = ( E n ) ∗ , p ;
(ii) 
T ( E n ) i , ∗ = ( E n ) ∗ , p if and only if T ( E n ) ∗ , i = ( E n ) p , ∗ .
Proof. 
We shall show that (i) holds. The proof of (ii) is similar to that of (i). Suppose that T ( E n ) i , ∗ = ( E n ) p , ∗ , then T ( E i , i ) = E p , p . By Lemma 5 (ii), T ( E n ) ∗ , i = ( E n ) ∗ , p or T ( E n ) ∗ , i = ( E n ) p , ∗ . If T ( E n ) ∗ , i = ( E n ) p , ∗ , then for q ∈ [ n ] ∖ { p } , there exist s , u ∈ [ n ] ∖ { i } such that T ( E i , s ) = E p , q and T ( E u , i ) = E p , q . This contradicts that T is bijective. Thus T ( E n ) ∗ , i = ( E n ) ∗ , p .
Conversely, if T ( E n ) ∗ , i = ( E n ) ∗ , p , then T ( E i , i ) = E p , p . By Lemma 5 (i), T ( E n ) i , ∗ = ( E n ) p , ∗ or T ( E n ) i , ∗ = ( E n ) ∗ , p . If T ( E n ) i , ∗ = ( E n ) ∗ , p , then for q ∈ [ n ] ∖ { p } , there exist s , u ∈ [ n ] ∖ { i } such that T ( E s , i ) = E q , p and T ( E i , u ) = E q , p . This contradicts that T is bijective. Thus T ( E n ) i , ∗ = ( E n ) p , ∗ . □
Lemma 8.
Let T : M n ( S ) → M n ( S ) be a transformation. If there exists σ ∈ Sym ( [ n ] ) such that T ( A ) = P σ − 1 A P σ for all A ∈ M n ( S ) or T ( A ) = P σ − 1 A T P σ for all A ∈ M n ( S ) , then T is a surjective linear transformation strongly preserving M n c .
Proof. 
Suppose that T ( A ) = P σ − 1 A P σ for all A ∈ M n ( S ) . It is easily seen that T is linear and surjective. Moreover, for any A ∈ M n ( S ) ,
A ∈ M n c ⇔ A 2 ≤ A ⇔ P σ − 1 A 2 P σ ≤ P σ − 1 A P σ ⇔ ( T ( A ) ) 2 ≤ T ( A ) ⇔ T ( A ) ∈ M n c .
Thus T is a surjective linear transformation strongly preserving M n c .
Now suppose that T ( A ) = P σ − 1 A T P σ for all A ∈ M n ( S ) . Notice that P σ T = P σ − 1 . Then T ( A ) = ( P σ − 1 A P σ ) T and so T is a linear surjective transformation. Since A ∈ M n c if and only if A T ∈ M n c , we deduce that T strongly preserves M n c . □
Theorem 1.
Let T : M n ( S ) → M n ( S ) be a surjective linear transformation. Then the following statements are equivalent:
(i) 
T preserves M n c ;
(ii) 
T strongly preserves M n c ;
(iii) 
There exists σ ∈ Sym ( [ n ] ) such that either T ( A ) = P σ − 1 A P σ for all A ∈ M n ( S ) or T ( A ) = P σ − 1 A T P σ for all A ∈ M n ( S ) .
Proof. 
By Lemma 8, (iii) implies (ii). (ii) implies (i) is clear. We shall show that (i) implies (iii). Suppose that T is a surjective linear transformation preserving M n c . If n = 1 , then T is the identity transformation on M 1 ( S ) = S . Thus (i) ⇒ (iii). Now we consider n ≥ 2 . Let T ( E k , k ) = E p , p . By Lemma 5, we consider the following two cases of T ( E n ) k , ∗ .
Case 1. T ( E n ) k , ∗ = ( E n ) p , ∗ . By Lemma 6 (i), (ii) and Lemma 7 (i), for any i ∈ [ n ] , there exists σ ∈ Sym ( [ n ] ) such that T ( E n ) i , ∗ = ( E n ) i σ , ∗ and T ( E n ) ∗ , i = ( E n ) ∗ , i σ . Thus for any i , j ∈ [ n ] , T ( E i , j ) = E i σ , j σ . Hence for any A = ( a i j ) ∈ M n ( S ) ,
T ( A ) = ∑ i , j ∈ [ n ] a i j T ( E i , j ) = ∑ i , j ∈ [ n ] a i j E i σ , j σ = P σ − 1 A P σ .
Case 2. T ( E n ) k , ∗ = ( E n ) ∗ , p . By Lemma 6 (iii), (iv) and Lemma 7 (ii), for any i ∈ [ n ] , there exists σ ∈ Sym ( [ n ] ) such that T ( E n ) i , ∗ = ( E n ) ∗ , i σ and T ( E n ) ∗ , i = ( E n ) i σ , ∗ . Thus for any i , j ∈ [ n ] , T ( E i , j ) = E j σ , i σ . Hence for any A = ( a i j ) ∈ M n ( S ) ,
T ( A ) = ∑ i , j ∈ [ n ] a i j T ( E i , j ) = ∑ i , j ∈ [ n ] a i j E j σ , i σ = P σ − 1 A T P σ .
□
Theorem 2.
Let T : M n ( S ) → M n ( S ) be a surjective linear transformation. Then T preserves M n c if and only if T commutes with Γ .
Proof. 
By Proposition 5, the converse holds. Now suppose that T is a surjective linear transformation preserving M n c . By Theorem 1, there exists σ ∈ Sym ( [ n ] ) such that T ( A ) = P σ − 1 A P σ for all A ∈ M n ( S ) or T ( A ) = P σ − 1 A T P σ for all A ∈ M n ( S ) . In both cases, we can verify that Γ ( T ( A ) ) = T ( Γ ( A ) ) . Thus T commutes with Γ . □

5. Equivalent Statements

In this section, we consider surjective linear transformations that preserve ρ c , and then provide some equivalent statements to determine whether a surjective linear transformation preserves M n c . Notice that every surjective linear transformation on M 1 ( S ) is the identity transformation. In the following, we always assume that n ≥ 2 .
Proposition 7.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving ρ c . Then the following statements hold:
(i) 
For any cycle σ ∈ Sym ( [ n ] ) of order n, there exists a cycle δ ∈ S y m ( [ n ] ) of order n such that T ( P σ ) = P δ ;
(ii) 
T ( D n ) = D n and T ( E n ) = E n . Moreover, T ( I n ) = I n .
Proof. 
(i) Let σ ∈ Sym ( [ n ] ) be a cycle of order n. Then Γ ( P σ ) = E n = Γ ( E n ) and so P σ ρ c E n . Since T preserves ρ c , we have T ( P σ ) ρ c T ( E n ) and so Γ ( T ( P σ ) ) = Γ ( T ( E n ) ) . By Lemma 2, T ( E n ) = E n . Thus Γ ( T ( P σ ) ) = E n . Clearly, T ( P σ ) is an n × n matrix with exactly n entries 1, and all other entries 0. By Proposition 4, we deduce that T ( P σ ) = P δ for some cycle δ ∈ Sym ( [ n ] ) of order n.
(ii) Let C = { P σ ∈ M n ( S ) | σ be the cycle of order n in Sym ( [ n ] ) } . Then T is bijective on C by (i). Notice that ∑ i ≠ j E i , j = ∑ P σ ∈ C P σ . Then
T ( ∑ i ≠ j E i , j ) = T ( ∑ P σ ∈ C P σ ) = ∑ P σ ∈ C P σ = ∑ i ≠ j E i , j .
By Lemma 2, T ( D n ) = D n and T ( E n ) = E n . Moreover, T ( I n ) = I n . □
Lemma 9.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving ρ c , i , j ∈ [ n ] and i ≠ j . Then the following statements hold:
(i) 
If T ( E i , i ) = E p , p and T ( E i , j ) = E s , t , then either s = p , t ≠ p or s ≠ p , t = p ;
(ii) 
If T ( E i , i ) = E p , p and T ( E j , i ) = E s , t , then either s = p , t ≠ p or s ≠ p , t = p .
Proof. 
Suppose that T ( E i , i ) = E p , p and T ( E i , j ) = E s , t . If s = p , then t ≠ p by Proposition 7. If s ≠ p , we assert t = p . In fact, let T ( E j , i ) = E u , v and A = E i , j + E j , i . Then u ≠ v and Γ ( A ) = E i , i + E i , j + E j , i + E j , j . Since A ρ c Γ ( A ) and T preserves ρ c , we have T ( A ) ρ c T ( Γ ( A ) ) and so Γ ( T ( A ) ) = Γ ( T ( Γ ( A ) ) ) . Clearly, T ( Γ ( A ) ) ≤ Γ ( T ( A ) ) . Notice that
Γ ( T ( A ) ) = Γ ( E s , t + E u , v ) = E s , t + E u , v + E s , t E u , v + E u , v E s , t ,
T ( Γ ( A ) ) = E p , p + E s , t + E u , v + E h , h , where T ( E j , j ) = E h , h .
We have s = v , t = u = p and so (i) holds. The proof of (ii) follows by a similar argument as in (i). □
Proposition 7 tells us that if T is a surjective linear transformation preserving ρ c , then T is bijective on D n and E n , respectively. As a consequence of Lemma 9, we have
Corollary 2.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving ρ c , i , j ∈ [ n ] and i ≠ j . Then the following statements hold:
(i) 
If T ( E i , j ) = E s , t and T ( E j , i ) = E u , v , then s = v , t = u ;
(ii) 
If T ( E i , j ) = E s , t and T ( E u , v ) = E t , s , then i = v , j = u .
Lemma 10.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving ρ c , i , j , k ∈ [ n ] are pairwise different. Then the following statements hold:
(i) 
If T ( E i , j ) = E p , q and T ( E i , k ) = E s , t , then either s = p , t ≠ q or s ≠ p , t = q ;
(ii) 
If T ( E i , j ) = E p , q and T ( E k , j ) = E s , t , then either s = p , t ≠ q or s ≠ p , t = q .
Proof. 
Suppose that T ( E i , j ) = E p , q and T ( E i , k ) = E s , t , then p ≠ q and s ≠ t by Proposition 7. If s = p , then t ≠ q since T is bijective. If s ≠ p , we assert t = q . Otherwise, if t ≠ q , let A = E k , i + E i , j . Then Γ ( A ) = E k , i + E i , j + E k , j . By Corollary 2, T ( E k , i ) = E t , s . Then T ( A ) = E t , s + E p , q . Since A ρ c Γ ( A ) and T preserves ρ c , we have T ( A ) ρ c T ( Γ ( A ) ) and so Γ ( T ( A ) ) = Γ ( T ( Γ ( A ) ) ) . Clearly, T ( Γ ( A ) ) ≤ Γ ( T ( A ) ) . Notice that
Γ ( T ( A ) ) = T ( A ) = E t , s + E p , q ,
T ( Γ ( A ) ) = E t , s + E p , q + T ( E k , j ) , T ( E k , j ) ∉ { E t , s , E p , q } .
It is a contradiction. Thus t = q and so (i) holds. The proof of (ii) follows by a similar argument as in (i). □
As a consequence of Lemmas 9 and 10, we have
Corollary 3.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a surjective linear transformation preserving ρ c , k ∈ [ n ] ∖ { i , j } . Then the following statements hold:
(i) 
If T ( E p , q ) = E i , j and T ( E s , t ) = E i , k , then either s = p , t ≠ q or s ≠ p , t = q ;
(ii) 
If T ( E p , q ) = E j , i and T ( E s , t ) = E k , i , then either s = p , t ≠ q or s ≠ p , t = q .
Theorem 3.
Let T : M n ( S ) → M n ( S ) be a surjective linear transformation. Then T preserves ρ c if and only if T commutes with Γ .
Proof. 
By Proposition 5, the converse holds. Now suppose that T is a surjective linear transformation preserving ρ c . We shall show that T preserves M n c . Let A = ( a i j ) ∈ M n c and T ( A ) = ( b i j ) . Then for any i , j ∈ [ n ] , we have
E i , j = T ( E p , q ) ⇔ b i j = a p q .
Clearly, the ( i , j ) -entry of T ( A ) 2 is ∑ k = 1 n b i k b k j . Let T ( E p , q ) = E i , j . If k ∉ { i , j } , then E i , k = T ( E p , t ) or E i , k = T ( E t , q ) by Corollary 3. Moreover, if E i , k = T ( E p , t ) , then E k , j = T ( E t , q ) ; if E i , k = T ( E t , q ) , then E k , j = T ( E p , t ) . By (4), we have b i k b k j = a p t a t q . Since A 2 ≤ A and b i j = a p q , we have
∑ k = 1 n b i k b k j = b i i b i j + b i j b j j + ∑ k ≠ i , j b i k b k j ≤ b i j + ∑ t ≠ p , q a p t a t q ≤ b i j + a p q = b i j .
Hence T ( A ) 2 ≤ T ( A ) and so T ( A ) ∈ M n c . Thus T preserves M n c . By Proposition 5, T commutes with Γ . □
We summarize the results of Theorems 1–3 in a single theorem as follows.
Theorem 4.
Let T : M n ( S ) → M n ( S ) be a surjective linear transformation. Then the following statements are equivalent:
(i) 
T preserves M n c ;
(ii) 
T preserves ρ c ;
(iii) 
T commutes with Γ ;
(iv) 
T strongly preserves M n c ;
(v) 
T strongly preserves ρ c ;
(vi) 
There exists σ ∈ S y m ( [ n ] ) such that either T ( A ) = P σ − 1 A P σ for all A ∈ M n ( S ) or T ( A ) = P σ − 1 A T P σ for all A ∈ M n ( S ) .
In the remainder of this section, we provide examples to show that there exist non-surjective linear transformations that preserve M n c , commute with Γ or preserve ρ c .
Example 1.
Let T : M n ( S ) → M n ( S ) be defined by T ( A ) = Z n for all A ∈ M n ( S ) . Clearly, T is linear and non-surjective. We can verify that T commutes with Γ , preserves M n c and preserves ρ c .
Example 2.
Let n = 2 and T : M 2 ( S ) → M 2 ( S ) be a transformation such that T ( A ) = a 12 E 1 , 2 for all A = ( a i j ) ∈ M 2 ( S ) . Then T is a non-surjective linear transformation commuting with Γ . Consequently, T preserves M 2 c and ρ c , respectively.
It is clear that T is linear and non-surjective. For any A = ( a i j ) ∈ M 2 ( S ) , by a simple calculation, we obtain that
Γ ( A ) = a 11 + a 12 a 21 a 12 a 21 a 22 + a 21 a 12 .
Thus T ( Γ ( A ) ) = a 12 E 1 , 2 = Γ ( T ( A ) ) . This shows that T commutes with Γ . By Proposition 5, T preserves M 2 c and ρ c , respectively.
Example 3.
Let n = 2 and T : M 2 ( S ) → M 2 ( S ) be a transformation such that T ( A ) = a 12 E 1 , 2 + a 21 E 2 , 1 for all A = ( a i j ) ∈ M 2 ( S ) . Then T is a non-surjective linear transformation preserving ρ c . However, T does not preserve M 2 c or commute with Γ .
Obviously, T is linear and non-surjective. Suppose that A = ( a i j ) , B = ( b i j ) ∈ M 2 ( S ) and A ρ c B . Then Γ ( A ) = Γ ( B ) . We deduce that a 12 = b 12 and a 21 = b 21 . Thus T ( A ) = a 12 E 1 , 2 + a 21 E 2 , 1 = b 12 E 1 , 2 + b 21 E 2 , 1 = T ( B ) and so T ( A ) ρ c T ( B ) . This shows that T preserves ρ c . Notice that E 2 ∈ M 2 c but T ( E 2 ) = E 1 , 2 + E 2 , 1 ∉ M 2 c . Then T does not preserve M 2 c . By Proposition 5, T does not commute with Γ .
Example 4.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a transformation such that T ( A ) = a 11 E 1 , 1 for all A = ( a i j ) ∈ M n ( S ) . Then T is a non-surjective linear transformation preserving M n c . However, T does not preserve ρ c or commute with Γ .
It is clear that T is linear and non-surjective. Notice that a 11 E 1 , 1 ∈ M n c for any A = ( a i j ) ∈ M n ( S ) . Then T preserves M n c . Now let A = E 1 , 2 + E 2 , 1 . Then T ( Γ ( A ) ) = E 1 , 1 and Γ ( T ( A ) ) = Z n . Thus T ( Γ ( A ) ) ≠ Γ ( T ( A ) ) , and so T does not commute with Γ . By Proposition 5, T does not preserve ρ c .
Example 5.
Let S = B and T : M n ( B ) → M n ( B ) ( n ≥ 2 ) be a transformation such that T ( A ) = A ∘ for all A = ( a i j ) ∈ M n ( B ) , where A ∘ = ∑ i ≠ j a i j E i , j . Then T is a non-surjective linear transformation preserving ρ c . However, T does not preserve M n c or commute with Γ .
Clearly, T is linear and non-surjective. Suppose that A = ( a i j ) , B = ( b i j ) ∈ M n ( B ) . Let Γ ( A ) = ( a i j ★ ) and Γ ( B ) = ( b i j ★ ) . If A ρ c B , then Γ ( A ) = Γ ( B ) and so a i j ★ = b i j ★ for all i , j ∈ [ n ] . We shall show that Γ ( T ( A ) ) = Γ ( T ( B ) ) , that is, Γ ( A ∘ ) = Γ ( B ∘ ) . Now let A ∘ = ( a i j ∘ ) , B ∘ = ( b i j ∘ ) , Γ ( A ∘ ) = ( x i j ) , and Γ ( B ∘ ) = ( y i j ) . Notice that B = { 0 , 1 } . We consider the following two cases of a i j ★ .
Case 1. a i j ★ = 0 . Then b i j ★ = 0 . Since A ∘ ≤ A and B ∘ ≤ B , we have Γ ( A ∘ ) ≤ Γ ( A ) and Γ ( B ∘ ) ≤ Γ ( B ) . Then x i j = y i j = 0 .
Case 2. a i j ★ = 1 . Then b i j ★ = 1 . Let
H = ∑ k 1 ∈ [ n ] ∖ { i , j } a i k 1 a k 1 j + ⋯ + ∑ k 1 , … , k n − 1 ∈ [ n ] ∖ { i , j } are distinct a i k 1 a k 1 k 2 ⋯ a k n − 1 j
and
L = ∑ k 1 ∈ [ n ] ∖ { i , j } b i k 1 b k 1 j + ⋯ + ∑ k 1 , … , k n − 1 ∈ [ n ] ∖ { i , j } are distinct b i k 1 b k 1 k 2 ⋯ b k n − 1 j .
By Proposition 1, a i j ★ = a i j + H and b i j ★ = b i j + L . Since a i j ★ = b i j ★ , we have a i j + H = b i j + L . We claim that H = 1 if and only if L = 1 . In fact, if H = 1 , then there exist distinct k 1 , … , k s ∈ [ n ] ∖ { i , j } such that a i k 1 a k 1 k 2 ⋯ a k s j = 1 . Hence a i k 1 = a k 1 k 2 = ⋯ = a k s j = 1 . Since A ≤ Γ ( A ) , we have a i k 1 ★ = a k 1 k 2 ★ = ⋯ = a k s j ★ = 1 and so b i k 1 ★ = b k 1 k 2 ★ = ⋯ = b k s j ★ = 1 . Thus b i k 1 ★ b k 1 k 2 ★ ⋯ b k s j ★ = 1 . By (3), we deduce that L = 1 . Similarly, if L = 1 , then H = 1 . Moreover, H = L since B = { 0 , 1 } . For any i , j ∈ [ n ] , x i j = a i j ∘ + H and y i j = b i j ∘ + L . If i = j , then a i j ∘ = b i j ∘ = 0 and so x i j = H = L = y i j . If i ≠ j , then a i j ∘ = a i j and b i j ∘ = b i j . Thus x i j = a i j ★ = b i j ★ = y i j .
We have shown that Γ ( T ( A ) ) = Γ ( T ( B ) ) . Thus T ( A ) ρ c T ( B ) and so T preserves ρ c . Notice that E n ∈ M n c but T ( E n ) = E n ∘ ∉ M n c . Then T does not preserve M n c . By Proposition 5, T does not commute with Γ .

6. Strong Linear Preservers of M n c

In this section, we stipulate that for any a , b ∈ S , a ≤ b or b ≤ a . That is, the partial order ≤ defined by (1) is a total order on incline S. We shall consider linear transformations strongly preserving M n c on M n ( S ) . In particular, we characterize the strong linear preservers on M 2 ( R ) , M 2 ( F ) and M n ( B ) .
Now we give some notations that will be used later. If a ≤ b and a ≠ b , we denote a < b . Let Y ⊆ S . If a ∈ Y and b ≤ a for any b ∈ Y , we denote a = max Y ; if a ∈ Y and a ≤ b for any b ∈ Y , we denote a = min Y . Let A = ( a i j ) , B = ( b i j ) ∈ M n ( S ) . Denote A − B = ( c i j ) , where
c i j = 0 , if b i j ≠ 0 , a i j , if b i j = 0 .
Notice that M 1 ( S ) = M 1 c = S . Take a ∈ S and define T : M 1 ( S ) → M 1 ( S ) by T ( x ) = a x for any x ∈ M 1 ( S ) . It is clear that T strongly preserves M 1 c . In the following, we consider n ≥ 2 .
Proposition 8.
Let T : M n ( S ) → M n ( S ) ( n ≥ 2 ) be a linear transformation strongly preserving M n c . Then for any i , j ∈ [ n ] , there is no ( s , t ) ≠ ( i , j ) such that T ( E i , j ) ≤ T ( E s , t ) . Consequently, T ( E i , j ) ≠ Z n and T ( E i , j ) ≠ E n .
Proof. 
Assume that T ( E i , j ) ≤ T ( E s , t ) for some ( s , t ) ≠ ( i , j ) . If n ≥ 3 or i = j , then E n − E i , j ∉ M n c . Notice that T ( E n − E i , j ) = T ( E n ) ∈ M n c . This contradicts that T strongly preserves M n c . If n = 2 and i ≠ j , then E s , t = E j , i or E s , t = E s , s ( s ∈ { i , j } ). Hence E i , j + E j , i + E s , s ∉ M 2 c and E j , i + E s , s ∈ M 2 c . Notice that T ( E i , j + E j , i + E s , s ) = T ( E j , i + E s , s ) , a contradiction.
Thus for any i , j ∈ [ n ] , there is no ( s , t ) ≠ ( i , j ) such that T ( E i , j ) ≤ T ( E s , t ) . Clearly, T ( E i , j ) ≠ Z n and T ( E i , j ) ≠ E n . □
We now consider strong linear preservers of M 2 c on M 2 ( S ) . Firstly, it is easily verified that
Proposition 9.
Let A = ( a i j ) ∈ M 2 ( S ) . Then A ∈ M 2 c ⇔ a 12 a 21 ≤ min { a 11 , a 22 } .
Let T be a linear transformation strongly preserving M 2 c . In the following, we denote
T ( E 1 , 1 ) = a 11 a 12 a 21 a 22 , T ( E 1 , 2 ) = b 11 b 12 b 21 b 22 ,
T ( E 2 , 1 ) = c 11 c 12 c 21 c 22 , T ( E 2 , 2 ) = d 11 d 12 d 21 d 22 .
Notice that E 1 , 1 , E 1 , 2 , E 2 , 1 , E 2 , 2 ∈ M 2 c . Then T ( E 1 , 1 ) , T ( E 1 , 2 ) , T ( E 2 , 1 ) , T ( E 2 , 2 ) ∈ M 2 c . By Proposition 9,
a 12 a 21 ≤ min { a 11 , a 22 } , b 12 b 21 ≤ min { b 11 , b 22 } ,
c 12 c 21 ≤ min { c 11 , c 22 } , d 12 d 21 ≤ min { d 11 , d 22 } .
Moreover, we have the following conclusions.
Lemma 11.
Let T : M 2 ( S ) → M 2 ( S ) be a linear transformation strongly preserving M 2 c . Then the following statements hold:
(i) 
min { a 11 , a 22 } = 0 , min { a 12 , a 21 } = 0 ;
(ii) 
min { b 11 , b 22 } = 0 , min { b 12 , b 21 } = 0 ;
(iii) 
min { c 11 , c 22 } = 0 , min { c 12 , c 21 } = 0 ;
(iv) 
min { d 11 , d 22 } = 0 , min { d 12 , d 21 } = 0 .
Proof. 
(i) Assume that r = min { a 11 , a 22 } ≠ 0 . Then E 1 , 1 + r E 1 , 2 + r E 2 , 1 ∉ M 2 c and
( a 12 + r b 12 + r c 12 ) ( a 21 + r b 21 + r c 21 ) ≤ a 12 a 21 + r = r ≤ min { a 11 + r b 11 + r c 11 , a 22 + r b 22 + r c 22 } .
Thus T ( E 1 , 1 + r E 1 , 2 + r E 2 , 1 ) ∈ M 2 c . This contradicts that T strongly preserves M 2 c . Hence min { a 11 , a 22 } = 0 . Moreover, 0 ≤ a 12 a 21 ≤ min { a 11 , a 22 } = 0 and so a 12 a 21 = 0 . Since S contains no zero divisors, we deduce that min { a 12 , a 21 } = 0 .
(ii) Assume that r = min { b 11 , b 22 } ≠ 0 . Then E 1 , 2 + r E 2 , 1 ∉ M 2 c and
( b 12 + r c 12 ) ( b 21 + r c 21 ) ≤ b 12 b 21 + r = r ≤ min { b 11 + r c 11 , b 22 + r c 22 } .
Thus T ( E 1 , 2 + r E 2 , 1 ) ∈ M 2 c . This contradicts that T strongly preserves M 2 c . Hence min { b 11 , b 22 } = 0 . Moreover, 0 ≤ b 12 b 21 ≤ min { b 11 , b 22 } = 0 and so b 12 b 21 = 0 . Since S contains no zero divisors, we deduce that min { b 12 , b 21 } = 0 .
(iii) Assume that r = min { c 11 , c 22 } ≠ 0 . Then r E 1 , 2 + E 2 , 1 ∉ M 2 c and
( r b 12 + c 12 ) ( r b 21 + c 21 ) ≤ c 12 c 21 + r = r ≤ min { r b 11 + c 11 , r b 22 + c 22 } .
Thus T ( r E 1 , 2 + E 2 , 1 ) ∈ M 2 c . This contradicts that T strongly preserves M 2 c . Hence min { c 11 , c 22 } = 0 . Moreover, 0 ≤ c 12 c 21 ≤ min { c 11 , c 22 } = 0 and so c 12 c 21 = 0 . Since S contains no zero divisors, we deduce that min { c 12 , c 21 } = 0 .
(iv) Assume that r = min { d 11 , d 22 } ≠ 0 . Then E 2 , 2 + r E 1 , 2 + r E 2 , 1 ∉ M 2 c and
( d 12 + r b 12 + r c 12 ) ( d 21 + r b 21 + r c 21 ) ≤ d 12 d 21 + r = r ≤ min { d 11 + r b 11 + r c 11 , d 22 + r b 22 + r c 22 } .
Thus T ( E 2 , 2 + r E 1 , 2 + r E 2 , 1 ) ∈ M 2 c . This contradicts that T strongly preserves M 2 c . Hence min { d 11 , d 22 } = 0 . Moreover, 0 ≤ d 12 d 21 ≤ min { d 11 , d 22 } = 0 and so d 12 d 21 = 0 . Since S contains no zero divisors, we deduce that min { d 12 , d 21 } = 0 . □
Lemma 12.
Let T : M 2 ( S ) → M 2 ( S ) be a linear transformation strongly preserving M 2 c . Then either (I) b 21 = c 12 = 0 , b 12 ≠ 0 , c 21 ≠ 0 or (II) b 12 = c 21 = 0 , b 21 ≠ 0 , c 12 ≠ 0 .
Proof. 
By Lemma 11 (iii) and (iv),
b 12 ≠ 0 , b 21 = 0 or b 12 = 0 , b 21 ≠ 0 or b 12 = b 21 = 0
c 12 ≠ 0 , c 21 = 0 or c 12 = 0 , c 21 ≠ 0 or c 12 = c 21 = 0 .
Assume that the conclusion does not hold. Then b 12 + c 12 = 0 or b 21 + c 21 = 0 . Thus
0 = ( b 12 + c 12 ) ( b 21 + c 21 ) ≤ min { b 11 + c 11 , b 22 + c 22 }
and so T ( E 1 , 2 + E 2 , 1 ) ∈ M 2 c . Notice that E 1 , 2 + E 2 , 1 ∉ M 2 c . This contradicts that T strongly preserves M 2 c . □
Lemma 13.
Let T : M 2 ( S ) → M 2 ( S ) be a linear transformation strongly preserving M 2 c . Then a 12 = a 21 = 0 , d 12 = d 21 = 0 . Moreover, either (I) a 11 ≠ 0 , a 12 = a 21 = a 22 = 0 , d 11 = d 12 = d 21 = 0 , d 22 ≠ 0 or (II) a 22 ≠ 0 , a 11 = a 12 = a 21 = 0 , d 12 = d 21 = d 22 = 0 , d 11 ≠ 0 .
Proof. 
Firstly, let t = max { a 12 , a 21 } , we assert t = 0 . Otherwise, if t ≠ 0 , then
E 1 , 1 + t E 1 , 2 , E 1 , 1 + t E 2 , 1 ∈ M 2 c and E 1 , 1 + t E 1 , 2 + t E 2 , 1 ∉ M 2 c .
Since T preserves M 2 c , we have T ( E 1 , 1 + t E 1 , 2 ) , T ( E 1 , 1 + t E 2 , 1 ) ∈ M 2 c . Thus
( a 12 + t b 12 ) ( a 21 + t b 21 ) ≤ min { a 11 + t b 11 , a 22 + t b 22 }
and
( a 12 + t c 12 ) ( a 21 + t c 21 ) ≤ min { a 11 + t c 11 , a 22 + t c 22 } .
By Lemma 12, there are two cases to consider:
Case 1. b 12 ≠ 0 , c 21 ≠ 0 , b 21 = c 12 = 0 . By (5) and (6), we have
a 12 a 21 + t b 12 a 21 ≤ min { a 11 + t b 11 , a 22 + t b 22 } ,
a 12 a 21 + t a 12 c 21 ≤ min { a 11 + t c 11 , a 22 + t c 22 } .
Since t = max { a 12 , a 21 } , we deduce that
( a 12 + t b 12 + t c 12 ) ( a 21 + t b 21 + t c 21 ) = ( a 12 + t b 12 ) ( a 21 + t c 21 ) = a 12 a 21 + t b 12 a 21 + t a 12 c 21 + t 2 b 12 c 21 = a 12 a 21 + t b 12 a 21 + t a 12 c 21 ≤ min { a 11 + t b 11 + t c 11 , a 22 + t b 22 + t c 22 }
and so T ( E 1 , 1 + t E 1 , 2 + t E 2 , 1 ) ∈ M 2 c . Notice that E 1 , 1 + t E 1 , 2 + t E 2 , 1 ∉ M 2 c . This contradicts that T strongly preserves M 2 c .
Case 2. b 21 ≠ 0 , c 12 ≠ 0 , b 12 = c 21 = 0 . By (5) and (6), we have
a 12 a 21 + t a 12 b 21 ≤ min { a 11 + t b 11 , a 22 + t b 22 } ,
a 12 a 21 + t c 12 a 21 ≤ min { a 11 + t c 11 , a 22 + t c 22 } .
Since t = max { a 12 , a 21 } , we deduce that
( a 12 + t b 12 + t c 12 ) ( a 21 + t b 21 + t c 21 ) = ( a 12 + t c 12 ) ( a 21 + t b 21 ) = a 12 a 21 + t c 12 a 21 + t a 12 b 21 + t 2 c 12 b 21 = a 12 a 21 + t c 12 a 21 + t a 12 b 21 ≤ min { a 11 + t b 11 + t c 11 , a 22 + t b 22 + t c 22 }
and so T ( E 1 , 1 + t E 1 , 2 + t E 2 , 1 ) ∈ M 2 c . Notice that E 1 , 1 + t E 1 , 2 + t E 2 , 1 ∉ M 2 c . This contradicts that T strongly preserves M 2 c .
From the above discussion, t = 0 and so a 12 = a 21 = 0 . Secondly, let u = max { d 12 , d 21 } , we assert u = 0 . Otherwise, if u ≠ 0 , then
E 2 , 2 + u E 1 , 2 , E 2 , 2 + u E 2 , 1 ∈ M 2 c and E 2 , 2 + u E 1 , 2 + u E 2 , 1 ∉ M 2 c .
Since T preserves M 2 c , we have T ( E 2 , 2 + u E 1 , 2 ) , T ( E 2 , 2 + u E 2 , 1 ) ∈ M 2 c . By Lemma 12, b 12 ≠ 0 , c 21 ≠ 0 , b 21 = c 12 = 0 or b 21 ≠ 0 , c 12 ≠ 0 , b 12 = c 21 = 0 . A similar discussion as above shows that T ( E 2 , 2 + u E 1 , 2 + u E 2 , 1 ) ∈ M 2 c . This contradicts that T strongly preserves M 2 c . Thus u = 0 and so d 12 = d 21 = 0 .
Finally, by Lemma 11, we have
a 11 ≠ 0 , a 12 = a 21 = a 22 = 0 or a 11 = a 12 = a 21 = 0 , a 22 ≠ 0 ,
d 11 ≠ 0 , d 12 = d 21 = d 22 = 0 or d 11 = d 12 = d 21 = 0 , d 22 ≠ 0 .
Assume that a 11 ≠ 0 , a 12 = a 21 = a 22 = 0 , d 11 ≠ 0 , d 12 = d 21 = d 22 = 0 or a 11 = a 12 = a 21 = 0 , a 22 ≠ 0 , d 11 = d 12 = d 21 = 0 , d 22 ≠ 0 . Then T ( E 1 , 1 ) ≤ T ( E 2 , 2 ) or T ( E 2 , 2 ) ≤ T ( E 1 , 1 ) . By Proposition 8, it’s a contradiction. Thus the conclusion holds. □
Lemma 14.
Let T : M 2 ( S ) → M 2 ( S ) be a linear transformation strongly preserving M 2 c . Then b 11 = b 22 = c 11 = c 22 = 0 . Moreover, either (I) b 12 ≠ 0 , b 11 = b 21 = b 22 = 0 , c 21 ≠ 0 , c 11 = c 12 = c 22 = 0 or (II) b 21 ≠ 0 , b 11 = b 12 = b 22 = 0 , c 12 ≠ 0 , c 11 = c 21 = c 22 = 0 .
Proof. 
Firstly, let t = max { b 11 , c 11 } , we assert t = 0 . Otherwise, if t ≠ 0 , by Lemma 13, there are two cases to consider:
Case 1. a 11 ≠ 0 , a 12 = a 21 = a 22 = 0 , d 11 = d 12 = d 21 = 0 , d 22 ≠ 0 . Then we have
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = a 11 + b 11 + c 11 b 12 + c 12 b 21 + c 21 b 22 + c 22 + d 22
T ( t E 1 , 2 + t E 2 , 1 + E 2 , 2 ) = t b 11 + t c 11 t b 12 + t c 12 t b 21 + t c 21 t b 22 + t c 22 + d 22 .
Since E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∈ M 2 c , we have T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) ∈ M 2 c and so
( b 12 + c 12 ) ( b 21 + c 21 ) ≤ min { a 11 + b 11 + c 11 , b 22 + c 22 + d 22 } .
Notice that t = max { b 11 , c 11 } = b 11 + c 11 ; we deduce that
( t b 12 + t c 12 ) ( t b 21 + t c 21 ) ≤ min { t b 11 + t c 11 , t b 22 + t c 22 + d 22 } .
Thus T ( t E 1 , 2 + t E 2 , 1 + E 2 , 2 ) ∈ M 2 c . However, t E 1 , 2 + t E 2 , 1 + E 2 , 2 ∉ M 2 c . It is a contradiction.
Case 2. a 22 ≠ 0 , a 11 = a 12 = a 21 = 0 , d 12 = d 21 = d 22 = 0 , d 11 ≠ 0 . Then we have
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = b 11 + c 11 + d 11 b 12 + c 12 b 21 + c 21 a 22 + b 22 + c 22
T ( E 1 , 1 + t E 1 , 2 + t E 2 , 1 ) = t b 11 + t c 11 t b 12 + t c 12 t b 21 + t c 21 a 22 + t b 22 + t c 22 .
Since E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∈ M 2 c , we have T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) ∈ M 2 c and so
( b 12 + c 12 ) ( b 21 + c 21 ) ≤ min { b 11 + c 11 + d 11 , a 22 + b 22 + c 22 } .
Notice that t = max { b 11 , c 11 } = b 11 + c 11 ; we deduce that
( t b 12 + t c 12 ) ( t b 21 + t c 21 ) ≤ min { t b 11 + t c 11 , a 22 + t b 22 + t c 22 } .
Thus T ( E 1 , 1 + t E 1 , 2 + t E 2 , 1 ) ∈ M 2 c . However, E 1 , 1 + t E 1 , 2 + t E 2 , 1 ∉ M 2 c . It is a contradiction. From the above discussion, we have t = 0 and so b 11 = c 11 = 0 .
Secondly, let u = max { b 22 , c 22 } , we assert u = 0 . Otherwise, if u ≠ 0 , by Lemma 13, there are also two cases to consider:
Case 1. a 11 ≠ 0 , a 12 = a 21 = a 22 = 0 , d 11 = d 12 = d 21 = 0 , d 22 ≠ 0 . Then we have
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = a 11 + b 11 + c 11 b 12 + c 12 b 21 + c 21 b 22 + c 22 + d 22
T ( E 1 , 1 + u E 1 , 2 + u E 2 , 1 ) = a 11 + u b 11 + u c 11 u b 12 + u c 12 u b 21 + u c 21 u b 22 + u c 22 .
Since E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∈ M 2 c , we have T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) ∈ M 2 c and so
( b 12 + c 12 ) ( b 21 + c 21 ) ≤ min { a 11 + b 11 + c 11 , b 22 + c 22 + d 22 } .
Notice that u = max { b 22 , c 22 } = b 22 + c 22 ; we deduce that
( u b 12 + u c 12 ) ( u b 21 + u c 21 ) ≤ min { a 11 + u b 11 + u c 11 , u b 22 + u c 22 } .
Thus T ( E 1 , 1 + u E 1 , 2 + u E 2 , 1 ) ∈ M 2 c . However, E 1 , 1 + u E 1 , 2 + u E 2 , 1 ∉ M 2 c . It is a contradiction.
Case 2. a 22 ≠ 0 , a 11 = a 12 = a 21 = 0 , d 12 = d 21 = d 22 = 0 , d 11 ≠ 0 . Then we have
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = b 11 + c 11 + d 11 b 12 + c 12 b 21 + c 21 a 22 + b 22 + c 22
T ( u E 1 , 2 + u E 2 , 1 + E 2 , 2 ) = u b 11 + u c 11 + d 11 u b 12 + u c 12 u b 21 + u c 21 u b 22 + u c 22 .
Since E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∈ M 2 c , we have T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) ∈ M 2 c and so
( b 12 + c 12 ) ( b 21 + c 21 ) ≤ min { b 11 + c 11 + d 11 , a 22 + b 22 + c 22 } .
Notice that u = max { b 22 , c 22 } = b 22 + c 22 ; we deduce that
( u b 12 + u c 12 ) ( u b 21 + u c 21 ) ≤ min { u b 11 + u c 11 + d 11 , u b 22 + u c 22 } .
Thus T ( u E 1 , 2 + u E 2 , 1 + E 2 , 2 ) ∈ M 2 c . However, u E 1 , 2 + u E 2 , 1 + E 2 , 2 ∉ M 2 c . It is a contradiction. From the above discussion, we have u = 0 and so b 22 = c 22 = 0 .
Finally, by Lemma 12, the conclusion holds. □
Lemma 15.
Let T : M 2 ( S ) → M 2 ( S ) be a linear transformation strongly preserving M 2 c . Then either (I) a 11 = d 22 ≠ 0 , a 12 = a 21 = a 22 = 0 , d 11 = d 12 = d 21 = 0 or (II) a 22 = d 11 ≠ 0 , a 11 = a 12 = a 21 = 0 , d 12 = d 21 = d 22 = 0 .
Proof. 
By Lemma 13, there are two cases to consider:
Case 1. a 11 ≠ 0 , d 22 ≠ 0 , a 12 = a 21 = a 22 = 0 , d 11 = d 12 = d 21 = 0 .
We assert a 11 = d 22 . Otherwise, without loss of generality, assume that d 22 < a 11 . By Lemma 14, if b 12 ≠ 0 , c 21 ≠ 0 , b 11 = b 21 = b 22 = 0 , c 11 = c 12 = c 22 = 0 , then
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = a 11 b 12 c 21 d 22 ,
T ( d 22 E 1 , 1 + a 11 E 1 , 2 + E 2 , 1 + E 2 , 2 ) = d 22 a 11 a 11 b 12 c 21 d 22 .
Since E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∈ M 2 c , we have b 12 c 21 ≤ min { a 11 , d 22 } and so ( a 11 b 12 ) c 21 ≤ min { d 22 a 11 , d 22 } . Thus T ( d 22 E 1 , 1 + a 11 E 1 , 2 + E 2 , 1 + E 2 , 2 ) ∈ M 2 c . Notice that d 22 E 1 , 1 + a 11 E 1 , 2 + E 2 , 1 + E 2 , 2 ∉ M 2 c , a contradiction.
If b 21 ≠ 0 , c 12 ≠ 0 , b 11 = b 12 = b 22 = 0 , c 11 = c 21 = c 22 = 0 , then
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = a 11 c 12 b 21 d 22 ,
T ( d 22 E 1 , 1 + a 11 E 1 , 2 + E 2 , 1 + E 2 , 2 ) = d 22 a 11 c 12 a 11 b 21 d 22 .
Since E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∈ M 2 c , we have b 21 c 12 ≤ min { a 11 , d 22 } and so c 12 ( a 11 b 21 ) ≤ min { d 22 a 11 , d 22 } . Thus T ( d 22 E 1 , 1 + a 11 E 1 , 2 + E 2 , 1 + E 2 , 2 ) ∈ M 2 c . Notice that d 22 E 1 , 1 + a 11 E 1 , 2 + E 2 , 1 + E 2 , 2 ∉ M 2 c , a contradiction.
Case 2. a 22 ≠ 0 , d 11 ≠ 0 , a 11 = a 12 = a 21 = 0 , d 12 = d 21 = d 22 = 0 .
We assert a 22 = d 11 . Otherwise, without loss of generality, assume that d 11 < a 22 . By Lemma 14, if b 12 ≠ 0 , c 21 ≠ 0 , b 11 = b 21 = b 22 = 0 , c 11 = c 12 = c 22 = 0 , then
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = a 22 b 12 c 21 d 11 ,
T ( d 11 E 1 , 1 + a 22 E 1 , 2 + E 2 , 1 + E 2 , 2 ) = d 11 a 22 a 22 b 12 c 21 d 11 .
Since E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∈ M 2 c , we have b 12 c 21 ≤ min { a 22 , d 11 } and so ( a 22 b 12 ) c 21 ≤ min { d 11 a 22 , d 11 } . Thus T ( d 11 E 1 , 1 + a 22 E 1 , 2 + E 2 , 1 + E 2 , 2 ) ∈ M 2 c . Notice that d 11 E 1 , 1 + a 22 E 1 , 2 + E 2 , 1 + E 2 , 2 ∉ M 2 c , a contradiction.
If b 21 ≠ 0 , c 12 ≠ 0 , b 11 = b 12 = b 22 = 0 , c 11 = c 21 = c 22 = 0 , then
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = a 22 c 12 b 21 d 11 ,
T ( d 11 E 1 , 1 + a 22 E 1 , 2 + E 2 , 1 + E 2 , 2 ) = d 11 a 22 c 12 a 22 b 21 d 11 .
Since E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∈ M 2 c , we have c 12 b 21 ≤ min { a 22 , d 11 } and so c 12 ( a 22 b 21 ) ≤ min { d 11 a 22 , d 11 } . Thus T ( d 11 E 1 , 1 + a 22 E 1 , 2 + E 2 , 1 + E 2 , 2 ) ∈ M 2 c . Notice that d 11 E 1 , 1 + a 22 E 1 , 2 + E 2 , 1 + E 2 , 2 ∉ M 2 c , a contradiction.
From the above discussion, the conclusion holds. □
Theorem 5.
Let T : M 2 ( S ) → M 2 ( S ) be a linear transformation strongly preserving M 2 c . Then T satisfies one of the following conditions:
(i) 
T ( E 1 , 1 ) = a E 1 , 1 , T ( E 2 , 2 ) = a E 2 , 2 , T ( E 1 , 2 ) = b 12 E 1 , 2 , T ( E 2 , 1 ) = c 21 E 2 , 1 , a ≠ 0 and b 12 c 21 ≤ a ≤ min { b 12 , c 21 } ;
(ii) 
T ( E 1 , 1 ) = a E 1 , 1 , T ( E 2 , 2 ) = a E 2 , 2 , T ( E 1 , 2 ) = b 21 E 2 , 1 , T ( E 2 , 1 ) = c 12 E 1 , 2 , a ≠ 0 and b 21 c 12 ≤ a ≤ min { b 21 , c 12 } ;
(iii) 
T ( E 1 , 1 ) = a E 2 , 2 , T ( E 2 , 2 ) = a E 1 , 1 , T ( E 1 , 2 ) = b 12 E 1 , 2 , T ( E 2 , 1 ) = c 21 E 2 , 1 , a ≠ 0 and b 12 c 21 ≤ a ≤ min { b 12 , c 21 } ;
(iv) 
T ( E 1 , 1 ) = a E 2 , 2 , T ( E 2 , 2 ) = a E 1 , 1 , T ( E 1 , 2 ) = b 21 E 2 , 1 , T ( E 2 , 1 ) = c 12 E 1 , 2 , a ≠ 0 and b 21 c 12 ≤ a ≤ min { b 21 , c 12 } .
Proof. 
By Lemmas 14 and 15, there are four cases to consider:
Case 1. a 11 = d 22 ≠ 0 , a 12 = a 21 = a 22 = 0 , d 11 = d 12 = d 21 = 0 , b 12 ≠ 0 , c 21 ≠ 0 , b 11 = b 21 = b 22 = 0 , c 11 = c 12 = c 22 = 0 .
Let a 11 = d 22 = a . Then T ( E 1 , 1 ) = a E 1 , 1 , T ( E 2 , 2 ) = a E 2 , 2 , T ( E 1 , 2 ) = b 12 E 1 , 2 , T ( E 2 , 1 ) = c 21 E 2 , 1 . Moreover, we have
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = a b 12 c 21 a ,
T ( b 12 E 1 , 1 + a E 1 , 2 + E 2 , 1 + c 21 E 2 , 2 ) = a b 12 a b 12 c 21 a c 21 .
Since T strongly preserves M 2 c , we deduce that b 12 c 21 ≤ a ≤ min { b 12 , c 21 } .
Case 2. a 11 = d 22 ≠ 0 , a 12 = a 21 = a 22 = 0 , d 11 = d 12 = d 21 = 0 , b 21 ≠ 0 , c 12 ≠ 0 , b 11 = b 12 = b 22 = 0 , c 11 = c 21 = c 22 = 0 .
Let a 11 = d 22 = a . Then T ( E 1 , 1 ) = a E 1 , 1 , T ( E 2 , 2 ) = a E 2 , 2 , T ( E 1 , 2 ) = b 21 E 2 , 1 , T ( E 2 , 1 ) = c 12 E 1 , 2 . Moreover, we have
T ( E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = a c 12 b 21 a ,
T ( c 12 E 1 , 1 + a E 1 , 2 + E 2 , 1 + b 21 E 2 , 2 ) = a c 12 a c 12 b 21 a b 21 .
Since T strongly preserves M 2 c , we deduce that b 21 c 12 ≤ a ≤ min { b 21 , c 12 } .
Case 3. a 22 = d 11 ≠ 0 , a 12 = a 21 = a 11 = 0 , d 22 = d 12 = d 21 = 0 , b 12 ≠ 0 , c 21 ≠ 0 , b 11 = b 21 = b 22 = 0 , c 11 = c 12 = c 22 = 0 .
Let a 22 = d 11 = a . Then T ( E 1 , 1 ) = a E 2 , 2 , T ( E 2 , 2 ) = a E 1 , 1 , T ( E 1 , 2 ) = b 12 E 1 , 2 , T ( E 2 , 1 ) = c 21 E 2 , 1 . A similar discussion to Case 1 shows that b 12 c 21 ≤ a ≤ min { b 12 , c 21 } .
Case 4. a 22 = d 11 ≠ 0 , a 12 = a 21 = a 11 = 0 , d 22 = d 12 = d 21 = 0 , b 21 ≠ 0 , c 12 ≠ 0 , b 11 = b 12 = b 22 = 0 , c 11 = c 21 = c 22 = 0 .
Let a 22 = d 11 = a . Then T ( E 1 , 1 ) = a E 2 , 2 , T ( E 2 , 2 ) = a E 1 , 1 , T ( E 1 , 2 ) = b 21 E 2 , 1 , T ( E 2 , 1 ) = c 12 E 1 , 2 . A similar discussion to Case 2 shows that b 21 c 12 ≤ a ≤ min { b 21 , c 12 } . □
As an application of Theorem 5, we characterize strong linear preservers of transitive closure on M 2 ( R ) , M 2 ( F ) and M n ( B ) . Recall that for A = ( a i j ) , B = ( b i j ) ∈ M n ( S ) , A ∘ B denotes the Hadamard (or Schur) product, i.e., the ( i , j ) -entry of A ∘ B is a i j b i j .
Theorem 6.
Let T : M 2 ( R ) → M 2 ( R ) be a linear transformation. Then T strongly preserves M 2 c if and only if there exist σ ∈ S y m ( [ 2 ] ) and X = ( x i j ) ∈ M 2 c with x 12 x 21 = x 11 = x 22 such that T ( A ) = X ∘ ( P σ − 1 A P σ ) for all A ∈ M 2 ( R ) or T ( A ) = X ∘ ( P σ − 1 A T P σ ) for all A ∈ M 2 ( R ) .
Proof. 
First we show the sufficiency. Suppose that W = ( w i j ) ∈ M 2 ( R ) and T ( W ) = ( v i j ) . Let x = x 12 x 21 = x 11 = x 22 . Then it is easily verified that
v 12 v 21 = x w 12 w 21 , v 11 = x w 11 , v 22 = x w 22 or v 12 v 21 = x w 12 w 21 , v 11 = x w 22 , v 22 = x w 11 .
Moreover, since the multiplication in R is the usual arithmetic sum, we deduce that
W ∈ M 2 c ⇔ w 11 w 22 ≤ min { w 12 , w 21 } ⇔ x w 12 w 21 ≤ min { x w 11 , x w 22 } ⇔ T ( W ) ∈ M 2 c .
Thus T strongly preserves M 2 c .
Now we show the necessity. Suppose that T strongly preserves M 2 c . Notice that the additive identity element is − ∞ and the multiplicative identity element is 0. By Theorem 5, there are four cases to consider:
Case 1. T ( E 1 , 1 ) = a E 1 , 1 , T ( E 2 , 2 ) = a E 2 , 2 , T ( E 1 , 2 ) = b 12 E 1 , 2 , T ( E 2 , 1 ) = c 21 E 2 , 1 , a ≠ − ∞ and b 12 c 21 ≤ a ≤ min { b 12 , c 21 } .
We assert b 12 c 21 = a . Otherwise, b 12 c 21 < a . Since b 12 c 21 is the arithmetic sum of b 12 and c 21 , we have t = b 12 c 21 − a < 0 and so t + a = b 12 c 21 , that is, t a = b 12 c 21 . Notice that
T ( t E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ) = t a b 12 c 21 a ∈ M 2 c .
However, t E 1 , 1 + E 1 , 2 + E 2 , 1 + E 2 , 2 ∉ M 2 c . This contradicts that T strongly preserves M 2 c . Thus b 12 c 21 = a . Let x 11 = x 22 = a and x 12 = b 12 , x 21 = c 21 . Then X = ( x i j ) ∈ M 2 c . Moreover, we can verify that T ( A ) = X ∘ A for all A ∈ M 2 ( R ) .
Case 2. T ( E 1 , 1 ) = a E 1 , 1 , T ( E 2 , 2 ) = a E 2 , 2 , T ( E 1 , 2 ) = b 21 E 2 , 1 , T ( E 2 , 1 ) = c 12 E 1 , 2 , a ≠ − ∞ and b 21 c 12 ≤ a ≤ min { b 21 , c 12 } .
A similar discussion to Case 1 shows that b 21 c 12 = a . Let x 11 = x 22 = a and x 12 = c 12 , x 21 = b 21 . Then X = ( x i j ) ∈ M 2 c . Moreover, we can verify that T ( A ) = X ∘ A T for all A ∈ M 2 ( R ) .
Case 3. T ( E 1 , 1 ) = a E 2 , 2 , T ( E 2 , 2 ) = a E 1 , 1 , T ( E 1 , 2 ) = b 12 E 1 , 2 , T ( E 2 , 1 ) = c 21 E 2 , 1 , a ≠ − ∞ and b 12 c 21 ≤ a ≤ min { b 12 , c 21 } .
A similar discussion to Case 1 shows that b 12 c 21 = a . Let x 11 = x 22 = a and x 12 = b 12 , x 21 = c 21 . Then X = ( x i j ) ∈ M 2 c . Moreover, we can verify that T ( A ) = X ∘ ( P σ − 1 A T P σ ) for all A ∈ M 2 ( R ) , where σ = ( 12 ) .
Case 4. T ( E 1 , 1 ) = a E 2 , 2 , T ( E 2 , 2 ) = a E 1 , 1 , T ( E 1 , 2 ) = b 21 E 2 , 1 , T ( E 2 , 1 ) = c 12 E 1 , 2 , a ≠ − ∞ and b 21 c 12 ≤ a ≤ min { b 21 , c 12 } .
A similar discussion to Case 1 shows that b 21 c 12 = a . Let x 11 = x 22 = a and x 12 = c 12 , x 21 = b 21 . Then X = ( x i j ) ∈ M 2 c . Moreover, we can verify that T ( A ) = X ∘ ( P σ − 1 A P σ ) for all A ∈ M 2 ( R ) , where σ = ( 12 ) . □
Theorem 7.
Let T : M 2 ( F ) → M 2 ( F ) be a linear transformation. Then T strongly preserves M 2 c if and only if there exists σ ∈ S y m ( [ 2 ] ) such that T ( A ) = P σ − 1 A P σ for all A ∈ M 2 ( F ) or T ( A ) = P σ − 1 A T P σ for all A ∈ M 2 ( F ) .
Proof. 
By Lemma 8, the sufficiency holds. Now we show the necessity. By Theorem 5, there are four cases to consider:
Case 1. T ( E 1 , 1 ) = a E 1 , 1 , T ( E 2 , 2 ) = a E 2 , 2 , T ( E 1 , 2 ) = b 12 E 1 , 2 , T ( E 2 , 1 ) = c 21 E 2 , 1 , a ≠ 0 and b 12 c 21 ≤ a ≤ min { b 12 , c 21 } .
We assert a = 1 . In fact, notice that a 2 = a in F ; we have
T a 1 1 1 = a 2 b 12 c 21 a = a b 12 c 21 a = T 1 1 1 1 ∈ M 2 c .
Since T strongly preserves M 2 c , we deduce that a 1 1 1 ∈ M 2 c . Thus a = 1 . Notice that a ≤ min { b 12 , c 21 } ; we have b 12 = c 21 = a = 1 . Thus T ( A ) = A for all A ∈ M 2 ( F ) .
Case 2. T ( E 1 , 1 ) = a E 1 , 1 , T ( E 2 , 2 ) = a E 2 , 2 , T ( E 1 , 2 ) = b 21 E 2 , 1 , T ( E 2 , 1 ) = c 12 E 1 , 2 , a ≠ 0 and b 21 c 12 ≤ a ≤ min { b 21 , c 12 } .
A similar discussion to Case 1 shows that b 21 = c 12 = a = 1 . Thus T ( A ) = A T for all A ∈ M 2 ( F ) .
Case 3. T ( E 1 , 1 ) = a E 2 , 2 , T ( E 2 , 2 ) = a E 1 , 1 , T ( E 1 , 2 ) = b 12 E 1 , 2 , T ( E 2 , 1 ) = c 21 E 2 , 1 , a ≠ 0 and b 12 c 21 ≤ a ≤ min { b 12 , c 21 } .
A similar discussion to Case 1 shows that b 12 = c 21 = a = 1 . Thus T ( A ) = P σ − 1 A T P σ for all A ∈ M 2 ( F ) , where σ = ( 12 ) .
Case 4. T ( E 1 , 1 ) = a E 2 , 2 , T ( E 2 , 2 ) = a E 1 , 1 , T ( E 1 , 2 ) = b 21 E 2 , 1 , T ( E 2 , 1 ) = c 12 E 1 , 2 , a ≠ 0 and b 21 c 12 ≤ a ≤ min { b 21 , c 12 } .
A similar discussion to Case 1 shows that b 21 = c 12 = a = 1 . Thus T ( A ) = P σ − 1 A P σ for all A ∈ M 2 ( F ) , where σ = ( 12 ) . □
Theorem 8.
Let T : M n ( B ) → M n ( B ) be a linear transformation. Then T strongly preserves M n c if and only if there exists σ ∈ S y m ( [ n ] ) such that T ( A ) = P σ − 1 A P σ for all A ∈ M n ( B ) or T ( A ) = P σ − 1 A T P σ for all A ∈ M n ( B ) .
Proof. 
By Lemma 8, the sufficiency holds. We need to show the necessity. Notice that B = { 0 , 1 } . If n = 2 , then T is bijective on { E i , j | i , j ∈ [ 2 ] } by Theorem 5. Thus T is surjective by Lemma 2. Consequently, the necessity holds by Theorem 1.
Now we consider n ≥ 3 . We first show that T ( E i , j ) = E k , l for any i , j ∈ [ n ] . Otherwise, it follows from Proposition 8 that there exist i , j ∈ [ n ] such that E k , l + E p , q ≤ T ( E i , j ) for some ( k , l ) ≠ ( p , q ) . Let
T ( E n ) − T ( E i , j ) = ∑ ( s , t ) ∈ Δ E s , t , where Δ ⊆ [ n ] × [ n ] .
Then | Δ | ≤ n 2 − 2 . For any ( s , t ) ∈ Δ , select a unique ( s ′ , t ′ ) ∈ [ n ] × [ n ] such that E s , t ≤ T ( E s ′ , t ′ ) . Let Δ ′ be the set of such elements ( s ′ , t ′ ) . Then | Δ ′ | ≤ | Δ | ≤ n 2 − 2 . Take ( u , v ) ∈ [ n ] × [ n ] ∖ ( Δ ′ ∪ { ( i , j ) } ) , then
T ( E n − E u , v ) = T ( E n ) ∈ M n c .
Since n ≥ 3 , we have E n − E u , v ∉ M n c . This contradicts that T strongly preserves M n c . Thus T ( E i , j ) = E k , l for any i , j ∈ [ n ] . By Proposition 8, T ( E i , j ) ≠ T ( E p , q ) for any ( i , j ) ≠ ( p , q ) . Thus T is bijective on { E i , j | i , j ∈ [ n ] } . By Lemma 2, T is surjective on M n ( B ) . Hence the necessity holds by Theorem 1. □

7. Conclusions and Future Work

In this paper, we have systematically studied transitive closure linear preservers for square matrices over a class of commutative inclines without zero divisors. We introduced the transitive closure operator Γ and studied its relation to the digraph transitive closure (Proposition 3). Our main results provide a complete classification of surjective linear preservers of transitive closures (Theorem 1), establish the equivalence between preserving transitive closures, commuting with Γ , and preserving the kernel of Γ (Theorem 4), and characterize strong linear preservers of transitive closure on 2 × 2 matrices over certain inclines (Theorems 6 and 7). As an important special case, we showed that strong linear preservers of transitive closure on n × n Boolean matrices are precisely the transformations given by permutation similarity or permutation similarity combined with transposition (Theorem 8). Several examples (Examples 1–5) demonstrate that the surjectivity condition in our main characterizations is essential.
The results presented in this paper are restricted to the following setting: the underlying semiring is a commutative incline without zero divisors; the linear preservers considered in Section 4 and Section 5 are surjective. Whether these conditions can be relaxed remains an open question.
In the future work, it would be interesting to explore whether similar characterizations hold for non-commutative inclines or more general semirings. Additionally, Examples 1–5 show that non-surjective linear transformations may also preserve transitive closures, or commute with Γ or preserve the kernel of Γ , but a complete classification of such non-surjective linear preservers is still lacking, and we hope that the results and examples presented in this paper will provide useful insights for further studies on linear preservers of matrices over semirings and incline algebras.

Author Contributions

Conceptualization, W.D.; methodology, W.D. and B.Y.; formal analysis, W.D. and B.Y.; investigation, W.D. and B.Y.; data curation, B.Y.; writing—original draft, W.D.; writing—review & editing, W.D. and B.Y.; visualization, B.Y.; project administration, W.D.; and funding acquisition, W.D. All authors have read and agreed to the published version of the manuscript.

Funding

The paper is supported by the National Natural Science Foundation of China (12301024, 12371024), the Youth Backbone Teachers Program of Huanghuai University, the Natural Science Foundation of Henan (262300421857, 242300421392), and the Science and Technology Key Project of Henan Province of China (242102210167).

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Li, C.K.; Pierce, S. Linear preserver problems. Am. Math. Mon. 2001, 108, 591–605. [Google Scholar] [CrossRef]
  2. Pierce, S.; Lim, M.H.; Loewy, R.; Li, C.K.; Tsing, N.K.; McDonald, B.; Beasley, L. A survey of linear preserver problems. Linear Multilinear Algebra 1992, 33, 1–2. [Google Scholar] [CrossRef] [Scilit]
  3. Beasley, L.B.; Guterman, A.E. Linear Preservers of Extremes of Rank Inequalities over Semirings: The Factor Rank. J. Math. Sci. 2005, 131, 5919–5938. [Google Scholar] [CrossRef] [Scilit]
  4. Beasley, L.B.; Mohindru, P.; Pereira, R. Preservers of Completely Positive Matrix Rank for Inclines. Bull. Malays. Math. Sci. Soc. 2017, 42, 437–447. [Google Scholar] [CrossRef] [Scilit]
  5. Catalano, L.; Julius, H. On Maps Preserving Products Equal to a Diagonalizable Matrix. Commun. Algebra 2021, 49, 4334–4344. [Google Scholar] [CrossRef] [Scilit]
  6. Chen, Z.; Liu, H. Strong Commutativity Preserving Maps of Strictly Triangular Matrix Lie Algebras. J. Algebra Appl. 2019, 18, 1950134. [Google Scholar] [CrossRef] [Scilit]
  7. Costara, C. Linear Bijective Maps Preserving Fixed Values of Products of Matrices at Fixed Vectors. Commun. Algebra 2021, 50, 920–926. [Google Scholar] [CrossRef] [Scilit]
  8. Guterman, A.; Johnson, M.; Kambites, M. Linear Isomorphisms Preserving Green’s Relations for Matrices over Anti-Negative Semifields. Linear Algebra Appl. 2018, 545, 1–14. [Google Scholar] [CrossRef] [Scilit]
  9. Kang, K.T.; Song, S.Z.; Jun, Y.B. Linear operators that strongly preserve regularity of fuzzy matrices. Math. Commun. 2010, 15, 243–254. [Google Scholar]
  10. Song, S.Z.; Kang, K.T.; Kang, M.H. Boolean regular matrices and their strongly preservers. Bull. Korean Math. Soc. 2009, 46, 373–385. [Google Scholar] [CrossRef] [Scilit]
  11. Nikita, B.; Hayden, J.; Martha, S. On maps preserving square roots of idempotent and rank-one nilpotent matrices. J. Algebra Appl. 2022, 21, 2250123. [Google Scholar] [CrossRef] [Scilit]
  12. Pshenitsyna, O.A. Maps preserving invertibility for matrices over semirings. Russ. Math. Surv. 2009, 64, 162–164. [Google Scholar] [CrossRef] [Scilit]
  13. Deng, W.N.; Ren, M.M.; Yu, B.M. Linear Preservers for Matrices over a Class of Semirings. Linear Multilinear Algebra 2022, 70, 6830–6845. [Google Scholar] [CrossRef] [Scilit]
  14. Cao, Z.-Q.; Kim, K.H.; Roush, F.W. Incline Algebra and Applications; Ellis Horwood: Chichester, UK, 1984. [Google Scholar]
  15. Kim, K.H.; Roush, F.W. Inclines and incline matrices: A survey. Linear Algebra Appl. 2004, 379, 457–473. [Google Scholar] [CrossRef] [Scilit]
  16. Deng, W.N.; Yu, B.M. Surjective Linear Transformations of Tropical Matrices Preserving Transitive Closures. Commun. Algebra 2023, 51, 2183–2198. [Google Scholar] [CrossRef] [Scilit]
  17. Gondran, M.; Minoux, M. Linear Algebra in Dioids: A Survey of Recent Results. North-Holl. Math. Stud. 1984, 95, 147–163. [Google Scholar] [CrossRef] [Scilit]
  18. 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] [Scilit]
  19. Conway, J.H. Regular Algebra and Finite Machines; Chapman and Hall: London, UK, 1971. [Google Scholar]
  20. Brualdi, R.A.; Ryser, H.J. Combinatorial Matrix Theory; Cambridge University Press: Cambridge, UK, 1991. [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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.