Next Article in Journal
Symmetry and Monotonicity of Solutions to Mixed Local and Nonlocal Weighted Elliptic Equations
Next Article in Special Issue
On the Equational Theory of Lattice-Based Algebras for Layered Graphs
Previous Article in Journal
Application of Fuzzy Subordinations and Superordinations for an Analytic Function Connected with q-Difference Operator
Previous Article in Special Issue
Computational Algebra, Coding Theory, and Cryptography: Theory and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Idempotent Triangular Matrices over Additively Idempotent Semirings: Decompositions into Products of Semicentral Idempotents

by
Dimitrinka Vladeva
Department of Algebra and Logic, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria
Axioms 2025, 14(2), 137; https://doi.org/10.3390/axioms14020137
Submission received: 23 December 2024 / Revised: 8 February 2025 / Accepted: 12 February 2025 / Published: 15 February 2025

Abstract

:
The explicit forms of idempotent and semicentral idempotent triangular matrices over an additively idempotent semiring are obtained. We define a diamond composition of idempotents and give a representation of an idempotent n × n matrix as an ( n 1 ) th degree of a sum of diamond compositions of semicentral idempotents. We construct a decomposition of a strictly upper matrix, a unitriangular matrix, and a nil-clean matrix by semicentral idempotents.

1. Introduction and Preliminaries

In the second half of the past century, a number of mathematicians realized the useful features and the significant applications of a certain type of semiring structure. Semirings are structures that are associative and distributive on both sides but do not, in general, have additive inverses. These semiring structures are additively idempotent, like Boolean and fuzzy algebras.
There are prominent applications for additively idempotent semirings including optimization and control, differential equations, algebraic geometry, dynamic programming, mathematical physics and chemistry, mathematical biology, interval analysis, mathematical economics, game theory, computer technology, Petri nets, and cryptography (see [1,2,3,4,5,6,7,8]).
On the other hand, idempotents play an important role in ring theory and are closely related to matrices since the matrix units are idempotents. There is very extensive research dealing with idempotents. Following V. Drensky (see [9]), idempotents were introduced by Benjamin Peirce [10] in 1870.
In 2021, X. Hou (see [11]) provided a complete characterization of idempotent triangular matrices over a ring in which zero and one were the only idempotent elements.
In 2022, S. Wright (see [12]) characterized the idempotency of upper triangular matrices with entries from an arbitrary ring. Very recently, D. Vladeva (see [13,14]) considered the semicentral idempotents of upper triangular matrix rings.
The study of idempotents of additively idempotent semirings has a short history. In 2013, I. Trendafilov and D. Vladeva (see [15]) proved that in the endomorphism semiring of a finite chain, the set of all idempotents with s fixed points, k 1 , , k s , 1 s n 1 , is a semiring of order m = 1 s 1 ( k m + 1 k m ) . In the main result of the paper the authors prove that the set of roots of a fixed idempotent of the endomorphism semiring of a finite chain is a semiring of the order C k 1 , 1 i = 1 1 C t i C s i C n 1 k , m , where C p is the p–th Catalan number.
In 2018, I. Chajda and H. L a ¨ nger (see [16]) investigated a variety of commutative additively and multiplicatively idempotent semirings.
In 2020, D. Vladeva (see [17]) studied a class of the right ideals of a subsemiring of the endomorphism semiring of a finite chain and considered projections on these ideals, which were derivations. For one of these derivations, d , m , and for the fixed endomorphism α 0 , the set of endomorphisms α such that d , m ( α ) = α 0 is denoted by α 0 d , m . The last set is a semiring if and only if α 0 is an idempotent. The number of the semirings, α 0 d , m , where 1 m n 1 , is equal to F 2 m , which is the 2 m th Fibonacci number.
In 2023, D. Vladeva (see [18]) suggested the following definitions:
1.
Let S and S 0 be additively idempotent semirings, S be a noncommutative semiring and an S 0 -semimodule, S 0 be a commutative semiring, and α s = s α for any α S 0 and s S . Then, S is called an S 0 -semialgebra.
2.
Let S be an S 0 -semialgebra and B ( S ) = { e i j } , i , j = 1 , , n , a basis of S (relative to S 0 ) with the following properties:
  • e i j e k l = e i l , i f j k 0 , i f j > k , i , j , k , l = 1 , , n .
  • i = 1 n e i i = 1 S , where 1 S is the identity of S.
  • e i j > e i k for all k > j and e i j > e h j , h < i .
Then, B ( S ) is called an e-basis. The basis elements e i i are idempotents, and since e i i e j j = e i j but e j j e i i = 0 , if i < j , they do not commute. In this paper, we prove the following: Let S be an S 0 -semialgebra and B ( S ) = { e i j } , i , j = 1 , , n an e-basis of S. Then, S is isomorphic to a matrix subsemiring of M n ( S 0 ) . From this theorem, it follows that if B ( S ) is a triangular e-basis, then S is isomorphic to a subsemiring of the semiring of upper triangular matrices.
Throughout the present paper, all semirings considered shall be assumed to be additively idempotent and possess an identity and a zero. Basic facts about additively idempotent semirings can be found in the seminal book of J. Golan (cf. [19]).
The present paper contains only new results and is arranged as follows. In Section 2, we obtain the explicit form of an arbitrary idempotent triangular matrix over an additively idempotent semiring. The next section deals with the left and right semicentral idempotents of an additively idempotent semiring. A new type of semicentral idempotent, called Jordan, specific for an additively idempotent semiring, is studied. We define a diamond composition, e 1 e 2 = e 1 + e 2 + e 1 e 2 , where e 1 and e 2 are idempotents and e 2 e 1 = 0 , which plays a crucial role in the decompositions of many triangular matrices. In Section 4, we find the explicit form of an arbitrary left and right semicentral idempotent triangular matrix. In the last four sections, we consider the decompositions of idempotent, strictly upper, unitriangular, and nil-clean triangular matrices by semicentral idempotent matrices.

2. Results on Idempotents of Triangular Matrix Semiring

