Next Article in Journal
Maladaptive One-Leg Balance Control in Parkinson’s Disease
Previous Article in Journal
CODE: A Moving-Window-Based Framework for Detecting Concept Drift in Software Defect Prediction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Solution Set of the Yang-Baxter-like Matrix Equation for an Idempotent Matrix

1
College of Mathematics and Data Science (Software College), Minjiang University, Fuzhou 350108, China
2
School of Mathematical Sciences, Guizhou Normal University, Guiyang 550001, China
3
School of Mathematical Sciences, Xiamen University, Xiamen 361005, China
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(12), 2510; https://doi.org/10.3390/sym14122510
Submission received: 24 October 2022 / Revised: 12 November 2022 / Accepted: 22 November 2022 / Published: 28 November 2022

Abstract

:
Given a complex idempotent matrix A, we derive simple, sufficient and necessary conditions for a matrix X being a nontrivial solution of the Yang-Baxter-like matrix equation A X A   =   X A X , discriminating commuting solutions from non-commuting ones. On this basis, we construct all the commuting solutions of the nonlinear matrix equation.

1. Introduction

Nonlinear matrix equations arise in many scientific and engineering fields. Seeking their solutions is a difficult task [1]. In this paper, we are interested in solving the nonlinear matrix equation of the form
A X A   =   X A X
where A is a given nonzero complex matrix. Matrix Equation (1) is called the Yang-Baxter-like matrix equation (see [2,3,4,5,6,7,8,9]), termed YBME for short, since it originates from physics. Matrix Equation (1) has the same form as the well-known Yang–Baxter equation, which first arose in two independent papers by Yang [10] and Baxter [11]. Recently, Kumar et al. [12] investigated new solution sets for the Yang-Baxter-like matrix equation by using a class of generalized outer inverses of a matrix. Jiang et al. [13] proposed a zeroing neural network dynamical system approach for solving the time-varying Yang–Baxter matrix equation.
It is evident that YBME (1) is a symmetric matrix equation concerning a known matrix A and an unknown matrix X. Although YBME (1) looks simple in format, it is not easy to solve for a general matrix A since it is equivalent to solving a quadratic system of n 2 equations in n 2 variables. So far, only for a few matrices with a special structure (f.g. [2,3,4,5,6]) can all commutable solutions of Equation (1) be obtained, i.e., solutions satisfying A X   =   X A .
In this paper, our aim is to find all solutions of YBME (1) with an idempotent matrix A, that has already been provided in [5]. However, the idea of our approach is novel. We do not need to use and compute the Jordan canonical form of A as in some previous works, such as [2,3,4,5,6,7,8,9]. Our analysis and method to construct the solution set are based on simple sufficient and necessary conditions that we derive for a matrix to be a nontrivial solution of YBME (1). In particular, we construct all commuting solutions.
The rest of the paper is organized as follows. In Section 2, we present some properties of the idempotent matrices. In Section 3, we first derive simple sufficient and necessary conditions for a matrix being a nontrivial (commuting, non-commuting) solution of YBME (1), and then analyze and construct the set that contains all the (commuting, non-commuting) solutions of YBME (1). Finally, in Section 4, we provide an example.

2. Preliminaries

