A note on products of quadratic matrices of singular type
Christiaan J Hattingh

TL;DR
This paper offers a new proof of a theorem related to the products of idempotent and square-zero matrices, and characterizes products of singular quadratic matrices using existing results.
Contribution
It presents an alternative, self-contained proof of Botha's theorem and provides a comprehensive characterization of products of singular quadratic matrices.
Findings
Proof of Botha's theorem is simplified and clarified.
Characterization of products of singular quadratic matrices established.
Enhanced understanding of matrix product structures in linear algebra.
Abstract
I provide an alternate and self-contained proof of Botha's theorem on products of idempotent and square-zero matrices where the product contains two square-zero factors, and provide a conclusive characterisation of products of singular quadratic matrices based on previous results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Topics in Algebra · Mathematics and Applications
A note on products of quadratic matrices of singular type.
C.J. Hattingh111Corresponding author. [email protected]
Abstract
I provide an alternate and self-contained proof of Botha’s theorem on products of idempotent and square-zero matrices where the product contains two square-zero factors, and provide a conclusive characterisation of products of singular quadratic matrices based on previous results.
1 Introduction
A singular quadratic matrix which is not the zero matrix has minimum polynomial (where is some scalar over a field), and is therefore either square-zero, or a scalar multiple of an idempotent matrix. In this article I aim to summarise previous results on products of such matrices in one general statement, presented here as corollary 7.
I want to start however, by presenting an alternate proof to one of the results first proved by Botha [4]. In this article I aim to present additional insight into that investigation through a self-contained alternate proof which might provide further insight and aid further research into products of quadratic matrices.
I will now fix some notation. The set of order square matrices over a field is indicated as . Matrices are generally indicated by capitals, and vectors in lower case. The null space of a matrix is indicated as and its range as , the corresponding dimensions of these subspaces are indicated as (nullity of ) and (rank of ) respectively.
Definition. .
I denote the simple Jordan block with characteristic value zero and order as
[TABLE]
It is easy to see that is the number of blocks in the rational canonical form of .
A vector space is generally indicated in capitals by calligraphic font. The vector space of -dimensional (column) vectors are indicated as , and the standard basisvector with a 1 in entry and zeros elsewhere is indicated as .
Well known previous results employed in the proof include
Grassmann’s theorem: Let be a vector space over a field and let and be subspaces of satisfying the condition that has finite dimension. Then . 2. 2.
Sylvester’s theorem: Let be matrices over such that has columns and has rows. Then (i) ; . 3. 3.
Fitting’s lemma: is similar to where is nilpotent and is non-singular.
Recent previous results that are employed:
is a product of idempotent matrices (over ) of nullities respectively if and only if and . [1] [2] 2. 2.
is a product of two square-zero matrices if and only if , and whenever is such a product the ranks of can be arbitrarily chosen subject to . [3, theorem 3]
Finally note that, up to similarity, the ordering of factors in a product consisting entirely of idempotent and square-zero matrices with prescribed nullities may be chosen arbitrarily, due to the fact that the idempotent and square-zero properties are preserved by similarity, and furthermore a product is similar to (its transpose) for any two square matrices of the same order. We may therefore generalize the results below to include the case where consists of any ordering of the factors presented.
2 Products with two square-zero factors
Theorem 1**.**
Let and . The following two statements are equivalent.
where and for each , and and and . 2. 2.
- (i)
, 2. (ii)
, 3. (iii)
.
Lemma 2**.**
Let where and are arbitrary square matrices. Then .
Proof.
[TABLE]
and so by Grassmann’s theorem
[TABLE]
Now since , the desired result follows directly from (1).
Lemma 3**.**
Let where is an arbitrary square matrix and , where . If then .
Proof. We have
[TABLE]
and since is the product of two square-zero matrices we have by [3, theorem 3]
[TABLE]
It follows by lemma 2 that
[TABLE]
and therefore
[TABLE]
Remark: Notice that the result above includes the case where .
Proposition 4**.**
Let where is an arbitrary square matrix and , where . Then .
Proof. If then the result follows directly from lemma 3, so suppose that . Then there exists a subspace such that and
[TABLE]
Now by a similar argument as employed in the proof of lemma 3 it is easy to show
[TABLE]
and it remains to show that .
Let be a basis for , then since it follows that is a linearly independent set, and since we then also have is linearly independent. Now and it follows that , which yields the desired result.
Lemma 5**.**
Let , then where and and and .
Proof. If :
[TABLE]
If , let
[TABLE]
then:
[TABLE]
Remark: Notice that for any integer .
Corollary 6**.**
Let where . Then where and and .
Proof. Let , and let as in the lemma above for . Furthermore, choose or for , so that in this case.
Then with and .
Proof of theorem 1. Suppose point number 1 in the statement of the theorem is true. Then (ii) and (iii) follow easily, and (i) follows from proposition 4 and [1].
Suppose point number 2 in the statement of the theorem holds. By the final paragraph of the introduction we may assume without loss of generality that .
By Fitting’s lemma is similar to where is nilpotent and is invertible. Without loss of generality we can assume that where with and .
Now where is any idempotent matrix with .
Let . It then follows that and the corollary above shows that where is idempotent, and .
Finally we have .
Now is idempotent. Notice that by the choice of and , we can specify arbitrarily subject to and therefore let . Now since , the result [1] shows that can be written as .
Furthermore is such that . By theorem 3 of [3] it follows that .
3 Products of quadratic matrices of singular type
Corollary 7**.**
Let and and be nonzero scalars in . Set . The following two statements are equivalent.
where and for each , and and for each . 2. 2.
- (i)
, 2. (ii)
, 3. (iii)
furthermore if then ,
if then ,
if then .
Proof. Note that is equivalent to . Now the corollary follows easily by combining the results presented in [1], [2], [4], and the preceding sections, with the fact that for any subspace we have .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J.D. Botha, Idempotent factorization of matrices, Linear and Multilinear Algebra , 40:4 (2008) 365 – 371.
- 2[2] F. Knüppel and K. Nielsen, A short proof of Botha’s theorem on products of idempotent linear mappings, Linear Algebra and its Applications, 438 (2013) 2520-2522
- 3[3] J.D. Botha, Square-zero factorization of matrices, Linear and Multilinear Algebra , 488 (2016) 71 – 85.
- 4[4] J.D. Botha, Products of idempotent and square-zero matrices, Linear Algebra and its Applications, 497 (2016) 116-133