In the following, S is an additively idempotent semiring and T n ( S ) is the semiring of n × n triangular matrices over S.
Example 1. 
It is well known that all the entries on the main diagonal of an idempotent triangular matrix are idempotents. Let e 1 x 12 0 e 2 2 = e 1 x 12 0 e 2 , where e 1 , e 2 , x 12 S and e i 2 = e i , i = 1 , 2 . Then, e 1 x 12 + x 12 e 2 = x 12 , which implies that e 1 x 12 + e 1 x 12 e 2 = e 1 x 12 and x 12 = e 1 x 12 + e 1 x 12 e 2 + x 12 e 2 . For an arbitrary α 12 S , it follows that
E ( e 1 , e 2 ) = e 1 e 1 α 12 + e 1 α 12 e 2 + α 12 e 2 0 e 2
is an idempotent matrix. Thus, (1) represents the idempotent matrices of T 2 ( S ) .
Note that when α 12 = e 1 β 12 e 2 , we obtain the idempotent matrix e 1 e 1 β 12 e 2 0 e 2 , and this matrix is a particular case of (1). Moreover, we have e 1 e 1 α 12 e 2 0 e 2 e 1 e 1 β 12 e 2 0 e 2 = e 1 e 1 α 12 e 2 0 e 2 + e 1 e 1 β 12 e 2 0 e 2 ; thus, idempotent matrices of this form commute.
Example 2. 
Let X = e 1 x 12 x 13 0 e 2 x 23 0 0 e 3 , where e i , x i j S , i , j = 1 , 2 , 3 , i < j , and e i 2 = e i , be an idempotent matrix. As in the previous example, we have x 12 = e 1 x 12 + e 1 x 12 e 2 + x 12 e 2 , x 23 = e 2 x 23 + e 2 x 23 e 3 + x 23 e 3 , and x 13 = e 1 x 13 + e 1 x 13 e 3 + x 13 e 3 + x 12 x 23 .
For arbitrary α 12 , α 13 , α 23 S , we denote δ i j = e i α i j + e i α i j e j + α i j e j (this concept should not be confused with the Kroneker symbol). Thus, x 12 = δ 12 , x 23 = δ 23 , and x 13 = δ 13 + δ 12 δ 23 . Conversely, for arbitrary α 12 , α 13 , α 23 S , we consider X = e 1 δ 12 δ 13 + δ 12 δ 23 0 e 2 δ 23 0 0 e 3 , where δ i j = e i α i j + e i α i j e j + α i j e j . We obtain that e 1 δ 12 + δ 12 e 2 = δ 12 and e 2 δ 23 + δ 23 e 3 = δ 23 . Since e i δ i j + δ i j = δ i j and δ i j e j + δ i j = δ i j , it follows that e 1 δ 12 δ 23 + δ 12 δ 23 = δ 12 δ 23 and δ 12 δ 23 e 3 + δ 12 δ 23 = δ 12 δ 23 . Then, e 1 ( δ 13 + δ 12 δ 23 ) + δ 12 δ 23 + ( δ 13 + δ 12 δ 23 ) e 3 = δ 13 + δ 12 δ 23 and X is an idempotent matrix. Hence,
E ( e 1 , e 2 , e 3 ) = e 1 δ 12 δ 13 + δ 12 δ 23 0 e 2 δ 23 0 0 e 3
is the general form of the idempotent matrix of T 3 ( S ) .
The next result is similar to Theorem 3.1 of S. Wright (cf. [12]) but different as we work in an additively idempotent matrix semiring.
Theorem 1. 
An n × n upper triangular matrix, X = ( x i j ) , over the additively idempotent semiring S is idempotent if and only if x i i = e i , where e i 2 = e i for i = 1 , , n , and x i j = δ i j + k = i + 1 j 1 x i k x k j , where δ i j = e i α i j + e i α i j e j + α i j e j , α i j S for i , j = 1 , , n and i + 1 < j . If j = i + 1 , then x i i + 1 = δ i i + 1 .
Proof. 
Let X = ( x i j ) be an idempotent matrix. Then, x i i = e i are idempotents for i = 1 , , n , and for i + 1 < j , it follows that x i j = k = i j x i k x k j = e i x i j + x i j e j + k = i + 1 j 1 x i k x k j . Since e i x i j + x i j = x i j and x i j e j + x i j = x i j , we have e i x i j e j + x i j e j = x i j e j and e i x i j e j + e i x i j = e i x i j . Therefore, e i x i j + x i j e j = δ i j . If j = i + 1 , we have x i i + 1 = e i x i i + 1 + x i i + 1 e i + 1 = δ i i + 1 .
Conversely, for the matrix X = ( x i j ) , we assume that x i i = e i , i = 1 , , n are idempotents, x i i + 1 = δ i i + 1 and x i j = δ i j + k = i + 1 j 1 x i k x k j , for i + 1 < j . Our induction hypothesis is the following.
Suppose that for a fixed j n , the matrices with the main diagonal x i i , , x k k , where i is an arbitrary positive integer and i < k < j , are idempotent.
Now, X is an idempotent matrix if and only if for the arbitrary element x i j , where i + 1 < j , we prove that x i j = e i x i j + x i j e j + k = i + 1 j 1 x i k x k j . From the assumption of x i j , it follows that the right side of the last equality is
e i δ i j + k = i + 1 j 1 x i k x k j + k = i + 1 j 1 x i k x k j + δ i j + k = i + 1 j 1 x i k x k j e j =
= e i δ i j + δ i j e j + k = i + 1 j 1 e i x i k x k j + x i k x k j e j + k = i + 1 j 1 x i k x k j .
From this inductive conjecture, we have e i x i k + x i k = x i k and x k j e j + x k j = x k j for k, i < k < j . Then, e i x i k x k j + x i k x k j = x i k x k j and x i k x k j e j + x i k x k j = x i k x k j . Hence,
k = i + 1 j 1 e i x i k x k j + x i k x k j e j + k = i + 1 j 1 x i k x k j = k = i + 1 j 1 x i k x k j .
Since e i δ i j + δ i j e j = δ i j = e i x i j + x i j e j , it follows that X is an idempotent matrix. □
For matrices over a field, the root of the matrix X is the matrix Y, such that Y m = X for some positive integer, m > 1 (see F. R. Gantmacher [20], Ch. 8). In 1979, S. K. Jain et al. (see [21]) studied the nonnegative m th roots of a nonnegative 0-symmetric idempotent matrix. Now, let Y be a matrix over an additively idempotent semiring and Y = 1 1 0 0 1 1 0 0 1 . Since Y 2 = X = 1 1 1 0 1 1 0 0 1 , it follows that Y is a square root of X. It is easy to check that X is an idempotent matrix. Thus, the following question is reasonable:
Can we find a square root of an arbitrary 3 × 3 idempotent triangular matrix?
In the following, we will answer a more general question in the semiring of upper triangular matrices over an additively idempotent semiring, S.
Let us consider the matrix Δ = ( δ i j ) , i , j = 1 , , n , i j , where δ i i = e i , e i 2 = e i , δ i j = e i α i j + e i α i j e j + α i j e j , and α i j are arbitrary elements of S for i , j = 1 , , n and i < j . From Theorem 1, it follows that if X is an arbitrary idempotent triangular matrix, then X + Δ = X . This implies that X + Δ X = X and X + X Δ = X and then from ( X + Δ ) 2 = X we have X + Δ 2 = X . In the same way, it follows that X + Δ m = X , where m is a positive integer. Now, we will prove that Δ n 1 = Δ n .
Theorem 2. 
Let S be an additively idempotent semiring, Δ = ( δ i j ) T n ( S ) , i , j = 1 , , n , i j , where δ i i = e i , e i 2 = e i and δ i j = e i α i j + e i α i j e j + α i j e j , α i j S for i , j = 1 , , n and i < j . Then, Δ n 1 = Δ n and Δ n 1 is an idempotent matrix.
Proof. 
We obtain that Δ 2 = ( δ i j ( 2 ) ) , where δ i i ( 2 ) = e i , δ i i + 1 ( 2 ) = δ i i + 1 and for j i + 2 , δ i j ( 2 ) = δ i j + k = i + 1 j 1 δ i k δ k j . Note that from the last equality, it follows that on the second super-diagonal all entries are δ i i + 2 + δ i i + 1 δ i + 1 i + 2 and on the third super-diagonal all entries are δ i i + 3 + δ i i + 1 δ i + 1 i + 3 + δ i i + 2 δ i + 2 i + 3 . The proof is by induction. Let us assume that for an integer, m, where m 2 , we have Δ m = ( δ i j ( m ) ) , where δ i i ( m ) = e i , δ i i + 1 ( m ) = δ i i + 1 , δ i i + 2 ( m ) = δ i i + 2 + δ i i + 1 δ i + 1 i + 2 , and for j i + m
δ i j ( m ) = δ i j + k = i + 1 j 1 δ i k δ k j + + k 1 , , k m 1 = i + 1 k 1 < < k m 1 j 1 δ i k 1 δ k m 1 j .
In order to find Δ m + 1 , we obtain that
δ i i ( m + 1 ) = e i δ i i ( m ) = e i 2 = e i , δ i i + 1 ( m + 1 ) = e i δ i i + 1 ( m ) + δ i i + 1 e i + 1 = δ i i + 1 , δ i i + 2 ( m + 1 ) = e i δ i i + 2 ( m ) + δ i i + 1 δ i + 1 i + 2 ( m ) + δ i i + 2 e i + 2 = = e i δ i i + 2 + e i δ i i + 1 δ i + 1 i + 2 + δ i i + 1 δ i + 1 i + 2 + δ i i + 2 e i + 2 = δ i i + 2 + δ i i + 1 δ i + 1 i + 2 ,
For j i + m + 1 , it follows that
δ i j ( m + 1 ) = e i δ i j ( m ) + δ i i + 1 δ i + 1 j ( m ) + δ i i + 2 δ i + 2 j ( m ) + + δ i j 2 δ j 2 j ( m ) + δ i j 1 δ j 1 j ( m ) + δ i j e j =
= e i δ i j + e i k = i + 1 j 1 δ i k δ k j + + k 1 , , k m 1 = i + 1 k 1 < < k m 1 j 1 δ i k 1 δ k m 1 j +
+ δ i i + 1 δ i + 1 j + k = i + 2 j 1 δ i + 1 k δ k j + + k 1 , , k m 1 = i + 2 k 1 < < k m 1 j 1 δ i + 1 k 1 δ k m 1 j +
+ δ i i + 2 δ i + 2 j + k = i + 3 j 1 δ i + 2 k δ k j + + k 1 , , k m 1 = i + 3 k 1 < < k m 1 j 1 δ i + 2 k 1 δ k m 1 j +
+ + δ i j 2 δ j 2 j + δ i j 2 δ j 2 j 1 δ j 1 j + δ i j 1 δ j 1 j + δ i j e j =
= δ i j + k = i + 1 j 1 δ i k δ k j + + k 1 , , k m = i + 1 k 1 < < k m j 1 δ i k 1 δ k m j .
Therefore,
Δ n 1 = e 1 δ 12 δ 13 + δ 12 δ 23 δ 1 n + k = 2 n 1 δ 1 k δ k n + + δ 12 δ 23 δ n 1 n 0 e 2 δ 23 δ 2 n + k = 3 n 1 δ 2 k δ k n + + δ 23 δ n 1 n 0 0 e 3 δ 3 n + k = 4 n 1 δ 3 k δ k n + + δ 34 δ n 1 n 0 0 0 e n .
Now, it is easy to check that Δ n = Δ n 1 . As a consequence, it follows that Δ n 1 = Δ n + 1 = = ( Δ n 1 ) 2 . □
The next result describes all idempotent triangular matrices over an additively idempotent semiring.
Theorem 3. 
An n × n upper triangular matrix, X = ( x i j ) , over the additively idempotent semiring S is idempotent if and only if x i i = e i , where e i 2 = e i for i = 1 , , n , x i i + 1 = δ i i + 1 for i = 1 , , n 1 , and
x i j = δ i j + k = i + 1 j 1 δ i k δ k j + k , k 1 = i + 1 k < k 1 j 1 δ i k δ k k 1 δ k 1 j + + δ i i + 1 δ j 1 j ,
where δ i j = e i α i j + e i α i j e j + α i j e j , α i j S for i , j = 1 , , n and i + 1 < j .
Proof. 
From Theorem 1, we know that the matrix X = ( x i j ) is idempotent if and only if x i i = e i , where e i 2 = e i for i = 1 , , n , x i i + 1 = δ i i + 1 and x i j = δ i j + k = i + 1 j 1 x i k x k j for i + 1 < j . Successively applying this equality, we obtain x i j =
δ i j + k = i + 1 j 1 δ i k + k 2 = i + 1 k 1 x i k 2 x k 2 k δ k j + k 1 = k + 1 j 1 x k k 1 x k 1 j = δ i j + k = i + 1 j 1 δ i k δ k j +
+ k = i + 1 j 1 δ i k k 1 = k + 1 j 1 δ k k 1 + k 3 = k 1 + 1 k 1 1 x k k 3 x k 3 k 1 δ k 1 j + k 4 = k 1 + 1 j 1 x k 1 k 4 x k 4 j +
+ k = i + 1 j 1 k 2 = i + 1 k 1 δ i k 2 + k 5 = i + 1 k 2 1 x i k 5 x k 5 k 2 δ k 2 k + k 6 = k 2 + 1 k 1 x k 2 k 6 x k 6 k δ k j =
= δ i j + k = i + 1 j 1 δ i k δ k j + k , k 1 = i + 1 k < k 1 j 1 δ i k δ k k 1 δ k 1 j + σ .
Some summands are reproduced; for example, k 2 = i + 1 k 1 δ i k 2 δ k 2 k δ k j is a part of
k , k 1 = i + 1 k < k 1 j 1 δ i k δ k k 1 δ k 1 j . For the sum
σ = k = i + 1 j 1 δ i k k 1 = k + 1 j 1 δ k k 1 k 4 = k 1 + 1 j 1 x k 1 k 4 x k 4 j + k 3 = k + 1 k 1 1 x k k 3 x k 3 k 1 δ k 1 j +
+ k 2 = i + 1 k 1 δ i k 2 k 6 = k 2 + 1 k 1 x k 2 k 6 x k 6 k + k 5 = i + 1 k 2 1 x i k 5 x k 5 k 2 δ k 2 k δ k j ,
we have the following:
σ contains k , k 1 = i + 1 k < k 1 j 1 δ i k δ k k 1 δ k 1 j and is part of this sum;
σ contains all products δ i m 1 δ m s j where m 1 < < m s and consequently the product δ i i + 1 δ j 1 j .
Hence, the result follows. □
Remark 1. 
We denote the equality from Theorem 3 briefly by
x i j = δ i j + i j *
and use it in Section 4.
Immediately from Theorems 2 and 3, we have the following.
Corollary 1. 
Each n × n upper triangular idempotent matrix E ( e 1 , , e n ) over the additively idempotent semiring S has the form
e 1 δ 12 δ 13 + δ 12 δ 23 δ 1 n + k = 2 n 1 δ 1 k δ k n + + δ 12 δ 23 δ n 1 n 0 e 2 δ 23 δ 2 n + k = 3 n 1 δ 2 k δ k n + + δ 23 δ n 1 n 0 0 e 3 δ 3 n + k = 4 n 1 δ 3 k δ k n + + δ 34 δ n 1 n 0 0 0 e n ,
where δ i j = e i α i j + e i α i j e j + α i j e j , α i j S for i , j = 1 , , n and i < j .
Each idempotent matrix, E ( e 1 , , e n ) , has roots, which are the matrices Δ m , where m = 1 , , n 2 .
As a consequence of the theorems above, we can show a result similar to the main theorem of X. Hou (cf. [11]).
Corollary 2. 
Let Δ = ( a i j ) T n ( S ) be a matrix with the following properties:
(i) All diagonal entries of Δ are ones or zeroes;
(ii) If a i i = a j j = 0 , then a i j = 0 , where i , j = 1 , , n and i < j .
Then, all idempotent triangular matrices over S with only zeroes and ones on the main diagonal are the matrices E = ( x i j ) such that x i i = a i i , i = 1 , , n , and
x i j = a i j + k = i + 1 j 1 a i k a k j + k , k 1 = i + 1 k < k 1 j 1 a i k a k k 1 a k 1 j + + a i i + 1 a j 1 j , 1 i < j n .
Proof. 
If in the proof of Theorem 2 at least one of the idempotents e i and e j are equal to 1, it follows that δ i j = a i j . When e i = e j = 0 , we have δ i j = 0 . Therefore, the matrix Δ is the same matrix Δ in the proof of Theorem 2 under the given conditions. This result follows from Theorem 3. □
Since the entries of the idempotent matrix in (3) have rather complex structures, we obtain idempotent matrices with the parameters α i j of a special form. Such a matrix is e 1 e 1 α 12 e 2 0 e 2 , considered in Example 1. To develop this idea to its conclusion, we construct the matrix Γ = ( γ i j ) , where γ i i = e i , e i 2 = e i for i = 1 , , n and γ i j = e i α i j e j , α i j S for 1 < i < j n . Matrices of the form Γ which are idempotents are called special idempotents. It is not difficult to verify that for n = 3 , the matrix Γ = e 1 e 1 α 12 e 2 e 1 α 13 e 3 0 e 2 e 2 α 23 e 3 0 0 e 3 is not an idempotent, but the matrix Γ 2 = e 1 e 1 α 12 e 2 e 1 α 13 e 3 + e 1 α 12 e 2 α 23 e 3 0 e 2 e 2 α 23 e 3 0 0 e 3 is an idempotent. Moreover, Γ 2 = e 1 e 1 β 12 e 2 e 1 β 13 e 3 0 e 2 e 2 β 23 e 3 0 0 e 3 , where β 12 = α 12 , β 13 = α 13 + α 12 e 2 α 23 and β 23 = α 23 . Thus, for n = 3 , the matrix Γ 2 is a special idempotent matrix.
Theorem 4. 
Let Γ = ( γ i j ) T n ( S ) , where γ i i = e i , e i 2 = e i , for i = 1 , , n and γ i j = e i α i j e j , α i j S for 1 < i < j n . Then, Γ n 1 is a special idempotent matrix.
Proof. 
Since e i γ i j = γ i j and γ i j e j = γ i j , it follows that the proof of the statement that Γ n 1 is an idempotent matrix is the same as the proof of Theorem 2. Following the proof of this theorem, we obtain that Γ n 1 = ( γ ( n 1 ) ) , where
γ i j ( n 1 ) = γ i j + k = i + 1 j 1 γ i k γ k j + k , k 1 = i + 1 k < k 1 j 1 γ i k γ k k 1 γ k 1 j + + γ i i + 1 γ j 1 j =
= e i α i j + k = i + 1 j 1 α i k e k α k j + k , k 1 = i + 1 k < k 1 j 1 α i k e k α k k 1 e k 1 α k 1 j +
k , k 1 = i + 1 k < k 1 j 1 + + α i i + 1 e i + 1 α i + 1 i + 2 α j 2 j 1 e j 1 α j 1 j e j
and this completes the proof. □
The set of special idempotent matrices is denoted by SP ( S ) . This notation is used in Section 4.

