Core and Core-EP Inverses of Tensors
Jajati Kesahri Sahooa, Ratikanta Beherab, Predrag S. Stanimirovićc, Vasilios N. Katsikisd, Haifeng Mae
aDepartment of Mathematics,
BITS Pilani, K.K. Birla Goa Campus, Goa, India
E-mail: [email protected]
bDepartment of Mathematics and Statistics,
Indian Institute of Science Education and Research Kolkata,
Nadia, West Bengal, India.
E-mail: [email protected]
cUniversity of Niš, Faculty of Science and Mathematics,
Department of Computer Science,
Višegradksa 33, 18000 Niš, Serbia;
E-mail: [email protected]
dNational and Kapodistrian University of Athens,
Sofokleous 1 Street, 10559 Athens, Greece;
E-mail: [email protected]
eHarbin Normal University, School of Mathematical Science
Harbin 150025, China.
E-mail: [email protected]
Abstract
Specific definitions of the core and core-EP inverses of complex tensors are introduced.
Some characterizations, representations and properties of the core and core-EP inverses are investigated.
The results are verified using specific algebraic approach, based on proposed definitions and previously verified properties.
The approach used here is new even in the matrix case.
keywords:
Generalized inverse; Core-EP inverse; Core inverse; Tensor; Einstein product.
AMS Subject Classifications: 15A69,15A09.
††journal: arxiv
1 Introduction, background and motivation
The core inverse for matrices was introduced by Baksalary [1, 2].
Several properties of the core inverse and interconnections with other generalized inverses were further studied by many researchers [1, 15, 26, 31, 32].
Perturbation bounds of the core inverse were considered in [18].
An extension of the core inverse in the finite dimensional space to the set of bounded Hilbert space operators were proposed in [27].
Rakić et al. in [26] extended the notion of the core inverse from the complex matrix space to an arbitrary ∗-ring.
Prasad, and Raj in [24] introduced a bordering method for computing the core-EP inverse by relating this generalized inverse with a suitable bordered matrix.
Some further properties of the core-EP inverse were investigated in [9].
Prasad, Raj, and Vinay in [25] introduced an iterative method to approximate the core-EP inverse.
Three limit representations of the core-EP inverse were proposed in [33].
The notion of the core inverse was generalized to the core-EP inverse.
Many characterizations of the core-EP inverse with other inverses are discussed in [10, 23].
The core-EP was extended to rectangular matrices in [9, 11].
Some new characterizations, representations and the perturbation bounds of the core-EP and the weighted core-EP were investigated in [19, 20].
The tensor inversion and generalized inversion based on different tensor products have been a frequent topic for investigation in the available literature.
The representations and properties of the tensor inverse were considered in [5].
Further, Liang et al. in [17] investigated necessary and sufficient conditions for the invertibility of a given tensor.
Representations and properties of the Moore-Penrose inverse of tensors were derived in [3] and [29].
Representations for the weighted Moore-Penrose inverse of tensors were considered in [13].
Panigrahy and Mishra in [21] investigated the Moore-Penrose inverse of the Einstein product of two tensors.
Ji and Wei [14] investigated the Drazin inverse of even-order square tensors under the Einstein product.
So, it is observable that the core and core-EP inverse are not investigated in the tensor case, so far.
The targets of our research, in the present article, are core and core-EP inverses of tensors.
Corresponding definitions are introduced and main properties are investigated.
Main contributions of this manuscript can be summarized as follows.
(1) Definitions of the core and core-EP inverses of tensors are introduced.
(2) Some characterizations and properties of the core and core-EP inverses are investigated.
(3) The results are verified using one specific algebraic approach, which is new even in the matrix case.
The rest of the paper is organized as follows.
Some necessary notations, useful known results and definitions are presented in Section 2.
Definition, basic properties and representations of the core inverse are considered in Section 3.
The core inverse of the sum of two tensors is investigated in Subsection 3.1.
Section 4 is aimed to the core-EP inverse of a square tensor.
Some properties, representations and characterizations of the core-EP inverse are given.
Illustrative numerical examples are given in Section 5.
Concluding remarks are stated in Section 6.
2 Preliminaries
For convenience, we first briefly explain some of the terminologies which will be used here on wards.
We refer to CI1×⋯×IN (resp. RI1×⋯×IN) as the set of order N complex (resp. real) tensors.
Particularly, a matrix is a second order tensor, and a vector is a first order tensor.
Each entry of a tensor A∈CI1×⋯×IN is denoted by Ai1...iN.
Note that throughout the paper, tensors are represented in calligraphic letters like A, and the notation Ai1...iN represents the scalars.
The Einstein product ([8]) A∗NB of tensors
A∈CI1×⋯×IN×K1×⋯×KN and B∈CK1×⋯×KN×J1×⋯×JM is defined
by the operation ∗N via
[TABLE]
Specifically, if B∈CK1×⋯×KN, then A∗NB∈RI1×⋯×IN and
[TABLE]
The Einstein product is discussed in the area of continuum mechanics [8] and the theory of relativity [16].
Further, the sum of two tensors A, B∈CI1×⋯×IN×K1×⋯×KN is
[TABLE]
For a tensor A=(Ai1...iMj1...jN)∈RI1×⋯×IM×J1×⋯×JN, the tensor
AT=(Aj1...jNi1...iM)∈RJ1×⋯×JN×I1×⋯×IM is the transpose of A.
The conjugate transpose of a tensor
A=(Ai1…iMj1…jN)∈CI1×⋯×IM×J1×⋯×JN
is denoted by A∗ and elementwise defined as
(A∗)j1…jNi1…iM=(A)i1…iMj1…jN∈CJ1×⋯×JN×I1×⋯×IM
where the over-line means the conjugate operator.
Further, a tensor O denotes the zero tensor if all the entries are zero.
A tensor A∈RI1×⋯×IN×I1×⋯×IN is symmetric
if A=AT, skew-symmetric if A=−AT, and orthogonal if A∗MAT=AT∗NA=I.
A tensor A∈CI1×⋯×IN×I1×⋯×IN is idempotent if A∗NA=A and tripotent if A3=A.
Further, a tensor A∈CI1×⋯×IN×I1×⋯×IN is called *Hermitian idempotent * if A2=A=A† or A2=A=A∗.
The additional notation
I(N)=I1×⋯×IN
will be useful in increasing the efficiency of the presentation.
Accordingly, the tensor A∈CI1×⋯×IM×J1×⋯×JN will be denoted in a simpler form as A∈CI(M)×J(N).
Tensors of the form CI(N)×J(N) are known as even-order tensors.
Following the terminology from [14], even-order tensors of the shape CI(N)×I(N) will be termed as even-order square tensors, or simply square tensors.
Definition 2.1**.**
Let A∈CI(N)×I(N).
Then the tensor A is called EP if A∗NA†=A†∗NA.
Definition 2.2**.**
A tensor A∈CI(M)×J(N) is called partial isometry if A∗NA∗∗MA=A or A†=A∗.
The definition of a diagonal tensor follows from [29].
Definition 2.3**.**
[29]*
A tensor with entries Di1…iNj1…jN
is called a diagonal tensor if Di1…iNj1…jN=0 for (i1,…,iN)=(j1,…,jN).*
We recall the definition of an identity tensor below.
Definition 2.4**.**
[5, Definition 3.13]*
A tensor with entries
Ii1i2⋯iNj1j2⋯jN=∏k=1Nδikjk,
where*
[TABLE]
is called a unit tensor or identity tensor.
Definition 2.5**.**
[28, Definition 2.1]*
The range and null space of a tensor A∈RI(M)×J(N) are defined as per the following:*
[TABLE]
where O is an appropriate zero tensor.
The index of a tensor A∈RI(N)×I(N) is defined as the smallest positive integer k, such that R(Ak)=R(Ak+1).
If k=1, then the tensor is called index one or group, or core tensor.
The index of a square tensor A is denoted as ind(A).
A tensor A∈CI1×⋯×IN×I1×⋯×IN is invertible
if there exists a tensor X such that A∗NX=X∗NA=I.
In this case, X is called the inverse of A and denoted by A−1.
Lemma 2.1**.**
[28, Lemma 2.2.]*
Let A∈RI1×⋯×IM×J1×⋯×JN,
B∈RI1×⋯×IM×K1×⋯×KL.
Then R(B)⊆R(A) if and only if there exists
U∈RJ1×…×JN×K1×…×KL such that
B=A∗NU.*
Let A∈CI(M)×J(N), X∈CJ(N)×I(M) and consider the following conditions
[TABLE]
Definition 2.6**.**
[29, Definition 2.2]*
The tensor X satisfying the tensor equations:*
- (1T)* is called inner or generalized inverse of A and denoted by A(1T).*
- (2T)* is called outer inverse of A and denoted by A(2).*
- (1T)* and (2T) is called reflexive generalized inverse of A and denoted by A(1T,2T).*
- (1T)–(4T)* is called Moore-Penrose inverse of A and denoted by A†.*
We use the notation A{1T}, A{1T,2T} and A{1T,3T} respectively for the set of inner inverses, reflexive generalized inverses of A, and {1,3} inverses of A.
Similarly, the sets A{1T,4T} and A{1T,2T,3T} are defined.
The group and Drazin inverse are defined as follows for an even-order square tensor A∈CI(N)×I(N).
Definition 2.7**.**
let A∈CI(N)×I(N) be a core tensor.
A tensor X∈CI(N)×I(N) satisfying
[TABLE]
is called the group inverse of A, and it is denoted by A#.
Definition 2.8**.**
[14]*
Let A∈CI(N)×I(N) with ind(A)=k.
A tensor X∈CI(N)×I(N) satisfying*
[TABLE]
is called the Drazin inverse of A and it is denoted by AD.
It is important to mention that the matrix equations corresponding to (1)T,(2)T,(3)T,(4)T,(5)T,(1k)T are denoted by (1),(2),(3),(4),(5),(1k), respectively.
The orthogonal projection onto a subspace R(A) is denoted by PR(A) and defined as
PR(A)=A∗NA†.
One specific and useful algorithm for a proper matricization of an arbitrary tensor was proposed in [28].
Definition 2.9**.**
[28]*
Let I1,…,IM,K1,…,KN be given integers and I,K are the integers defined as*
[TABLE]
The reshaping operation
[TABLE]
transforms a tensor A∈CI(M)×K(N)
into the matrix A∈CI×K using the Matlab function reshape as follows:
[TABLE]
The inverse reshaping of A∈CI×K is the tensor A∈CI(M)×K(N) defined by
[TABLE]
Also, an appropriate definition of the tensor rank, arising from the reshaping operation, was proposed in [28].
Definition 2.10**.**
[28]*
Let A∈CI(N)×K(N) and
A=reshape(A,I,K)=rsh(A)∈CI×K.
Then the tensor rank of A, denoted by rshrank(A), is defined by rshrank(A)=rank(A).*
3 Tensor core inverse
Let A be an n×n complex matrix of index 1.
The core inverse A#⃝∈Cn×n of A∈Cn×n was introduced in [1, Definition 1] as the matrix satisfying
[TABLE]
where PA (=AA†) denotes an orthogonal projection onto the range R(A).
Various characterizations of the core inverse, including its correlations with another generalized inverses, were originated in [1].
The results obtained in [1] were developed on the basis of the Hartwig and Spindelböck decomposition.
In [27], the authors introduced an equivalent definition of the core inverse, by proving in Theorem 3.1. that (3.1) is equivalent to
[TABLE]
Analogous definition of the core inverse in a ring R with involution was introduced in [26]:
[TABLE]
Finally, the core inverse in the set
CnCM={A∈Cn×n∣ rank(A2)=rank(A)}.
was also defined [26]:
[TABLE]
In [32, Theorem 3.1], the authors introduced the following representation of the core inverse in a ring R with involution:
[TABLE]
In this section, we will introduce the core inverse of tensors and investigate its properties and representations.
Also, several characterizations of the tensor core inverse as well as some relationships with other generalized inverses will be discussed.
A tensor A is said to be a core invertible or a core tensor if the core inverse of A exists.
For this purpose, we will say that a tensor A is a core tensor if its reshaping index is equal to 1, i.e.,
[TABLE]
In the present paper the tensor core inverse is introduced in Definition 3.1, using the approach analogous to (3.5).
Definition 3.1**.**
Let A∈CI(N)×I(N) be a given core tensor.
A tensor X∈CI(N)×I(N) satisfying
- (C1)
X∗NA2=A**
2. (C2)
A∗NX2=X**
3. (3T)
(A∗NX)∗=A∗NX**
is called the core inverse of A and denoted by A\mbox#⃝.
It is known that the core inverse A#⃝ of a square matrix A is the unique {1,2}-inverse which satisfies R(A#⃝)=R(A), N(A#⃝)=N(A∗).
The goal of Lemma 3.1 is to verify that the tensor core inverse, introduced by the tensor equations (C1), (C2), (3T) in Definition 3.1, satisfies (1T) and (2T).
Lemma 3.1**.**
Let A∈CI(N)×I(N) be given.
Then A\mbox#⃝ satisfies (1T) and (2T).
Proof.
The proof follows after the following verification:
[TABLE]
∎
The uniqueness of the core inverse is proved in Theorem 3.1.
Theorem 3.1**.**
An arbitrary core invertible tensor A∈CI(N)×I(N) has one and only one core inverse.
Proof.
Let X1 and X2 be two tensors satisfying (C1), (C2), (3T).
Using these properties in conjunction with (3.6) and (3.7), it follows that
[TABLE]
Thus
[TABLE]
Hence, the statement is proved.
∎
Corollary 3.1 can be obtained by combining (3.6), (3.7) and (3T).
Corollary 3.1**.**
Let A∈CI(N)×I(N) be a core tensor, then A\mbox#⃝∈A{1T,2T,3T}.
Theorem 3.2 gives some characterizations of the core inverse in terms of other generalized inverses and generalizes Theorem 1 from [1].
It is important to mention that the results of Theorem 3.2 are verified using one specific algebraic approach, which is new even in the matrix case.
Theorem 3.2**.**
Let A∈CI(N)×I(N) be a core tensor. Then the following holds:
- (a)
A\mbox#⃝=A#∗NA∗NA†=A#∗NPR(A)=A∗NA#∗NA†;**
2. (b)
An∗NA\mbox#⃝=An∗NA†;**
3. (c)
(A\mbox#⃝)†=A2∗NA†=A2∗NA\mbox#⃝;**
4. (d)
A\mbox#⃝* is EP;*
5. (e)
(A\mbox#⃝)\mbox#⃝=A2∗NA†;**
6. (f)
(A\mbox#⃝)2∗NA=A#;**
7. (g)
A\mbox#⃝∗NA=A#∗NA.
Proof.
(a)
Since A is a core tensor, the existence of A# is ensured and later X:=A#∗NA∗NA†.
It is necessary to verify X satisfies (C1),(C2),(3T).
Indeed:
[TABLE]
(b)
The proof follows from the representations given in (a) and simple transformations:
[TABLE]
(c)
Let Z:=A2∗NA†. It is easy to show
A\mbox#⃝∗NZ=Z∗NA\mbox#⃝=A∗NA†.
Since
[TABLE]
the tensor Z is the Moore-Penrose inverse of A\mbox#⃝.
(d) This part can be demonstrated after easy verification of the equalities
[TABLE]
(e) It is enough to show A\mbox#⃝∗N(A2∗NA†)2=A2∗NA† and (A2∗NA†)∗N(A\mbox#⃝)2=A\mbox#⃝.
Indeed:
[TABLE]
(f) This statement follows from (A\mbox#⃝)2∗NA=A#∗NA∗NA†∗NA#∗NA∗NA†∗NA=A#.
(g) The last one follows from (a) and the definition of the Moore-Penrose inverse.
∎
Remark 3.1**.**
It is easy to verify that A\mbox#⃝=A#∗NA∗NA†=A#∗NPR(A)=A∗NA#∗NA† satisfies (3.1).
Corollary 3.2**.**
If A is a core tensor with full rank factorization A=PQ, then
[TABLE]
Proof.
Using full rank factorizations of the group inverse and the Moore-Penrose inverse, it follows that
[TABLE]
which clearly coincides with AR(P),N(P∗)(2).
∎
The following representation of A\mbox#⃝ follows from Theorem 3.2(c).
Corollary 3.3**.**
The core inverse can be obtained by A\mbox#⃝=(A2∗NA†)†.
We can also generalize Theorem 3.2(a) by using {1,3} inverses of A instead of the Moore-Penrose inverse.
The result is proved in Theorem 3.3.
Theorem 3.3**.**
Let A∈CI(N)×I(N) be a core tensor.
If there exists a tensor X:=A(1T,3T)∈CI(N)×I(N) such that X∈A{1T,3T}, then A\mbox#⃝=A#∗NA∗NX.
Proof.
Let us assume that there exists a tensor X:=A(1T,3T) satisfying A∗NX∗NA and (A∗NX)∗=A∗NX.
Consider Y:=A#∗NA∗NA(1T,3T).
We can notice the following expressions
[TABLE]
Therefore, Y satisfies (C1), (C2) and (3T) with respect to A.
By the uniqueness of the core inverse, it follows that A\mbox#⃝=A#∗NA∗NX.
∎
Corollary 3.4**.**
Let A∈CI(N)×I(N) be a core tensor and X∈CI(N)×I(N).
If X satisfies one of the following two systems (i) or (ii)
- (i)
(C1)* X∗NA2=A, and (3T) (A∗NX)∗=A∗NX;*
2. (ii)
X∗NA=A#∗NA,* and (3T) (A∗NX)∗=A∗NX;*
then A\mbox#⃝=A#∗NA∗NX.
Proof.
Let the system (i) be satisfied.
If X∗NA2=A is true, then
[TABLE]
Therefore,
A∗NX∗NA=A and X∈A{1,3}.
Further if the conditions (ii) are satisfied X∗NA=A∗NA#, then
[TABLE]
which again implies X∈A{1,3}.
Now, the proof in both cases follows from Theorem 3.3.
∎
Corollary 3.5 follows from [28, Theorem 4.3] and the properties of the core tensor inverse.
Corollary 3.5**.**
Let A∈CI(N)×I(N) is a given core tensor.
(a)* The following statements are equivalent:*
there exists an outer inverse X∈CI(N)×I(N):=A\mbox#⃝=AR(A),N(A∗)(2);
there exist a tensor U∈CI(N)×I(N) that fulfils the tensor equations
[TABLE]
there exist tensors U,V∈CI(N)×I(N) such that
[TABLE]
there exist U∈CI(N)×I(N) and V∈CI(N)×I(N) such that
[TABLE]
there exist U∈CI(N)×I(N) and V∈CI(N)×I(N) satisfying
[TABLE]
N(A∗∗NA2)=N(A);
R(A∗∗NA2)=R(A∗);
A∗N(A∗∗NA2)(1)∗NA∗∗NA2=A* and
A∗∗NA2∗N(A∗∗NA2)(1)∗NA∗=A∗;*
rshrank(A∗∗NA2)=rshrank(A);
A* is core invertible;*
(b)* If the statements in (a) are true, then*
[TABLE]
*for arbitrary U∈CK(k)×L(l) satisfying (3.8).
*
The next result gives a correlation between the core inverse of a tensor power and the power of its core inverse.
Theorem 3.4**.**
Let A∈CI(N)×I(N) be a core tensor.
Then the following holds for an arbitrary integer m≥1:
- (a)
Am∗N(A\mbox#⃝)m=A∗NA†,**
2. (b)
(A\mbox#⃝)m=(Am)\mbox#⃝.**
Proof.
(a) Using the statement of Theorem 3.2(a), we obtain
[TABLE]
Continuing in the same way, one can obtain
[TABLE]
(b) Let X=(A\mbox#⃝)m.
Now, using the part (a) of this theorem, we get
[TABLE]
Therefore, X is the core inverse of Am, which completes the proof.
∎
In general, the Moore-Penrose inverse, the group inverse and the core inverse of tensors are different.
This fact is confirmed in Example 3.1.
Example 3.1**.**
Consider a tensor
A=(Aijkl)∈R(2×3)×(2×3) with entries
[TABLE]
Then, A#=A∈R(2×3)×(2×3).
However, A†=(Xijkl)∈R(2×3)×(2×3), where
[TABLE]
*and A\mbox#⃝=(Yijkl)∈R(2×3)×(2×3), where
*
[TABLE]
Hence it is clear that A\mbox#⃝,A# and A† are different.
Now, a natural question is: are these inverses the same under some assumptions?
The next theorem will provide an affirmative answer to this along with some characterizations for EP tensors.
The results of Theorem 3.5 generalize the results of Theorem 2 from [1].
Theorem 3.5**.**
Let A∈CI(N)×I(N) be a core tensor. Then the following statements hold:
- (a)
A\mbox#⃝=0* if and only if A=0,*
2. (b)
A\mbox#⃝=A∗NA†* if and only if A idempotent,*
3. (c)
A\mbox#⃝=A†* if and only if A is EP,*
4. (d)
A\mbox#⃝=A#* if and only if A is EP,*
5. (e)
A\mbox#⃝=A* if and only if A is EP and tripotent,*
6. (f)
A\mbox#⃝=A∗* if and only if A is EP and partial isometry.*
Proof.
(a) If A=0, then A\mbox#⃝=0 follows trivially from Theorem 3.2(a).
To show the converse, let A\mbox#⃝=0.
This assumption leads to A#∗NA∗NA†=0.
Post-multiplying and pre-multiplying by A, we get A=0.
Thus, the statement in (a) is completed.
(b) Now let A2=A.
Then A\mbox#⃝=A#∗NA∗NA†=A#∗NA2∗NA†=A∗NA†.
The opposite statement is true since
[TABLE]
(c) Let us assume A\mbox#⃝=A†.
So, by Theorem 3.2(e), it follows that A\mbox#⃝ is EP.
This implies that A\mbox#⃝∗N(A\mbox#⃝)†=(A\mbox#⃝)†∗NA\mbox#⃝.
This yields A†∗NA=A∗NA† since A\mbox#⃝=A†.
Therefore A is EP.
Now the converse follows by the following expression
[TABLE]
(d) Again, assume that A is EP.
Then the core inverse of A is equal to
[TABLE]
Consider A\mbox#⃝=A#.
To claim that A is EP, it is enough to show A#=A†.
Since A\mbox#⃝ is {1T,2T,3T} inverse of A, we only need to claim that (A#∗NA)∗=A#∗NA.
Since A#∗NA=A∗NA#,
it implies
A∗NA\mbox#⃝=A\mbox#⃝∗NA.
Now
[TABLE]
This completes the proof for (d).
(e) Next assume that A\mbox#⃝=A. Since A\mbox#⃝ is EP which yields A is EP.
From Definition 3.1, it follows that A∗N(A\mbox#⃝)2=A\mbox#⃝.
This turns to A3=A. So A is EP and tripotent.
The converse statement holds since
[TABLE]
(f) To show the last part, first consider A\mbox#⃝=A∗. Since A∗NA\mbox#⃝∗NA=A, it gives A∗NA∗∗NA=A.
This gives A\mbox#⃝=A∗=A†.
Then, by part (c), A is an isometry and EP.
The converse statement follows from part (c) and the definition of isometry.
∎
Combining the results of Theorem 3.5 (c) and (d), we state the following remark.
Remark 3.2**.**
Let A∈CI(N)×I(N) be a core tensor.
Then A is EP if and only if A\mbox#⃝=A†=A#.
Further characterizations of EP tensors are provided in the next theorem.
The results of Theorem 3.6 generalize the results of Theorem 2 from [1].
Theorem 3.6**.**
Let A∈CI(N)×I(N) be a core tensor. Then the following are equivalent:
- (i)
A* is EP,*
2. (ii)
(A\mbox#⃝)\mbox#⃝=A,**
3. (iii)
A\mbox#⃝∗NA=A∗NA\mbox#⃝,**
4. (iv)
(A†)\mbox#⃝=A,**
5. (v)
(A\mbox#⃝)†=A.**
Proof.
Let A is EP. By Theorem 3.2(d), (A\mbox#⃝)\mbox#⃝=A2∗NA†=A∗NA†∗NA=A.
Thus (i)⇒ (ii).
Assume (ii) is true, i.e., A2∗NA†=A.
Now
[TABLE]
This completes (ii)⇒ (iii).
Next we will claim (iii)⇒ (i).
Consider A\mbox#⃝∗NA=A∗NA\mbox#⃝.
This turnout to A∗NA#=A∗NA†. Now A\mbox#⃝=A#∗NA∗NA†=A#∗NA∗NA#=A#.
So by Theorem 3.5(d), the tensor A is EP.
Next we will claim the equivalence between (i) and (iv).
Let us assume A is EP.
Then A\mbox#⃝=A† by Theorem 3.5(c).
This yields (A†)\mbox#⃝=(A\mbox#⃝)\mbox#⃝=A.
To show the converse it is enough to show that A† is the core inverse of A.
Let (A†)\mbox#⃝=A. Which implies A†∗NA2=A and A∗N(A†)2=A†.
As (A∗NA†)∗=A∗NA†, it follows that A† satisfies all the conditions of the core inverse.
Therefore (i)⇔(iv).
Finally, we will show (i)⇔(v).
The tensor A is EP if and only if A\mbox#⃝=A†.
This turnout A is EP if and only if (A\mbox#⃝)†=(A†)†=A.
∎
By looking at Theorem 3.6 (i), (iv) and (v), we state the following remark.
Remark 3.3**.**
Let A∈CI(N)×I(N) be a core tensor. Then A is EP if and only if (A\mbox#⃝)†=(A†)\mbox#⃝.
We will discuss some equivalent characterization of core inverse in the remaining part of this section. The condition A∗NX2=X can be dropped from the definition of core inverse but with an additional condition as stated in the theorem given below.
Theorem 3.7**.**
*Let A∈CI(N)×I(N) be a core tensor.
If there exists a tensor X satisfying
(2T) X∗NA∗NX=X, (3T) (A∗NX)∗=A∗NX and (C1) X∗NA2=A,
then X is the core inverse of A.*
Proof.
Let A=X∗NA2. Post-multiplying by A#, we obtain A∗NA#=X∗NA2∗NA#=X∗NA.
Now A∗NX∗NA=A∗NA∗NA#=A.
Therefore, X∈A{1T,3T}.
So, by Theorem 3.3, the core inverse of A is A\mbox#⃝=A#∗NA∗NX=A∗NA#∗NX.
Replacing A∗NA# by X∗NA, one can obtain A\mbox#⃝=X∗NA∗NX=X.
Hence the proof is complete.
∎
Theorem 3.7 leads to the following corollary.
Corollary 3.6**.**
*Let A∈CI(N)×I(N) be a core tensor.
If there exists a tensor X satisfying
(2T) X∗NA∗NX=X, (3T) (A∗NX)∗=A∗NX and (C1) X∗NA2=A,
then A∗NX2=X.*
Remark 3.4**.**
Corollary 3.6 can be proved separately and the proof is the following.
Since X=X∗NA∗NX=X2∗NA∗NX=X2∗NA2∗NX. Pre-multiplying by X#, we obtain
[TABLE]
Now A∗NX2=A∗NX∗NX=X#∗NX∗NX=X.
The assumptions of Corollary 3.6 can also be used as an equivalent definition of core inverse of A.
Next, we discuss another equivalent definition of the core inverse, which was proved in [31] for the matrix case by using the singular decomposition.
Proposition 3.1**.**
*Let A∈CI(N)×I(N) be a core tensor.
If there exists a tensor X satisfying
(1T) A∗NX∗NA=A, (3T) (A∗NX)∗=A∗NX and (C2) A∗NX2=X,
then X is core inverse of A.*
Proof.
It is sufficient to show that X∗NA2=A. Combining the result A∗NX∗NA=A and A∗NX2=X, we get A=A2∗NX2∗NA.
Pre-multiplying A# both sides, we obtain A#∗NA=A#A2∗NX2∗NA=A∗NX2∗NA=X∗NA.
Now X∗NA2=X∗NA∗NA=A#∗NA∗NA=A. Hence X is the core inverse of A.
∎
By combining Theorem 3.7 and Proposition 3.1, we state the following corollary which can be used as an equivalent characterization of the core inverse.
Corollary 3.7**.**
Let A∈CI(N)×I(N) be a core tensor and X∈CI(N)×I(N).
If X satisfies any one of the following triads of equations:
- (i)
(C1)* X∗NA2=A, (C2) A∗NX2=X, and (3T) (A∗NX)∗=A∗NX,*
2. (ii)
(2T)* X∗NA∗NX=X, (C1) X∗NA2=A, and (3T) (A∗NX)∗=A∗NX,*
3. (iii)
(1T)* A∗NX∗NA=A, (2T) A∗NX2=X, and (3T) (A∗NX)∗=A∗NX,*
then X is the core inverse of A.
If we replace the condition A∗NX2=X in Corollary 3.7 (iii) by X∗NA2=A, then one can easily verify that X∗NA∗NX is the core inverse of A.
In conclusion, we pose the following remark.
Remark 3.5**.**
Let A∈CI(N)×I(N) be a core tensor.
If there exists a tensor X satisfying A∗NX∗NA=A, (A∗NX)∗=A∗NX, and X∗NA2=A,
then X∗NA∗NX is the core inverse of A.
The core inverse can be further characterized using the range condition as in Theorem 3.8.
Theorem 3.8**.**
Let A∈CI(N)×I(N) be a core tensor and X∈CI(N)×I(N).
If X satisfies (A∗NX)∗=A∗NX, X∗NA2=A, and R(X)⊆R(A),
then X is the core inverse of A.
Proof.
To show X is the core inverse of A, it is enough to show only X∗NA∗NX=X. Since R(X)⊆R(A). So by Lemma 2.1, there exists a tensor Z∈CI1×⋯×IN×I1×⋯×IN such that X=A∗NZ. From the condition X∗NA2=A, we obtain
[TABLE]
Therefore, by Theorem 3.7, X is the core inverse of A.
∎
Note that the converse of Theorem 3.8, is also true and can be verified from the definition of the core inverse.
In the next subsection, we discuss the computation of core inverse for sum of two tensors.
3.1 Tensor core inverse of the sum of two tensors
Group inverse of sum of two elements over a ring was first introduced by Drazin [7].
Some generalization also discussed in [6]. Then the same idea extended to core inverse on a ring in [32].
The result of [32], further extended to tensors in [4] and stated below.
Theorem 3.9**.**
Let A, B∈CI1×⋯×IN×I1×⋯×IN be core tensors with A∗NB=O. Then
[TABLE]
In the next theorem, we generalize the same result with one more additional condition.
Theorem 3.10**.**
Let A, B∈CI1×⋯×IN×I1×⋯×IN be core tensors with A∗NB=O and A∗∗NB=O. Then
(A+B)\mbox#⃝=(I−B∗NB\mbox#⃝)∗NA\mbox#⃝+B\mbox#⃝.
Proof.
By Theorem 3.9, it follows that
[TABLE]
Using Theorem 3.2(f), we further obtain
[TABLE]
Since A∗NB=O and A∗∗NB=O, the following transformations follows:
[TABLE]
Let X=(I−B∗NB\mbox#⃝)∗NA\mbox#⃝+B\mbox#⃝.
Now we have
[TABLE]
Thus ((A+B)∗NX)∗=(A∗NA\mbox#⃝)∗+(B∗NB\mbox#⃝)∗=(A+B)∗NX. Also we have
[TABLE]
Since A is {1T,3T} inverse of (A+B), by Theorem 3.3,
[TABLE]
∎
The necessity of the condition A∗NB=O in Theorem 3.10 can can verified in the following example.
Example 3.2**.**
Consider the tensor A=(aijkl)∈R(2×3)×(2×3) defined in Example 3.1 and a tensor B=(bijkl)∈R2×3×2×3 with entries
[TABLE]
It is easy to verify A∗2B=O, A+B=O, and (A+B)2=O.
Since R(A+B)=R(A+B)2, so the core inverse of A+B does not exist, whereas A and B are core invertible.
Notice that, if B∗NA=O, then B∗NA\mbox#⃝=B∗NA∗N(A\mbox#⃝)2=O.
So, with this additional assumption, we have the following corollary.
Corollary 3.8**.**
Let A, B∈CI(N)×I(N) be core tensors with A∗NB=O=B∗NA and A∗∗NB=O.
Then
(A+B)\mbox#⃝=A\mbox#⃝+B\mbox#⃝.
4 Tensor core-EP inverse
The core-EP inverse X of a square matrix A with ind(A)=k is defined in [23] as the outer inverse satisfying R(X)=R(Ak),N(X)=N((Ak)∗).
Also, the core-EP inverse X is the unique (1k),(2),(3) inverse satisfying R(X)⊂R(Ak) [23].
In this section, we will extend the notion of the core inverse to the core-EP inverse for square tensors.
The core-EP inverse, as the core inverse, is unique.
Some characterizations of the tensor core-EP inverse with respect to the tensor Drazin inverse, group inverse and the tensor Moore-Penrose inverse will be presented in this section.
The definition of the core-EP inverse of square tensors is introduced in Definition 4.1.
Definition 4.1**.**
Let A∈CI(N)×I(N) and ind(A)=k. A tensor X∈CI(N)×I(N) satisfying
- (EP)
X∗NAk+1=Ak**
2. (C2)
A∗NX2=X**
3. (3T)
(A∗NX)∗=A∗NX**
is called core-EP inverse of A and it is denoted as \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}.
Clearly, if k=1, then \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{\scriptsize\mbox{\tiny\#⃝}}.
Before proving the uniqueness of the core-EP inverse, we first prove some preliminary results.
Lemma 4.1**.**
*Let A∈CI(N)×I(N) satisfy ind(A)=k.
If a tensor X∈CI(N)×I(N) satisfies (EP) and (C2), then the following holds:
*
- (a)
A∗NX=Am∗NXm, m∈N.**
2. (b)
X∗NA∗NX=X.**
3. (c)
Am∗NXm∗NAm=Am* for m≥k.*
4. (d)
Xm+1∗NAm=AD* when m≥k=ind(A).*
Proof.
(a) Using (C2) repetitively, we obtain
[TABLE]
(b) Again applying (EP) and (C2), we get
[TABLE]
(c) To claim next part let m≥k.
As
[TABLE]
(d) To show the last part, let B:=Xm+1∗NAm.
Then
[TABLE]
Using the given assumption, we again obtain
[TABLE]
and
[TABLE]
Thus B=Xm+1∗NAm is the Drazin inverse of A.
Hence, the proof is complete.
∎
The next theorem proves the uniqueness of the core-EP inverse.
Theorem 4.1**.**
Let A∈CI(N)×I(N) and ind(A)=k.
Then A has a unique core-EP inverse in CI(N)×I(N).
Proof.
Let X and Y be two distinct core-EP inverses of A.
Then
X∗NAk+1=Ak, A∗NX2=X, (A∗NX)∗=A∗NX
and
Y∗NAk+1=Ak, A∗NY2=Y, (A∗NY)∗=A∗NY.
By Lemma 4.1(d), Xm+1∗NAm=AD and Ym+1∗NAm=AD for any m≥k.
Again by Lemma 4.1(c), we have
Ak∗NXk∗NAk=Ak.
Now
[TABLE]
and
(Ak∗NXk)∗=(A∗NX)∗=A∗NX=Ak∗NXk. This yield Xk is the core inverse of Ak. Similarly, we can show that Yk is also the core inverse of Ak.
From the uniqueness of the core inverse, it follows Xk=Yk.
Now
[TABLE]
Continuing in the same way, we obtain
[TABLE]
Hence, the core-EP inverse is unique.
∎
The existence of the core-EP inverse and its computation can be discussed through other generalized inverses.
Theorem 4.2 gives some characterizations of the core inverse in that direction.
Theorem 4.2**.**
Let A∈CI(N)×I(N) and ind(A)=k.
Then \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{\mathrm{D}}{*_{N}}\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l}\right)^{{\dagger}}, where l is an integer satisfying l≥k.
Furthermore, \mathcal{A}{*_{N}}\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l}\right)^{{\dagger}}.
Proof.
It is necessary to verify that X:=AD∗NAl∗N(Al)† satisfies (EP), (C2) and (3T).
The equation (EP) can be verified using
[TABLE]
Further, (C2) follows from
[TABLE]
The equation (3T) is verified as
[TABLE]
So, X is the core-EP inverse of A.
∎
The representations obtained in Corollary 4.1 generalizes [23, Corollary 3.3].
Corollary 4.1**.**
Let A∈CI(N)×I(N) and ind(A)=k.
Then
[TABLE]
where l is an integer satisfying l≥k.
Proof.
Using known representation of the core inverse from Theorem 3.2 in conjunction with known properties of the Drazin and the group inverse, one can verify
[TABLE]
Now, according to the representation of the core-EP inverse from Theorem 4.2, it follows that
\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l+1}\right)^{\scriptsize\mbox{\tiny\#⃝}}=\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}.
Finally, in view of AD∗NAl+1=Al, it follows that \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l+1}\right)^{\dagger}.
∎
One can observe that the proof of Theorem 4.2 requires only {1,3} inverse of Al.
Hence, using similar lines, we generalize the theorem as follows:
Theorem 4.3**.**
Let A∈CI(N)×I(N) and ind(A)=k.
Then \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{D}{*_{N}}\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l}\right)^{(1,3)}, where l is an integer with l≥k.
Furthermore, \mathcal{A}{*_{N}}\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l}\right)^{(1,3)}.
The core-EP inverse can be computed through the core inverse.
The next result is in this direction.
Theorem 4.4**.**
Let A∈CI(N)×I(N) and ind(A)=m.
Then A is core-EP invertible if and only if Am is core invertible.
Furthermore, \left(\mathcal{A}^{m}\right)^{\scriptsize\mbox{\tiny\#⃝}}=\left(\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}\right)^{m} and \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{m-1}{*_{N}}\left(\mathcal{A}^{m}\right)^{\scriptsize\mbox{\tiny\#⃝}}
Proof.
Let \left(\mathcal{A}\right)^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{X} and Y=Xm. Now by using Lemma 4.1, we obtain:
[TABLE]
Therefore, Am is core invertible and \left(\mathcal{A}^{m}\right)^{\scriptsize\mbox{\tiny\#⃝}}=\mathcal{Y}=\left(\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}\right)^{m}.
To show the converse part, let Am be core invertible. So by Definition 3.1, we have the following expressions
[TABLE]
Now consider X=Am−1∗N(Am)\mbox#⃝.
Then we have
[TABLE]
Thus X is the core-EP inverse of A and hence \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{X}=\mathcal{A}^{m-1}{*_{N}}(\mathcal{A}^{m})^{\scriptsize\mbox{\tiny\#⃝}}.
∎
The power of the core-EP inverse of a tensor and the core-EP of a tensor power is discussed in the next theorem.
Theorem 4.5**.**
Let A∈CI(N)×I(N) and k be any positive integer.
Then A is core-EP invertible if and only if Ak is core-EP invertible.
In particular, (\mathcal{A}^{k})^{\scriptsize\mbox{\tiny\dagger⃝}}=(\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}})^{k} and \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{k-1}{*_{N}}(\mathcal{A}^{k})^{\scriptsize\mbox{\tiny\dagger⃝}}.
Proof.
Let ind(A)=m and \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{X}. Then by definition of core-EP inverse, we have X∗NAm+1=Am, A∗NX2=X, (A∗NX)∗=A∗NX.
Choose an integer n such that 0≤kn−m<k.
Now we have the following:
[TABLE]
Therefore Xk is the core-EP inverse of Ak and hence (\mathcal{A}^{k})^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{X}^{k}=(\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}})^{k} with ind(Ak)≤n.
Conversely, suppose ind(Ak)=n and (\mathcal{A}^{k})^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{Y}.
So by the definition, we have Y∗N(Ak)n+1=(Ak)n, Ak∗N(Y)2=Y, and (Ak∗NY)∗=Ak∗NY.
To claim the converse part, it is enough to show that X=Ak−1∗NY is the core-EP inverse of A.
The equation (EP) is satisfied because of
[TABLE]
Also, (C2) is satisfied:
[TABLE]
Finally (3T) is verified by
[TABLE]
Thus, X is the core-EP inverse of A with ind(A)≤kn.
Therefore, \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{X}=\mathcal{A}^{k-1}{*_{N}}\mathcal{Y}=\mathcal{A}^{k-1}{*_{N}}\left(\mathcal{A}^{k}\right)^{\scriptsize\mbox{\tiny\dagger⃝}}.
∎
Theorem 4.6**.**
Let A∈CI(N)×I(N with ind(A)=m. Then (\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}})^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{2}{*_{N}}\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}
Proof.
Let \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{X}. So by definition, we have X∗NAm+1=Am, A∗NX2=X, and (A∗NX)∗=A∗NX. Let us assume Y=A2∗NX. To claim the result, we need to show Y is core-EP inverse of X. As
[TABLE]
[TABLE]
[TABLE]
Therefore, \left(\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}\right)^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{Y}=\mathcal{A}^{2}{*_{N}}\mathcal{X}=\mathcal{A}^{2}{*_{N}}\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}.
∎
Since \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}} is of index 1 and Y∗NX2=A2∗NX3=A∗NA∗NX2∗NX=A∗NX2=X, we conclude as a corollary.
Corollary 4.2**.**
Let A∈CI(N)×I(N) with ind(A)=m. Then (\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}})^{\scriptsize\mbox{\tiny\#⃝}}=\mathcal{A}^{2}{*_{N}}\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\left(\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}\right)^{\scriptsize\mbox{\tiny\dagger⃝}}.
Corollary 4.3**.**
Let A∈CI(N)×I(N) with ind(A)=m.
Then \left((\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}})^{\scriptsize\mbox{\tiny\dagger⃝}}\right)^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}.
Proof.
Let \mathcal{B}=\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}. By Theorem 4.6, we have
[TABLE]
∎
Next part of this section discusses additive property of the core-EP inverse.
Theorem 4.7**.**
Let A∗NB=O=B∗NA, and A∗∗NB=O. Then \left(\mathcal{A}+\mathcal{B}\right)^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}+\mathcal{B}^{\scriptsize\mbox{\tiny\dagger⃝}}.
Proof.
Let us assume A∗NB=O=B∗NA, and A∗∗NB=O=(A∗∗NB)∗=B∗∗NA.
Using these assumptions, we obtain
[TABLE]
Let m=max{\mboxind(A,B}.
Then by Lemma 4.1, \mathcal{A}^{m}{*_{N}}\left(\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}\right)^{m}{*_{N}}\mathcal{A}^{m}=\mathcal{A}^{m} and \mathcal{B}^{m}{*_{N}}\left(\mathcal{B}^{\scriptsize\mbox{\tiny\dagger⃝}}\right)^{m}{*_{N}}\mathcal{B}^{m}=\mathcal{B}^{m}.
Now we see that
[TABLE]
and
[TABLE]
Thus (\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}})^{m}+(\mathcal{B}^{\scriptsize\mbox{\tiny\dagger⃝}})^{m} is {1T,3T} inverse of (A+B)m.
So, by Theorem 4.3, we obtain
[TABLE]
This completes the proof.
∎
In the case of the Drazin inverse, the following result was proved in [4].
Theorem 4.8**.**
If A∗NB=O=B∗NA, then (A+B)D=AD+BD.
5 Numerical examples
In this section, we present several numerical examples to verify selected properties discussed in the previous sections. All examples were carefully implemented in MATLAB.
Example 5.1**.**
This example is aimed to the verification of parts (a), (b), (d) and (g) of Theorem 3.2.
Let A∈R(2×2)×(2×2) with
[TABLE]
Verification of part (a) of Theorem 3.2:
We shall compute the core inverse A\mbox#⃝ with the formula
A\mbox#⃝=A#∗NA∗NA†, which turns out to be A\mbox#⃝=A∗N(A3)†∗NA2∗NA†, since it holds A#=A(A3)†A.
We have that,
[TABLE]
and
[TABLE]
Then, the core inverse of A is the following,
[TABLE]
Now, we shall verify the identities (C1), (C2), (3T) for the resulted core inverse A\mbox#⃝.
We have that
[TABLE]
Then, we have that A\mbox#⃝∗NA2=A, hence (C1) is true.
Also, it holds that
[TABLE]
hence, we have that A∗N(A\mbox#⃝)2=A\mbox#⃝ and (C2) is true.
Finally, it holds that
[TABLE]
Therefore, equation (3T) is true.
**Verification of part (d) of Theorem 3.2: **
According to our calculations for part (a), it is easy to see that,
[TABLE]
Hence, from part (c) we have A\mbox#⃝∗N(A\mbox#⃝)†=(A\mbox#⃝)†∗NA\mbox#⃝ and A\mbox#⃝ is EP.
Verification of part (g) of Theorem 3.2:
Since, it holds A#=A(A3)†A, we have that
[TABLE]
and
[TABLE]
Hence, part (g) of Theorem 3.2 is verified.
Example 5.2**.**
In this example we will verify the representation \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{\mathrm{D}}{*_{N}}\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l}\right)^{{\dagger}},\ l\geq\mathrm{ind}({\mathcal{A}}), from Theorem 4.2.
We consider the tensor A∈R(2×2)×(2×2) with
[TABLE]
We observe that rshrank(A)=2, while rshrank(A2)=rshrank(A3)=1. Hence, ind(A)=2.
The Drazin inverse of a tensor is defined by the formula AD=Al(A2l+1)†Al.
So, we need to verify the identities (EP), (C2) and (3T) for the tensor defined by the formula
\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{2}{*_{N}}\left(\mathcal{A}^{5}\right)^{\dagger}{*_{N}}\mathcal{A}^{4}{*_{N}}\left(\mathcal{A}^{2}\right)^{{\dagger}}.
It holds, (A2)†=(A5)†, where
[TABLE]
Therefore, according to the identity \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{2}{*_{N}}\left(\mathcal{A}^{5}\right)^{\dagger}{*_{N}}\mathcal{A}^{4}{*_{N}}\left(\mathcal{A}^{2}\right)^{{\dagger}}, the
core-EP inverse of A is,
[TABLE]
*Because of the previous calculations, the validity of (EP), (C2) and (3T) is clear.
*
Example 5.3**.**
The aim of this example is to verify the representation \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l+1}\right)^{\dagger}, presented in Corollary 4.1.
The input tensor A∈R(2×2)×(2×2) with the entries
[TABLE]
*It holds that rshrank(A)=3 and rshrank(A2)=rshrank(A3)=2.
Hence, ind(A)=2.
For l=2 we will compute the core-EP inverse of A with the formula \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{l}{*_{N}}\left(\mathcal{A}^{l+1}\right)^{\dagger}.
So, we need to verify the identities (EP), (C2) and (3T) for the tensor defined by the formula
\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{2}{*_{N}}\left(\mathcal{A}^{3}\right)^{\dagger}.
We have that*
[TABLE]
[TABLE]
and
[TABLE]
Therefore, the core-EP inverse \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}=\mathcal{A}^{2}{*_{N}}\left(\mathcal{A}^{3}\right)^{\dagger} of A is equal to
[TABLE]
*Now, we shall verify the identities (EP), (C2) and (3T) for the resulted core-EP inverse \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}.
We have that*
[TABLE]
*Then, we have that \mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}}{*_{N}}\mathcal{A}^{3}=\mathcal{A}^{2}, hence (EP) is true.
Also, it holds that*
[TABLE]
*Hence, we have that \mathcal{A}{*_{N}}(\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}})^{2}=\mathcal{A}^{\scriptsize\mbox{\tiny\dagger⃝}} and (C2) is satisfied.
Finally, it holds that*
[TABLE]
Therefore, the equation (3T) is true.
6 Conclusion
So far, the core and core-EP inverses in the matrix case are introduces in different ways.
Our research introduces the core and the core-EP inverses of complex square tensors by means of specific definitions.
Additionally, some of their characterizations, representations and properties are investigated.
The results are verified using specific algebraic approach, based on proposed definitions and previously verified properties.
The approach used here is new even in the matrix case.
Illustrative numerical examples are presented.
In order to finalize our conclusion, it will be useful to mention some possibilities for further research.
-
According to Theorem 3.2(e), the tensor core inverse A\mbox#⃝ is EP.
Therefore, it is reasonable to expect that A\mbox#⃝ inherits all properties of EP matrices stated in [30].
These properties would be an interesting topic for further research.
-
It will be interesting to continue the results from [22] and investigate properties of the λ-Aluthge transform of the core inverse in both the matrix and the tensor case.
-
Also, the reverse order law of multiple tensor products would be an interesting area for further research.
**Acknowledgments.
**Ratikanta Behera acknowledges the support provided by Science and Engineering Research Board (SERB), Department of Science and Technology, India, under the Grant No. EEQ/2017/000747.
Predrag Stanimirović gratefully acknowledges support from the Ministry of Education, Science and Technological Development, Republic of Serbia, Grant No. 174013.