In this section, we first provide some properties of the idempotent matrices that are needed for our analysis later.
Let A be an n   ×   n idempotent matrix with rank r, satisfying A 2   =   A and r a n k ( A )   =   r . We assume that 0   <   r   <   n to avoid the two trivial cases A   =   0 or A   =   I . In fact, when A   =   0 , YBME (1) is zero. When A   =   I , YBME (1) reduces to X 2   =   X , whose solution is any idempotent matrix. That is to say, if we denote the set of all the solutions of the matrix for equation X 2   =   X as
S X 2 = X   =   { X     C n × n | X 2   =   X } ,
we know that S X 2 = X is the set of all the idempotent matrices of order n.
It is widely known that any square matrix A with rank r has the spectral decomposition in the form
A   =   U V T   =   u 1 v 1 T   +     +   u r v r T ,
where U   =   [ u 1 ,   ,   u r ] and V   =   [ v 1 ,     ,   v r ] are of full rank. For notational convenience, in the following, we will denote
U ˜   =   [ u r + 1 ,     ,   u n ] , V ˜ = [ v r + 1 ,     ,   v n ] ,
where u r + 1 ,     ,   u n and v r + 1 ,     ,   v n form the basis of the null space of U H and V H , respectively. Therefore, we have U H U ˜   =   0 and V H V ˜   =   0 .
Lemma 1.
Let A   =   U V H , where U and V are two n   ×   r ( r   <   n ) complex matrices of full column rank; then, A is a singular idempotent matrix if and only if V H U   =   I .
Proof. 
Since A 2   =   U ( V H U ) V H , A   =   U V H . Thus, A is an idempotent matrix if and only if V H U   =   I . □
According to Lemma 1, we easily verify that
S X 2 = X   =   { I }     { 0 }     S i d ,
where
S i d   =   { X   =   U V H | U , V     C n × r , r a n k ( U )   =   r a n k ( V )   =   r , V H U   =   I , 1     r     n     1 . } .
Now, we begin to find solutions of YBME (1) with an idempotent matrix.
Lemma 2.
Let A   =   U V H be an n   ×   n idempotent matrix with rank r, and let E be a r   ×   r matrix, then X   =   U E V H is a (commuting) solution of YBME (1) if and only if E is an ( r   ×   r ) idempotent matrix.
Proof. 
Let X   =   U E V H , notice that V H U   =   I . Thus we have
X A X   =   U E V H U V H U E V H   =   U E 2 V H , A X A   =   U V H U E V H U V H   =   U E V H .
So, X is a solution of YBME (1) if and only if E 2   =   E , i.e., E is an idempotent matrix. Further, since X A   =   U E V H U V H   =   U E V H , A X   =   U V H U E V H   =   U E V H , X commutes with A. □
Lemma 3.
Let A   =   U V H be an n   ×   n idempotent matrix with rank r, then for any ( n     r )   ×   ( n     r ) matrix F, X   =   V ˜ F U ˜ H is a commuting solution of YBME (1).
Proof. 
In fact, let X   =   V ˜ F U ˜ H , notice that U H U ˜   =   0 and V H V ˜   =   0 , so we have
X A   =   V ˜ F U ˜ H U V H   =   0 , A X   =   U V H V ˜ F U ˜ H   =   0 .
So, X is a commuting solution of YBME (1). □

3. All the Solutions