3. Definitions and Results of Idempotents of Additively Idempotent Semiring

Let S be an additively idempotent semiring. Following G. F. Birkenmeier et al. (see [22]), we give the following definition: An idempotent, S ( r e s p . , r S ) , is called left (resp., right) semicentral if x = x (resp., r x r = r x ) for an arbitrary x S .
From this definition, we easily have the following.
Proposition 1. 
The set of left (resp., right) semicentral idempotents of the semiring S is a multiplicative semigroup with an identity.
The multiplicative semigroup of the left (resp., right) semicentral idempotents of the semiring S is denoted by ( L ( S ) , . ) (resp., ( R ( S ) , . ) ).
For 1 , 2 L ( S ) , we consider the Jordan product 1 2 = 1 2 + 2 1 . Similarly, for r 1 , r 2 R ( S ) , we define r 1 r 2 = r 1 r 2 + r 2 r 1 . It is straightforward to prove the following.
Proposition 2. 
The semigroup L ( S ) (resp., R ( S ) ) is closed under the Jordan product.
Let LR ( S ) be the semigroup generated by L ( S ) R ( S ) . For the products and Jordan products of elements of LR ( S ) , we easily have the following.
Proposition 3. 
Let L ( S ) and r R ( S ) . Then, we have the following:
(i) r is an idempotent, but it is neither a left nor a right semicentral idempotent; also, r x r = r x r for all x R and then ( r ) 2 = r .
(ii) ( r ) 2 = r .
(iii) r r = r = r .
(iv) r = r r = r r = ( r ) = ( r ) = r ( r ) = r .
In order to keep this exposition self-contained, we present some definitions very similar to those in [14]. Let 1 , 2 L ( S ) . We define
2 1 if and only if 2 x 1 = x 1 for all x S .
Then, it follows that 1 0 for L ( S ) . Since 2 x 1 = 2 1 x 1 , it follows that, if 2 1 = 1 , then 2 1 . On the other hand, if 2 1 , then 2 1 = 1 . Hence,
2 1 2 1 = 1 .
Let 0 , 1 , 2 L ( S ) and 2 1 . From (4), we have 2 0 1 0 = 2 1 0 = 1 0 . Thus, 2 1 2 0 1 0 . Similarly, for r 1 , r 2 R ( S ) , we define
r 2 r 1 if and only if r 1 x r 2 = r 1 x for all x S .
It immediately follows that 1 r 0 for r R ( S ) . Since r 1 x r 2 = r 1 x r 1 r 2 , it follows that r 1 r 2 = r 1 , which implies that r 2 r 1 . Conversely, if r 2 r 1 , we obtain r 1 r 2 = r 1 . Consequently,
r 2 r 1 r 1 r 2 = r 1 .
Let r 0 , r 1 , r 2 L ( S ) and r 2 r 1 . From (5), it follows that r 0 r 1 r 0 r 2 = r 0 r 1 r 2 = r 0 r 1 , which implies r 2 r 1 r 0 r 2 r 0 r 1 .
We define an equivalence relation on L ( R ) as follows. From the definition, we have the following:
(i) 1 1 for an arbitrary 1 L ( R ) ;
(ii) 2 1 and 3 2 implies that 3 1 .
Then, we state that 1 l e f t 2 if and only if 1 2 and 2 1 . Thus, l e f t is an equivalence relation on L ( R ) .
The definition of an equivalence relation on R ( R ) is similar. We have the following:
(i) r 1 r 1 for an arbitrary r 1 R ( R ) .
(ii) r 2 r 1 and r 3 r 2 implies that r 3 r 1 .
If we define r 1 r i g h t r 2 if and only if r 1 r 2 and r 2 r 1 , it follows that r i g h t is an equivalence relation on R ( R ) .
Let e S be an idempotent. Since the additively idempotent semiring S is partially ordered ( a + b = a a b ), we can consider two cases:
Case 1. Let e 1 . Then, e is called left (resp., right) if e x x e (resp., x e e x ) for an arbitrary x S (see D. Vladeva [23]). If e is a left idempotent, it follows that e x e x e . But, from e 1 , we have e x e x e . Thus, e x e = x e , i.e., e is a left semicentral idempotent. Similarly, if e is a right idempotent, we obtain that it is a right semicentral idempotent.
Note that if e is a left or a right semicentral idempotent, then e x + x e e x e .
Case 2. Let e 1 . If e is a left (resp., right) idempotent, it follows that e x e e x x e (resp., e x e x e e x ). Therefore, e x e e x + x e .
The underlying idea of the last inequality is to construct a new specific class of idempotents. An idempotent, 𝚥 S , is called Jordan semicentral if we have the following:
(a) 𝚥 1 ;
(b) 𝚥 x 𝚥 = 𝚥 x = 𝚥 x + x 𝚥 for an arbitrary x S .
In order to find examples of such idempotents, we consider 1 + e , where e is an idempotent of S. Since 1 + e is an idempotent, it follows that 1 + and 1 + r , where L ( S ) and r R ( S ) are idempotents.
We obtain ( 1 + ) x ( 1 + ) = x + x + x + x = x + x + x = ( 1 + ) x + x ( 1 + ) for any x S and L ( S ) . Similarly, ( 1 + r ) x ( 1 + r ) = ( 1 + r ) x + x ( 1 + r ) for any x S and r R ( S ) . Moreover, if e is an arbitrary idempotent of S, then 1 + e is a Jordan semicentral idempotent. Thus, we have enough examples for Jordan semicentral idempotents.
As in ring theory, the idempotent c from the centre of the semiring S is called a central idempotent. If we denote by ( C ( S ) , . ) the semigroup of central idempotents, then C ( S ) = L ( S ) R ( S ) . On the other hand, if we denote by J ( S ) the set of Jordan semicentral idempotents, it follows that if c C ( S ) and c 1 , then c J ( S ) .
Proposition 4. 
Let 𝚥 J ( S ) . If c C ( S ) , then 𝚥 c J ( S ) .
Proof. 
From 𝚥 x 𝚥 = 𝚥 x + x 𝚥 for all x S , it follows that 𝚥 c x 𝚥 c = ( 𝚥 c x 𝚥 ) c = ( 𝚥 c x + c x 𝚥 ) c = 𝚥 c x + x 𝚥 c . □
Proposition 5. 
Let L ( S ) , r R ( S ) and 𝚥 , 𝚥 1 J ( S ) . Then, we have the following:
(1) ( 𝚥 ) 2 = 𝚥 ; (2) ( 𝚥 ) 2 = 𝚥 ; (3) ( r 𝚥 ) 2 = r 𝚥 ; (4) ( 𝚥 r ) 2 = r 𝚥 ;
(5) ( 𝚥 ) 2 = 𝚥 ; (6) ( 𝚥 r ) 2 = 𝚥 r ; (7) ( r 𝚥 ) 2 = r 𝚥 ;
(8) ( 𝚥 r ) 2 = ( 𝚥 r ) 2 = ( 𝚥 r ) ( 𝚥 ) ;
(9) ( ( 𝚥 ) r ) ( ( 𝚥 r ) ) = ( 𝚥 r ) ( 𝚥 ) ;
(10) ( 𝚥 𝚥 1 ) 2 = 𝚥 𝚥 1 .
Proof. 
The proof is routine from these definitions. □
Proposition 6. 
Let e 1 and e 2 be idempotents of S. Then, e 1 + e 2 + e 1 e 2 is an idempotent in the following cases:
(a) e 1 e 2 = 0 ; (b) e 1 , e 2 L ( S ) ; (c) e 1 , e 2 R ( S ) ; (d) e 1 , e 2 J ( S ) ;
(e) e 1 L ( S ) , e 2 R ( S ) ; (f) e 1 L ( S ) , e 2 J ( S ) ; (g) e 1 R ( S ) , e 2 J ( S ) .
Proof. 
The proof is routine from these definitions. □
Proposition 7. 
If 𝚥 , 𝚥 1 J ( S ) , then ( 𝚥 𝚥 1 ) 2 = ( 𝚥 1 𝚥 ) 2 .
Proof. 
We obtain ( 𝚥 𝚥 1 ) 2 = 𝚥 𝚥 1 𝚥 𝚥 1 = 𝚥 ( 𝚥 1 𝚥 + 𝚥 𝚥 1 ) = 𝚥 𝚥 1 𝚥 + 𝚥 𝚥 1 = 𝚥 𝚥 1 + 𝚥 1 𝚥 = 𝚥 𝚥 1 . Since ( 𝚥 1 𝚥 ) 2 = 𝚥 1 𝚥 , the result follows. □
Let 𝚥 , 𝚥 1 J ( S ) . We write 𝚥 𝚥 1 if 𝚥 x 𝚥 1 = 𝚥 x + x 𝚥 1 for an arbitrary x S . Thus, when 𝚥 𝚥 1 , we have 𝚥 𝚥 1 = 𝚥 + 𝚥 1 and then j and 𝚥 1 commute.
We now define 𝚥 𝚥 1 if 𝚥 𝚥 1 and 𝚥 1 𝚥 . Note that for Jordan semicentral idempotents, the relation “⪰" is not transitive and the relation “∼” is not an equivalence relation.
From 𝚥 1 , it follows that 𝚥 1 and 1 𝚥 ; thus, 𝚥 1 for any 𝚥 J ( S ) .
It is easy to see that if 𝚥 1 = 1 + 1 , 𝚥 2 = 1 + 2 , and 1 2 , then 𝚥 1 𝚥 2 , where 1 , 2 L ( S ) . Similarly, if 𝚥 1 = 1 + r 1 , 𝚥 2 = 1 + r 2 and r 2 r 1 , then 𝚥 1 𝚥 2 , where r 1 , r 2 R ( S ) .
Therefore, if 1 l e f t 2 for 𝚥 1 = 1 + 1 and 𝚥 2 = 1 + 2 , it follows that 𝚥 1 𝚥 2 and, similarly, if r 1 r i g h t r 2 , then 𝚥 1 = 1 + r 1 and 𝚥 2 = 1 + r 2 implies 𝚥 1 𝚥 2 .
For a fixed 𝚥 J ( S ) , we consider the set J 𝚥 = { 𝚥 1 | 𝚥 1 𝚥 } .
Proposition 8. 
For any 𝚥 J ( S ) , the set J 𝚥 is a commutative semigroup.
Proof. 
Let 𝚥 , 𝚥 1 J ( S ) and 𝚥 𝚥 1 . Then, for an arbitrary x S
( 𝚥 + 𝚥 1 ) x ( 𝚥 + 𝚥 1 ) = 𝚥 x 𝚥 + 𝚥 x 𝚥 1 + 𝚥 1 x 𝚥 + 𝚥 1 x 𝚥 1 =
= 𝚥 x 𝚥 + 𝚥 x + x 𝚥 1 + 𝚥 1 x + x 𝚥 + 𝚥 1 x 𝚥 1 = 𝚥 x 𝚥 + 𝚥 1 x 𝚥 1 = ( 𝚥 + 𝚥 1 ) x + x ( 𝚥 + 𝚥 1 ) .
Hence, 𝚥 𝚥 1 x 𝚥 𝚥 1 = 𝚥 𝚥 1 x + x 𝚥 𝚥 1 . □
Remark 2. 
In the next section, we give examples of left semicentral idempotent triangular matrices, 1 and 2 , such that 1 l e f t 2 and there is similar for right and Jordan semicentral idempotent triangular matrices.
Now, let e 1 and e 2 be arbitrary idempotents of S. It is straightforward to prove the following.
Proposition 9. 
If e 1 1 , then e 1 + e 2 is an idempotent.
Similarly, it follows that i = 1 n e i is an idempotent if e 1 , , e n are idempotents such that e i 1 for i = 1 , , n 1 .
Proposition 10. 
Let e be an idempotent of the semiring S, with L ( S ) , r R ( S ) , and 𝚥 J ( S ) . Then, e e L ( e S e ) , e r e R ( e S e ) , and e 𝚥 e J ( e S e ) .
Proof. 
The proof is routine from these definitions. □
Let e be a fixed idempotent of the semiring S. We include some basic results related to idempotents of the semiring e S .
(i) e is a left semicentral idempotent of e S for any L ( S ) .
(ii) Since ( e r ) 2 = e r e for any r R ( S ) , from Proposition 10, it follows that e r is a square root of an idempotent.
(iii) ( e r ) ( e ) is an idempotent where L ( S ) and r R ( S ) . Moreover, e r and e r are square roots of ( e r ) ( e ) . Similarly, ( e r ) ( e e ) is an idempotent.
(iv) Since ( ( e ) ( e r e ) ) 2 = ( e r ) ( e e ) , we have that ( e ) ( e r e ) is a root of an idempotent.
(v) ( e 𝚥 ) ( e ) is an idempotent where L ( S ) and 𝚥 J ( S ) . Similarly, ( e 𝚥 ) ( e e ) is an idempotent.
(vi) ( e r ) ( e 𝚥 e ) is an idempotent where r R ( S ) and 𝚥 J ( S ) .
(vii) ( e r ) ( e 𝚥 ) ( e ) is an idempotent where L ( S ) , r R ( S ) , and 𝚥 J ( S ) .
(viii) ( e 𝚥 ) 2 = e 𝚥 e + e 𝚥 and e 𝚥 e + e 𝚥 are idempotents where 𝚥 J ( S ) . Consequently, ( e 𝚥 ) 4 = ( e 𝚥 ) 2 .
Now, we describe the dual results related to idempotents of the semiring S e :
(i) r e is a right semicentral idempotent of S e for any r R ( S ) .
(ii) Since ( e ) 2 = e e for any L ( S ) , from Proposition 10, it follows that e is a root of an idempotent.
(iii) ( r e ) ( e ) is an idempotent where L ( S ) and r R ( S ) . Moreover, r e and r e are square roots of ( r e ) ( e ) . Similarly, ( e r e ) ( e ) is an idempotent.
(iv) Since ( ( e ) ( e r e ) ) 2 = ( e r e ) ( e ) , we have that ( e ) ( e r e ) is a root of an idempotent.
(v) ( r e ) ( 𝚥 e ) is an idempotent where r R ( S ) and 𝚥 J ( S ) . Similarly, ( e r e ) ( 𝚥 e ) is an idempotent.
(vi) ( e 𝚥 e ) ( e ) is an idempotent where L ( S ) and 𝚥 J ( S ) .
(vii) ( r e ) ( 𝚥 e ) ( e ) is an idempotent where L ( S ) , r R ( S ) , and 𝚥 J ( S ) .
(viii) ( 𝚥 e ) 2 = 𝚥 e + e 𝚥 e and 𝚥 e + e 𝚥 e are idempotents where 𝚥 J ( S ) . Consequently, ( 𝚥 e ) 4 = ( 𝚥 e ) 2 .
Let e 1 and e 2 be idempotents of S and e 2 e 1 = 0 . Note that, by Proposition 6a, it follows that e 1 + e 2 + e 1 e 2 is an idempotent.
We denote e 1 e 2 = e 1 + e 2 + e 1 e 2 . (The reader can obtain the same construction in ring theory, related to non-unital rings, in [24].)
The next proposition motivates the results in APPLICATION A.
Proposition 11. 
Let e be an idempotent of the semiring S, with L ( S ) and r R ( S ) . If r = 0 , then (a) r and (b) e r e is an idempotent of S.
Proof. 
Part (a) follows immediately from Proposition 6 (a). Since ( r e ) ( e l ) = r e = r e = 0 , (b) holds. □
Remark 3. 
In the next section, we will show natural examples of a left semicentral idempotent, ℓ, and a right semicentral idempotent, r, such that r = 0 . So, it will be interesting to describe the semiring closure (the minimal subsemiring of S) generated by the fixed ℓ and r. The semiring closure consists of the nilpotent r , since ( r ) 2 = r = 0 , the square root + r , since ( + r ) 2 = + r + r , and five idempotents: ℓ, r, + r , r + r , and + r + r .
Using a left semicentral idempotent, , and a right semicentral idempotent, r, such that r = 0 , we can construct a new Jordan semicentral idempotent.
Proposition 12. 
If L ( S ) , r R ( S ) , and r l = 0 , then it follows that 𝚥 = 1 + r is a Jordan semicentral idempotent.
Proof. 
We obtain ( 1 + r ) x ( 1 + r ) = x + r x + x r + r x r = ( 1 + r ) x + x ( 1 + r ) + r x , where x S . Since r x = r x r = 0 , we have that 𝚥 x 𝚥 = 𝚥 x + x 𝚥 . □
Proposition 13. 
If L ( S ) and r R ( S ) , then for the Jordan semicentral idempotents 𝚥 = 1 + and 𝚥 r = 1 + r , it follows that 𝚥 𝚥 r = 1 + r .
Proof. 
It is easy to check that 1 + e is an idempotent for any idempotent e of S. We know that 𝚥 = 1 + and 𝚥 r = 1 + r are Jordan semicentral idempotents.
Consequently, 𝚥 𝚥 r = ( 1 + ) ( 1 + r ) = 1 + + r + r = 1 + r . □
We can extend the last result as follows.
Proposition 14. 
Let e 1 be an idempotent of S, with L ( S ) and r R ( S ) . Then, it follows that 𝚥 1 = 1 + e and 𝚥 2 = 1 + r e are Jordan semicentral idempotents and 𝚥 1 𝚥 2 = 1 + e r e .
Proof. 
As in the proof of Proposition 13, we obtain that ( 1 + e ) ( 1 + r e ) = 1 + e r e . When e 1 for an arbitrary x S , it follows that 𝚥 1 x 𝚥 1 = ( 1 + e ) x ( 1 + e ) = x + e x + x e + e x e = ( 1 + e ) x + x ( 1 + e ) = 𝚥 1 x + x 𝚥 1 . Similarly, we observe that 𝚥 2 = 1 + r e is a Jordan semicentral idempotent. □

