ABSTRACT
This paper deals with left star, star, and core partial orders for complex matrices. For each partial order, we present an order-isomorphism between the down-set of a fixed matrix B and a certain set (depending on the partial order) of orthogonal projectors whose matrix sizes can be considerably smaller than that of the matrix B. We study the lattice structure and we give properties of the down-sets. We prove that the down-set of B ordered by the core partial order and by the star partial order are sublattices of the down-set ordered by the left star partial order. We analize the existence of supremum and infimum of two given matrices and we give characterizations of these operations (whenever they exist). Some of the results given in the paper are already known in the literature but we present a different proof based on the previously established order-isomorphism.
AMS SUBJECT CLASSIFICATIONS:
1. Introduction and preliminaries
The set of complex matrices is denoted by . The conjugate transpose, range, and rank of are denoted by , , and , respectively. The identity matrix of order is denoted by and zero matrices are denoted simply by O.
For each , there exists a unique matrix such that AX and XA are Hermitian, AXA = A, and XAX = X, which is called the Moore-Penrose inverse of A and it is denoted by . We denote by the set of all complex matrices that have index at most 1, that is, . If then there exists a unique matrix that satisfies and , which is called the core inverse of A and it is denoted by . For further properties and applications of these inverses we refer the reader to [Citation1–9].
This paper deals with some matrix partial orders. Specifically, with the star and the left star partial orders defined on the set of square complex matrices, and with the core partial order defined on the set . The star partial order was introduced by Drazin in [Citation10] and it has been studied since then by numerous authors. The left star partial order was introduced by Baksalary and Mitra in [Citation11]. Finally, the core partial order was introduced more recently by Baksalary and Trenkler in [Citation1]. For any , let us recall that (see, for example, [Citation12–14]):
the left star partial order is defined by: if and only if (or equivalently, and );
the star partial order is defined by: if and only if and (or equivalently, and );
the core partial order is defined by: if and only if and (or equivalently, and ).
Let Q and R be two posets. It is said that a map is order-preserving if holds in R whenever holds in Q. We say that Q and R are (order-)isomorphic if there exists a bijection ϕ from Q to R such that both ϕ and are order-preserving. In that case, ϕ is called an order-isomorphism.
The aim of this paper is to study the down-sets for each and a fixed matrix B. If then it is required that B and all the matrices in have index at most 1 accordingly. The structure and properties of these down-sets were studied by other authors for rectangular matrices and for the wider case of bounded linear Hilbert space operators. For the case of the left star partial order, was studied by Cırulis in [Citation16] where it was proved that is a complete orthomodular lattice. Antezana et al. studied in [Citation17] the star partial order on bounded operators on a Hilbert space. In particular, from their results, it can be deduced that is a lattice. Finally, in [Citation18], Djikić proved that is also a lattice.
Our approach to the study of is different from the authors abovementioned. In this paper, we prove that is order-isomorphic to a certain ordered set (depending on the partial order we are dealing with) of orthogonal projectors. Our starting point is the characterization given in [Citation19] of matrices which are below a given matrix B by using a Hartwig-Spindelböck decomposition of B. More precisally, given (or in for ), where and the r positive singular values of B are ordered in decreasing order, we consider a Hartwig-Spindelböck decomposition of B (see [Citation20]) given by (1) (1) where is unitary, , and and satisfy (note that L is absent when ). It is worth mentioning that this decomposition always exists but it is not necessarily unique, and that if and only if K is nonsingular. The predecessors of B are characterized as follows.
Theorem 1.1
[Citation19, Theorems 4, 8, 16]
Let (or for ) be a nonzero matrix written as in (Equation1(1) (1) ). The following conditions are equivalent.
(1) | There exists a matrix (where for ) such that . | ||||
(2) | There exists a unique matrix such that (2) (2) where and the following conditions hold depending on the partial order:
|
According to Theorem 1.1, we define the following posets that play a crucial role in this paper.
Definition 1.2
Let (or for ) be a nonzero matrix written as in (Equation1(1) (1) ), let
,
, and
,
This last relation will be used indistinctly over any of the aformentioned sets.
It is easy to see that implies for any . Note that the set is the set of all orthogonal projectors in . It is well-known that if and are orthogonal projectors in and we consider the partial order ≤ defined above then is an orthomodular lattice (see [Citation21, Propositions 1, 2] and [Citation16]) where, for any , we have that and the complement of T is By Theorem 1.1, for any , we clearly have a bijection defined by for every and T given as in Theorem 1.1. Furthermore, we prove in Section 2 that ϕ is an order-isomorphism. Taking advantage of this order-isomorphism, we study the ordered structure of by means of the poset . Matrices are orthogonal projectors and, in addition, it can be proved that the Moore-Penrose inverse and the core inverse of T are both equal to T. Moreover, all of them belong to (instead of ), with where r can be considerably smaller than n. So, working with the matrices is easier than using the matrices A and this fact brings significant advantages.
In Section 3 we investigate the lattice properties of . One of our main goals is to show that there exists a relation between , , and . More precisally, based on the order-isomorphism proved in Section 2, we show that , for each x, is a lattice; and that and are sublattices of . In addition, we find properties of , for each partial order. We show that and are orthomodular lattices whose subchains (that is, a subset for which every pair of elements are comparable) are all finite. We give a necessary and sufficient condition for to be distributive. We show that if is distributive then it is a Boolean algebra. Eagambaram et al. showed in [Citation22] that is a finite lattice if and only if all the positive singular values of B are pairwise distinct. We improve this result by showing that, in that case, not only is a finite lattice but also a Boolean algebra. Additionally, we derive its cardinality. For the left star and the star partial orders, we prove that if then and are order-isomorphic. Assuming that , an analogous result is obtained for the core partial order.
As a last application of the order-isomorphism ϕ, we study the supremum and the infimum of two given matrices in (or in for the core partial order). Xu et al. proved in [Citation23] that there exists the star supremum of and if and only if and have a common upper bound. Moreover, an explicit representation of the supremum was established (whenever it exists). In [Citation24], Hartwig gave necessary and sufficient conditions for the existence of the star supremum in rings with involution and found an expression for that supremum. Later, Djikić gave in [Citation25] a simple necessary and sufficient condition for the existence of the star supremum for two operators on a Hilbert space. Recently, Djikić proved in [Citation18] a similar result to that by Xu et al., for the core partial order by giving necessary and sufficient conditions for the existence of the core supremum in a Hilbert space. In Section 4, we use the order-isomorphism ϕ to present a different proof from those given by Hartwig, Xu et al. and Djikić. Our proof is also valid for the left star partial order. In addition, we compute the supremum (whenever it exists) by means of the same expression for the three orders. Finally, we analyse the infimum of two arbitrary matrices. Hartwig and Drazin proved in [Citation21] that the set of matrices endowed with the star partial order is a lower semilattice, i.e. for every pair of matrices and , there exists . The set of matrices that have index at most 1 endowed with the core partial order is also a lower semilattice (see [Citation18]). In Section 4, we compute the infimum of two matrices that have a common upper bound by means of the same expression for the three orders. We would like to highlight that the expressions for the infimum and supremum of two matrices in that we provide are different from those given in [Citation16].
If two matrices B (written as in (Equation1(1) (1) )) and C do not have a common upper bound, we find an expression of the type (Equation2(2) (2) ) for the infimum and the conditions that the associated orthogonal projectors must satisfy.
2. Isomorphic representation of down-sets
From now on, x will refer to any of the three partial orders we are dealing with, that is, . In the case that , without mentioning it explicitly, we will regard the matrices to be in .
In this section we state the order-isomorphism between and . In order to do that, for a fixed a Hartwig-Spindelböck decomposition of B, we consider the posets and the bijection defined by given in Section 1. Note that if then ; O is the least element and is the greatest element of . More precisely, we should denote ϕ by because this map depends on matrices Σ and K of the decomposition used to factorize the matrix B. However, to simplify the notation, from now on, we simply denote it by ϕ.
Theorem 2.1
The posets and are order-isomorphic. Moreover, the function rank is preserved under the order-isomorphism ϕ.
Proof.
Let us first prove that ϕ is order-preserving. For that, let both written as in (Equation2(2) (2) ), and . From and taking into account that , we have that Hence we obtain the following system (3) (3) (4) (4) (5) (5) (6) (6) Post-multiplicating (Equation3(3) (3) ) and (Equation4(4) (4) ) by and , respectively, and then adding both equations we obtain since . Consequently, (7) (7) Similarly, from (Equation5(5) (5) ) and (Equation6(6) (6) ) we obtain (8) (8) Pre-multiplying (Equation7(7) (7) ) and (Equation8(8) (8) ) by K and L respectively, and then adding we have and this means that .
Let us suppose now that with . By and , it is straightforward to see that . To prove that , we consider each partial order separately.
Consider first the star partial order. Then, Since both and commute with Σ, we have that . Thus, . Hence, .
Consider now . From [Citation19, Lemma 14], we know that since Σ is nonsingular. Then, . From [Citation19, Lemma 3], we also know that . Now, taking into account this fact, it is easy to see that . So, .
Finally, we consider the core partial order. From and we have and Then follows. So, .
We have proved that is order-isomorphic to , for every x.
In order to see that ϕ preserves the rank function, we observe that if and , then
Remark 2.1
By using a Schur's factorization of the matrix , we have that there exists a unitary matrix V and an upper triangular matrix S such that . It can be proved that the sets and , ordered by ≤, are order-isomorphic by using the map defined by . In practice, examples can be constructed more easily with a such matrix S instead of using .
Remark 2.2
Assume and . It is easy to see that and so the maximum length of any subchain in is . Moreover, if and we consider the projectors where for each , it is straightforward to see that , , and . Then, we obtain a chain with r + 1 elements of maximum length.
Lemma 2.2
Let . If is order-isomorphic to then . Moreover, if then is order-isomorphic to .
Proof.
Let us suppose that . Then, by using Remark 2.2, we can construct a chain in of length and this contradicts the maximum length of a chain in . The second statement is immediate from Theorem 2.1.
Remark 2.3
For each :
if , then . Hence, is a chain with two elements.
if , then for each ; so every distinct are incomparable and thus has the aspect presented in Figure .
3. Lattice structure of
In this section we investigate the lattice structure of for each x by using the order-isomorphism ϕ. We prove that and are sublattices of . For each x, we analyse the structure of . We show that and are orthomodular lattices whose subchains are all finite. In addition, we give a necessary and sufficient condition for to be distributive. We also state that if is distributive then it is a Boolean algebra. Finally, we give necessary and sufficient conditions for to be a finite Boolean algebra.
For the left star and the star partial order, we prove that if then and are order-isomorphic. An analogous result is obtained for the core partial order, provided that holds.
We start giving the infimum and the supremum of two matrices in the segment for the case in which their associated orthogonal projectors commute.
Proposition 3.1
Let such that . Then and .
Proof.
It is clear that and it is well-known that is the infimum of and in (see [Citation16]). In addition, if , then ; and if , then . So, in for all x.
It is also known that if and commute then (see [Citation16]). In addition, if , then ; and if , then . Therefore, for every x.
As an immediate consequence of the above result and the fact that ϕ is an order-isomorphism we have the following result.
Corollary 3.2
Let be written as in (Equation2(2) (2) ) such that , where for every . Then:
(a) | and | ||||
(b) | . |
We now investigate separately for each order.
3.1. Left star partial order
In this section we show that is an orthomodular lattice of finite height and nondistributive provided that . It is worth mentioning that the fact that is an orthomodular lattice was proved by Cırulis in [Citation16] for the more general case of a bounded operator X over a complex Hilbert space H, by setting an isomorphism between every down-set of the set of all bounded linear operators over H and the down-set of projectors where is the projector onto the closure of the range ( for ). Our proof is based on the order-isomorphism ϕ and the advantage of this technique is that allows us to work with orthogonal projectors whose sizes can be considerably smaller than those of matrix B itself.
Our first objective is to show that is a nondistributive lattice if . In order to do that, we have to observe that is exactly the set of all orthogonal projectors. So, we only need to find an example where the distributive property does not hold and this example will serve in general.
Example 3.3
Let B be any matrix in such that and such that for every , where , , and . Let us see that . Indeed, by Proposition 3.1, . On the other hand, by Remark 2.3, , since , for each .
Since is an orthomodular lattice (see [Citation16]), by Theorem 2.1, is an orthomodular lattice too and, by considering a rank argument, it is clear that all its subchains are finite. In this case, it is said that the lattice has finite height. We summarize these reasonings in the following theorem.
Theorem 3.4
If then is an orthomodular lattice of finite height. In addition, if then is nondistributive.
Remark 3.1
Let be written as in (Equation2(2) (2) ), where for each . Then:
and
.
Remark 3.2
If then is an infinite lattice. For example, if , with a in the real interval , , and , then .
Note also that if A is any matrix such that and then, in general, is an infinite lattice order-isomorphic to the one given in Figure .
Remark 3.3
Let be orthogonal projectors such that and TQ = O. It is easy to see that PQ = O.
Lemma 3.5
Let . If then and are order-isomorphic. In particular, if then and are order-isomorphic.
Proof.
Assume that and set such that , for each . If P satisfies , by and Remark 3.3, we have that . Moreover, . It is easy to see that is idempotent, Hermitian, and . Now, again from , we have that and then ; i.e. . Thus, the map given by is well-defined. Let us prove that φ is an order-isomorphism. Indeed, let and . Since , we get and . Thus, φ is surjective. Let . Since and , we have if and only if , that is equivalent to , which simplifies to , that is, . Then, φ is an order-isomorphism.
The second statement follows by setting and .
Lemma 3.5 allows us to realize the complexity of the down-set when . For instance, if we choose a matrix A such that then the Figure will appear repeated at the top (down-set ) and at the bottom (down-set ) of the Hasse diagram of the whole down-set .
3.2. Star partial order
We now need the following technical result.
Lemma 3.6
[Citation3, Theorem 1.4.2]
Let and . Then if and only if and .
Theorem 3.7
If then is a sublattice of .
Proof.
It is immediate that . Then .
Let . We know that and exist in . Now we prove that . By Theorem 3.4, and exist in . So, we only need to see that and .
Let and . Taking into account that and , the equalities , and imply, by Lemma 3.6, that (9) (9) Now, the equalities and again by Lemma 3.6 and (Equation9(9) (9) ), imply that Finally, from , we get that and Hence, is a sublattice of .
Proposition 3.8
The lattice is an orthomodular lattice of finite height. Moreover, if is distributive then is a Boolean algebra.
Proof.
Let . Let us see that . Indeed, it is clear that . Since , then . So . Thus, is closed under the unary operation of complementation of . Taking into account Theorems 3.4 and 3.7, we have that is an orthomodular lattice.
If is a distributive lattice then is a Boolean algebra. So, is a Boolean algebra.
The next example illustrates the existence of matrices B such that are distributive lattices.
Example 3.9
Let us consider the matrix . Some computations give . The Hasse diagram associated to is given in Figure .
Eagambaram et al. showed in [Citation22] that is a finite lattice if and only if all the positive singular values of B are pairwise distinct. The next theorem improves this result by showing that, in that case, is not only a finite lattice but also a Boolean algebra. Additionally, we find its cardinality.
Theorem 3.10
Let . The lattice is a Boolean algebra if and only if all the positive singular values of B are pairwise distinct.
Proof.
Let be pairwise distinct and . If then and . Thus, , where . Let and , for each . Then , where for all i. Note that , for any i, j, and all the supremum and infimum obtained from these projectors also commute with , for all i. Then, by Proposition 3.1, we have that . Thus, is a distributive lattice and, by Proposition 3.8, it is Boolean algebra.
Conversely, suppose that with for some . Let us consider the matrices constructed in Example 3.3 and , for every . Now, take partitioned in blocks like the matrix Σ where the block is the matrix and the rest is completed with null matrices of the corresponding order. Now, we can choose such that . Then . Hence, is nondistributive.
Corollary 3.11
Let be a nonzero matrix of rank r. The following conditions are equivalent.
(a) | is a finite lattice. | ||||
(b) | All positive singular values of B are pairwise distinct. | ||||
(c) | is a Boolean algebra with elements. |
Corollary 3.12
If are nonzero matrices such that all positive singular values of B are pairwise distinct and , then all the positive singular values of A are pairwise distinct as well.
Proof.
It follows from Theorem 3.10, because every down-set of a Boolean algebra is a Boolean algebra too.
Remark 3.4
If for some then . If, in addition, , then is an infinite nondistributive lattice by Theorem 3.4 and Remark 3.2.
If , for some , then the condition is equivalent to where and for every .
If , , and we consider the map φ defined in the proof of Lemma 3.5, then we have the following result since commutes with Σ.
Lemma 3.13
Let . If then and are order-isomorphic. In particular, if then and are order-isomorphic.
3.3. Core partial order
We now investigate the lattice structure of for any . Once again, we take advantadge of the order-isomorphism ϕ to prove that is a sublattice of . Inspired by some examples, we highlight that the behaviour of the core partial order is rather different from the others. For instance, is not necessarily an orthogonal lattice (see Example (c)). Moreover, under the natural assumptions and , we demonstrate that and are order-isomorphic.
Theorem 3.14
If then is a sublattice of .
Proof.
It is immediate that . Then .
Let . We know that and exist in . Now we prove that . By Theorem 3.4, and exist in . So, it remains to prove:
and
.
Replacing the supremum expressions in (a), we have So, . Therefore, (a) is proved.
To show (b), notice first that: (10) (10) and (11) (11) By adding (Equation10(10) (10) ) and (Equation11(11) (11) ), Then, . Thus, (b) is proved.
Remark 3.5
may be a nondistributive lattice. For example, if , for some , then .
The next example is constructed by using the set defined in Remark 2.1 and it shows that may be a Boolean algebra. Indeed, consider the matrix where Some computations lead to and The associated Hasse diagram of is given in Figure .
may be a non-Boolean distributive lattice as the following example shows. Consider where , Some computations lead to and the associated Hasse diagram of is given in Figure .
As we can observe in the last example, not always holds whenever . When , the following result is valid.
Lemma 3.15
Let . If and then and are order-isomorphic. In particular, if then and are order-isomorphic.
Proof.
Take φ as in Lemma 3.5. Let us see that φ is surjective. Since where , from , we obtain that . Now, consider . Then . But and . So, . The rest of conditions for φ to be an order-isomorphism can be proved as in Lemma 3.5.
4. Supremum and infimum of two arbitrary matrices
In this section we first demonstrate that there exists the supremum (for all three partial orders) of two given matrices and if and only if and have a common upper bound. Our main tools are Theorems 3.4, 3.7, and 3.14. In addition, we find an expression for this supremum. Secondly, we analyse the infimum of two given matrices. In the case where the matrices have a common upper bound, we obtain an expression for their infimum. If two matrices B and C do not have a common upper bound, we already know that exists for the three partial orders (see [Citation16, Citation18, Citation21]). If B is written as in (Equation1(1) (1) ) then the infimum can be written as in (Equation2(2) (2) ) and we find the conditions that the associated orthogonal projector must satisfy.
Theorem 4.1
Let be a nonsingular matrix, and such that . If , for some , then .
Proof.
Let and . The fact that B is nonsingular yields that and , for every , with L = O and . By Theorems 3.4, 3.7, or 3.14, depending on the corresponding partial order x, and by Remark 3.1 we know that .
Since , we have that . Then and consequently Taking into account this last fact, (12) (12) Now we need to study each order separately.
From we know that . Then and consequently . Since , for every , and , we have and by (Equation12(12) (12) ), we get .
If then . So, . Thus, . Then and from (Equation12(12) (12) ) we obtain that .
Finally, if then . Thus, or equivalently . Taking into account that , we have Therefore, by (Equation12(12) (12) ), we have that .
Let us observe that if (or for the core partial order) then there exists a nonsingular matrix B such that . Indeed:
If and then it is enough to consider .
If then consider a singular value decomposition of given by and we can choose .
If and we consider again then, by Baksalary and Trenkler [Citation1, Lemma 3], we can take .
Proposition 4.2
Let (or for the core partial order). Then, exists if and only if and have a common upper bound. In that case, .
Proof.
The first statement is immediate from Theorem 4.1 taking into account that if and have a common upper bound then there exists a nonsingular matrix B such that , for all partial order x. For the second statement, assume that have a common upper bound and take B a nonsingular matrix such that . Consider a Hartwig-Spindelböck decomposition of B given by , where are unitary and . Let and be the orthogonal projectors such that , for each i, that is . Then, From , by using the facts that Σ is nonsingular and for each i (see [Citation19, Lemma 14]), we have that Hence, .
Proposition 4.3
Let (or for the core partial order). If and have a common upper bound then .
Proof.
Proceeding as in the proof of the Proposition 4.2, consider a nonsingular matrix B and a Hartwig-Spindelböck decomposition such that and the orthogonal projectors such that . Then, , , and . By Theorems 3.4, 3.7 or 3.14, depending on the corresponding partial order x, we have that .
In general, if B and C do not have a common upper bound, we know that there exists for the three partial orders. If B is written as in (Equation1(1) (1) ) and we write , where , then for the infimum there exists such that . It is straightforward to see that if and only if and . Moreover, if and only if . Indeed, . Thus, if and only if , and this is equivalent to because Σ is nonsingular and so .
For the star partial order we have that if and only if and .
Finally, for the core partial order we obtain that if and only if and .
We summarize the last reasoning in the following proposition.
Proposition 4.4
Let (or for the core partial order) where B is written as in (Equation1(1) (1) ) and C as above. Then the infimum is given by , where is the maximum of the following set.
(a) | For the left star partial order, | ||||
(b) | For the star partial order, | ||||
(c) | For the core partial order, |
Disclosure statement
No potential conflict of interest was reported by the author(s).
Additional information
Funding
References
- Baksalary OM, Trenkler G. Core inverse of matrices. Linear Multilinear Algebra. 2010;58(5–6):681–697. DOI:10.1080/03081080902778222
- Ben-Israel A, Greville TNE. Generalized inverses: theory and applications. 2nd ed. New York: Springer-Verlag; 2003. (CMS books in mathematics/ouvrages de mathématiques de la SMC; vol. 15).
- Campbell SL, Meyer Jr CD, Generalized inverses of linear transformations. New York: Dover Publications Inc.; 1991. Corrected reprint of the 1979 original.
- Chen J, Zhu H, Patricio P, et al. Characterizations and representations of core and dual core inverses. Canad Math Bull. 2017;60(2):269–282. DOI:10.4153/CMB-2016-045-7
- Kyrchei I. Determinantal representations of the W-weighted Drazin inverse over the quaternion skew field. Appl Math Comput. 2015;264:453–465. DOI:10.1016/j.amc.2015.04.125
- Pablos Romo F. On Drazin–Moore–Penrose inverses of finite potent endomorphisms. Linear Multilinear Algebra. 2021;69(4):627–647. DOI:10.1080/03081087.2019.1612834
- Wang H, Liu X. Characterizations of the core inverse and the core partial ordering. Linear Multilinear Algebra. 2015;63(9):1829–1836. DOI:10.1080/03081087.2014.975702
- Zhou M, Chen J, Stanimirovic PS, et al. Complex varying-parameter Zhang neural networks for computing core and core-EP inverse. Neural Process Lett. 2020;51(2):1299–1329. DOI:10.1007/s11063-019-10141-6
- Zhu H, Patrício P. Several types of one-sided partial orders in rings. Rev R Acad Cienc Exactas Fís Nat Ser A Mat RACSAM. 2019;113(4):3177–3184. DOI:10.1007/s13398-019-00685-6
- Drazin MP. Natural structures on semigroups with involution. Bull Amer Math Soc. 1978;84(1):139–141. DOI:10.1090/S0002-9904-1978-14442-5
- Baksalary JK, Mitra SK. Left-star and right-star partial orderings. Linear Algebra Appl. 1991;149:73–89. DOI:10.1016/0024-3795(91)90326-R
- Cvetković-Ilić DS, Mosić D, Wei Y. Partial orders on B(H). Linear Algebra Appl. 2015;481:115–130. DOI:10.1016/j.laa.2015.04.025
- Manjunatha Prasad K, Mohana KS, Sheela YS. Matrix partial orders associated with space preorder. In: Combinatorial matrix theory and generalized inverses of matrices. New Delhi: Springer; 2013. p. 195–226.
- Mitra SK, Bhimasankaram P, Malik SB. Matrix partial orders, shorted operators and applications. Hackensack (NJ): World Scientific Publishing Co. Pte. Ltd.; 2010. (Series in algebra; vol. 10).
- Burris S, Sankappanavar HP. A course in universal algebra. New York-Berlin: Springer-Verlag; 1981. (Graduate texts in mathematics; vol. 78).
- Cīrulis J. One-sided star partial orders for bounded linear operators. Oper Matrices. 2015;9(4):891–905. DOI:10.7153/oam-09-52
- Antezana J, Cano C, Mosconi I, et al. A note on the star order in Hilbert spaces. Linear Multilinear Algebra. 2010;58(7–8):1037–1051. DOI:10.1080/03081080903227104
- Djikić MS. Lattice properties of the core-partial order. Banach J Math Anal. 2017;11(2):398–415. DOI:10.1215/17358787-0000010X
- Malik SB, Rueda L, Thome N. Further properties on the core partial order and other matrix partial orders. Linear Multilinear Algebra. 2014;62(12):1629–1648. DOI:10.1080/03081087.2013.839676
- Hartwig RE, Spindelböck K. Matrices for which A∗ and A† commute. Linear Multilinear Algebra. 1983;14(3):241–256. DOI:10.1080/03081088308817561
- Hartwig RE, Drazin MP. Lattice properties of the *-order for complex matrices. J Math Anal Appl. 1982;86(2):359–378. DOI:10.1016/0022-247X(82)90228-1
- Eagambaram N, Manjunatha Prasad K, Mohana KS. Column space decomposition and partial order on matrices. Electron J Linear Algebra. 2013;26:795–815. DOI:10.13001/1081-3810.1688
- Xu XM, Du HK, Fang X, et al. The supremum of linear operators for the *-order. Linear Algebra Appl. 2010;433(11–12):2198–2207. DOI:10.1016/j.laa.2010.07.026
- Hartwig RE. Pseudolattice properties of the star-orthogonal partial ordering for star-regular rings. Proc Amer Math Soc. 1979;77(3):299–303. DOI:10.2307/2042174
- Djikić MS. Properties of the star supremum for arbitrary Hilbert space operators. J Math Anal Appl. 2016;441(1):446–461. DOI:10.1016/j.jmaa.2016.04.020