Three New Proofs of the Theorem rank f ( M ) + rank g ( M ) = rank ( f , g )( M ) + rank [ f , g ]( M )

: It is well known that in C [ X ] , 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.


Introduction
In an euclidean ring (A, +, •), for any elements a, b ∈ A, there exists the greatest common divisor d = (a, b) ∈ A and there exists the least common multiple m = [a, b] ∈ A. For the rings (Z, +, •) and (C[X], +, •), the relation a • b = d • m is well known (see [1] [p. 150]).By C[X], 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 f , g ∈ C[X] and for any matrix M ∈ M n (C), the following relation holds: where d := ( f , g) denotes the greatest common divisor and m := [ f , g] denotes the lowest common multiple of the polynomials f , g.
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.

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).
For the other cases, we have where σ f (λ) is the order of multiplicity of the λ for the polynomial f (i.e., f (λ Using Theorem 2 (i)-(iv), proving equality (1) is reduced to proving the following relation: for any J λ Jordan cell of M.
Let λ be an eigenvalue of the matrix M and J λ the corresponding Jordan cell.With the above notations, and .
By Theorem 2 (vi), to prove equality (2), we discuss the following three cases.
As a consequence, we have We also consider the matrices A, B, C ∈ M n (C) such that We deduce that 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.Thus, the equality to be demonstrated is reduced to showing that there are two matrices, X, Y ∈ M n (C), such that which is an immediate consequence of the following theorem (see [1] (Theorem 3.31, p. 135)).Theorem 4. If K is a field, f , g ∈ K[X], and d is their greatest common divisor, then there are Indeed, we can choose X = φ 1 (M) and Y = φ 2 (M), 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 rank(AB) + rank(BC) = rank(B) + rank(ABC), 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 A, B ∈ M n (C), the following relation holds: If, in relation ( 4), we replace B with BC, we obtain Subtracting relation ( 5) from ( 4), we obtain Since Im(BC) ⊂ Im B, we obtain the well-known Frobenius inequality rank(AB) + rank(BC) ≤ rank B + rank(ABC), (7) 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 ( f 1 , g 1 ) = 1, there exist two polynomials, By multiplying in the last relation by x and taking into account that x ∈ Ker( f 1 (M)), we obtain 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).Proof.First, we show that S is a tripotent matrix.Indeed, we have If we consider in Theorem 1 the polynomials f = x and g = x 2 − 1, for which d = 1 and m = x 3 − x, we obtain that rank S + rank S 2 − I n = n + rank S 3 − S ; thereby, taking into account that the matrix S is tripotent, we deduce that rank S + rank S 2 − I n = n.
If we consider in Theorem 1 the polynomials f = x − 1 and g = x + 1, for which d = 1 and m = x 2 − 1, we obtain that rank(S − I n ) + rank(S + I n ) = n + rank S 2 − I n , so rank S 2 − I n = rank(S − I n ) + rank(S + I n ) − n 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 a ∈ C, with a ̸ = 0, n ≥ 2, and A ∈ M n (C).Then, Proof.If we consider in Theorem 1 the polynomials f = x and g = a − x, for which d = 1 and m = ax − x 2 , we obtain that rank A + rank(aI n − A) = rank I n + rank aA − A 2 , 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 f 1 , f 2 , . . ., f m ∈ K[X] be polynomials and A ∈ M n (K).Let f i 1 , f i 2 , . . . ,f i p denote the greatest common divisor of polynomials f i 1 , f i 2 , . . ., f i p (the maximum-degree monic polynomial that divides all polynomials f i 1 , f i 2 , . . ., f i p ) and f i 1 , f i 2 , . . ., f i p denote the lowest common multiple of the polynomials f i 1 , f i 2 , . . ., f i p (the minimum-degree monic polynomial that is a multiple of all polynomials f i 1 , f i 2 , . . ., f i p ).Then,

Theorem 3 .
Let A ∈ M m,n (C), B ∈ M n,k (C), and C ∈ M k,l (C) be given.Then, the following three statements are equivalent: (a) rank O AB BC B = rank(AB) + rank(BC); (b) rank(ABC) = rank(AB) + rank(BC) − rank(B); (c) there are X and Y such that BCX + YAB = B.

Proposition 1 .
Let A, B, C, and D be n × n real matrices such that A T = BCD, B T = CDA, C T = DAB, and D T = ABC.We denote S = ABCD.Then, rank S + rank(S − I n ) + rank(S + I n ) = 2n.