4. Results on Semicentral Idempotents of Triangular Matrix Semiring

For the proofs of the following two important theorems, we need another lemma (similar to Proposition 3.1 of [14] for trangular matrices over a ring).
Lemma 1. 
Let X = ( x i j ) T n ( S ) be an arbitrary matrix. If P = ( π i j ) T n ( S ) is a left (resp., right or Jordan) semicentral idempotent of T n ( S ) , then π i i , i = 1 , , n , are left (resp., right or Jordan) semicentral idempotents of S.
Proof. 
We obtain the diagonal entries of the following matrices:
x i i π i i of the matrix X P ;
π i i x i i of the matrix P X ;
π i i x i i + x i i π i i of the matrix P X + X P ;
π i i x i i π i i of the matrix P X P for i = 1 , , n .
Now, if P is a left semicentral idempotent of T n ( S ) , we have π i i x i i π i i = x i i π i i ; if P is a right semicentral idempotent of T n ( S ) , we obtain π i i x i i π i i = π i i x i i ; and if P is a Jordan semicentral idempotent of T n ( S ) , then π i i x i i π i i = π i i x i i + x i i π i i . Thus, the result follows. □
Theorem 5. 
Each left semicentral idempotent triangular n × n matrix over an additively idempotent semiring, S, without zero divisors is of the form k = Λ k Λ k A 0 0 , where Λ k = diag ( λ 1 , , λ k ) , λ i L ( S ) , for i = 1 , , k , λ i 1 λ i , i = 2 , k , and A = ( α i j ) M k × ( n k ) for k = 1 , , n 1 , or is of the form n = diag ( λ 1 , , λ n ) , where λ i L ( S ) for i = 1 , n and λ i 1 λ i for i = 2 , , n .
Proof. 
From Lemma 1, it follows that diagonal entries of the left semicentral idempotent matrix Λ are left semicentral idempotents of S. Thus, from the notations in (2) and from (3), it follows that
Λ = λ 1 δ 12 δ 1 k + 1 k * δ 1 n + 1 n * 0 λ 2 δ 2 k + 2 k * δ 2 n + 2 n * 0 0 λ k δ k n + k n * 0 0 0 λ n ,
where λ i L ( S ) for i = 1 , n , is a left semicentral idempotent matrix. Note that δ i m + i m * , 1 i k < m n is just the ( i , m ) -entry of the matrix from (3) for e i = λ i . Since Λ X Λ = X Λ for every triangular matrix, X, we can choose X = e k 1 k , where e k 1 k is a matrix unit for 1 < k n .
Then, we obtain X Λ = λ k e k 1 k + δ k k + 1 e k 1 k + 1 + + δ k n + k n * e k 1 n and
Λ X Λ = δ 1 k 1 + 1 k 1 * λ k e 1 k + δ 1 k 1 + 1 k 1 * δ k k + 1 e 1 k + 1 +
+ + δ 1 k 1 + 1 k 1 * δ k n + k n * e 1 n + +
+ δ k 2 k 1 λ k e k 2 k + δ k 2 k 1 δ k k + 1 e k 2 k + 1 + + δ k 2 k 1 δ k n + k n * e k 2 n +
+ λ k 1 λ k e k 1 k + λ k 1 δ k k + 1 e k 1 k + 1 + + λ k 1 δ k n + k n * e k 1 n .
Comparing the corresponding elements, we find λ k 1 λ k = λ k which is λ k 1 λ k . Therefore, λ 1 λ 2 λ n .
As a consequence, we have that λ k 1 δ k k + 1 = δ k k + 1 , , λ k 1 δ k n + k n * = δ k n + k n * are identities for every k = 2 , , n 1 . Since λ i λ j for i < j , it follows that δ i j = λ i α i j + λ i α i j λ j + α i j λ j = λ i α i j + α i j λ j . If i < j < k , we have δ i j λ k = ( λ i α i j + α i j λ j ) λ k = α i j λ k . From δ 1 k 1 + 1 k 1 * λ k = 0 , it follows that δ 1 k 1 λ k = 0 (since an additively idempotent semiring a + b = 0 implies that a = 0 ) and then α 1 k 1 λ k = 0 , where k 3 . Similarly, from δ 2 k 1 + 2 k 1 * λ k = 0 , we find α 2 k 1 λ k = 0 where k 4 .
Thus, using λ 1 λ k , we obtain α i j λ k = 0 for 1 i < j < k n .
Now, we choose matrix X = e k k . Then, X Λ = λ k e k k + δ k k + 1 e k k + 1 + + δ k n + k n * e k n . Next, we obtain Λ X Λ = δ 1 k + 1 k * λ k e 1 k + δ 1 k + 1 k * δ k k + 1 e 1 k + 1 +
+ + δ 1 k + 1 k * δ k n + k n * e 1 n + +
+ δ k 1 k λ k e k 1 k + δ k 1 k δ k k + 1 e k 1 k + 1 + + δ k 1 k δ k n + k n * e k 1 n +
+ λ k e k k + λ k δ k k + 1 e k k + 1 + + λ k δ k n + k n * e k n .
We compare the corresponding elements and find that δ 1 k λ k = 0 which implies that α 1 k λ k = 0 . Similarly, we obtain α 2 k λ k = 0 , , α k 1 k λ k = 0 .
Hence, α i j λ k = 0 for 1 i < j k n . As a consequence, if k = n and λ n 0 , since there are no zero divisors in S, it follows that all α i j = 0 where 1 i < j n . Thus, Λ = n = diag ( λ 1 , , λ n ) , where λ 1 λ 2 λ n .
Now, assume that k is the largest number such that λ k 0 . Then, all α i j = 0 where 1 i < j k . Since λ k + 1 = = λ n = 0 , it follows that the nonzero entries of the matrix Λ are λ 1 , , λ k and, generally, the entries of the k × ( n k ) matrix on the right upper corner of Λ . These entries are δ i j + i j * for i = 1 , , k and j = k + 1 , , n . From α i j = 0 , for 1 i < j k , it follows that i j * = 0 . So, the enties of the matrix are δ i j = λ i α i j + α i j λ j = λ i α i j , where i = 1 , , k , j = k + 1 , , n . Hence, Λ = k .
Conversely, it is easily checked that the matrix k is a left semicentral idempotent. Let X M k × k , Y M k × ( n k ) , and Z M ( n k ) × ( n k ) . Then, X Y 0 Z k = X Λ k X Λ k A 0 0 and k X Y 0 Z k = Λ k X Λ k Λ k X Λ k A 0 0 .
Since the matrix Λ k is a left semicentral idempotent of T k ( S ) , it follows that k is a left semicentral idempotent of T n ( S ) , and the result follows. □
The number k, 1 k n , in Theorem 5 is a type of the left semicentral idempotent k . For a fixed k, the set of all left semicentral idempotent matrices of the type k is denoted by L k .
Remark 4. 
Recall that SP ( S ) is the set of special idempotent matrices over the semiring S. From Theorem 5, it is easy to see that for an arbitrary number, k, 1 k n , it follows that SP ( S ) L k = 0 . Therefore, SP ( S ) L ( T n ( S ) ) = 0 .
Proposition 15. 
The set L k is a subsemigroup of L ( T n ( S ) ) with an identity.
Proof. 
Let k with the diagonal entries λ 1 , , λ k L ( S ) and k with the diagonal entries λ 1 , , λ k L ( S ) be left semicentral idempotents of the same type. It is easy to verify that
k k = λ 1 λ 1 0 λ 1 λ 1 α 1 k + 1 λ 1 λ 1 α 1 n 0 λ k λ k λ k λ k α k k + 1 λ k λ k α k n 0 0 0 0 0 0 0 0 .
Thus, for a fixed k, 1 k n , the set L k is a noncommutative semigroup. It is easy to verify that the identity element of L k is the matrix 1 k = I k A 0 0 , where I k = i = 1 k e i i and A M k × ( n k ) ( S ) . □
The matrix 1 k is called a monic left semicentral idempotent of the type k.
In the papers [13,14], the author considered some properties of monic semicentral idempotents.
Note that k = n 1 k , where n = diag ( λ 1 , , λ n ) , for 1 k n 1 .
Remark 5. 
Let k , 1 k n 1 be a fixed number and A , B M k × ( n k ) ( S ) . The matrices A = I k A 0 0 and B = I k B 0 0 are monic left semicentral idempotent matrices. It is easy to see that A l e f t B . Thus, 1 k is an equivalence class under the relation l e f t .
For right semicentral idempotent triangular matrices, we prove a result quite similar to Theorem 5.
Theorem 6. 
Each right semicentral idempotent triangular n × n matrix over an additively idempotent semiring, S, without zero divisors is of the form r k = 0 A R k 0 R k , where R k = diag ( ρ n k + 1 , , ρ n ) , ρ i R ( S ) , for i = n k + 1 , , n , ρ i + 1 ρ i , i = n k + 1 , , n 1 , and A = ( α i j ) M ( n k ) × k for k = 1 , , n 1 , or is of the form r n = diag ( ρ 1 , , ρ n ) , where ρ i R ( S ) for i = 1 , n and ρ i + 1 ρ i for i = 1 , , n 1 .
Proof. 
Again using Lemma 1, we obtain that diagonal entries of the right semicentral idempotent matrix R are right semicentral idempotents of S. From the notations in (2) and from (3), it follows that
R = ρ 1 δ 1 k 1 + 1 k 1 * δ 1 k + 1 k * δ 1 n + 1 n * 0 ρ k 1 δ k 1 k δ k 1 n + k 1 n * 0 0 ρ k δ k n + k n * 0 0 0 ρ n ,
where ρ i R ( S ) , for i = 1 , n , is a right semicentral idempotent matrix and δ i m + i m * , 1 i k < m n , is just the ( i , m ) -entry of the matrix from (3) for e i = ρ i .
Since R X R = R X for every triangular matrix, X, we can choose X = e k 1 k , where e k 1 k is a matrix unit for 1 < k n .
We obtain R X = δ 1 k 1 + 1 k 1 * e 1 k + + ρ k 1 e k 1 k and
R X R = δ 1 k 1 + 1 k 1 * ρ k e 1 k + δ 1 k 1 + 1 k 1 * δ k k + 1 e 1 k + 1 +
+ + δ 1 k 1 + 1 k 1 * δ k n + k n * e 1 n + +
+ ρ k 1 ρ k e k 1 k + ρ k 1 δ k k + 1 e k 1 k + 1 + + ρ k 1 δ k n + k n * e k 1 n .
By comparing the coefficients of e k 1 k , we find ρ k 1 ρ k = ρ k 1 that is ρ k ρ k 1 (see (5)). Therefore, ρ n ρ n 1 ρ 1 .
Also, we have that
δ 1 k 1 + 1 k 1 * δ k k + 1 = 0 , δ 1 k 1 + 1 k 1 * δ k n + k n * = 0 , ,
ρ k 1 δ k k + 1 = 0 , , ρ k 1 δ k n + k n * = 0 .
Since ρ j ρ i for i < j , it follows that δ i j = ρ i α i j + ρ i α i j ρ j + α i j ρ j = ρ i α i j + α i j ρ j .
Then, if p < i < j , we have ρ p δ i j = ρ p α i j .
From ρ k 1 δ k n + k n * = 0 , it follows that ρ k 1 α i j = 0 for 1 k < i < j n .
Now, for X = e k k , we have R X = δ 1 k + 1 k * e 1 k + + δ k 1 k e k 1 k + ρ k e k k and then obtain
R X R = δ 1 k + 1 k * ρ k e 1 k + δ 1 k + 1 k * δ k k + 1 e 1 k + 1 +
+ + δ 1 k + 1 k * δ k n + k n * e 1 n + +
+ δ k 1 k ρ k e k 1 k + δ k 1 k δ k k + 1 e k 1 k + 1 + + δ k 1 k δ k n + k n * e k 1 n +
+ ρ k e k k + ρ k δ k k + 1 e k k + 1 + + ρ k δ k n + k n * e k n .
It is easy to see that δ 1 k + 1 k * ρ k = δ 1 k + 1 k * , , δ k 1 k ρ k = δ k 1 k are identities. It follows that
δ 1 k + 1 k * δ k k + 1 = 0 , , δ 1 k + 1 k * δ k n + k n * = 0 , , δ k 1 k δ k k + 1 = 0 ,
, δ k 1 k δ k n + k n * = 0 , , ρ k δ k k + 1 = 0 , , ρ k δ k n + k n * = 0 .
Now, ρ k δ k k + 1 = 0 implies that ρ k α k k + 1 = 0 for all 1 k n 1 . Thus, if ρ 1 0 , we have α 12 = 0 , and from ρ 1 α i j = 0 , 1 < i < j n 1 , we obtain that ρ 1 α i j = 0 for all i < j . Therefore, R = r n = diag ( ρ 1 , , ρ n ) .
Let ρ 1 = = ρ n k = 0 and ρ n k + 1 0 . As shown above, it follows that α i j = 0 for all n k + 1 i < j n .
Since δ i j = 0 for 1 i < j n k and also for n k + 1 i < j n , it follows that the ( i , j ) -entries, where 1 i n k and n k + 1 j n , of the matrix are equal: δ i j = α i j ρ j . Hence, R = r k .
Conversely, by the same reasoning as in the proof of Theorem 5, we check that r k is a right semicentral idempotent matrix, and the proof is completed. □
The number k, 1 k n , in Theorem 6 is called a type of the right semicentral idempotent r k . For a fixed k, the set of all right semicentral idempotent matrices of the type k is denoted by R k .
As in Remark 3, it follows that SP ( S ) R ( T n ( S ) ) = 0 .
Proposition 16. 
The set R k is a subsemigroup of R ( T n ( S ) ) with an identity.
Proof. 
The proof is similar to that of Proposition 15. □
The identity element of R k is the matrix 1 k r = 0 A 0 I n k + 1 , where I n k + 1 = i = n k + 1 n e i i and A M ( n k ) × k ( S ) . This matrix is called a monic right semicentral idempotent of the type k. In a similar way to in Remark 5, it follows that 1 k r is an equivalence class under the relation r i g h t .
Remark 6. 
In spite of some evident similarities with semicentral idempotent matrices over a ring, there is a significant difference. All non-diagonal left and right semicentral idempotent matrices over an additively idempotent semiring are singular.
Further, we construct the matrix 1 k 𝚥 = I + 1 k = I k A 0 I n k with only ones on the main diagonal and an arbitrary matrix, A M k × ( n k ) , in the right upper corner. Then, it follows that 1 k 𝚥 is a Jordan semicentral idempotent for k = 1 , , n 1 (see Section 3). Similarly, the matrix 1 r m 𝚥 = I + 1 m r = I n m A 0 I m is a Jordan semicentral idempotent for m = 1 , , n 1 . Then, 1 r n k 𝚥 = 1 k 𝚥 . These semicentral idempotents are called monic Jordan semicentral idempotent matrices.
Remark 7. 
(i) Assume that k, where 1 k n 1 is a fixed integer and A , B M k × ( n k ) ( S ) . Now, the matrices 𝚥 A = I k A 0 I n k and 𝚥 B = I k B 0 I n k are monic Jordan semicentral idempotent matrices.
Let X M k × k , Y M k × ( n k ) and Z M ( n k ) × ( n k ) .
We obtain 𝚥 A X Y 0 Z = X Y + A Z 0 Z and X Y 0 Z 𝚥 B = X X B + Y 0 Z and then 𝚥 A X Y 0 Z + X Y 0 Z 𝚥 B = X X B + Y + A Z 0 Z = 𝚥 A X Y 0 Z 𝚥 B . Therefore, 𝚥 A 𝚥 B .
(ii) There are no monic Jordan semicentral idempotent matrices that are special idempotent matrices.
The next result shows that there are other Jordan semicentral idempotents.
Proposition 17. 
If 𝚥 i J ( S ) , i = 1 , , n and 𝚥 i 𝚥 k for i < k , the matrix A = diag ( 𝚥 1 , , 𝚥 n ) is a Jordan semicentral idempotent.
Proof. 
Let X = ( x i k ) T n ( S ) . Then, it follows that A X = ( 𝚥 i x i k ) , X A = ( x i k 𝚥 k ) and A X A = ( 𝚥 i x i k 𝚥 k ) . Since 𝚥 i x i k 𝚥 k = 𝚥 i x i k + x i k 𝚥 k for any i < k , we have A X A = A X + X A . □
Remark 8. 
The monic Jordan semicentral idempotent matrices and diagonal matrices considered in the last proposition are particular cases of the matrices I p 0 B 0 C 0 0 0 I q , where I p = i = 1 p e i i , I q = i = n q + 1 n e i i , B M p × q ( S ) , and C = diag ( 𝚥 p + 1 , , 𝚥 n q ) , where 𝚥 i J ( S ) , i = p + 1 , , n q , and 𝚥 i 𝚥 k for i < k . When p = q = 0 , the matrix is diagonal, and when n = p + q , all the diagonal entries of the matrix are ones. The proof of this fact is routine.
In the next example, we describe idempotents of certain triangular matrix semirings.
Example 3. 
Let B = ( { 0 , 1 } , + , . ) be a Boolean semiring. We present all idempotents as well as left (right and Jordan) semicentral idempotents, roots of idempotent matrices, and nilpotent matrices in the semiring T n ( B ) for n = 2 and n = 3 .
The matrices 1 0 0 0 and 1 1 0 0 are left semicentral idempotents, 0 0 0 1 and 0 1 0 1 are right semicentral idempotent matrices, and 1 1 0 1 is a Jordan semicentral idempotent matrix. The matrix 0 1 0 0 is nilpotent. The identity matrix and the zero matrix can be considered a Jordan semicentral idempotent and nilpotent matrix, respectively.
Let ε i j = 1 or ε i j = 0 for i , j = 1 , , n , with i < j . Then, every matrix of T n ( B ) has the form ( ε i j ) . For n = 3 , it is easy to verify that the matrices 1 = e 11 + ε 12 e 12 + ε 13 e 13 and 2 = 1 + e 22 + ε 23 e 23 are left semicentral idempotents. Therefore, we obtain 12 left semicentral idempotent matrices.
Similarly, the right semicentral idempotents are r 1 = e 33 + ε 23 e 23 + ε 13 e 13 and r 2 = r 1 + e 22 + ε 12 e 12 . The Jordan semicentral idempotents are 𝚥 = I + 2 = I + ε 12 e 12 + ε 13 e 13 + ε 23 e 23 . Thus, we obtain 32 semicentral idempotent matrices.
From Proposition 3, we find that r 2 2 = e 22 + ε 12 e 12 + ε 13 e 13 + ε 23 e 23 are idempotents. Since 1 r 1 r 1 , from Proposition 3 again, we obtain that 1 r 1 = e 11 + ε 12 e 12 + ε 13 e 13 + ε 23 e 23 + e 33 are idempotent matrices. Therefore, we find 16 idempotent matrices that are not semicentral idempotents.
It is easy to see that ε 12 e 12 + ε 13 e 13 + ε 23 e 23 are strictly nilpotent matrices.
All other matrices are square roots of semicentral idempotents. Thus, e 11 + ε 12 e 12 + ε 13 e 13 + e 23 are roots of 1 and e 33 + ε 23 e 23 + ε 13 e 13 + e 12 are roots of r 1 .

