Abstract
It is well known that in , the product of two polynomials is equal to the product of their greatest common divisor and their least common multiple. In a recent paper, we proved a similar relation between the ranks of matrix polynomials. More precisely, the sum of the ranks of two matrix polynomials is equal to the sum of the rank of the greatest common divisor of the polynomials applied to the respective matrix and the rank of the least common multiple of the polynomials applied to the respective matrix. In this paper, we present three new proofs for this result. In addition to these, we present two more applications.
Keywords:
rank; Jordan canonical form; matrix polynomials; Sylvester inequality; Frobenius inequality MSC:
15A03; 15A20; 15A24
1. Introduction
In an euclidean ring , for any elements , there exists the greatest common divisor and there exists the least common multiple . For the rings and , the relation is well known (see [1] [p. 150]). By , we denote the set of all polynomials in the indeterminate X with complex coefficients. In a recent paper (see [2]), we proved a similar relation between the ranks of matrix polynomials.
Theorem 1.
For any two polynomials and for any matrix , the following relation holds:
where denotes the greatest common divisor and denotes the lowest common multiple of the polynomials .
In [2], the proof is presented using the method of elementary transformations in block-partitioned matrices. In this paper, we present three more proofs of the previous theorem. The first proof uses the reduction of a matrix to Jordan’s canonical form. The following two proofs reduce the equality to be proved to the study of the case of equality from Frobenius inequality.
The rank of a matrix is a fundamental concept in numerical linear algebra and engineering. For example, in control theory, the rank of a matrix can be used to determine whether a linear system is controllable or observable.
2. Main Results
First Proof of Theorem 1 (Vasile Pop).
For the first proof, we use the reduction of the matrices which appear in Theorem 1 to Jordan’s canonical form. More precisely, we show how the relation of this theorem can be reduced to the case in which M is a Jordan cell:
For this, we recall some basic facts (see, for example, [3], pp. 164–169; [4], pp. 95–100).
Theorem 2.
Let be a matrix and a polynomial. Then,
- (i)
- There is an invertible matrix such that the matrixhas a diagonal-block formwhere , , …, are the distinct eigenvalues of M and , , …, are the corresponding Jordan cells;
- (ii)
- ;
- (iii)
- ;
- (iv)
- ;
- (v)
- for any Jordan cell , we have
- (vi)
- for any Jordan cell , we haveif λ is a root of f with multiplicity at least m . For the other cases, we havewhere is the order of multiplicity of the λ for the polynomial f .
Using Theorem 2 (i)–(iv), proving equality (1) is reduced to proving the following relation:
for any Jordan cell of M.
Let be an eigenvalue of the matrix M and the corresponding Jordan cell. With the above notations,
we have
and
By Theorem 2 (vi), to prove equality (2), we discuss the following three cases.
(a) If and , then and . Then, relation (2) becomes , which, evidently, is true.
(b) If and , then and , and relation (2) becomes , which, evidently, is true.
(c) If and , then and , and relation (2) becomes , which, evidently, is true. □
Second Proof of Theorem 1 (Alexandru Negrescu).
Consider , two polynomials, such that
As a consequence, we have
We also consider the matrices such that
We deduce that
and
Therefore, the equality to be proved is equivalent to
which we recognize as the equality case of Frobenius inequality.
In 2002, Tian and Styan (see [5] (Theorem 1)) proved the following result.
Theorem 3.
Let , , and be given. Then, the following three statements are equivalent:
- (a)
- ;
- (b)
- ;
- (c)
- there are X and Y such that .
Thus, the equality to be demonstrated is reduced to showing that there are two matrices, , such that
which is an immediate consequence of the following theorem (see [1] (Theorem 3.31, p. 135)).
Theorem 4.
If is a field, , and d is their greatest common divisor, then there are such that
Indeed, we can choose and , whereby the proof is finished. □
Third Proof of Theorem 1 (Mihai Opincariu).
As put forward in the previous proof, the equality to be demonstrated is equivalent to
where the notations are those of the second proof (, , ).
To prove relation (3), we use Sylvester’s Theorem (see [6] (Theorem 2.6)), which presents the equality case in Sylvester’s inequality.
Theorem 5.
For any matrices , the following relation holds:
Subtracting relation (5) from (4), we obtain
Since , we obtain the well-known Frobenius inequality
and by (6), it follows that equality case (3) is true if and only if
So, taking into account the notations at the beginning of this proof, it remains to show the relation
It is enough to proof the inclusion “⊂”, since the other is obvious.
We have:
According to Theorem 4, since , there exist two polynomials, , such that
hence
By multiplying in the last relation by and taking into account that , we obtain
Since , we have
equivalent to
or
that is,
and the proof is finished. □
Besides the applications highlighted in [2], Section 3, we present two others. The first of these is closely related to a problem given in the 2004 edition of the Undergraduate Mathematics Competition at the Mechanics and Mathematics Faculty of Taras Shevchenko National University of Kyiv, Ukraine (see [7], p. 27).
Proposition 1.
Let A, B, C, and D be real matrices such that
We denote . Then,
Proof.
First, we show that S is a tripotent matrix. Indeed, we have
If we consider in Theorem 1 the polynomials and , for which and , we obtain that ; thereby, taking into account that the matrix S is tripotent, we deduce that .
If we consider in Theorem 1 the polynomials and , for which and , we obtain that , so and the conclusion follows. □
The following result was proposed by Bogdan Sebacher in the 2019 edition of the Traian Lalescu National Mathematics Contest for University Students, Romania (see [8]).
Proposition 2.
Let , with , , and . Then,
Proof.
If we consider in Theorem 1 the polynomials and , for which and , we obtain that , and the conclusion follows. □
In addition to those presented in [2], we offer two more consequences of Theorem 1, which can be easily shown by the method of mathematical induction.
Corollary 1.
Let be polynomials and . Let denote the greatest common divisor of polynomials (the maximum-degree monic polynomial that divides all polynomials ) and denote the lowest common multiple of the polynomials (the minimum-degree monic polynomial that is a multiple of all polynomials ). Then,
and
3. Conclusions
This paper provides three new proofs that the sum of the ranks of two matrix polynomials is equal to the sum of the rank of the greatest common divisor of the polynomials applied to the respective matrix and the rank of the least common multiple of the polynomials applied to the respective matrix. In addition to these, two more applications are provided.
Author Contributions
Conceptualization, V.P. and A.N.; methodology, V.P. and A.N.; formal analysis, V.P. and A.N.; investigation, V.P. and A.N.; writing—original draft preparation, V.P. and A.N.; writing—review and editing, V.P. and A.N.; supervision, V.P. and A.N.; funding acquisition, V.P. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
Data sharing is not applicable to this article.
Acknowledgments
We thank Mihai Opincariu, “Avram Iancu” National College, Brad, Hunedoara, Romania, for providing us with the third proof.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Rotman, J.J. Advanced Modern Algebra; Prentice Hall: Saddle River, NJ, USA, 2003. [Google Scholar]
- Pop, V. Relations between ranks of matrix polynomials. J. Algebr. Number Theory Adv. Appl. 2021, 24, 35–41. [Google Scholar] [CrossRef] [Scilit]
- Horn, R.A.; Johnson, C.R. Matrix Analysis, 2nd ed.; Cambridge University Press: New York, NY, USA, 2013. [Google Scholar]
- Gantmacher, F.R. The Theory of Matrices; Chelsea Publishing Company: New York, NY, USA, 1960; Volume 1. [Google Scholar]
- Tian, Y.; Styan, G.P.H. When does rank(ABC)=rank(AB)+rank(BC)-rank(B) hold? Int. J. Math. Educ. Sci. Technol. 2002, 33, 127–137. [Google Scholar]
- Zhang, F. Matrix Theory. Basic Results and Techniques; Springer: New York, NY, USA, 2011. [Google Scholar]
- Brayman, V.; Kukush, A. Undergraduate Mathematics Competitions (1995–2016). Taras Shevchenko National University of Kyiv, 2nd ed.; Springer: New York, NY, USA, 2017. [Google Scholar]
- Băeţica, C.; Mincu, G.; Pop, V.; Todea, C.C. Traian Lalescu national mathematics contest for university students, 2019 edition. Gaz. Mat. Ser. 2019, 3–4, 22–35. [Google Scholar]
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. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).