In this section, we find all the solutions X of YBME (1) with an idempotent matrix based on simple sufficient and the necessary conditions for a matrix being a nontrivial (commuting, non-commuting) solution. We first provide a lemma.
Lemma 4.
If A   =   U V H where U and V are two n   ×   r complex matrices of full rank such that V T U   =   I , then the two matrices
P   =   [ U , V ˜ ] , Q   =   [ V , U ˜ ]
are nonsingular.
Proof. 
To show the matrix P   =   [ U , V ˜ ] is nonsingular, we only need to show that the linear system P z   =   U x   +   V ˜ y   =   0 only has a zero solution. In fact, since V H U   =   I and V H V ˜   =   0 , we have V H P z   =   V H U x   +   V H V ˜ y   =   V H U x   =   x   =   0 . The linear system P z   =   0 becomes V ˜ y   =   0 . Further, since V ˜ is of full column rank, we derive from V ˜ y   =   0 that y   =   0 . So, P z   =   0 has only a zero solution; thus, P is nonsingular. Similarly, we can show that Q is nonsingular. □
Since P and Q, defined in (7), are nonsingular, we can easily show that for an arbitrary n   ×   n matrix X, there is an n   ×   n matrix Z such that
X   =   P Z Q H   =   [ U , V ˜ ] Z 1 Z 2 Z 3 Z 4 V H U ˜ H ,
where Z 1 , Z 2 , Z 3 and Z 4 are r   ×   r , r   ×   ( n     r ) , ( n     r )   ×   r and ( n     r )   ×   ( n     r ) matrices, respectively. Now, we present our main results.
Theorem 1.
Let A   =   U V H be an n   ×   n idempotent matrix with rank r, and X   =   P Z Q H , defined in (8), an n   ×   n complex matrix. Then, X is a solution of YBME (1) if and only if Z 1 , Z 2 , and Z 3 satisfy the following equations simultaneously:
Z 1 2   =   Z 1 , Z 1 Z 2   =   0 , Z 3 Z 1   =   0 , Z 3 Z 2   =   0 .
Proof. 
Notice that V H U   =   I , U ˜ H U   =   0 and V ˜ H V   =   0 , in a simple calculation lead to
X A X   =   X U V H X   =   P Z 1 Z 3 [ Z 1 , Z 2 ] Q H   =   P Z 1 2 Z 1 Z 2 Z 3 Z 1 Z 3 Z 2 Q H
and A X A   =   U V H X U V H   =   U Z 1 V H . Thus,
X A X     A X A   =   X U V H X     U V H X U V H   =   P Z 1 2     Z 1 Z 1 Z 2 Z 3 Z 1 Z 3 Z 2 Q H .
Notice that P and Q are nonsingular; therefore, X is a solution of YBME (1) if and only if Z 1 , Z 2 and Z 3 satisfy (9). □
In light of the previous result, note that the matrix Z 4 is completely arbitrary. In terms of Theorem 1, we can obtain all the solutions of YBME (1) by solving (9) for the matrices Z i ( i   =   1 , 2 , 3 ). Denote the solution set of (9) as
S Z ( Z 1 ,   Z 2 ,   Z 3 )   =   { ( Z 1 ,   Z 2 ,   Z 3 ) | Z 1 ,   Z 2 ,   Z 3 s a t i s f y ( 9 ) } ,
or equivalently,
S Z ( Z 1 ,   Z 2 ,   Z 3 )   =   { ( Z 1 ,   Z 2 ,   Z 3 ) | Z 1     S Z 1 2 = Z 1 , Z 1 Z 2   =   0 , Z 3 Z 1   =   0 , Z 3 Z 2   =   0 } .
In the following, we derive the set S Z ( Z 1 ,   Z 2 ,   Z 3 ) using the set S Z 1 2 = Z 1   =   { I }     { 0 }     S i d .
(i) If Z 1   =   I , then all the solutions of (9) are ( I ,   0 ,   0 ) .
(ii) If Z 1   =   0 , then all the solutions of (9) are { ( 0 ,   Z 2 ,   Z 3 ) ) | Z 3 Z 2   =   0 } .
(iii) If Z 1     S i d , then we can assume that Z 1   =   E F H k where E, and F are two r   ×   s matrices of full column rank such that F H E   =   I , s   =   1 ,   2 ,     ,   r     1 .
Let Z 2   =   F ˜ Y 2 and Z 3   =   Y 3 E ˜ H , where E ˜ , F ˜ are two r   ×   ( r     s ) matrices whose columns form the basis of the null space of E H and F H , respectively. Then, we have Z 1 Z 2   =   0 , Z 3 Z 1   =   0 for the arbitrary ( r     s )   ×   ( n     r ) matrix Y 2 and arbitrary ( n     r )   ×   ( r     s ) matrix Y 3 . Thus, when Z 1     S i d , we obtain the set of all the solutions of (9) is
{ ( Z 1   =   E F H ,   Z 2   =   F ˜ Y 2   ,   Z 3   =   Y 3 E ˜ H ) | Y 3 E ˜ H F ˜ Y 2   =   0 } .
So, we find that the set S Z ( Z 1 ,   Z 2 ,   Z 3 ) is
{ ( I ,   0 ,   0 ) }     { ( 0 ,   Z 2 ,   Z 3 ) ) | Z 3 Z 2   =   0 }     { ( Z 1   =   E F H , Z 2   =   F ˜ Y 2 , Z 3   =   Y 3 E ˜ H ) | Y 3 E ˜ H F ˜ Y 2   =   0 } .
Corollary 1.
Let A   =   U V H be an idempotent matrix with rank r; then, all the solutions of YBME (1) can be expressed as X   =   P Z Q H in (8), where ( Z 1 ,   Z 2 ,   Z 3 )     S Z ( Z 1 ,   Z 2 ,   Z 3 ) , and Z 4 are arbitrary.
For the commuting solutions of YBME (1), we have an optimal result.
Theorem 2.
Let A   =   U V H , where U and V are two n   ×   r complex matrices of full column rank such that V H U   =   I . Then, an n   ×   n complex matrix X is a commuting solution of YBME (1) if and only if
X   =   U E V H   +   V ˜ F U ˜ H ,
where E is any r   ×   r idempotent matrix, and F is any ( n     r )   ×   ( n     r ) matrix.
Proof. 
Sufficiency. Using Lemmas 2 and 3, we easily verify that when E is an idempotent matrix; for arbitrary F, X   =   U E V H   +   V ˜ F U ˜ H is a commuting solution of YBME (1).
Necessity. Let X   =   P Z Q H , where Z is partitioned as in (8). A simple calculation leads to
0   =   X A     A X   =   U [ Z 1     Z 1 ] V H   +   V ˜ Z 3 V H     U Z 2 U ˜ H   =   P 0 Z 2 Z 3 0 Q H ,
If X commutes with A   =   U V H , then since P, Q are nonsingular, we obtain Z 2   =   0 and Z 3   =   0 . Thus,
X   =   [ U , V ˜ ] Z 1 0 0 Z 4 V H U ˜ H   =   U Z 1 V H   +   V ˜ Z 4 U ˜ H
where Z 1 is an r   ×   r matrix, Z 4 is an ( n     r )   ×   ( n     r ) matrix.
To prove necessity, we still need to show that if X in (13) is a commuting solution of YBME (1), Z 1 must be an idempotent matrix.
In fact, let X   =   U Z 1 V H   +   V ˜ Z 4 U ˜ H ; we easily verify that X A X   =   U Z 1 2 V H , A X A   =   U Z 1 V H . Thus, it is clear that since X is assumed to be a solution of YBME (1), Z 1 needs to be an idempotent matrix. Let E   =   Z 1 and F   =   Z 4 , whereby the necessity is proved. □
Remark 1.
Theorem 2 can be seen as a corollary of Theorem 1, and Lemmas 1 and 2 are corollaries of Theorem 2.