5. Application A: Decomposition of Idempotent Triangular Matrices into Semicentral Idempotents

Example 4. 
In Example 1, we obtain that all idempotent 2 × 2 matrices over S are E ( e 1 , e 2 ) = e 1 e 1 α 12 + e 1 α 12 e 2 + α 12 e 2 0 e 2 , where e 1 , e 2 , α 12 S , and e 1 and e 2 are idempotents.
Let us consider the monic left semicentral idempotent 1 1 = 1 α 12 0 0 and the monic right semicentral idempotent 1 1 r = 0 α 12 0 1 .
Then, we construct new idempotents as follows: E 1 = diag ( e 1 , e 2 ) 1 1 = e 1 e 1 α 12 0 0 and E 1 r = 1 1 r diag ( e 1 , e 2 ) = 0 α 12 e 2 0 e 2 . Then, E 1 E 1 r = 0 e 1 α 12 e 2 0 0 . Therefore, E ( e 1 , e 2 ) = E 1 + E 1 r + E 1 E 1 r = E 1 E 1 r .
We can now state another representation. The matrix 1 𝚥 = 1 α 12 0 1 is a monic Jordan semicentral idempotent. We construct the matrices E 1 𝚥 left = diag ( e 1 , e 2 ) 1 𝚥 = e 1 e 1 α 12 0 e 2 and E 1 𝚥 right = 1 𝚥 diag ( e 1 , e 2 ) = e 1 α 12 e 2 0 e 2 . Thus, we have E 1 𝚥 left E 1 𝚥 right = e 1 e 1 α 12 e 2 0 e 2 and then it follows that E ( e 1 , e 2 ) = E 1 𝚥 left + E 1 𝚥 right + E 1 𝚥 left E 1 𝚥 right = E 1 𝚥 left E 1 𝚥 right .
Example 5. 
In Example 2, we find that all idempotent matrices of T 3 ( S ) are matrices of the form E ( e 1 , e 2 , e 3 ) = e 1 δ 12 δ 13 + δ 12 δ 13 0 e 2 δ 23 0 0 e 3 , where δ i j = e i α i j + e i α i j e j + α i j e j , e i , α i j S , i , j = 1 , 2 , 3 , i < j , and e i 2 = e i .
The matrices 1 1 = 1 α 12 α 13 0 0 0 0 0 0 and 1 2 = 1 0 α 13 0 1 α 23 0 0 0 are monic left semicentral idempotents. The matrices 1 1 r = 0 0 α 13 0 0 α 23 0 0 1 and 1 2 r = 0 α 12 α 13 0 1 0 0 0 1 are monic right semicentral idempotents, where α 12 , α 13 , α 23 S .
Now, we can construct E 1 = diag ( e 1 , e 2 , e 3 ) 1 1 = e 1 e 1 α 12 e 1 α 13 0 0 0 0 0 0 and E 2 = diag ( e 1 , e 2 , e 3 ) 1 2 = e 1 0 e 1 α 13 0 e 2 e 2 α 23 0 0 0 . Similarly, E 1 r = 1 1 r diag ( e 1 , e 2 , e 3 ) = 0 0 α 13 e 3 0 0 α 23 e 3 0 0 e 3 and E 2 r = 1 2 r diag ( e 1 , e 2 , e 3 ) = 0 α 12 e 2 α 13 e 3 0 e 2 0 0 0 e 3 . Then, E 1 E 2 r = 0 e 1 α 12 e 2 e 2 α 13 e 3 0 0 0 0 0 0 and E 2 E 1 r = 0 0 e 1 α 13 e 3 0 0 e 2 α 23 e 3 0 0 0 . All these matrices are idempotents.
Next, let Δ 1 = E 1 E 2 r = e 1 δ 12 δ 13 0 e 2 0 0 0 e 3 and Δ 2 = E 2 E 1 r = e 1 0 δ 13 0 e 2 δ 23 0 0 e 3 , which are also idempotents. Then, we have Δ 1 + Δ 2 = e 1 δ 12 δ 13 0 e 2 δ 23 0 0 e 3 = Δ and, from Theorem 2, it follows that E ( e 1 , e 2 , e 3 ) = ( Δ 1 + Δ 2 ) 2 .
There is another way of describing the idempotent matrix E ( e 1 , e 2 , e 3 ) . It is easy to see that ( E 1 E 2 r ) ( E 2 E 1 r ) + ( E 2 E 1 r ) ( E 1 E 2 r ) = E ( e 1 , e 2 , e 3 ) .
From the monic Jordan semicentral idempotent 1 1 𝚥 = 1 α 12 α 13 0 1 0 0 0 1 , we construct E 1 𝚥 left = e 1 e 1 α 12 e 1 α 13 0 e 2 0 0 0 e 3 and E 1 𝚥 right = e 1 α 12 e 2 α 13 e 3 0 e 2 0 0 0 e 3 . Then, E 1 𝚥 left E 1 𝚥 right = e 1 e 1 α 12 e 2 e 1 α 13 e 3 0 e 2 0 0 0 e 3 . Therefore, E 1 𝚥 left E 1 𝚥 right = Δ 1 .
Similarly, E r 1 𝚥 left E r 1 𝚥 right = Δ 2 , where 1 r 1 𝚥 = 1 0 α 13 0 1 α 23 0 0 1 is another monic Jordan semicentral idempotent. Thus, we can represent E ( e 1 , e 2 , e 3 ) only by the monic Jordan semicentral idempotents.
Theorem 7. 
Let E ( e 1 , , e n ) be an arbitrary idempotent triangular n × n matrix over an additively idempotent semiring. Then,
E ( e 1 , , e n ) = k = 1 n 1 E k E n k r n 1 ,
where E k = diag ( e 1 , , e n ) 1 k and E n k r = 1 n k r diag ( e 1 , , e n ) , k = 1 , , n 1 .
Proof. 
We know that 1 k = I k A 0 0 , where I k = i = 1 k e i i and A M k × ( n k ) ( S ) . Then, E k = E k E k A 0 0 , where E k = diag ( e 1 , , e k ) . Similarly, from 1 n k r = 0 A 0 I n k , where I n k = i = k + 1 n e i i , it follows that E n k r = 0 A E n k 0 E n k , where E n k = diag ( e k + 1 , , e n ) . Now, we find E k E n k r = 0 E k A E n k 0 0 and E n k r E k = 0 .
Then, Δ k = E k E n k r = I + D k , where I is the identity matrix and D k = ( δ i j ) , i = 1 , , k , j = k + 1 , , n .
Consequently,
k = 1 n 1 E k E n k r = k = 1 n 1 Δ k = Δ
and by Theorem 2 and Corollary 1, the result follows. □
In a particular case when E ( e 1 , , e n ) = diag ( e 1 , , e n ) , the formula in Theorem 7 is an identity. In order to represent the diagonal matrix E ( e 1 , , e n ) by left and right semicentral idempotents, we prove the next result.
Corollary 3. 
The matrix E ( e 1 , , e n ) = diag ( e 1 , , e n ) can be presented in the form
i = 1 n e i 1 n i + 1 r 1 i = e 1 r n 1 e i 1 n i + 1 r 1 i e n r 1 n .
Proof. 
It follows that the matrix unit e i i , i = 1 , , n , can be presented in the form 1 n i + 1 r 1 i , where all entries of these semicentral idempotents over the main diagonal are zeroes. Note that 1 n r = 1 n = I . Since e i 1 n i + 1 r 1 i are orthogonal idempotents, the sum is equal to a diamond composition on the right side. □
From the proof of Theorem 7, we obtain a new equality, similar to (6).
Corollary 4. 
Let E ( e 1 , , e n ) be an arbitrary idempotent triangular n × n matrix over an additively idempotent semiring. Then,
E ( e 1 , , e n ) = k = 1 n 1 E k 𝚥 E r n k 𝚥 n 1 ,
where E k 𝚥 = diag ( e 1 , , e n ) 1 k 𝚥 , E r n k 𝚥 = 1 r n k 𝚥 diag ( e 1 , , e n ) for k = 1 , , n 1 .
Proof. 
From Section 4, we know that 1 k 𝚥 = I + 1 k and 1 r n k 𝚥 = I + 1 n k r where k = 1 , , n 1 are monic Jordan semicentral idempotents. Both matrices are equal to I k A 0 I n k , which has only ones on the main diagonal and a matrix, A M k × ( n k ) ( S ) , is in the right upper corner.
Under the notations in the proof of Theorem 7, it follows that E k 𝚥 = E k E k A 0 E n k , E r n k 𝚥 = E k A E n k 0 E n k and E k 𝚥 E r n k 𝚥 = E k E k A E n k 0 E n k .
Hence, E k 𝚥 E r n k 𝚥 = Δ k , and the result follows. □

