A Study on the Similarity of the Block Matrices
Cheng Shi-zhen
Abstract
Cheng Shi-zhen
Abstract
In this note, we show the two necessary and sufficient conditions such that two block matrices are similar, that is, suppose that the two square matrices A and B satisfy A2=0 and B2=0. Show that the two block matrices AC=0B and A0=0B are similar if and only if rank AC=0B=rank(A)+rank(B) and AC+CB=0. Suppose that the two square matrices A and B satisfy A2=A and B2=B. Show that the two block matrices AC=0B and A0=0B are similar if and only if AC+CB=C.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this note, we show the two necessary and sufficient conditions such that two block matrices are similar, that is, suppose that the two square matrices A and B satisfy A2=0 and B2=0. Show that the two block matrices AC=0B and A0=0B are similar if and only if rank AC=0B=rank(A)+rank(B) and AC+CB=0. Suppose that the two square matrices A and B satisfy A2=A and B2=B. Show that the two block matrices AC=0B and A0=0B are similar if and only if AC+CB=C.
Key concepts: Rank (graph theory), Block (permutation group theory), Combinatorics, Mathematics, Square (algebra), Similarity (geometry), Matrix (chemical analysis), Computer science