Generalization of Roth's solvability criteria to systems of matrix equations
Andrii Dmytryshyn, Vyacheslav Futorny, Tetiana Klymchuk, Vladimir V., Sergeichuk

TL;DR
This paper extends Roth's classical solvability criterion for matrix equations to complex and quaternion matrix systems, providing new conditions for the existence of solutions in these broader contexts.
Contribution
The paper generalizes Roth's criterion to systems involving complex conjugation and quaternion matrices, broadening the applicability of solvability conditions for matrix equations.
Findings
Extended Roth's criterion to complex conjugate matrix systems
Established solvability conditions for quaternion matrix equations
Unified framework for real, complex, and quaternion matrix equations
Abstract
W.E. Roth (1952) proved that the matrix equation has a solution if and only if the matrices and are similar. A. Dmytryshyn and B. K{\aa}gstr\"om (2015) extended Roth's criterion to systems of matrix equations with unknown matrices , in which every is , , or . We extend their criterion to systems of complex matrix equations that include the complex conjugation of unknown matrices. We also prove an analogous criterion for systems of quaternion matrix equations.
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.
Generalization of Roth’s solvability criteria to systems of matrix equations††thanks: Linear Algebra Appl. 527 (2017) 294–302.
Andrii Dmytryshyn, Department of Computing Science,
Umeå University, Umeå, Sweden; [email protected]
Vyacheslav Futorny, Department of Mathematics,
University of São Paulo, Brazil; [email protected]
Tetiana Klymchuk, Universitat Politècnica de Catalunya,
Barcelona, Spain; Taras Shevchenko National University,
Kiev, Ukraine; [email protected]
Vladimir V. Sergeichuk, Institute of Mathematics,
Kiev, Ukraine, [email protected]
Abstract
W.E. Roth (1952) proved that the matrix equation has a solution if and only if the matrices and are similar. A. Dmytryshyn and B. Kågström (2015) extended Roth’s criterion to systems of matrix equations with unknown matrices , in which every is , , or . We extend their criterion to systems of complex matrix equations that include the complex conjugation of unknown matrices. We also prove an analogous criterion for systems of quaternion matrix equations.
AMS classification: 15A24
Keywords: Systems of matrix equations, Sylvester equations, Roth’s criteria
1 Introduction
Roth [13] proved that the matrix equation (respectively, ) over a field has a solution if and only if the matrices and are similar (respectively, equivalent); see also [8, Section 4.4.22] and [10, Section 12.5].
Dmytryshyn and Kågström [4, Theorem 6.1] extended Roth’s criteria to the system of generalized Sylvester equations
[TABLE]
with unknown matrices over a field of characteristic not 2 with a fixed involution, in which every is either , or , or . Most of the known generalizations of Roth’s criteria are special cases of their criterion. The first author was awarded the SIAM Student Paper Prize 2015 for the paper [4].
However, Dmytryshyn and Kågström [4] do not consider complex matrix equations that include the complex conjugate of unknown matrices. The theory of such equations and their applications to discrete-time antilinear systems are presented in Wu and Zhang’s new book [17]. Bevis, Hall, and Hartwig [1] proved that the complex matrix equation has a solution if and only if the matrices and are consimilar (i.e., for some nonsingular ).
We extend Dmytryshyn and Kågström’s criterion to a large class of matrix equations that includes the systems
[TABLE]
- •
of complex matrix equations, in which , where is the complex conjugate matrix and is the complex adjoint matrix, and
- •
of quaternion matrix equations, in which , where is the quaternion adjoint matrix.
We prove our criterion by methods of [4] (see also [6, 15, 16]), though our exposition is self-contained and uses only elementary linear algebra.
Note that the system of matrix equations (1) over a field can be rewritten as a system of linear equations, which gives another criterion of solvability for (1): it has a solution if and only if . However, the system is large and can be ill-conditioned.
Special cases of the system (1) are considered in hundreds of articles and books. For recent results related to solvability criteria we refer the reader to [2, 3, 4, 5, 7, 14, 17] and the references given there. A survey of papers on Roth’s criteria and their generalizations is given in the extended introduction to [7]. A quaternion linear algebra is presented in [12], in which quaternion matrix equations are considered in Chapters 5 and 14.
2 Main results
Let be a skew field (which can be a field). An involutory automorphism of is a bijection of onto itself, satisfying
[TABLE]
An involutory anti-automorphism of is a bijection , satisfying
[TABLE]
For example, the complex conjugation is an involutory automorphism and involutory anti-automorphism of ; the quaternion conjugation is an involutory anti-automorphism of .
The following theorem is proved in Section 3.
Theorem 1**.**
Given
- •
a skew field of characteristic not 2 that is finite dimensional over its center,
- •
an involutory automorphism possible, the identity and an involutory anti-automorphism of possible, the identity if is a field,
- •
a system
[TABLE]
of matrix equations over with unknown matrices , in which all , , and
[TABLE]
for each matrix over ;
the system (2) has a solution if and only if there exist nonsingular matrices over such that
[TABLE]
in which
[TABLE]
If all in (2), then the condition “ of characteristic not 2” in Theorem 1 can be omitted; see Lemma 1.
The conditions (3) on the block matrices from Theorem 1 are all given in the same style using (4). In the following remark, we give these conditions more explicitly for each of four possible cases.
Remark 1*.*
For each , the equality (3) in Theorem 1 can be rewritten in the form:
[TABLE]
Corollary 1**.**
- (a)
Over , the system (2) with has a solution if and only if (3) holds for some nonsingular real matrices , and is used instead of in (4).
- (b)
Over , the system (2) with has a solution if and only if (3) holds for some nonsingular complex matrices . Here is the complex conjugate matrix, is the complex adjoint matrix. The symbol is used instead of in (4).
- (c)
Over , the system (2) with has a solution if and only if (3) holds for some nonsingular quaternion matrices . Here
[TABLE]
for each quaternion , and
[TABLE]
for each quaternion matrix .
Note that each involutory automorphism of is either the identity, or in a suitable set of orthogonal imaginary units , see [9, Lemma 1]; and each involutory anti-automorphism of is either , or in a suitable set of orthogonal imaginary units, see [12, Theorem 2.4.4(c)].
Theorem 2**.**
Let be a skew field of characteristic not that is finite dimensional over its center. The system (1) over , in which all and are as in Theorem 1, has a solution if and only if there exist nonsingular matrices over satisfying the following equalities:
[TABLE]
Proof (assuming that Theorem 1 holds).
Define from (1) the system of matrix equations
[TABLE]
with unknown matrices . If the system (1) has a solution , then (6) has the solution , in which all and . Thus, the system (1) has a solution if and only if (6) has a solution. By Theorem 1, the system (6) has a solution if and only if (5) holds for some nonsingular matrices . ∎
3 The proof of Theorem 1
The following lemma proves Theorem 1 if all .
Lemma 1**.**
Let be a skew field that is finite dimensional over its center. Let be an involutory automorphism of which can be the identity. Let
[TABLE]
be a system of matrix equations over with unknown matrices , in which all . Then the system (7) has a solution if and only if there exist nonsingular matrices such that
[TABLE]
Proof.
. If is a solution of (7), then (8) holds for
[TABLE]
. Suppose there are nonsingular matrices of sizes satisfying (8). Then
[TABLE]
Denote by the center of (which coincides with if is a field). For and any , , and so . Hence is an automorphism of of order 1 or 2. By [11, Chapter VI, Theorem 1.8], the index of the subfield in is 1 or 2. Since is finite dimensional over its center, is also finite dimensional over .
Thus, the set in (10) is a finite dimensional vector space over . Define its subspaces
[TABLE]
Let the matrices of every
[TABLE]
be partitioned into 4 blocks such that each has the same size as (compare with (9)). Define the -linear mappings () as follows:
[TABLE]
Then
[TABLE]
Fact 1:
Indeed, for the -tuple (10) from and for every , we have
[TABLE]
Hence is a -linear bijection , which proves Fact 1.
Fact 2:
A -tuple belongs to if and only if
[TABLE]
if and only if
[TABLE]
if and only if .
Fact 3:
For each
[TABLE]
there exist such that
[TABLE]
which means that
[TABLE]
Then
[TABLE]
and so which proves Fact 3.
By (11) and Facts 1–3, . Since , . Hence there are such that
[TABLE]
which means that
[TABLE]
Equating the blocks in (12), we get Thus, is a solution of the system (7). ∎
Proof of Theorem 1.
. If is a solution of (2), then the equalities (3) hold for defined in (9).
. Suppose there are nonsingular matrices satisfying (3). We consider the set as the abelian group with multiplication
[TABLE]
that corresponds to the compositions of the matrix mappings , .
Represent (3) in the form
[TABLE]
in which and are such that and . Applying to (13) and multiplying each factor by on the left and by on the right, we get
[TABLE]
Using
[TABLE]
and (4), we rewrite (14) as follows:
[TABLE]
The equalities (13) and (15) and Lemma 1 ensure the solvability of the system formed by matrix equations
[TABLE]
() with unknown matrices . Let be its solution. Substituting these matrices to (16) and applying to the right equalities, we get
[TABLE]
Adding the left and right equalities, we obtain
[TABLE]
Write for . Then . By (17),
[TABLE]
Therefore, is a solution of the system (2). ∎
Acknowledgements
A. Dmytryshyn was supported by the Swedish Research Council (VR) grant E0485301, and by eSSENCE, a strategic collaborative e-Science programme funded by the Swedish Research Council. V. Futorny was supported by CNPq grant 301320/2013-6 and FAPESP grant 2014/09310-5. V.V. Sergeichuk was supported by FAPESP grant 2015/05864-9.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J.H. Bevis, F.J. Hall, R.E. Hartwig, The matrix equation A X ¯ − X B = C 𝐴 ¯ 𝑋 𝑋 𝐵 𝐶 A\bar{X}-XB=C and its special cases, SIAM J. Matrix Anal. Appl. 9 (1988) 348–359.
- 2[2] F. De Terán, F.M. Dopico, Consistency and efficient solution of the Sylvester equation for ⋆ ⋆ \star -congruence, Electron. J. Linear Algebra 22 (2011) 849–863.
- 3[3] A. Dmytryshyn, Structure preserving stratification of skew-symmetric matrix polynomials, Report UMINF 15.16, Dept. of Computing Science, Umeå University, Sweden, 2015.
- 4[4] A. Dmytryshyn, B. Kågström, Coupled Sylvester-type matrix equations and block diagonalization, SIAM J. Matrix Anal. Appl. 36 (2015) 580–593.
- 5[5] G.-R. Duan, Generalized Sylvester Equations. Unified Parametric Solutions, CRC Press, Boca Raton, FL, 2015.
- 6[6] H. Flanders, H.K. Wimmer, On the matrix equations A X − X B = C 𝐴 𝑋 𝑋 𝐵 𝐶 AX-XB=C and A X − Y B = C 𝐴 𝑋 𝑌 𝐵 𝐶 AX-YB=C , SIAM J. Appl. Math. 32 (1977) 707–710.
- 7[7] V. Futorny, T. Klymchuk, V.V. Sergeichuk, Roth’s solvability criteria for the matrix equations A X − X ^ B = C 𝐴 𝑋 ^ 𝑋 𝐵 𝐶 AX-\widehat{X}B=C and X − A X ^ B = C 𝑋 𝐴 ^ 𝑋 𝐵 𝐶 X-A\widehat{X}B=C over the skew field of quaternions with an involutive automorphism q ↦ q ^ maps-to 𝑞 ^ 𝑞 q\mapsto\hat{q} , Linear Algebra Appl. 510 (2016) 246–258.
- 8[8] R.A. Horn, C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, 1991.