6. Application B: Decomposition of Strictly Upper Triangular Matrices into Semicentral Idempotents

Note that strictly upper triangular matrices (i.e., those with zeroes on the main diagonal) over an additively idempotent semiring, S, form a subsemiring of T n ( S ) .
The following reasonings are very similar to those in [14,25] for triangular matrices over a ring.
By N T n ( S ) , we denote the ring of strictly upper triangular (or nil-triangular) n × n matrices over the additively idempotent semiring S.
Example 6. 
Let A N T 2 ( S ) . Then, it follows that
A = 0 a 0 0 = 1 a 0 0 0 0 0 1 = 1 1 1 1 r .
Let A N T 3 ( S ) . As in the proof of Proposition 2.7 (cf. [25]), it follows that
A = 0 a 12 a 13 0 0 a 23 0 0 0 = 1 0 a 13 0 1 a 23 0 0 0 0 a 12 0 0 0 0 0 0 1 =
= 1 2 1 a 12 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 = 1 2 1 a 12 0 0 0 0 0 0 1 1 2 r .
On the other hand, for 1 1 = 1 a 12 0 0 0 0 0 0 0 and 1 1 r = 0 0 0 0 0 0 0 0 1 , we obtain that 1 1 1 1 r = 0 , which implies that 1 1 1 1 r = 1 1 + 1 1 r = 1 a 12 0 0 0 0 0 0 1 . Therefore, A = 1 2 ( 1 1 + 1 1 r ) 1 2 r .
Theorem 8. 
Let S be an additively idempotent semirimg, n N , and A a strictly upper triangular n × n matrix over S. Then,
A = k = 0 n 1 1 n 1 k + 1 k r ,
where 1 0 = 1 0 r = 0 .
Proof. 
We can show that
A = B C 0 0 = I n 1 C 0 0 B 0 0 1 = 1 n 1 B 0 0 1 ,
where B N T n 1 ( S ) and C M ( n 1 ) × 1 ( S ) .
If B = k B k , where B k T r n 1 ( S ) , then B 0 0 1 = k B k 0 0 1 .
The proof proceeds by induction on n. By 1 k ( p ) (resp., 1 k r ( p ) ) we denote a left (resp., right) semicentral idempotent p × p matrix where p = 2 , , n 1 .
For n = 3 , using the first part of Example 4, we obtain
0 a 12 a 13 0 0 a 23 0 0 0 = 1 2 ( 3 ) 1 1 ( 2 ) 1 1 r ( 2 ) 0 0 1 = 1 2 ( 3 ) 1 1 ( 2 ) 0 0 1 1 1 r ( 2 ) 0 0 1 =
= 1 2 ( 3 ) 1 1 ( 2 ) 0 0 0 + 0 0 0 0 0 0 0 0 1 1 2 r ( 3 ) = 1 2 ( 3 ) ( 1 1 ( 3 ) + 1 1 r ( 3 ) ) 1 2 r ( 3 ) = k = 0 3 1 2 k + 1 k r .
We assume that B = k = 0 n 2 1 n 2 k ( n 1 ) + 1 k r ( n 1 ) . Then, we find
B 0 0 1 = k = 0 n 2 1 n 2 k ( n 1 ) + 1 k r ( n 1 ) 0 0 1 = k = 0 n 2 1 n 2 k ( n ) + 1 k + 1 r ( n ) .
Hence, A = 1 n 1 ( n ) k = 0 n 3 1 n 2 k ( n ) + 1 k + 1 r ( n ) 1 n 1 r ( n ) , which gives the desired conclusion. □