4. An Illustration Example

We provide an example to illustrate the process of constructing the solution set of YBME (1).
Example 1.
(see [5]) Let
A   =   1 3 2 1 1 1 2 1 1 1 2 .
We easily obtain a spectral decomposition of A: A   =   U V H with U   =   1 3 1 1 1 0 0 1 and V H   =   1 2 1 1 1 2 . Since V H U   =   I , we know that A is an idempotent matrix of rank 2.
A simple calculation leads to U ˜ H   =   ( 1 , 1 , 1 ) and V ˜ H   =   ( 1 , 1 , 1 ) .
Using Corollary 1, all the solutions of YBME (1) are
X   =   1 3 1 1 1 1 0 1 0 1 1 E f g H α 1 2 1 1 1 2 1 1 1
where α is an arbitrary number, E is a 2   ×   2 matrix, and f , g are 2-dimensional vectors. ( E ,   f ,   g H ) is in the set
{ ( I ,   0 ,   0 ) }     { ( 0 ,   f ,   g H ) ) | g H f   =   0 }     { ( E   =   a b H ,   f   =   β b ˜ ,   g H   =   γ a ˜ H ) | β γ a ˜ H b ˜   =   0 } .
In the above set, a ,   b are any two 2-dimensional vectors satisfying b H a   =   1 . a ˜ , b ˜ are two 2-dimensional vectors satisfying a H a ˜   =   0 , b H b ˜   =   0 . β , γ are numbers.
According to Theorem 2, all the commuting solutions of YBME (1) are as follows:
X   =   1 3 1 1 1 0 0 1 E 1 2 1 1 1 2   +   1 1 1 α ( 1 , 1 , 1 )
where α is an arbitrary complex number, E is any 2   ×   2 idempotent matrix, that is, E     S E 2   =   E   =   { I }     { 0 }     S i d . Here, more specifically, E     S i d means that E   =   a b H , and a , b are arbitrary 2-dimensional vectors satisfying b H a   =   1 .

Author Contributions

