Factorizations in upper triangular matrices over information semialgebras (Q2197570)

A commutative cancellative monoid (e.g., an integral domain) is said to be atomic if every nonzero nonunit element is a product of irreducible factors (called atoms). An atomic monoid is called a finite factorization monoid (FFM) if every nonunit element has only finitely many factorizations, and it is called a bounded factorization monoid (BFM) if for each nonunit element there is a bound for the number of atoms in each of its factorizations. In commutative cancellative monoids FFP \(\Rightarrow\) BFP \(\Rightarrow\) ACCP\(\Rightarrow\) atomic, where ACCP is the ascending chain property of pricipal ideals. This paper investigates the atomicity of the noncommutative monoid \(T_n(S)^\bullet\) of \(n\times n\) upper triangular matrices over an information semialgebra \(S\) and improves the results in [the first author and \textit{R. Sampson}, Linear Algebra Appl. 587, 334--357 (2020; Zbl 1457.16044)]. For \(n\ge 2\), the authors show that each of the four properties above transfers back and forth between \(T_n(S)^\bullet\) and \(S\), and that a similar transfer behavior takes place if one replaces \(T_n(S)^\bullet\) by its submonoid \(U_n(S)\) consisting of upper triangular matrices whose diagonal elements are units of \(S\). As a consequence, the chain of implications FFP \(\Rightarrow\) BFP \(\Rightarrow\) ACCP \(\Rightarrow\) atomic also holds for the noncommutative monoids \(T_n(S)^\bullet\) and \(U_n(S)\). Moreover, by using Puiseux information semialgebras, they verify that none of the mentioned implications is reversible in general, as happens in the case of commutative monoids. The article consists of three sections that follow a beautiful introduction, comprehensive of an interesting historical overview on factorization theory. The main results of the paper are contained in Section 4.