7. Application C: Decomposition of Unitriangular Matrices into Semicentral Idempotents

Recall that a matrix is called unitriangular if it is upper triangular and has only ones on the main diagonal. Each unitriangular matrix has the form I + A , where I is an identity matrix and A is a strictly upper triangular matrix. It is easy to see that unitriangular matrices over an additively idempotent semiring, S, form a subsemiring of T n ( S ) .
First, let us consider the representation of a unitriangular idempotent matrix by left and semicentral idempotents. As a consequence of Theorem 7, we have the following.
Proposition 18. 
Let U be a unitriangular idempotent n × n matrix over an additively idempotent semiring. Then, U = k = 1 n 1 1 k 1 n k r n 1 .
For some unitriangular idempotent matrices, which are “near” to the identity matrix, the representation by semicentral idempotents takes an especially simple form.
Proposition 19. 
Let U = ( a i j ) T n ( S ) , where a i i = 1 , a i j = 0 for all i , j = 1 , , n , i < j , except a i i + 1 if i is an odd integer, and S be an additively idempotent semiring. Then, U = k = 1 n 1 1 k 1 n k r .
Proof. 
It is enough to show that U is an idempotent matrix, and for each k = 1 , , n 1 , the matrix 1 k 1 n k r contains a k × ( n k ) matrix which is a submatrix of U with all entries being zeroes except a k k + 1 if k is an odd integer. □
The next example elucidates that there are unitriangular idempotent matrices represented only by a diamond composition of left and right semicentral idempotents.
Example 7. 
Let A = ( a i j ) where a i j S is a unitriangular idempotent 4 × 4 matrix. Let 1 k = I k B 0 0 , where I k = i = 1 k e i i , B = ( a i j ) M k × ( 4 k ) ( S ) , and B is a submatrix of A, be a monic left semicentral idempotent for k = 1 , 2 , 3 . Let 1 4 k r = 0 C 0 I 4 k , where I 4 k = i = k + 1 4 e i i and C = ( a i j ) M ( 4 k ) × k ( S ) and C is a submatrix of A, be a monic right semicentral idempotent for k = 1 , 2 , 3 . Then, we have
A = ( 1 3 1 1 r ) ( 1 2 1 2 r ) ( 1 1 1 3 r ) .
Next, we study the notion of a diamond composition of the arbitrary triangular matrices A and B. Thus, A B = A + B + A B is neither an idempotent matrix nor a nilpotent matrix.
Now, for the arbitrary triangular matrices A and B, it is easy to obtain that ( I + A ) ( I + B ) = I + ( A B ) , where I is the identity matrix. Consequently, the semiring of unitriangular matrices is closed under a diamond composition.
By induction (and using the associativity of a diamond composition), it follows that k ( I + A k ) = I + k A k , where A k are arbitrary triangular matrices.
In the text between Remark 5 and Remark 6, we find, for Jordan semicentral idempotents, that 1 n k 𝚥 = I + 1 n k and 1 r k 𝚥 = I + 1 k r .
Therefore, it follows that 1 n k 𝚥 1 r k 𝚥 = I + 1 n k 1 k r which implies that k = 1 n 1 1 n k 𝚥 1 r k 𝚥 = I + k = 1 n 1 1 n k 1 k r .
Theorem 9. 
Let S be an additively idempotent semirimg, n N , and U a unitriangular n × n matrix over S. Then,
U = k = 1 n 1 1 n k 1 k r = k = 1 n 1 1 n k 𝚥 1 r k 𝚥 .
Proof. 
Let A be the strictly upper triangular matrix from Theorem 8. The sum of each two corresponding (with the same number) entries on the main diagonals of the matrices 1 n k and 1 k r is 1. The sum of all left and all right semicentral idempotent matrices (from the representation of A in Theorem 8) contains all entries of A. Moreover, the product 1 n k 1 k r is a submatrix of A (using the reasoning in Section 4 before Lemma 1). Then, we have k = 1 n 1 1 n k 1 k r = I + A .
On the other hand, any product, k = p q 1 n k 1 k r , 0 p < q n 1 , is a submatrix of I + A . Consequently, U = I + A = k = 1 n 1 1 n k 1 k r = k = 1 n 1 1 n k 𝚥 1 r k 𝚥 . □
From the proof of the last theorem, we have the following.
Corollary 5. 
Let 1 n k and 1 k r for k = 1 , , n 1 be left and right semicentral idempotent matrices. Let all these semicentral idempotents be submatrices of the unitriangular matrix A = ( a i j ) T n ( S ) . Then,
k = 1 n 1 1 n k 1 k r = k = 1 n 1 1 n k 1 k r = k = 1 n 1 1 n k 1 k r .
D. I. Vladeva (see [26]) considered derivations of the semirings of triangular Toeplitz n × n matrices over an additively idempotent semiring. For basic facts and many applications of Toeplitz matrices, we refer the reader to R. Gray (see [27]). Note that any triangular Toeplitz n × n matrix (or diagonal-constant matrix) depends only on the entries a 11 , , a 1 n placed on the diagonals of the matrix. As a consequence of the last theorem and (8), we obtain the following.
Corollary 6. 
Let A = ( a i j ) T n ( S ) be a Toeplitz matrix, where S is an additively idempotent semiring. If a 11 is a unit of S, then A = a 11 k = 1 n 1 1 n k 1 k r .

8. Application D: Nil-Clean Triangular Matrices—Decomposition into Semicentral Idempotents

A classical definition of W. K. Nicholson (see [28,29]) says that a ring, R, is clean if every element of R can be written as a sum of an idempotent and a unit. Using this notion, A.J. Diesl, in [24], introduced nil-clean rings as rings in which every element can be written as the sum of an idempotent and a nilpotent. Diesl’s work caught the attention of a number of mathematicians, and in the past ten years, there have been many investigations concerning variants of nil-clean rings (see [30,31,32]). Inspired by these articles, we introduce a nil-clean additively idempotent semiring as a semiring in which every element can be written as the sum of an idempotent and a nilpotent.
Since the sum of two elements, a and b, in an additively idempotent semiring is max { a , b } , we need an example of a nil-clean semiring.
Example 8. 
We consider the finite set C n = { 0 , 1 , , n 1 } and define x y = max { x , y } , where x , y C n . Thus, C n , is a join-semilattice or a commutative idempotent semigroup. The map α : C n C n is called an endomorphism of the finite chain C n if α ( x y ) = α ( x ) α ( y ) . The set of endomorphisms with a fixed point, 0, is a semiring, denoted by E C n ( 0 ) , with respect to the addition and multiplication defined by the following:
( α + β ) ( x ) = α ( x ) β ( x ) and ( α β ) ( x ) = β ( α ( x ) ) , where x C n and α , β E C n ( 0 ) .
We denote by ( 0 , 1 , , n 1 ) and by ( 0 , 0 , , 0 ) the identity and the zero of E C n ( 0 ) , respectively. For more information regarding endomorphism semirings, the reader is referred to [17]. In [17], as well as in [18], we consider a semiring which is a subsemiring of the endomorphism semiring E C n ( 0 ) , consisting of the endomorphisms α such that α ( k ) k for all k C n . As this semiring is associated with Catalan numbers, we call it the Catalan endomorphism semiring and denote it by CAT n . We note the following properties:
(i) For an arbitrary α CAT n , it follows that α ( 0 , 1 , , n 1 ) , where CAT n is an incline (see [33]). It can be easily checked that this is the maximal subsemiring of E C n ( 0 ) , which is an incline.
(ii) The order of CAT n is the n-th Catalan number C n . (For the definition and properties of Catalan numbers, the reader is referred to [34].)
(iii) The nilpotent endomorphisms of E C n ( 0 ) are the endomorphisms α such that α m = ( 0 , 0 , , 0 ) for some positive integer, m, and they also have the property α ( k ) < k for all k C n . The set of nilpotent endomorphisms is an ideal of CAT n of the order of the ( n 1 ) -th Catalan number C n 1 .
Now, consider an arbitrary endomorphism, α CAT n . If α has no fixed points, it follows that α ( k ) < k for all k C n . Consequently, α is a nilpotent. Since α = α + ( 0 , 0 , , 0 ) , we have that α is a sum of an idempotent and nilpotent.
Let k be the lowest number which is a fixed point of α. We consider the following possibilities.
Case 1. Let k = 1 . Assume that k 1 = k = 1 < k 2 < < k s are all fixed points of α. Now, if x C n and 1 < x < k 2 , then α ( x ) = 1 . Similarly, if k s 1 < x < k s , then α ( x ) = k s 1 .
Case 1.1. If k s = n 1 , then α is an idempotent. It is reasonable to assume that n 3 . Then, the endomorphism ( 0 , , 0 , 1 ) is a nilpotent. Now, from α = α + ( 0 , , 0 , 1 ) , we have that α is a sum of an idempotent and nilpotent.
Case 1.2. Let k s < n 1 . If α ( x ) = k s for all x such that k s x n 1 , then α is an idempotent. Assume that for some x, k s < x n 1 , we have α ( x ) = p < x where p k s . Now, we construct a new endomorphism, β, such that β ( x ) = 0 for all x, 0 x k s , and β ( x ) = α ( x ) for x such that k s < x n 1 . Then, β is a nilpotent. Additionally, we construct an endomorphism, γ, such that γ ( x ) = α ( x ) for all x, such that 0 x k s and γ ( x ) = k s for x, k s x n 1 . Consequently, γ is an idempotent. It is easy to see that α = β + γ .
Case 2. Let k, where k > 1 , be the smallest fixed point of α. Then, for all x, 1 x k 1 , we have α ( x ) < x . Let α ( k 1 ) = p < k 1 . Now, we construct an endomorphism, β, such that β ( x ) = α ( x ) for all x, 0 x k 1 , and β ( x ) = p for all x, k x n 1 . Since β has no fixed points, it is a nilpotent. Assume that k 1 = k < k 2 < < k s are all fixed points of α. Now, for x such that k < x < k 2 , we have α ( x ) = k . Similarly, if k s 1 < x < k s , then α ( x ) = k s 1 .
Case 2.1. Let k s = n 1 . We construct an endomorphism, γ, where γ ( x ) = 0 f0r all x such that 0 x k 1 and γ ( x ) = α ( x ) for x, k x n 1 . Then, γ is an idempotent and α = β + γ .
Case 2.2. Let k s < n 1 . We construct an endomorphism, β, such that β ( x ) = α ( x ) for all x, 0 x k 1 , β ( x ) = α ( k 1 ) for all x, k x k s , and β ( x ) = α ( x ) for all x, k s < x n 1 . Since β has no fixed points, it is a nilpotent. Finally, we construct an endomorphism, γ, such that γ ( x ) = 0 for all x such that 0 x k 1 , γ ( x ) = α ( x ) , for x, k x k s , and γ ( x ) = k s for all x, such that k s x n 1 . Then, γ is an idempotent and α = β + γ . Consequently, we prove that CAT n is a nil-clean semiring.
Remark 9. 
In the example above, we write α = α + ν , where ν is a nilpotent element, for each idempotent α. We call this representation trivial. Are there nontrivial representations in the following sense: e 1 = e + n , where e 1 and e are idempotents, e e 1 , and n is a nilpotent element?
In order to find such a representation, we consider an additive idempotent semiring, S, where ℓ (resp., r) is a left (resp., right) semicentral idempotent. Assume (as in Section 2) that r = 0 . Then, r is a nilpotent element and 1 + r , + r and r + r are nil-clean elements. It is easy to see that 1 + r , + r and r + r are idempotents (moreover, 1 + r is a Jordan semicentral idempotent; see Proposition 4). But, the subsemiring of S, generated by ℓ and r with the property r = 0 , is not a nil-clean semiring. It is interesting to know if there is a nil-clean semiring with the nontrivial representation of all idempotent elements. Such a nil-clean semiring will be considered in the remark after Proposition 22.
The next result shows why the notion of a nil-clean semiring is relevant to the study of triangular matrices.
Proposition 20. 
The semiring T n ( S ) is nil-clean, provided that S is a nil-clean semiring.
Proof. 
Let A T n ( S ) , where S is a nil-clean semiring. Then, A = ( ε i j + η i j ) , where ε i j is an idempotent and η i j is a nilpotent element for i , j = 1 , , n , i j . It follows that A = E + N , where E = diag ( ε 11 , , ε n n ) , and N = ( η i j ) + E 1 , where E 1 = ( ε i j ) is a strictly upper triangular matrix. Since E is an idempotent matrix and N is a nilpotent matrix, it follows that T n ( S ) is a nil-clean semiring. □
In the next result, we represent a triangular matrix over a nil-clean semiring by left and right monic semicentral idempotent matrices.
Proposition 21. 
Let A T n ( S ) where S is a nil-clean semiring. Then, there are the matrices B , C T n ( S ) , such that we have the following:
(i) A = B + C ;
(ii) B = i = 1 n ε i i 1 n i + 1 r 1 i , where ε i i are idempotents of S;
(iii) C m = k = 0 n 1 1 n 1 k + 1 k r for some positive integer, m.
Proof. 
By the last proposition, it follows that A = B + C , where B is an idempotent diagonal matrix and C is a nilpotent matrix. Using Corollary 11, we have that B = i = 1 n ε i i 1 n i + 1 r 1 i where ε i i are its diagonal elements.
Since diagonal entries of C are nilpotent elements, there is a positive integer, say, m, such that (according to Theorem 8 and (7)) C m = k = 0 n 1 1 n 1 k + 1 k r . □
It is important to know if there are nil-clean triangular matrices over S and which entries are not nil-clean elements of S. In a similar vein, J. S ˘ ter (see [35]) has shown that M n ( R ) is a nil-clean ring if R is a Boolean ring.
Note that in Example 3, we describe all matrices of T 3 ( B ) , where B is the Boolean semiring, as follows: left, right, and Jordan semicentral idempotents, idempotents which are not semicentral, and strictly upper and square roots of semicentral idempotent matrices.
Proposition 22. 
The semiring T n ( B ) is nil-clean where B is the Boolean semiring.
Proof. 
The proof is straightforward. □
Remark 10. 
Every idempotent matrix, A T n ( B ) , is a sum of its main diagonal, which is also an idempotent matrix and strictly upper matrix consisting of all entries over the main diagonal of A. Therefore, there is a nontrivial representation of A in the sense of Remark 8.
Now, we represent a matrix in T n ( B ) by semicentral idempotent matrices.
Proposition 23. 
Let A T n ( B ) , where B is the Boolean semiring. Then,
A = ε 11 1 n r 1 1 + + ε i i 1 n i + 1 r 1 i + + ε n n 1 1 r 1 n + k = 0 n 1 1 n 1 k + 1 k r ,
where ε i i = 1 or ε i i = 0 for i = 1 , , n .
Proof. 
The proof is similar to that of Proposition 20. □
By the same reasoning, we prove the next result.
Proposition 24. 
Let S 0 be a nil-clean subsemiring of T n ( S ) where S is an additively idempotent semiring. Then, for every matrix, A S 0 , there are B , C S 0 such that we have the following:
(i) A = B + C .
(ii) B is an idempotent matrix with the diagonal entries e i , i = 1 , , n , and B = k = 1 n 1 E k E n k r n 1 , E k = diag ( e 1 , , e n ) 1 k , E n i r = 1 n k r diag ( e 1 , , e n ) , k = 1 , , n 1 .
(iii) C m = k = 0 n 1 1 n 1 k + 1 k r for some positive integer, m.
There are enough nil-clean subsemirings of T n ( S ) . Since every semicentral (not necessarily monic) idempotent matrix is nil-clean, we can add to such matrices an arbitrarily strictly upper matrix. Now, the matrices 1 k + N k and 1 m r + N m , where N k and N m are strictly upper, are nil-clean matrices. It is easy to see that these matrices form a semiring.

