Belitskiĭ's canonical form for \(5\times 5\) upper triangular matrices under upper triangular similarity (Q2484488): Difference between revisions

The canonical form problem for upper triangular similarity has been solved by the Belitskii's algorithm. Beliskikii's algorithm works in a much broader setting, reducing a matrix \(A\) to a canonical form. The set \(T\) of all upper triangular \(n\times n\) matrices is a reduced \(1\times 1\) algebra, and every \(A\) in \(T\) is reduced to \(T\)-canonical form by Beliskii's algorithm. In dimension 6 or more, there are infinitely many upper triangular similarity classes of nilpotent matrices if the underlying field is infinite. Using Belitskii's algorithm, the author explicitly describes canonical forms for \(5\times 5\) upper triangular matrices under upper triangular similarity.