∎
11institutetext: Ratikanta Behera 22institutetext: 22email: [email protected] 33institutetext: R. N. Mohapatra 44institutetext: 44email: [email protected]
55institutetext: Sandip Maji 66institutetext: 66email: [email protected]
Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA.
Department of Mathematics and Statistics, Indian Institute of Science Education and Research Kolkata,
West Bengal, 741242, India
Weighted Moore-Penrose inverses of arbitrary-order tensors
Ratikanta Behera1
Sandip Maji2
R. N. Mohapatra1
(Received: date / Accepted: date)
Abstract
Within the field of multilinear algebra, inverses and generalized inverses of tensors based on the Einstein product have been investigated over the past few years. In this paper, we explore the singular value decomposition and full-rank decomposition of arbitrary-order tensors using reshape operation. Applying range and null space of tensors along with the reshape operation; we further study the Moore-Penrose inverse of tensors and their cancellation properties via the Einstein product. Then we discuss weighted Moore-Penrose inverses of arbitrary-order tensors using such product. Following a specific algebraic approach, a few characterizations and representations of these inverses are explored. In addition to this, we obtain a few necessary and sufficient conditions for the reverse-order law to hold for weighted Moore-Penrose inverses of arbitrary-order tensors.
1 Introductions
1.1 Background and motivation
Tensors or hypermatrix are multidimensional generalizations of vectors and matrices, and have attracted tremendous interest in recent years (see kolda ; Marcar ; loan ; Qil05 ; Sho13 ). Indeed, multilinear systems are closely related to tensors and such systems are encountered in a number of fields of practical interest, i.e., signal processing (see LalmV00 ; SidLaP17 ; CopBol89 ), scientific computing (see BeyMo05 ; ShiWeL13 ; BraliNT13 ), data mining Chew07 , data compression and retrieval of large structured data (see SilL08 ; MaoChLY18 ). Further, the Moore-Penrose inverse of tensors plays an important role in solving such multilinear systems (see bm ; JinBa17 ; ma2019 ) and the reverse-order law for the Moore-Penrose inverses of tensors yields a class of interesting problems that are fundamental in the theory of generalized inverses of tensors (see PanRad18 ; JR_rev ). In view of these, multilinear algebra is drawing more and more attention from researchers (see JinBa17 ; Bader:2006 ; Marcar ; Kru77 ; LalmV00 ), specifically, the recent findings in (see bm ; BraliNT13 ; weit2 ; PanRad18 ; psmv18 ; sun ), motivate us to study this subject in the framework of arbitrary-order tensors.
Let CI1×⋯×IN(RI1×⋯×IN) be the set of order
N and dimension I1×⋯×IN tensors over the complex (real)
field C(R). Let A∈CI1×⋯×IN be a multiway array with N-th order tensor, and I1,I2,⋯,IN be dimensions of the first, second,⋯, Nth way,
respectively. Indeed, a matrix is a second order tensor, and a vector is a first order tensor. We denote Rm×n to be the set of all m×n matrices with real entries. Note that throughout the paper, tensors are represented in calligraphic letters like A, and the notation (A)i1...iN=ai1...iN represents the scalars. Each entry of A is denoted by ai1...iN.
The Einstein product (see ein ) A∗NB∈CI1×⋯×IM×K1×⋯×KL of tensors A∈CI1×⋯×IM×J1×⋯×JN and B∈CJ1×⋯×JN×K1×⋯×KL is defined
by the operation ∗N via
[TABLE]
The Einstein product is not commutative but associative, and distributes with respect to tensor addition. Further, cancellation does not work but there is a multiplicative identity tensor I. This type of product of tensors is used in the study of the theory of relativity ein and also used in the area of continuum mechanics lai .
On the other hand, one of the most successful developments in the world of linear algebra is the concept of Singular Value Decomposition (SVD) of matrices BenGr74 . This concept gives us important information about a matrix such as its rank, an orthonormal basis for the column or row space, and reduction to a diagonal form Tian04 . Recently this concept is also used in low rank matrix approximations Gra04 ; ishteva2011best ; ye2005generalized . Since tensors are natural multidimensional generalizations of matrices, there are many applications involving arbitrary-order tensors. Further, the problem of decomposing tensors is approached in a variety of ways by extending the SVD, and extensive studies have exposed many aspects of such decomposition and its applications ( see for example CheQZ17 ; kolda ; Kru77 ; LalmV00 ; SidLaP17 ; LIANG2018 ). However, the existing framework of SVD of tensors appears to be insufficient and/or inadequate in several situations.
The aim of this paper is to present a proper generalization of the SVD of arbitrary-order tensors under Einstein tensor product. In fact, the existing form BraliNT13 of the SVD is well suited for square tensors, which is defined as follows:
Definition 1
(Definition 2.8, BraliNT13 ):
The transformation defined as;
f:TI,J,I,J(R)⟶MIJ,IJ(R) with f(A)=A and defined component wise as;
[TABLE]
where TI,J,I,J(R)={A∈RI×J×I×J : det(f(A))=0}. In general for any even order tensor, the transformation is defined as;
f:TI1,...,IN,I1,...,JN(R)⟶MI1...IN,J1...JN(R)
[TABLE]
Using the above Definition and Theorem 3.17 in BraliNT13 , we obtain the SVD of a tensor A∈RI×J×I×J, which can be extended only to any square tensor, i.e., for A∈RI1×I2×⋯×IN×I1×I2×⋯×IN.
Extension of the SVD for an arbitrary-order tensor using this method BraliNT13 is impossible, since f is not a homomorphism for even-order and/or arbitrary-order tensors. In fact, the Einstein product is not defined for the following two even-order tensors, A∈RI1×I2×J1×J2 and B∈RI1×I2×J1×J2, i.e., A∗2B is not defined.
Therefore, our aim in this paper is to find the SVD for any arbitrary order tensors using reshape operation, which is discussed in the next section.
In addition, recently there has been increasing interest in analyzing inverses and generalized inverses of tensors based on different tensor products (seeSahBe20 ; Wei18 ; JinBa17 ; BraliNT13 ; sun ). The representations and properties of the ordinary tensor inverse were introduced in BraliNT13 . This interpretation is extended to the Moore-Penrose inverse of tensors in sun and investigated for a few characterizations of different generalized inverses of tensors via Einstein product in bm . Appropriately, Behera and Mishra bm posed the open question: “Does there exist a full rank decomposition of tensors ? If so, can this be used to compute the Moore-Penrose inverse of a tensor”? It is worth mentioning that Liang and Zheng LIANG2018 investigated this question and discuss the computation of Moore-Pensore inverse of tensors using full rank decomposition. Here we extend this work for weighted Moore-Pensore inverse using reshape operation. When investigating on the weighted Moore-Pensore inverse, we find some interesting characterization, which is discussed in the next Section.
Recently, Panigrahy and Mishra pami1 investigated the Moore-Penrose inverse of a product of two tensors via Einstein product. Using such theory of Einstein product, Stanimirovic, et al. psmv18 also introduced some basic properties of the range and null space of multidimensional arrays, and the effective definition of the tensor rank, termed as reshaping rank. In this respect, Panigrahy et al. PanRad18 obtained a few necessary and sufficient conditions for the reverse order law for the Moore-Penrose inverses of tensors, which can be used to simplify various tensor expressions that involve inverses of tensor products dingwei . Since then, many authors investigate the reverse order law for various classes of generalized inverses of tensors chetheory ; JR_rev ; Mispa18 . At the same time, the representations of the weighted Moore-Penrose inverse weit2 of an even-order tensor was introduced via the Einstein product. In this context, we focus our attention on exploring some characterizations and representation of weighted Moore-Penrose inverses of arbitrary-order tensors.
In this paper, we study the weighted Moore-Penrose inverse of an arbitrary-order tensor. This study can lead to the enhancement of the computation of SVD and full rank decomposition of arbitrary-order tensor using reshape operation. With that in mind, we discuss some identities involving the weighted Moore-Penrose inverses of tensors and then obtain a few necessary and sufficient conditions of the reverse order law for the weighted Moore-Penrose inverses of arbitrary-order tensors via the Einstein product.
1.2 Outline
We organize the paper as follows: In the next subsection, we introduce some notations and definitions which are helpful in proving the main results of this paper. In Section 2, we provide the main results of the paper. In order to do so, we introduce SVD and full rank decomposition of an arbitrary-order tensor using reshape operation. Within this framework, the Moore-Penrose and the generalized weighted Moore-Penrose inverse for arbitrary-order tensor is defined. Furthermore, we obtain several identities involving the weighted Moore-Penrose inverses of tensors via Einstein product. The Section 3 contains a few necessary and sufficient conditions of the reverse-order law for the weighted Moore-Penrose inverses of tensors.
1.3 Notations and definitions
For convenience, we first briefly explain a few essential facts about the Einstein product of tensors, which are found in bm ; BraliNT13 ; sun . For a tensor A=(ai1...iMj1...jN)∈CI1×⋯×IM×J1×⋯×JN, the tensor B=(bj1...jNi1...iM)∈CJ1×⋯×JN×I1×⋯×IM is said to be conjugate transpose of A, if bj1...jNi1...iM=ai1...iMj1...jN and B is denoted by A∗. When bj1...jNi1...iM=ai1...iMj1...jN, B
is the transpose of A, denoted by AT. The definition of a diagonal tensor was introduced as a square tensor in BraliNT13 (Definition 3.12) and as an even-order tensor in sun . Here we introduce arbitrary-order diagonal tensor, as follows:
Definition 2
A tensor D∈CI1×⋯×IM×J1×⋯×JN with entries di1...iMj1...jN
is
called a diagonal
tensor if
di1...iMj1...jN=0, when
[i1+∑k=2M(ik−1)∏l=1k−1Il]=[j1+∑k=2N(jk−1)∏l=1k−1Jl].
Now we recall the definition of an identity tensor below.
Definition 3
(Definition 3.13, BraliNT13 ) A tensor IN∈CJ1×⋯×JN×J1×⋯×JN with entries
(IN)i1i2⋯iNj1j2⋯jN=∏k=1Nδikjk,
where
[TABLE]
is called a unit tensor or identity tensor.
Note that throughout the paper, we denote IM,IL and IR as identity tensors in the space CI1×⋯×IM×I1×⋯×IM, CK1×⋯×KL×K1×⋯×KL and CH1×⋯×HR×H1×⋯×HR respectively.
Further, a tensor O denotes the zero tensor if all the entries are zero.
A tensor A∈CI1×⋯×IN×I1×⋯×IN is Hermitian if A=A∗ and skew-Hermitian if A=−A∗. Subsequently, a tensor A∈CI1×⋯×IN×I1×⋯×IN is unitary if A∗NA∗=A∗∗NA=IN, and idempotent if A∗NA=A. In the case of tensors of real entries,
Hermitian, skew-Hermitian and unitary tensors are called symmetric (see Definition 3.16,
BraliNT13 ), skew-symmetric and orthogonal (see Definition 3.15, BraliNT13 ) tensors, respectively.
Next we present the definition of the reshape operation, which was introduced earlier in psmv18 . This is a more general way of rearranging the entries in a tensor (it is also a standard Matlab function), as follows:
Definition 4
(Definition 3.1, psmv18 ):
The 1-1 and onto reshape map, rsh, is defined as: rsh:CI1×⋯×IM×J1×⋯×JN⟶CI1⋯IM×J1⋯JN with
[TABLE]
where A∈CI1×⋯×IM×J1×⋯×JN and the matrix A∈CI1⋯IM×J1⋯JN. Further, the inverse reshaping is the mapping defined as: rsh−1:CI1⋯IM×J1⋯JN⟶CI1×⋯×IM×J1×⋯×JN with
[TABLE]
where the matrix A∈CI1⋯IM×J1⋯JN and the tensor A∈CI1×⋯×IM×J1×⋯×JN.
Further, Lemma 3.2 in psmv18 defined the rank of a tensor, A, denoted by rshrank(A) as
[TABLE]
Continuing this research, Stanimirovic et. al. in psmv18 discussed the homomorphism properties of the rsh function, as follows,
Lemma 1
(Lemma 3.1 psmv18 ):
Let A∈CI1×⋯×IM×J1×⋯×JN and B∈CJ1×⋯×JN×K1×⋯×KL be given tensors. Then
[TABLE]
where A=rsh(A)∈CI1⋯IM×J1⋯JN,B=rsh(B)∈CJ1⋯JN×K1⋯KL.
An immediate consequence of the above Lemma is the following:
[TABLE]
Existence of SVD of any square tensor is discussed in BraliNT13 . Using this framework, Jun and Wei weit2 defined Hermitian positive definite tensors, as follows:
Definition 5
(Definition 1, weit2 )
For P∈CI1×⋯×IN×I1×⋯×IN, if there exists a unitary tensor U∈CI1×⋯×IN×I1×⋯×IN such that
[TABLE]
where D∈CI1×⋯×IN×I1×⋯×IN is a diagonal tensor with positive diagonal entries, then P is said to be a Hermitian positive definite tensor.
Further, Jun and Wei weit2 defined the square root of a Hermitian positive definite tensor, P, as follows:
[TABLE]
where D1/2 is the diagonal tensor, which obtained from D by taking the square root of all its diagonal entries. Notice that P1/2 is always non-singular and its inverse is denoted by P−1/2.
we now recall the definition of the range and the null space of arbitrary order tensors.
Definition 6
( Definition 2.1,psmv18 ):
The null space and the range space of a tensor A∈CI1×⋯×IM×J1×⋯×JN are defined as follows:
[TABLE]
It is easily seen that N(A) is a subspace of CJ1×⋯×JN and R(A) is a subspace of CI1×⋯×IM. In particular, N(A)={O} if and only if A is left invertiable via ∗M operation and R(A)=CI1×⋯×IM if and only if A is right invertiable via ∗N operation.
2 Main results
Mathematical modelling of problems in science and engineering typically involves solving multilinear systems; this becomes particularly challenging for problems having an arbitrary-order tensor. However, the existing framework on Moore-Penrose inverses of arbitrary-order tensor appears to be insufficient and/or inappropriate. It is thus of interest to study the theory of Moore-Penrose inverse of an arbitrary-order tensor via the Einstein product.
2.1 Moore-Penrose inverses
One of the most widely used methods is the SVD to compute Moore-Penrose inverse. Here we present a generalization of the SVD via the Einstein product.
Lemma 2
Let A∈CI1×⋯×IM×J1×⋯×JN with rshrank(A)=r. Then the SVD for tensor A has the form
[TABLE]
where U∈CI1×⋯×IM×I1×⋯×IM and V∈CJ1×⋯×JN×J1×⋯×JN are unitary tensors, and D∈CI1×⋯×IM×J1×⋯×JN is a diagonal tensor, defined by
[TABLE]
where I=[i1+∑k=2M(ik−1)∏l=1k−1Il] and J=[j1+∑k=2N(jk−1)∏l=1k−1Jl].
Proof
Let A=rsh(A)∈CI1⋯IM×J1⋯JN. In the context of the SVD of the matrix A, one can write
A=UDV∗, where U∈CI1⋯IM×I1⋯IM and V∈CJ1⋯JN×J1⋯JN are unitary matrices and D∈CI1⋯IM×J1⋯JN is a diagonal matrix with
[TABLE]
From relations (7) and (8), we can write
[TABLE]
where U=rsh−1(U),V=rsh−1(V) and D=rsh−1(D).
Further, U∗MU∗=rsh−1(UU∗)=rsh−1(I)=IM and V∗NV∗=rsh−1(VV∗)=rsh−1(I)=IN gives A=U∗MD∗NV∗, where U and V are unitary tensors and D diagonal tensor.
Remark 1
The authors of in LIANG2018 proved the Theorem 3.2 for a square tensor. Here we proved for an arbitrary-order tensor. Specifically, the decomposition is followed from the homomorphism property of reshape map.
Continuing this study, we recall the definition of the Moore-Penrose inverse of tensors in CI1×⋯×IM×J1×...×JN via the Einstein product, which was introduced in LIANG2018 for arbitrary-order.
Definition 7
Let A∈CI1×⋯×IM×J1×...×JN. The tensor X∈CJ1×⋯×JN×I1×⋯×IM satisfying the following four tensor equations:
[TABLE]
is called the Moore-Penrose inverse of A, and is
denoted by A†.
Similarly, to the proof of Theorem 3.2 in sun , we have the existence and uniqueness of the Moore-Penrose inverse of an arbitrary-order tensor in CI1×⋯×IM×J1×...×JN, as follows.
Theorem 2.1
The Moore-Penrose inverse of an arbitrary-order tensor, A∈CI1×⋯×IM×J1×⋯×JN exists and is unique.
By straightforward derivation, the following results can be obtained, which also hold (Lemma 2.3 and Lemma 2.6) in bm for even-order tensor.
Lemma 3
Let A∈CI1×⋯×IM×J1×⋯×JN. Then
- (a)
A∗=A†∗MA∗NA∗=A∗∗MA∗NA†;**
2. (b)
A=A∗NA∗∗M(A∗)†=(A∗)†∗NA∗∗MA;**
3. (c)
A†=(A∗∗MA)†∗NA∗=A∗∗M(A∗NA∗)†.**
From psmv18 , we present the relation of range space of multidimensional arrays
which will be used to prove next Lemma.
Lemma 4
(Lemma2.2, psmv18 )
Let A∈CI1×⋯×IM×J1×⋯×JN, B∈CI1×⋯×IM×K1×⋯×KL. Then R(B)⊆R(A) if and only if there exists U∈CJ1×⋯×JN×K1×⋯×KL such that B=A∗NU.
We now discuss the important relation between range and Moore-Penrose inverse of an arbitrary order tensor, which are mostly used in various section of this paper.
Lemma 5
*Let A∈CI1×⋯×IM×J1×⋯×JN and B∈CI1×⋯×IM×K1×⋯×KL. Then
(a) R(B)⊆R(A)⇔A∗NA†∗MB=B,
(b) R(A)=R(B)⇔A∗NA†=B∗LB†,
(c) R(A)=R[(A†)∗] and R(A∗)=R(A†).*
Proof
(a) Using the fact that R(A∗NU)⊆R(A) for two tensors A and U in appropriate order, one can conclude R(B)⊆R(A) from A∗NA†∗MB=B. Applying Lemma 4, we conclude B=A∗NP from R(B)⊆R(A), where P∈CJ1×⋯×JN×K1×⋯×KL.
Hence, A∗NA†∗MB=A∗NA†∗MA∗NP=B.
(b) From (a), we have R(A)=R(B) if and only if A∗NA†∗MB=B and B∗LB†∗MA=A which implies B†=B†∗MA∗NA†. Then
A∗NA†=B∗LB†∗MA∗NA†=B∗LB†.
(c) Using the Lemma 3 [(b),(c)], one can conclude that R(A)⊆R[(A†)∗] and R[(A†)∗]⊆R(A) respectively. This follows R(A)=R[(A†)∗]. Further, replacing A by A∗ and using the fact (A∗)†=(A†)∗ we obtain R(A∗)=R(A†).
Using the fact that R(A∗NB)⊆R(A) for two tensor A and B and the Definition-7, we get,
[TABLE]
where A∈CI1×⋯×IM×J1×⋯×JN and B∈CJ1×⋯×JN×K1×⋯×KL. Now using the method as in the proof of Lemma 5, one can prove the next Lemma.
Lemma 6
*Let A∈CI1×⋯×IM×J1×⋯×JN and B∈CK1×⋯×KL×J1×⋯×JN. Then
(a) R(B∗)⊆R(A∗)⇔B∗NA†∗MA=B,
(b) R(A∗)=R(B∗)⇔A†∗MA=B†∗LB,
(c) R(A∗NB†)=R(A∗NB∗).*
Consider A, B, X∈CI1×⋯×IN×I1×⋯×IN and all are invertible, the following equation
[TABLE]
is called the cancellation property of product of tensors (A,B,X).
When
the ordinary inverse is replaced by generalized inverse with suitable order, this cancellation property is not true in general. In this context, we concentrate to characterize all triples (A,B,X) which satisfy
[TABLE]
where X∈CI1×⋯×IM×J1×⋯×JN, A∈CK1×⋯×KL×I1×⋯×IM and B∈CJ1×⋯×JN×H1×⋯×HR. The first result obtained below deals with the necessary condition of this properties.
Lemma 7
*Let X∈CI1×⋯×IM×J1×⋯×JN, A∈CK1×⋯×KL×I1×⋯×IM and B∈CJ1×⋯×JN×H1×⋯×HR.
If X†=B∗R(A∗MX∗NB)†∗LA, then
X=A†∗LA∗MX and X=X∗NB∗RB†.*
Proof
Let, X†=B∗R(A∗MX∗NB)†∗LA. It is quite obvious that X†=X†∗MA†∗LA=B∗RB†∗NX†.
Hence, from Lemma 5[(a),(c)] and Lemma 6(a), we have
R[(X†)∗]⊆R(A∗),
i.e,R(X)⊆R(A†) and R(X†)⊆R(B),i.e.,R(X∗)⊆R[(B†)∗].
Which implies X=A†∗LA∗MX and X=X∗NB∗RB†.
The following example shows that converse of the above theorem is not true in general.
Example 1
Consider tensors
A=(aijkl)1≤i,j,k,l≤2∈R2×2×2×2, B=A∗ and X=(xijkl)1≤i,j,k,l≤2∈R2×2×2×2 such that
[TABLE]
and
[TABLE]
Then,
[TABLE]
Thus we have
[TABLE]
But
[TABLE]
where
[TABLE]
[TABLE]
However, the converse of Lemma 7 holds under the assumption of additional condition which is stated below.
Lemma 8
Let X∈CI1×⋯×IM×J1×⋯×JN,A∈CK1×⋯×KL×I1×⋯×IM and B∈CJ1×⋯×JN×H1×⋯×HR.
If X=A†∗LA∗MX=X∗NB∗RB† along with the condition
K=A†∗L(A∗MX)∗N(A∗MX)†∗LA and L=B∗R(X∗NB)†∗M(X∗NB)∗RB† are Hermitian, Then X†=B∗R(A∗MX∗NB)†∗LA.
Proof
Let W=B∗R(A∗MX∗NB)†∗LA.
Now, X∗NW∗MX=(A†∗LA∗MX∗NB∗RB†)∗NB∗R(A∗MX∗NB)†∗LA∗M(A†∗LA∗MX∗NB∗RB†)
= A†∗L[(A∗MX∗NB)∗R(A∗MX∗NB)†∗L(A∗MX∗NB)]∗RB†=A†∗L(A∗MX∗NB)∗RB†=X.
Further, W∗MX∗NW=B∗R(A∗MX∗NB)†∗LA∗MX∗NB∗R(A∗MX∗NB)†∗LA=W.
Again K=X∗NW and L=W∗MX are Hermitian.
Hence W=X†.
From Lemma 7 It is clear that, If X†=B∗R(A∗MX∗NB)†∗LA, Then R(A∗MX)=R(A∗MX∗NB), which implies that (A∗MX∗NB)∗R(A∗MX∗NB)†=A∗MX∗N(A∗MX)†. It is easy to verify that
X∗NX†=K and X†∗MX=L, and both K and L both are Hermitian. Therefore, a necessary and sufficient condition for the cancellation law can be stated as:
Theorem 2.2
*Let X∈CI1×⋯×IM×J1×⋯×JN,A∈CK1×⋯×KL×I1×⋯×IM and B∈CJ1×⋯×JN×H1×⋯×HR.
X†=B∗R(A∗MX∗NB)†∗LA if and only if
X=A†∗LA∗MX=X∗NB∗RB† and both K=A†∗L(A∗MX)∗N(A∗MX)†∗LA and L=B∗R(X∗NB)†∗M(X∗NB)∗RB† are Hermitian.*
We now proceed to discuss a few necessary and sufficient conditions for the cancellation law.
Corollary 1
Let X∈CI1×⋯×IM×J1×⋯×JN,A∈CK1×⋯×KL×I1×⋯×IM and B∈CJ1×⋯×JN×H1×⋯×HR, and
X†=B∗R(A∗MX∗NB)†∗LA if and only if both the equations
[TABLE]
Proof
By taking B=I in Theorem 2.2, we have X†=(A∗MX)†∗LA if and only if
A†∗L(A∗MX)∗N(A∗MX)†∗LA is Hermitian and X=A†∗LA∗MX. Similarly with the special case A=I in Theorem 2.2, we get
X†=B∗R(X∗NB)† if and only if B∗R(X∗NB)†∗M(X∗NB)∗RB† is Hermitian and X=X∗NB∗RB†. Using the fact of Theorem2.2 one can prove the required result.
Using Lemma 5 and Lemma 6 in the corollary 1 one obtain the following result.
Theorem 2.3
Let X∈CI1×⋯×IM×J1×⋯×JN, A∈CK1×⋯×KL×I1×⋯×IM and B∈CJ1×⋯×JN×H1×⋯×HR, then
[TABLE]
if and only if
[TABLE]
Proof
Suppose that X†=B∗R(A∗MX∗NB)†∗LA.
Then from Corollary 1,
X†=(A∗MX)†∗LA and X†=B∗R(X∗NB)†.
Now, R(X)=R[(X†)∗]=R[A∗∗L{(A∗MX)†}∗]=R(A∗∗LA∗MX) and R(X∗)=R(X†)=R[B∗R(X∗NB)†]=R[B∗R(X∗NB)∗]=R(B∗RB∗∗NX∗).
Therefore, R(X∗NX∗∗MA∗)⊆R(X)=R(A∗∗LA∗MX)⊆R(A∗), i.e., R(X∗NX∗∗MA∗)⊆R(A∗)
and
R(A∗∗LA∗MX)⊆R(X) implies that (A∗MX)†=X†∗MA†.
R(X)⊆R(A†) implies A†∗LA∗MX=X.
Similarly from R(X∗)=R(B∗RB∗∗NX∗) it follows that (X∗NB)†=B†∗NX†,
X=X∗NB∗RB†.
Conversely, Using Lemma 5(c), Lemma6(a) in the fact
R[(X†)∗]=R(X)⊆R(A†)=R(A∗) and R(X†)=R(X∗)⊆R[(B†)∗]=R(B).
One have X†=X†∗MA†∗LA and X†=B∗RB†∗NX†.
Now, (A∗MX)†∗LA=X†∗MA†∗LA=X† and B∗R(X∗NB)†=B∗RB†∗NX†=X†. then by Corollary1 proof is done.
From the above theorem one can conclude the necessary and sufficient condition for cancellation law in terms of range.
Lemma 9
Let X∈CI1×⋯×IM×J1×⋯×JN, A∈CK1×⋯×KL×I1×⋯×IM and B∈CJ1×⋯×JN×H1×⋯×HR.
Then
[TABLE]
if and only if
[TABLE]
2.2 Weighted Moore-Penrose inverse
Weighted Moore-Penrose inverse of even-order tensor, A∈CI1×⋯×IK×J1×⋯×JK was introduced in weit2 , very recently. Here we have discussed weighted Moore-Penrose inverse for an arbitrary-order tensor via Einstein product, which is a special case of generalized weighted Moore-Penrose inverse.
Definition 8
Let A∈CI1×⋯×IM×J1×⋯×JN,and a pair of invertible and Hermitian tensors M∈CI1×⋯×IM×I1×⋯×IM and N∈CJ1×⋯×JN×J1×⋯×JN. A tensor Y∈CJ1×⋯×JN×I1×⋯×IM is said to be the generalized weighted Moore-Penrose inverse of A with respect to M and N, if Y satisfies the following four tensor equations
[TABLE]
In particular, when both M, N are Hermitian positive definite tensors, the tensor Y
is called the weighted Moore-Penrose inverse of A and denote by AM,N†.
However, the generalized weighted Moore-Penrose inverse Y does not always exist for any tensor A, as shown below with an example.
Example 2
Consider tensors
A=(aijk)∈R2×3×2 and M=(aijkl)∈R2×3×2×3 with N=(nij)∈R2×2 such that
[TABLE]
with
[TABLE]
[TABLE]
Then we have
[TABLE]
This shows AT∗2M∗2A is not invertible. Consider the generalized weighted Moore-Penrose inverse Y∈R2×2×3 of the given tensor A is exist, then using relation (1) and relation (3) of Definition 8, we have
[TABLE]
Since (AT∗2A)−1∗1AT∗2A=I, then A is left cancellable, now (16) becomes
[TABLE]
this follows that AT∗2M∗2A is invertiable, which is a contradiction.
At this point one may be interested to know when does the generalized weighted Moore-Penrose inverse exist ? The answer to this question is explained in the following theorem.
Theorem 2.4
Let A∈CI1×⋯×IM×J1×⋯×JN. If both M∈CI1×⋯×IM×I1×⋯×IM and N∈CJ1×⋯×JN×J1×⋯×JN are Hermitian positive definite tensors. Then generalized weighted Moore-Penrose inverse of an arbitrary-order tensor A exists and is unique, i.e., there exist a unique tensor X∈CJ1×⋯×JN×I1×⋯×IM, such that,
[TABLE]
where M1/2 and N1/2 are square roots of M and N respectively, satisfy all four relations of Definition 8.
One can prove the above theorem, using Theorem 1 in weit2 and Theorem 2.1. Further, it is know that identity tensors are always Hermitian and positive definite, therefore, for any
A∈CI1×⋯×IM×J1×⋯×JN, AIM,IN† exists and AIM,IN†=A†, which is called the Moore-Penrose inverse of A. Specifically, if we take M=IM or N=IN in Eq.(18), then the following identities are hold.
Corollary 2
Let A∈CI1×⋯×IM×J1×⋯×JN. Then
[TABLE]
Using the Definition 8 and following the Lemma 2 in weit2 one can write
(AM,N†)N,M†=A and (AM,N†)∗=(A∗)N−1,M−1†, where A is any arbitrary-order tensor.
Now we define weighted conjugate transpose of a arbitrary-order tensor, as follows.
Definition 9
Let M∈CI1×⋯×IM×I1×⋯×IM and N∈CJ1×⋯×JN×J1×⋯×JN are Hermitian positive definite tensors, the weighted conjugate transpose of A∈CI1×⋯×IM×J1×⋯×JN is denoted by AN,M# and defined as AN,M#=N−1∗NA∗∗MM.
Next we present the properties of the weighted conjugate transpose of any arbitrary-order tensor, A∈CI1×⋯×IM×J1×⋯×JN, as follows.
Lemma 10
*Let A∈CI1×⋯×IM×J1×⋯×JN, B∈CJ1×⋯×JN×K1×⋯×KL and Hermitian positive definite tensors M∈CI1×⋯×IM×I1×⋯×IM, P∈CK1×⋯×KL×K1×⋯×KL and N∈CJ1×⋯×JN×J1×⋯×JN.Then
(a) (AN,M#)M,N#=A,
(b) (A∗NB)P,M#=BP,N#∗NAN,M#.*
Adopting the result of Lemma 10(b) and the definition of the weighted Moore-Penrose inverse, we can write the following identities.
Lemma 11
Let A∈CI1×⋯×IM×J1×⋯×JN, and M∈CI1×⋯×IM×I1×⋯×IM , N∈CJ1×⋯×JN×J1×⋯×JN are Hermitian positive definite tensors.
Then
- (a)
(AN,M#)N,M†=(AM,N†)M,N#**
2. (b)
A=A∗NAN,M#∗M(AN,M#)N,M†=(AN,M#)N,M†∗NAN,M#∗MA;**
3. (c)
AN,M#=AM,N†∗MA∗NAN,M#=AN,M#∗MA∗NAM,N†.
Using the Lemma 3.17 in PanRad18 on two invertible tensors B∈CI1×⋯×IM×I1×⋯×IM and C∈CJ1×⋯×JN×J1×⋯×JN, one can write the following identities
[TABLE]
where A is the arbitrary-order tensor, i.e., A∈CI1×⋯×IM×J1×⋯×JN. By Eq.(19) and Corollary 2, we get following results.
Lemma 12
*Let A∈CI1×⋯×IM×J1×⋯×JN, and M∈CI1×⋯×IM×I1×⋯×IM, N∈CJ1×⋯×JN×J1×⋯×JN be a pair of Hermitian positive definite tensors. Then
(a) AM,IN†∗MA=(M1/2∗MA)†∗MM1/2∗MA=A†∗MA,
(b) A∗NAIM,N†=A∗NN−1/2∗N(A∗NN−1/2)†=A∗NA†,
(c) (AM,IN†)∗=M1/2∗M[A∗∗MM1/2]†,
(d) (AIM,N†)∗=(N−1/2∗NA∗)†∗NN−1/2.*
The considerable amount of conventional and important facts with the properties concerning the range space of arbitrary-order tensor, the following theorem obtains the well-formed result.
Theorem 2.5
Let U∈CI1×⋯×IM×J1×⋯×JN, V∈CJ1×⋯×JN×K1×⋯×KL. Let M∈CI1×⋯×IM×I1×⋯×IM and N∈CK1×⋯×kL×K1×⋯×KL be a pair of Hermitian positive definite tensors. Then
[TABLE]
Proof
Let X=(U†)∗∗NV and Y=U∗N(V†)∗.
From Lemma 6(c) we get
[TABLE]
Now, using Lemma 6(b) and Lemma 5(b) along with the fact (V†)∗=V∗LV†∗N(V†)∗, we obtain,
[TABLE]
Replacing U and V by M1/2∗MU and V∗LN−1/2 respectively on the above result, we get
[TABLE]
Substituting the above result in Eq.(18) we get the desired result.
Further, in connection with range space of arbitrary-order tensor, the following Theorem collects some useful identities of weighted Moore-Penrose inverses.
Theorem 2.6
Let U∈CI1×⋯×IM×J1×⋯×JN, V∈CJ1×⋯×JN×K1×⋯×KL and W∈CK1×⋯×KL×H1×⋯×HR. If A=U∗NV∗LW, where M∈CI1×⋯×IM×I1×⋯×IM and N∈CH1×⋯×HR×H1×⋯×HR are Hermitian positive definite tensors. Then
- (a)
AM,N†=XIN,N†∗NV∗LYM,IL†, where X=(U∗NV∗LV†)†∗MA and Y=A∗R(V†∗NV∗LW)†;
2. (b)
AM,N†=XIL,N†∗LV∗∗NV∗LV∗∗NYM,IN†, where X=[U∗N(V†)∗]†∗MA and Y=A∗R[(V†)∗∗LW]†.
Proof
(a) From Eq.(18) we have
[TABLE]
where U1=M1/2∗MU and W1=W∗RN−1/2.
On the other hand, by Eq. (12), we have
[TABLE]
Also by Lemma 5(c), we get
[TABLE]
Thus, by using Lemma 5[(a),(b)] and Lemma 6[(a),(b)], we have
[TABLE]
Replacing U by U1 and W by W1 in Eq.(20) and then using Lemma 12[(a),(b)], we get
[TABLE]
(b) Following the Lemma 3(b) and Eq. (12), we get
R(A)=R(Y) and
R(X∗)=R[(V∗∗NV∗LW)∗∗L(U∗N(V†)∗)∗∗M{(U∗N(V†)∗)∗}†]=R(A∗).
Also by using Lemma 5(c)
[TABLE]
Using Lemma 5[(a),(b)] and Lemma 6[(a),(b)], we obtain
[TABLE]
Let U1=M1/2∗MU, W1=W∗RN−1/2 and A1=U1∗NV∗LW1.
Then using Eq. (21) and the Lemma 12 [(a),(b)], we can write
[TABLE]
Therefore, AM,N†=N−1/2∗RA1†∗MM1/2=XIL,N†∗LV∗∗NV∗LV∗∗NYM,IN†.
Theorem 2.7
Let U∈CI1×⋯×IM×J1×⋯×JN, V∈CJ1×⋯×JN×K1×⋯×KL and W∈CK1×⋯×KL×H1×⋯×HR. Also let M∈CI1×⋯×IM×I1×⋯×IM and N∈CH1×⋯×HR×H1×⋯×HR be a pair of Hermitian positive definite tensors. Then
- (a)
(U∗NV∗LW)M,N†=[(UM,IN†)∗∗NV∗LW]M−1,N†∗M(UM,IN†)∗∗NV∗L(WIL,N†)∗∗R[U∗NV∗L(WIL,N†)∗]M,N−1†;
2. (b)
(U∗NV∗LW)M,N†=[{(U∗NV)M,IL†}∗∗LW]M−1,N†∗M[(U∗NV)M,IL†]∗∗LV†∗N[(V∗LW)IN,N†]∗∗R[U∗N{(V∗LW)IN,N†}∗]M,N−1†.
Proof
(a) Let A=U∗NV∗LW,
X=(U†)∗∗NV∗LW and Y=U∗NV∗L(W†)∗.
Using Lemma 6(c), we get
[TABLE]
Further, using the fact that W†=W†∗N(W†)∗∗NW∗,and Lemma 5(b) and Lemma 6(b), we can write,
[TABLE]
Using the above result to
[(M1/2∗MU)∗NV∗L(W∗RN−1/2)]† and following the Lemma 12[(c),(d)] we get,
[TABLE]
(b) Let A=U∗NV∗LW, X=[(U∗NV)†]∗∗LW and Y=U∗N[(V∗LW)†]∗.
Using Lemma6(c), we get
[TABLE]
From Lemma 3(a), one can write [(V∗LW)†]∗=(V∗LW)∗R(V∗LW)†∗N[(V∗LW)†]∗.
Now using Lemma 5(b) and Lemma 6(b), we obtain
[TABLE]
Replacing U and W by M1/2∗MU and W∗RN−1/2 respectively on the above result, we have
[TABLE]
Substituting the above result in Eq.(18) one can get the desired result.
Theorem 2.8
Let U∈CI1×⋯×IM×J1×⋯×JN, V∈CJ1×⋯×JN×K1×⋯×KL and W∈CK1×⋯×KL×H1×⋯×HR. If A=U∗NV∗LW, and M∈CI1×⋯×IM×I1×⋯×IM, N∈CH1×⋯×HR×H1×⋯×HR be a pair of Hermitian positive definite tensors, Then
[TABLE]
where X=U†∗MA and Y=A∗RW†.
Proof
Let U1=M1/2∗MU and W1=W∗RN−1/2. It is known, from Eq.(18),
[TABLE]
Now using Eq.(12) we have
R(X∗)=R[(U∗NV∗LW)∗∗N(U∗)†]=R(A∗) and
R(Y)=R(A).
Also, from Lemma 5 (c), we have
[TABLE]
Using Lemma 5[(a),(b)] and Lemma 6[(a),(b)], we get
[TABLE]
Using Lemma12[(a),(b)]) one can conclude
[TABLE]
[TABLE]
Hence the proof is complete.
By Lemma 12[(a),(b)] and Eq. (18), and Eq. (22) we have
Corollary 3
*Let U∈CI1×⋯×IM×J1×⋯×JN, V∈CJ1×⋯×JN×K1×⋯×KL and W∈CK1×⋯×KL×H1×⋯×HR. Let A=U∗NV∗LW. Let M∈CI1×⋯×IM×I1×⋯×IM, N∈CH1×⋯×HR×H1×⋯×HR,
P∈CJ1×⋯×JN×J1×⋯×JN and Q∈CK1×⋯×KL×K1×⋯×KL
are Hermitian positive definite tensors. Then the weighted Moore-Penrose inverse of A with respect to M and N satisfies the following identities:
(a) AM,N†=(UIM,P†∗MA)P,N†∗NV∗L(A∗RWQ,IR†)M,Q†,
(b) AM,N†=[(U∗NV∗LVP,IL†)M,P†∗MA]P,N†∗NV∗L[A∗R(VIN,Q†∗NV∗LW)Q,N†]M,Q†.*
2.3 The full rank decomposition
The tensors and their decompositions originally appeared in 1927, Hit27 . The idea of decomposing a tensor as a product of tensors with a more desirable structure may well be one of the most important developments in numerical analysis such as the implementation of numerically efficient algorithms and the solution of multilinear systems kolda ; Che2018 ; Marcar ; Kolda01 . As part of this section, we focus on the full rank decomposition of a tensor. Unfortunately, It is very difficult to compute tensor rank. But the authors of in psmv18 introduced an useful and effective definition of the tensor rank, termed as reshaping rank. With the help of reshaping rank, We present one of our important results, full rank decomposition of an arbitrary-order tensor.
Theorem 2.9
Let A∈CI1×⋯×IM×J1×⋯×JN. Then there exist a left invertible tensor
F∈CI1×⋯×IM×H1×⋯×HR and a right invertible tensor G∈CH1×⋯×HR×J1×⋯×JN such that
[TABLE]
where rshrank(F)=rshrank(G)=rshrank(A)=r=H1⋯HR. This is called the full rank decomposition of the tensor A.
Proof
Let the matrix A=rsh(A)∈CI1⋯IM×J1⋯JN. Then we have, rank(A) = r.
Suppose that the matrix A has a full rank decompositions, as follows,
[TABLE]
where F∈CI1⋯IM×H1⋯HR is a full column rank matrix and G∈CH1⋯HR×J1⋯JN is a full row rank matrix. From Eq. (8) and Eq. (24) we obtain
[TABLE]
where F=rsh−1(F)∈CI1×⋯×IM×H1×⋯×HR and G=rsh−1(G)∈CH1×⋯×HR×J1×⋯×JN.
it follows that
[TABLE]
where F∈CI1×⋯×IM×H1×⋯×HR is the left invertible tensor and G∈CH1×⋯×HR×J1×⋯×JN is a right invertible tensor.
The prove of the above theorem was proved earlier
(see Lemma 2.3(a), LIANG2018 ) indifferent way. Here, we have provided another proof without using reshape operation. Further, the authors of in LIANG2018 computed the Moore-Penrose inverse of a tensor using full rank decomposition of tensors. as follows
Lemma 13
(Theorem 3.7, LIANG2018 )
If the full rank decomposition of a tensor A∈CI1×⋯×IM×J1×⋯×JN is given as Theorem 2.9, then
[TABLE]
Now, the following theorem expressed the weighted Moore-Penrose inverse of a tensor
A∈CI1×⋯×IM×J1×⋯×JN in form of the ordinary tensor inverse.
Theorem 2.10
If the full rank decomposition of a tensor A∈CI1×⋯×IM×J1×⋯×JN is given by Eq. (23), then
the weighted Moore-Penrose inverse of A can be written as
[TABLE]
where M∈CI1×⋯×IM×I1×⋯×IM and N∈CJ1×⋯×JN×J1×⋯×JN are Hermitian positive definite tensors.
Proof
From Eq. (18), we have
[TABLE]
where B=(M1/2∗MF)∗R(G∗NN−1/2), and M & N are Hermitian positive definite tensors. Here B is in the form of full rank decomposition, as both M1/2 and N1/2 are invertible. Now, from Lemma 13, we get
[TABLE]
Therefore, AM,N†=N−1∗NG∗∗R(F∗∗MM∗MA∗NN−1∗NG∗)−1∗RF∗∗MM.
In particular when the arbitrary-order tensor, A is either left invertible or right invertible, we have the following results.
Corollary 4
Let a tensor A∈CI1×⋯×IM×J1×⋯×JN has the full rank decomposition.
- (a)
If the tensor A is left invertible, then AM,N†=N−1∗N(A∗∗MM∗MA∗NN−1)−1∗NA∗∗MM;
2. (b)
If the tensor A is right invertible, then
AM,N†=N−1∗NA∗∗M(M∗MA∗NN−1∗NA∗)−1∗MM.
It is easy to see that the full rank factorizations of a tensor A∈CI1×⋯×IM×J1×⋯×JN are not unique: if A=F∗RG is one full rank factorization, where F∈CI1×⋯×IM×H1×⋯×HR is the left invertible tensor and G∈CH1×⋯×HR×J1×⋯×JN is the right invertible tensor, then there exist a invertible tensor P of appropriate size, such that, A=(F∗RP)∗R(P−1∗RG) is another full rank factorization. The following Theorem represents the result.
Theorem 2.11
Let A∈CI1×⋯×IM×J1×⋯×JN with rshrank(A)=r=H1H2⋯HR.
Then A has infinitely many full rank decompositions. However if A has two full rank decompositions, as follows,
[TABLE]
where F, F1∈CI1×⋯×IM×H1×⋯×HR and G, G1∈CH1×⋯×HR×J1×⋯×JN, then there exists an invertible tensor B such that
[TABLE]
Moreover,
[TABLE]
Proof
Suppose the tensor, A∈CI1×⋯×IM×J1×⋯×JN has two full rank decompositions, as follows,
[TABLE]
where F, F1∈CI1×⋯×IM×H1×⋯×HR and G, G1∈CH1×⋯×HR×J1×⋯×JN. Then
[TABLE]
Substituting M=IM and N=IN in Corollary 4(b) we have, G1∗NG1†=IR.
Therefore, F1=F∗R(G∗NG1†), similarly we can find G1=(F1†∗MF)∗RG.
Let rsh(G)=G=reshape(G,r,J1⋯JN) and rsh(G1)=G1=reshape(G1,r,J1⋯JN). Then rsh(G∗NG1†)=GG1†∈Cr×r and
[TABLE]
Hence GG1† is invertible as it has full rank. This concluded G∗NG1†=rsh−1(GG1†) is invertible. Similarly F1†∗MF is also invertible. Let B=G∗NG1† and C=F1†∗MF. Then
[TABLE]
is equivalent to C=B−1. Therefore
[TABLE]
Further
[TABLE]
Similarly G1†=G†∗RB.
3 Reverse order law
In this section, we present various necessary and sufficient conditions of the reverse-order law for the weighted Moore-Penrose inverses of tensors. The first result obtained below addresses the sufficient condition for reverse-order law of tensor.
Theorem 3.1
Let A∈CI1×⋯×IM×J1×⋯×JN and B∈CJ1×⋯×JN×K1×⋯×KL. Let M∈CI1×⋯×IM×I1×⋯×IM, and N∈CK1×⋯×KL×K1×⋯×KL be a pair of Hermitian positive definite tensors.
If R(B)=R(A∗), Then
[TABLE]
Proof
Let X=A†∗MA∗NB and Y=A∗NB∗LB†. By using Lemma 5(c), we get
[TABLE]
Similarly, from Eq. (12) we have
[TABLE]
Further, from Lemma 5[(a), (b)] and Lemma 6[(a), (b)], we obtain
[TABLE]
i.e.,
[TABLE]
Let A1=M1/2∗MA and B1=B∗LN−1/2.
Using the Lemma 12[(a),(b)], we get
[TABLE]
Now, replacing A and B by A1 and B1 respectively on Eq.(28), we get
[TABLE]
Thus from corollary 2, we can conclude
[TABLE]
From the given condition and Lemma 5[(b),(c)], we have B∗LB†=A†∗MA, i.e.,
[TABLE]
Hence, (A∗NB)M,N†=BIN,N†∗NAM,IN†.
Further, using Theorem 3.30 in PanRad18 one can write a necessary and sufficient condition for reverse order law for arbitrary-order tensors, i.e., for A∈CI1×⋯×IM×J1×⋯×JN and B∈CJ1×⋯×JN×K1×⋯×KL. Then (A∗NB)†=B†∗NA† if and only if
[TABLE]
Now, utilizing the above result and the fact of Lemma 5[(a),(c)], we conclude a beautiful result for necessary and sufficient condition for Moore-Penrose inverse of arbitrary-order tensor, as follows.
Lemma 14
*Let A∈CI1×⋯×IM×J1×⋯×JN and B∈CJ1×⋯×JN×K1×⋯×KL.
The Reverse order law hold for Moore-Penrose inverse, i.e.,(A∗NB)†=B†∗NA†
if and only if
R(A∗∗MA∗NB)⊆R(B) and R(B∗LB∗∗NA∗)⊆R(A∗).*
The primary result of this paper is presented next under the impression of the properties of range space of arbitrary-order tensor.
Theorem 3.2
Let A∈CI1×⋯×IM×J1×⋯×JN,B∈CJ1×⋯×JN×K1×⋯×KL. Let M∈CI1×⋯×IM×I1×⋯×IM, N∈CK1×⋯×KL×K1×⋯×KL and P∈CJ1×⋯×JN×J1×⋯×JN
are three Hermitian positive definite tensors. Then
[TABLE]
if and only if
[TABLE]
Proof
From equation (18), we have
(A∗NB)M,N†=BP,N†∗NAM,P† if and only if
[TABLE]
is equivalent to, if and only if
[TABLE]
where A~=M1/2∗MA∗NP−1/2 and B~=P1/2∗NB∗LN−1/2. From Lemma 14, we have
[TABLE]
if and only if
[TABLE]
which equivalently if and only if
[TABLE]
Hence, (A∗NB)M,N†=BP,N†∗NAM,P† if and only if
[TABLE]
This completes the proof.
As a corollary to Theorem 3.2, we present another reverse order law for the weighted Moore-Penrose inverse of arbitrary-order tensor.
Corollary 5
Let A∈CI1×⋯×IM×J1×⋯×JN,B∈CJ1×⋯×JN×K1×⋯×KL. Let M∈CI1×⋯×IM×I1×⋯×IM, N∈CK1×⋯×KL×K1×⋯×KL and P∈CJ1×⋯×JN×J1×⋯×JN
are three Hermitian positive definite tensors. Then
[TABLE]
if and only if
[TABLE]
Proof
From Theorem 3.2, Eq.(29) and Lemma 5(a), we have
(A∗NB)M,N†=BP,N†∗NAM,P† if and only if
[TABLE]
and
[TABLE]
i.e., if and only if
[TABLE]
i.e., if and only if
[TABLE]
This completes the proof.
Theorem 3.3
Let A∈CI1×⋯×IM×J1×⋯×JN,B∈CJ1×⋯×JN×K1×⋯×KL. Let M∈CI1×⋯×IM×I1×⋯×IM, N∈CK1×⋯×KL×K1×⋯×KL and P∈CJ1×⋯×JN×J1×⋯×JN are positive definite Hermitian tensors. Then
[TABLE]
if and only if
[TABLE]
Proof
Suppose, (A∗NB)M,N†=BP,N†∗NAM,P†.
Now one can write
[TABLE]
Further we can write
[TABLE]
[TABLE]
[TABLE]
Hence,
[TABLE]
By similar arguments one can also show that,(A∗NB∗LBP,N†)M,P†=B∗LBP,N†∗NAM,P†.
Conversely, For proving converse, first we prove a identity.
From Eq.(18) and Eq.(28) we have,
[TABLE]
Further, using the given hypothesis and above identity, we can write
[TABLE]
This completes the proof.
In the next theorem, we develop the characterization for the weighted Moore-Penrose inverse of the product of arbitrary-order tensors A and B, as follows.
Theorem 3.4
Let A∈CI1×⋯×IM×J1×⋯×JN,B∈CJ1×⋯×JN×K1×⋯×KL. Let M∈CI1×⋯×IM×I1×⋯×IM, N∈CK1×⋯×KL×K1×⋯×KL and P∈CJ1×⋯×JN×J1×⋯×JN
are three Hermitian positive definite tensors. Then
[TABLE]
where A1=A∗NB1∗L(B1)P,N† and B1=AM,P†∗MA∗NB.
Proof
[TABLE]
[TABLE]
[TABLE]
From (31) and (3), we have
[TABLE]
Therefore,
[TABLE]
Hence,
[TABLE]
Let X=A∗NB and Y=(B1)P,N†∗N(A1)M,P†.
Using (3) and (32) we obtain
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
Hence, XM,N†=Y, i.e., (A∗NB)M,N†=(B1)P,N†∗N(A1)M,P†.
We shall present the following example as a confirmation of the above Theorem.
Example 3
Let A1=A∗2B1∗1(B1)P,N† and B1=AM,P†∗1A∗2B, where
A=(aijk)∈R3×2×4, B=(bijk)∈R2×4×3, M=(mij)∈R3×3, N=(nij)∈R3×3 and P=(pijkl)∈R2×4×2×4 such that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Then A1=(a~ijk)∈R3×2×4, B1=(b~ijk)∈R2×4×3, (A1)M,P†=(xijk)∈R2×4×3
and (B1)P,N†=(yijk)∈R3×2×4 such that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus
[TABLE]
Hence (A∗NB)M,N†=(B1)P,N†∗N(A1)M,P†
Further, using the Lemma 4 in weit2 on an arbitrary-order tensor A∈CI1×⋯×IM×J1×⋯×JN with Hermitian positive definite tensors M∈CI1×⋯×IM×I1×⋯×IM and N∈CJ1×⋯×JN×J1×⋯×JN one can write the following identity
[TABLE]
Using the above identity, a sufficient condition for the reverse order law for weighted Moore-Penrose inverse of tensor is presented next.
Corollary 6
Let A∈CI1×⋯×IM×J1×⋯×JN,B∈CJ1×⋯×JN×K1×⋯×KL. Let M∈CI1×⋯×IM×I1×⋯×IM, N∈CK1×⋯×KL×K1×⋯×KL and P∈CJ1×⋯×JN×J1×⋯×JN are positive definite Hermitian tensors. If
[TABLE]
Then
[TABLE]
Proof
From Theorem3.4 we have, (A∗NB)M,N†=(B1)P,N†∗N(A1)M,P†, where
A1=A∗NB1∗L(B1)P,N† and B1=AM,P†∗MA∗NB.
From Eq.(33) and given hypothesis, we have
[TABLE]
So there exists P∈CJ1×⋯×JN×K1×⋯×KL such that B=AM,N†∗MA∗NP.
Now,
[TABLE]
Hence A1=A∗NB∗LBN,P†.
Further,
we have, N(BN1/2,P1/2#)⊆N(A), which is equivalent to
[TABLE]
Then from Lemma5(a), we have
[TABLE]
which equivalently
[TABLE]
that is
[TABLE]
i.e.
[TABLE]
Hence, (A∗NB)M,N†=BN,P†∗NAM,N†.
We next present another characterization of the product of arbitrary-order tensors,
as follows,
Theorem 3.5
*Let A∈CI1×⋯×IM×J1×⋯×JN and B∈CJ1×⋯×JN×K1×⋯×KL.
Let M∈CI1×⋯×IM×I1×⋯×IM, N∈CK1×⋯×KL×K1×⋯×KL and P∈CJ1×⋯×JN×J1×⋯×JN
are three Hermitian positive definite tensors. Then*
[TABLE]
where A1=A∗NB∗LBP,IL† and B1=(A1)M,P†∗MA1∗NB.
Proof
Let X=A∗NB and Y=(B1)P,N†∗N(A1)M,P†. Now we have
[TABLE]
Now, using Eq. (34), we obtain
[TABLE]
Further, using the following relations
[TABLE]
we have
[TABLE]
It concludes that,
[TABLE]
From the relations (35)-(38) validates Y=XM,N†. Hence (A∗NB)M,N†=(B1)P,N†∗N(A1)M,P†.
This completes the proof.
The significance of the properties of range and null space of arbitrary-order tensors, the last result achieved the sufficient condition for the triple reverse order law of tensor.
Theorem 3.6
*Let U∈CI1×⋯×IM×J1×⋯×JN, V∈CJ1×⋯×JN×K1×⋯×KL and
W∈CK1×⋯×KL×H1×⋯×HR. Let M∈CI1×⋯×IM×I1×⋯×IM and N∈CH1×⋯×HR×H1×⋯×HR be a pair of Hermitian positive definite tensors. If*
[TABLE]
Then
[TABLE]
Proof
Let A=U∗NV∗LW, W1=(U∗NV)†∗MA and U1=A∗R(V∗LW)†.
From Eq.(12), we get
[TABLE]
Also from Lemma 5(c), we get
[TABLE]
Applying Lemma 5[(a),(b)] and Lemma 6[(a),(b)], we have
[TABLE]
which is equivalent to
[TABLE]
Replacing U and W by M1/2∗MU and W∗RN−1/2 in Eq.(39) along with using Eq.(18) and Lemma 12[(a),(b)] we have
[TABLE]
Applying Lemma 5[(a),(c)] and Lemma 6(a) in the given condition, we get
[TABLE]
Hence,
(U∗NV∗LW)M,N†=WIL,N†∗LV†∗NUM,IN†.
4 Conclusion
In this paper, a novel SVD and full rank-decomposition of arbitrary-order tensors using reshape operation is developed. Using this decomposition, we have studied the Moore-Penrose and general weighted Moore-Penrose inverse for arbitrary-order tensors via the Einstein product. We have also added some results on the range and null spaces to the existing theory. Then we discuss a few characterizations of cancellation properties for Moore-Penrose inverse of tensors. In addition to these, we have discussed the reverse-order laws for weighted Moore-Penrose inverses. In the future, it will be more interesting to express additional identities of weighted Moore-Penrose inverse in terms of the ordinary Moore-Penrose inverse for arbitrary-order tensor.
**Acknowledgments
**The first and the third authors are grateful to the Mohapatra Family Foundation and the College of Graduate Studies, University of Central Florida, Orlando, for their financial support for this research. In addition to this the first author is grateful for the partially supported by Science and Engineering Research Board (SERB), Department of Science and Technology, India, under the Grant No. EEQ/2017/000747.