9. Conclusions

In this paper, we obtain the explicit form of an arbitrary idempotent triangular matrix over an additively idempotent semiring. The explicit forms of left and right semicentral idempotents are given. A new type of semicentral idempotent, called Jordan, is studied. A diamond composition of two idempotent matrices is defined, which plays an important role in decompositions of many triangular matrices.
We consider this paper as a step towards the construction of a linear algebra on additively idempotent semirings, generalizing the idea of well-known max-algebra.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The author wish to tank the reviewers and The editors for helpful comments and suggestions that improved the quality of the article.

Conflicts of Interest

The author declare no conflicts of interest.

References

  1. Bistarelli, S. Semirings for Soft Constraint Solving and Programming; Springer: Berlin/Heidelberg, Germany, 2004. [Google Scholar]
  2. Brunsch, T.; Hardouin, L.; Maiac, C.; Raisc, J. Duality and interval analysis over idempotent semirings. Linear Algebra Appl. 2012, 437, 2436–2454. [Google Scholar] [CrossRef]
  3. Butkovič, P. Max-Linear Systems: Theory and Algorithms; Springer: London, UK, 2010. [Google Scholar]
  4. Gaubert, S.; Katz, R. Reachability problems for products of matrices in semirings. Int. J. Algebra Comp. 2006, 16, 603–622. [Google Scholar] [CrossRef]
  5. Gaubert, S.; Katz, R. Max-Plus Convex Geometry. In Proceedings of the Conference on Relational Methods in Computer Science, RelMiCS/AKA 2006, Manchester, UK, 29 August–2 September 2006. [Google Scholar]
  6. Grigoriev, D.; Shpilrain, V. Tropical cryptography. Commun. Algebra 2014, 42, 2624–2632. [Google Scholar] [CrossRef]
  7. Di Nola, A.; Gerla, B. Algebras of Łukasiewicz’s Logic and their Semiring Reducts. In Idempotent Mathematics and Mathematical Physics; Contemporary Mathematics; American Mathematical Society: Providence, RI, USA, 2005; Volume 377, pp. 131–144. [Google Scholar]
  8. Perri, T.; Rowen, L.H. Kernels in tropical geometry and a Jordan-Holder theorem. J. Algebra Its Appl. 2018, 17, 1850066. [Google Scholar] [CrossRef]
  9. Drensky, V.S. Idempotents of 2 × 2 matrix rings over rings of formal power series. Linear Multilinear Algebra 2022, 70, 5207–5213. [Google Scholar] [CrossRef]
  10. Peirce, B. Linear Associative Algebra. Washington, 1870. Am. J. Math. 1870, 4, 99–215. Available online: http://www.math.harvard.edu/history/peircealgebra/index.html (accessed on 1 February 2025).
  11. Hou, X. Idempotents in triangular matrix rings. Linear Multilinear Algebra 2021, 69, 296–304. [Google Scholar] [CrossRef]
  12. Wright, S.E. Triangular idempotent matrices over a general ring. Linear Multilinear Algebra 2022, 70, 1717–1731. [Google Scholar] [CrossRef]
  13. Vladeva, D.I. The role of semicentral idempotents in triangular matrix rings. In Communications in Algebra; Taylor & Francis: Abingdon, UK, 2024; Volume 53, pp. 1024–1038. [Google Scholar] [CrossRef]
  14. Vladeva, D.I. Semicentral idempotents of upper triangular matrix ring. J. Algebra Appl. 2024. Submitted 02.02.2024, Accepted 24.11. 2024 (to appear). [Google Scholar]
  15. Trendafilov, I.D.; Vladeva, D.I. Idempotent Elements of the Endomorphism Semiring of a Finite Chain. C. R. l’Académie Bulg. Sci. 2013, 66, 621–628. [Google Scholar]
  16. Chajda, I.; Länger, H. The variety of commutative additively and multiplicatively idempotent semirings. Semigroup Forum 2018, 96, 409–415. [Google Scholar] [CrossRef]
  17. Vladeva, D.I. Projections on right and left ideals of endomorphism semiring which are derivations. J. Algebra Appl. 2020, 19, 2050212-1–2050212-26. [Google Scholar] [CrossRef]
  18. Vladeva, D.I. Derivations of some classes of additively idempotent semirings. Commun. Algebra 2023, 51, 3244–3265. [Google Scholar] [CrossRef]
  19. Golan, J.S. Semirings and Their Applications; Kluwer Academic Press: Dordrecht, The Netherlands, 1999. [Google Scholar]
  20. Gantmacher, F.R. Matrix Theory Vol. 1; Chelsea: New York, NY, USA, 1959. [Google Scholar]
  21. Jain, S.K.; Goel, V.K.; Kwak, E.K. Nonnegative mth Roots of Nonnegative 0-Symmetric ldempotent Matrices. Linear Algebra Its Appl. 1979, 23, 37–51. [Google Scholar] [CrossRef]
  22. Birkenmeier, G.F.; Park, J.K.; Rizvi, S.T. Extensions of Rings and Modules; Springer: Berlin/Heidelberg, Germany; Birkhäuser: Basel, Switzerland, 2013. [Google Scholar]
  23. Vladeva, D.I. Derivations of skew Ore polynomial semirings. Commun. Algebra 2020, 48, 4718–4731. [Google Scholar] [CrossRef]
  24. Diesl, A.J. Nil clean rings. J. Algebra 2013, 383, 197–211. [Google Scholar] [CrossRef]
  25. Alahmadi, A.; Jain, S.K.; Leroy, A.; Sathaye, A. Decompositions into products of idempotents. Electron. J. Linear Algebra 2015, 29, 74–88. [Google Scholar] [CrossRef]
  26. Vladeva, D.I. Derivatives of triangular, Toeplitz, circulant matrices and of matrices of other forms over semirings. In Proceedings of the 43rd International Conference Applications of Mathematics in Engineering and Economics, Sozopol, Bulgaria, 8–13 June 2017; Volume 1910, pp. 060006-1–060006-12. [Google Scholar]
  27. Gray, R. Toeplitz and Circulant Matrices: A Review; Stanford University Press: Stanford, CA, USA, 2006. [Google Scholar]
  28. Nicholson, W.K. Lifting idempotents and exchange rings. Trans. Am. Math. Soc. 1977, 229, 269–278. [Google Scholar] [CrossRef]
  29. Nicholson, W.K.; Zhou, Y. Clean Rings: A Survey, Advances in Ring Theory; World Scientific Publication: Hackensack, NJ, USA, 2005; pp. 181–198. [Google Scholar]
  30. Breaz, S.; Călugăreanu, G.; Danchev, P.; Micu, T. Nil-clean matrix rings. Linear Algebra Appl. 2013, 439, 3115–3119. [Google Scholar] [CrossRef]
  31. Breaz, S.; Danchev, P.; Zhou, Y. Rings in which every element is either a sum or a difference of a nilpotent and an idempotent. J. Algebra Appl. 2016, 15, 1650148-1–1650148-13. [Google Scholar] [CrossRef]
  32. Danchev, P.; Garcia, E.; Lozano, M. Decompositions of matrices into diagonalizable and square-zero matrices. Linear Multilinear Algebra 2022, 70, 4056–4070. [Google Scholar] [CrossRef]
  33. Cao, Z.; Kim, K.; Roush, F. Incline Algebra and Applications; John Wiley & Sons: New York, NY, USA, 1984. [Google Scholar]
  34. Stanley, R. Catalan Numbers; Cambridge University Press: New York, NY, USA; Cambridge, UK, 2015. [Google Scholar]
  35. Šter, J. On expressing matrices over Z2 as the sum of an idempotent and a nilpotent. Linear Algebra Appl. 2015, 544, 339–349. [Google Scholar] [CrossRef]
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

Vladeva, D. Idempotent Triangular Matrices over Additively Idempotent Semirings: Decompositions into Products of Semicentral Idempotents. Axioms 2025, 14, 137. https://doi.org/10.3390/axioms14020137

AMA Style

Vladeva D. Idempotent Triangular Matrices over Additively Idempotent Semirings: Decompositions into Products of Semicentral Idempotents. Axioms. 2025; 14(2):137. https://doi.org/10.3390/axioms14020137

Chicago/Turabian Style

Vladeva, Dimitrinka. 2025. "Idempotent Triangular Matrices over Additively Idempotent Semirings: Decompositions into Products of Semicentral Idempotents" Axioms 14, no. 2: 137. https://doi.org/10.3390/axioms14020137

APA Style

Vladeva, D. (2025). Idempotent Triangular Matrices over Additively Idempotent Semirings: Decompositions into Products of Semicentral Idempotents. Axioms, 14(2), 137. https://doi.org/10.3390/axioms14020137

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