Conceptualization, X.X., L.L. and Q.L.; methodology, X.X. and L.L.; original draft preparation and editing, X.X. and Q.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research supported by National Natural Science Foundation of China Nos.12161020, 12061025, and Natural Science Foundation of Educational Commission of Guizhou Province under Grant Qian-Jiao-He KY Zi [2020]298.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Lu, L.Z. Solution form and simple iteration of a nonsymmetric algebraic Riccati equation arising in transport theory. SIAM J. Matrix Anal. Appl. 2005, 26, 679–685. [Google Scholar] [CrossRef]
  2. Tian, H. All solutions of the Yang-Baxter-like matrix equation for rank-one matrices. Appl. Math. Lett. 2016, 51, 55–59. [Google Scholar] [CrossRef]
  3. Zhou, D.M.; Chen, G.L.; Ding, J. Solving the Yang-Baxter-like matrix equation for rank-two matrices. J. Comput. Appl. Math. 2017, 313, 142–151. [Google Scholar] [CrossRef]
  4. Zhou, D.M.; Chen, G.L. On the Yang-Baxter-like matrix equation for rank-two matrices. Open Math. 2017, 15, 340–353. [Google Scholar] [CrossRef]
  5. Mansour, S.I.A.; Ding, J.; Huang, Q. Explicit solutions of the Yang-Baxter-like matrix equation for an idempotent matrix. Appl. Math. Lett. 2017, 63, 71–76. [Google Scholar] [CrossRef]
  6. Lu, L.Z. Manifold expressions of all solutions of the Yang-Baxter-like matrix equation for rank-one matrices. Appl. Math. Lett. 2022, 132, 108175. [Google Scholar] [CrossRef]
  7. Ding, J.; Zhang, C.; Rhee, N.H. Further solutions of a Yang-Baxter-like matrix equation. East Asian J. Appl. Math. 2013, 3, 352–362. [Google Scholar] [CrossRef]
  8. Ding, J.; Rhee, N.; Zhang, C. Commuting solutions of the Yang-Baxter matrix equation. Appl. Math. Lett. 2015, 44, 1–4. [Google Scholar] [CrossRef]
  9. Dong, Q.; Ding, J. Complete Commuting solutions of the Yang-Baxter-like matrix equation for diagonalizable matrices. Comput. Math. Appl. 2016, 72, 194–201. [Google Scholar] [CrossRef]
  10. Yang, C.N. Some exact results for the many-body problem in one dimension with repulsive delta-function interaction. Phys. Rev. Lett. 1967, 19, 1312–1315. [Google Scholar] [CrossRef]
  11. Baxter, R.J. Partition function of the eight-vertex lattice model. Ann. Phys. 1972, 70, 193–228. [Google Scholar] [CrossRef]
  12. Kumar, A.; Mosić, D.; Stanimirović, P.S.; Singh, G.; Kazakovtsev, L.A. Commuting Outer Inverse-Based Solutions to the Yang-Baxter-like Matrix Equation. Mathematics 2022, 10, 2738. [Google Scholar] [CrossRef]
  13. Jiang, W.; Lin, C.L.; Katsikis, V.N.; Mourtas, S.D.; Stanimirović, P.S.; Simos, T.E. Zeroing Neural Network Approaches Based on Direct and Indirect Methods for Solving the Yang-Baxter-like Matrix Equation. Mathematics 2022, 10, 1950. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Xu, X.; Lu, L.; Liu, Q. Solution Set of the Yang-Baxter-like Matrix Equation for an Idempotent Matrix. Symmetry 2022, 14, 2510. https://doi.org/10.3390/sym14122510

AMA Style

Xu X, Lu L, Liu Q. Solution Set of the Yang-Baxter-like Matrix Equation for an Idempotent Matrix. Symmetry. 2022; 14(12):2510. https://doi.org/10.3390/sym14122510

Chicago/Turabian Style

Xu, Xiaoling, Linzhang Lu, and Qilong Liu. 2022. "Solution Set of the Yang-Baxter-like Matrix Equation for an Idempotent Matrix" Symmetry 14, no. 12: 2510. https://doi.org/10.3390/sym14122510

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop