Next Article in Journal
Hybrid LSTM–Transformer Architecture with Multi-Scale Feature Fusion for High-Accuracy Gold Futures Price Forecasting
Previous Article in Journal
Multi-Subject Decision-Making Analysis in the Public Opinion of Emergencies: From an Evolutionary Game Perspective
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

T-Eigenvalues of Third-Order Quaternion Tensors

1
Department of Mathematics and Newtouch Center for Mathematics, Shanghai University, Shanghai 200444, China
2
Sino-European School of Technology, Shanghai University, Shanghai 200444, China
3
School of Mathematics, East China University of Science and Technology, Shanghai 200237, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(10), 1549; https://doi.org/10.3390/math13101549 (registering DOI)
Submission received: 2 April 2025 / Revised: 2 May 2025 / Accepted: 5 May 2025 / Published: 8 May 2025
(This article belongs to the Section E: Applied Mathematics)

Abstract

:
In this paper, theories, algorithms and properties of eigenvalues of quaternion tensors via the t-product termed T-eigenvalues are explored. Firstly, we define the T-eigenvalue of quaternion tensors and provide an algorithm to compute the right T-eigenvalues and the corresponding T-eigentensors, along with an example to illustrate the efficiency of our algorithm by comparing it with other methods. We then study some inequalities related to the right T-eigenvalues of Hermitian quaternion tensors, providing upper and lower bounds for the right T-eigenvalues of the sum of a pair of Hermitian tensors. We further generalize the Weyl theorem from matrices to quaternion third-order tensors. Additionally, we explore estimations related to right T-eigenvalues, extending the Geršgorin theorem for matrices to quaternion third-order tensors.
MSC:
15A23; 15A69; 65F30

1. Introduction

Quaternion algebra was first introduced by Hamilton [1], and it is a noncommutative division ring. One of its most important properties is that multiplication does not satisfy the commutative law, which leads to many situations that hold for complex numbers not being valid in quaternion algebra. However, quaternions play a crucial role in various fields, including computer graphics, signal processing, image processing, face recognition, etc. (e.g., [2,3,4,5,6,7]).The concept of tensors is extended from that of matrices, and tensors can serve as valuable resources for handling high-dimensional data, such as image processing [8], computer vision [9] and analysis of medical data [10]. In recent years, numerous scholars have studied tensors and their various applications [11,12,13,14,15,16]. To the best of our knowledge, the eigenvalues of matrices are widely used in various fields, such as facial recognition, image processing, image denoising, image clustering, etc. (e.g., [17,18,19]). As an extension from matrices, eigenvalues of tensors have begun to receive more and more attention among scholars, and theories and applications about different kinds of eigenvalues of tensors have been explored, such as E-eigenvalue, H-eigenvalue, Z-eigenvalue, etc. (e.g., [20,21]). Recently, with the advent of the tensor Einstein product [22] and the t-product [23], there has been a growing interest in the eigenvalues of tensors associated with these operations. For instance, He et al. have already studied theories and algorithms of eigenvalues of tensors via the Einstein product on quaternion realm and have given applications of color video processing [24,25]. Very recently, Liu et al. [26] have proposed eigenvalues of tensors under the t-product named T-eigenvalues, and have extended Weyl’s theorem and Cauchy’s interlacing theorem from matrix case to tensor case. Chen et al. [27] concentrated on perturbation theory regarding the tensor T-eigenvalues, and give three extensions from matrix domain to tensor domain: the Geršgorin theorem [28], the Bauer–Fike theorem [29] and Kahan theorem [30]. Recent research on t-products has primarily concentrated on tensors within real and complex number fields, whereas the study of quaternion algebra has been comparatively limited. To address this gap in research, this paper seeks to explore the theoretical foundations, computational methods and distinctive characteristics of T-eigenvalues in the realm of third-order quaternion tensors.
The arrangement of the remaining sections of the paper is as follows: In Section 2, we provide the basic symbols and definitions that will be used later. In Section 3, we present the computation of right T-eigenvalues and their associated T-eigentensors for third-order quaternion tensors under the T-product, and we compare our algorithm with other methods in terms of computational error and CPU time to demonstrate the efficiency of our method. In Section 4, we investigate some important inequalities related to the right T-eigenvalues for Hermitian quaternion tensors. In Section 5, we explore estimations concerning the right T-eigenvalues.

2. Preliminaries

In this section, some basic notations and definitions are given. First, we begin with some notations that will be used in the following sections. In this paper, the real number field, the complex number field and the quaternion algebra are symbolized by R , C and Q , respectively. The scalars under real number field or complex number field are denoted by lowercase characters such as q, and we use bold minuscule letters to denote vectors, like q . For matrices, we choose bold uppercase characters to symbolize them, for example, Q . For tensors, we utilize Euler script letters to denote them, taking the expression Q for example. In the context of quaternion algebra, these symbols are accompanied by a breve, i.e.,  q ˘ , q ˘ , Q ˘ and Q ˘ , respectively.
Quaternion algebra [1] is a noncommutative division ring. For any given quaternion, here we use the bold lowercase letters i , j and k to denote the three imaginary units of any given quaternion. Each element q ˘ of the quaternion algebra can be denoted as q ˘ = q 0 + q 1 i + q 2 j + q 3 k , where q 0 , q 1 , q 2 , q 3 R and i , j , k satisfy that i 2 = j 2 = k 2 = 1 , i j = j i = k , j k = k j = i and k i = i k = j . The modulus of the above quaternion number can be expressed as | q ˘ | = q 0 2 + q 1 2 + q 2 2 + q 3 2 , and a quaternion q ˘ = q 0 + q 1 i + q 2 j + q 3 k is called unit pure quaternion provided that q 0 = 0 and q 1 2 + q 2 2 + q 3 2 = 1 . The conjugate of the above quaternion q ˘ is q ˘ ¯ = q 0 q 1 i q 2 j q 3 k . For any nonzero quaternion q ˘ , there is an inverse q ˘ 1 = q ˘ ¯ | q ˘ | 2 . For two quaternions x ˘ = x 0 + x 1 i + x 2 j + x 3 k and y ˘ = y 0 + y 1 i + y 2 j + y 3 k , the dot product of x ˘ and y ˘ is defined as x ˘ · y ˘ = i = 0 3 x i y i , and  x ˘ y ˘ if x ˘ · y ˘ = 0 , i.e.,  x 0 y 0 + x 1 y 1 + x 2 y 2 + x 3 y 3 = 0 . We use d i m Q ( S ˘ ) to denote of the dimension of a subspace S ˘ of Q n × 1 , which is considered as a right quaternion vector space, and we use S p a n Q { u ˘ 1 , , u ˘ m } : = { u ˘ 1 x ˘ 1 + + u ˘ m x ˘ m : x ˘ 1 , , x ˘ m Q } to symbolize the subspace spanned by u ˘ 1 , , u ˘ m Q n × 1 . Given a quaternion vector x ˘ , the norm on Q n × 1 is denoted by x ˘ Q = x ˘ H x ˘  [31]. For a set of n × 1 quaternion vectors { x ˘ 1 , x ˘ 2 , , x ˘ n }, we say they are orthonormal if x ˘ i H x ˘ j = δ i j , where δ i j is the Kronecker delta, i.e.,  δ i j = 1 if i = j , and  δ i j = 0 if i j . For more details about quaternion algebra, we propose that the readers read the latest book about quaternions [31].
Similarly, we can use this expression Q ˘ = Q 0 + Q 1 i + Q 2 j + Q 3 k to denote a quaternion matrix Q ˘ Q m × n , where each Q i R m × n . The conjugate transpose of quaternion matrix Q ˘ = ( q ˘ i j ) = Q 0 + Q 1 i + Q 2 j + Q 3 k is Q ˘ H = ( q ˘ ¯ j i ) = Q 0 T Q 1 T i Q 2 T j Q 3 T k . The Kronecker product for two matrices Q ˘ Q m × n and S ˘ Q s × t is denoted by Q ˘ S ˘ , which is the ( m s ) × ( n t ) quaternion matrix with the following structure:
Q ˘ S ˘ = q ˘ 11 S ˘ q ˘ 12 S ˘ q ˘ 1 n S ˘ q ˘ 21 S ˘ q ˘ 22 S ˘ q ˘ 2 n S ˘ q ˘ m 1 S ˘ q ˘ m 2 S ˘ q ˘ m n S ˘ .
In this paper, we focus on third-order quaternion tensors, which only have three dimensions. A third-order quaternion tensor with n 1 n 2 n 3 elements can be denoted by Q ˘ = ( q ˘ i j k ) Q n 1 × n 2 × n 3 , where 1 i n 1 , 1 j n 2 , 1 k n 3 . For a third-order quaternion tensor Q ˘ = ( q ˘ i j k ) Q n 1 × n 2 × n 3 , its Frobenius norm is denoted as Q ˘ F = i = 1 n 1 j = 1 n 2 k = 1 n 3 | q ˘ i j k | 2 . For a third-order quaternion tensor Q ˘ Q n 1 × n 2 × n 3 , the i-th frontal slice is referred to as Q ˘ ( i ) in this paper, which can also be represented by Q ˘ ( : , : , i ) using MATLAB R2022a notation to describe algorithms. Additionally, we will introduce the following operators related to the quaternion third-order tensor Q ˘ Q m × n × p that are frequently used in the following sections, i.e.,  unfold ( · ) , bcirc ( · ) [23,32]:
unfold ( Q ˘ ) = Q ˘ ( 1 ) Q ˘ ( 2 ) Q ˘ ( p ) , bcirc ( Q ˘ ) = Q ˘ ( 1 ) Q ˘ ( p ) Q ˘ ( 2 ) Q ˘ ( 2 ) Q ˘ ( 1 ) Q ˘ ( 3 ) Q ˘ ( p ) Q ˘ ( p 1 ) Q ˘ ( 1 ) ,
where Q ˘ ( i ) is the i-th frontal slice of tensor Q ˘ with a size of m × n , i = 1 , 2 , , p . It is noteworthy that fold ( unfold ( Q ˘ ) ) = Q ˘ and bcirc 1 ( bcirc ( Q ˘ ) ) = Q ˘ .
A quaternion discrete Fourier transform matrix F ˘ μ ˘ Q m × m has the following structure [33]:
F ˘ μ ˘ = 1 m 1 1 1 1 ω ˘ ω ˘ m 1 1 ω ˘ m 1 ω ˘ ( m 1 ) ( m 1 ) ,
where ω ˘ = e 2 π μ ˘ m , and μ ˘ is a unit pure quaternion. According to [33], the quaternion discrete Fourier transform matrix F ˘ μ ˘ is a unitary matrix satisfying
F ˘ μ ˘ H F ˘ μ ˘ = F ˘ μ ˘ F ˘ μ ˘ H = I m ,
( F ˘ μ ˘ H ) 2 = ( F ˘ μ ˘ ) 2 = M ,
where
M = 1 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 .
Next, we give some basic definitions about third-order quaternion tensors that will be utilized in the subsequent sections:
Definition 1 
(T-product [23,32]). Let Q ˘ Q n 1 × n 2 × n 3 and P ˘ Q n 2 × n 4 × n 3 , then we call the following expression the t-product of Q ˘ and P ˘ :
Q ˘ P ˘ : = fold ( bcirc ( Q ˘ ) unfold ( P ˘ ) ) Q n 1 × n 4 × n 3 .
Definition 2 
(F-square tensor [34]). A tensor Q ˘ Q n × n × m is referred to as an F-square tensor provided that each of its frontal slices are square matrices.
Definition 3 
(Identity tensor [23]). We call a third-order tensor I Q n × n × m an identity tensor if its first frontal slice is an identity matrix with the rest being zero matrices.
Definition 4 
(Conjugate transpose of a third-order quaternion tensor [23]). Given Q ˘ Q n 1 × n 2 × n 3 , the conjugate transpose of Q ˘ is represented by Q ˘ H , which is obtained by conjugating and transposing every frontal slice of Q ˘ , then reversing the order from 2 to n 3 .
Definition 5 
(Right T-eigenvalue and T-eigentensor). Given Q ˘ Q m × m × n , the right T-eigenvalue is a quaternion number λ ˘ r satisfying that
Q ˘ X ˘ = X ˘ λ ˘ r ,
where X ˘ Q m × 1 × n is a nonzero quaternion tensor named T-eigentensor of Q ˘ corresponding to λ ˘ r . We use σ r ( Q ˘ ) to represent the set containing all the right T-eigenvalues of Q ˘ .
It is clear that for each right T-eigenvalue λ ˘ r of Q ˘ , we have the following observations:
bcirc ( Q ˘ ) unfold ( X ˘ ) = unfold ( X ˘ ) λ ˘ r ,
that is to say, the right T-eigenvalues of Q ˘ clearly correspond to the right eigenvalues belonging to the quaternion matrix bcirc ( Q ˘ ) , and the relationship holds in the reverse direction as well.
Definition 6 
(Hermitian quaternion tensors). A quaternion tensor Q ˘ Q m × m × n is called a Hermitian tensor provided that Q ˘ H = Q ˘ .

3. The Right T-Eigenvalues of Third-Order Quaternion Tensors

In this section, we consider the right T-eigenvalues of third-order quaternion tensor Q ˘ H m × m × n . The following is a list of several useful lemmas:
Lemma 1 
([35]). Given four quaternion matrices P ˘ , Q ˘ , U ˘ and V ˘ of appropriate dimensions, then the following properties of the Kronecker product hold:
1. 
( P ˘ Q ˘ ) H = P ˘ H Q ˘ H ;
2. 
( P ˘ Q ˘ ) ( U ˘ V ˘ ) = ( P ˘ U ˘ ) ( Q ˘ V ˘ ) .
where “⊗” denotes the Kronecker product.
Lemma 2 
([32,34]). Given a third-order quaternion tensor Q ˘ Q n 1 × n 2 × n 3 , the subsequent statements are true:
1. 
bcirc ( Q ˘ P ˘ ) = bcirc ( Q ˘ ) bcirc ( P ˘ ) , where P ˘ Q n 2 × n 4 × n 3 .
2. 
bcirc ( Q ˘ H ) = ( bcirc ( Q ˘ ) ) H .
3. 
( Q ˘ P ˘ ) H = P ˘ H Q ˘ H .
We have the following theorems.
Lemma 3 
([33]). Suppose a quaternion circulant matrix Q ˘ = Q 0 + Q 1 μ ˘ + Q 2 α ˘ + Q 3 β ˘ Q m × m is in a three-axis system ( μ ˘ , α ˘ , β ˘ ) , where μ ˘ is any given unit pure quaternion, α ˘ is a unit pure quaternion satisfying α ˘ μ ˘ and  β ˘ = α ˘ μ ˘ . Then, there exists a permuted quaternion Fourier transform matrix P F ˘ μ ˘ that can block-diagonalize Q ˘ , that is,
( P F ˘ μ ˘ ) Q ˘ [ ( P F ˘ μ ˘ ) ] H = Q ˘ 1 Q ˘ 2 Q ˘ s ,
where P is a permutation matrix obtained by exchanging of the i-th and ( m i + 3 ) -th columns of a m × m identity matrix for i = 3 , 4 , , m + 1 2 when m is odd or for i = 3 , 4 , , m 2 when m is even. Q ˘ 1 is of size 1 × 1 , while the other diagonal block is of size 2 × 2 when m is odd. In the final diagonal block for an even m, there is an additional 1-by-1 matrix, in addition to the previously mentioned diagonal blocks.
Theorem 1. 
Given a quaternion circulant matrix Q ˘ Q m × m , the matrix ( P F ˘ μ ˘ ) Q ˘ [ ( P F ˘ μ ˘ ) ] H has the same right eigenvalues as matrix Q ˘ , where P is a permutation matrix defined as in Lemma 3.
Proof. 
Suppose λ ˘ r is one right eigenvalue of Q ˘ , and η ˘ is the corresponding eigenvector, i.e.,
Q ˘ η ˘ = η ˘ λ ˘ r , η ˘ 0 .
By left-multiplying P F ˘ μ ˘ from both sides of Equation (8), we have that
( P F ˘ μ ˘ ) Q ˘ η ˘ = ( P F ˘ μ ˘ ) η ˘ λ ˘ r , η ˘ 0 ,
i.e.,
( P F ˘ μ ˘ ) Q ˘ [ ( P F ˘ μ ˘ ) ] H ( P F ˘ μ ˘ ) η ˘ = ( P F ˘ μ ˘ ) η ˘ λ ˘ r , η ˘ 0 .
The above equation holds true because [ ( P F ˘ μ ˘ ) ] H ( P F ˘ μ ˘ ) = I m .
Let ξ ˘ = ( P F ˘ μ ˘ ) η ˘ ; it is easy to find that ξ ˘ 0 , and from Equation (10) we have that
( P F ˘ μ ˘ ) Q ˘ [ ( P F ˘ μ ˘ ) ] H ξ ˘ = ξ ˘ λ ˘ r , ξ ˘ 0 .
That is to say, λ ˘ r is also one right eigenvalue of ( P F ˘ μ ˘ ) Q ˘ [ ( P F ˘ μ ˘ ) ] H , and  ξ ˘ = ( P F ˘ μ ˘ ) η ˘ is an eigenvector corresponding to λ ˘ r .    □
Corollary 1. 
Given a quaternion F-square tensor Q ˘ Q m × m × n , the matrix [ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ] has the same right eigenvalues as matrix bcirc ( Q ˘ ) , where P is a permutation matrix defined by swapping the t-th and ( n t + 3 ) -th columns of an identity matrix for t = 3 , , n + 1 2 if n is odd or for t = 3 , , n 2 if n is even.
Theorem 2. 
Assume that Q ˘ Q n × n = Q ˘ 1 Q ˘ 2 Q ˘ t , where each Q ˘ s is a quaternion matrix. Then, we have that the right eigenvalues of Q ˘ are the union of right eigenvalues of quaternion matrices Q ˘ s , that is, σ r ( Q ˘ ) = s = 1 t σ r ( Q ˘ s ) .
Proof. 
Suppose that the size of each matrix Q ˘ s is n s × n s , and  λ ˘ s is one right eigenvalue belonging to Q ˘ s with the corresponding eigenvector x ˘ s 0 . Then, we have that
Q ˘ x ˘ 1 0 0 = x ˘ 1 0 0 λ ˘ 1 , i . e . , Q ˘ X ˘ 1 = X ˘ 1 λ ˘ 1 , X ˘ 1 = x ˘ 1 0 0 0 ,
Q ˘ 0 x ˘ 2 0 = 0 x ˘ 2 0 λ ˘ 2 , i . e . , Q ˘ X ˘ 2 = X ˘ 2 λ ˘ 2 , X ˘ 2 = 0 x ˘ 2 0 0 ,
Q ˘ 0 0 x ˘ t = 0 0 x ˘ t λ ˘ t , i . e . , Q ˘ X ˘ t = X ˘ t λ ˘ t , X ˘ t = 0 0 x ˘ t 0 .
Thus, it is easy to see that λ ˘ s is one right eigenvalue of Q ˘ with the correlated eigenvector X ˘ s , and the right eigenvalues of the block-diagonal quaternion matrix Q ˘ consist of the right eigenvalues of each diagonal block Q ˘ s , s = 1 , 2 , , t .    □
Theorem 3. 
Given an F-square tensor Q ˘ = Q 0 + Q 1 μ ˘ + Q 2 α ˘ + Q 3 β ˘ Q m × m × n is in a three-axis system ( μ ˘ , α ˘ , β ˘ ) , where μ ˘ is any given unit pure quaternion, α ˘ is a unit pure quaternion satisfying α ˘ μ ˘ and  β ˘ = α ˘ μ ˘ . Thus, the right T-eigenvalues of Q ˘ are composed of right eigenvalues of the diagonal block matrices of [ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] , where P is a permutation matrix by swapping i-th and ( n i + 3 ) -th columns of a n × n identity matrix for i = 3 , 4 , , n + 1 2 if n is odd and for i = 3 , 4 , , n 2 if n is even; F ˘ μ ˘ is the quaternion discrete Fourier transform matrix.
Proof. 
It is shown by Ng et al. [33] that a permuted quaternion discrete Fourier transform matrix can transform a quaternion circulant matrix into a block-diagonal form, and further it is extended to the following case:
Given a third-order F-square tensor Q ˘ Q m × m × n , then according to [33], we have that
[ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] = Q ˘ 1 Q ˘ 2 Q ˘ t D Q ,
where t = n 2 + 1 if n is even, t = n + 1 2 if n is odd. P is a permutation matrix by swapping the i-th and the ( n i + 3 ) -th columns of an identity matrix for i = 3 , 4 , , n + 1 2 if n is odd or for i = 3 , 4 , , n 2 if n is even. It is worth noting that D Q is a block-diagonal quaternion matrix with Q ˘ 1 being m × m while other diagonal blocks are 2 m × 2 m if n is odd, and in the final diagonal block for an even m, there is an additional m × m matrix, in addition to the previously mentioned diagonal blocks.
It is noted that the proofs for both the even and odd cases bear similarities. For the sake of simplicity, only the odd case will be considered here.
Suppose that λ ˘ i is one right eigenvalue of diagonal block matrix Q ˘ i with the corresponding nonzero eigenvector x ˘ i . Then by Theorem 2, we have that λ ˘ i is also one right eigenvalue of [ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] with the corresponding eigenvector X ˘ i = ( 0 , , x ˘ i , , 0 ) T , that is,
[ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] X ˘ i = X ˘ i λ ˘ i .
After left-multiplying both sides of Equation (13) by matrix [ ( P F ˘ μ ˘ ) H I m ) ] , we can determine that
bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] X ˘ i = [ ( P F ˘ μ ˘ ) H I m ) ] X ˘ i λ ˘ i .
Let Y ˘ i = [ ( P F ˘ μ ˘ ) H I m ) ] X ˘ i , then it is easy to see that Y ˘ i 0 . Thus we have that λ ˘ r is one right T-eigenvalue belonging to Q ˘ , and the corresponding T-eigentensor is fold ( Y ˘ i ) . This can be proven by the combination of the proof of Theorems 1 and 2, that is, σ r ( Q ˘ ) = σ r ( D Q ) = s = 1 t σ r ( Q ˘ s ) .    □
Theorem 4. 
Given a right T-eigenvalue λ ˘ r of the quaternion tensor Q ˘ Q m × m × n with a T-eigentensor X ˘ related to λ ˘ r , then for every nonzero quaternion number p ˘ , p ˘ 1 λ ˘ r p ˘ is again a right T-eigenvalue of Q ˘ with the corresponding T-eigentensor X ˘ p ˘ .
Proof. 
Note that Q ˘ X ˘ = X ˘ λ ˘ r , thus we have that
Q ˘ ( X ˘ p ˘ ) = ( Q ˘ X ˘ ) p ˘ = ( X ˘ λ ˘ r ) p ˘ = X ˘ p ˘ ( p ˘ 1 λ ˘ r p ˘ ) .
   □
Regarding a Hermitian quaternion tensor Q ˘ Q m × m × n , the following theorems hold.
Theorem 5. 
Given Q ˘ Q m × m × n , then Q ˘ is a Hermitian tensor ( bcirc ( Q ˘ ) ) H = bcirc ( Q ˘ ) .
Theorem 6. 
The right T-eigenvalues of a quaternion Hermitian tensor Q ˘ Q m × m × n all belong to the real number field.
Proof. 
It is evident that if bcirc ( Q ˘ ) = bcirc ( Q ˘ H ) = bcirc ( Q ˘ ) H from Lemma 2, then bcirc ( Q ˘ ) is a quaternion Hermitian matrix. Suppose that λ ˘ is one right T-eigenvalue belonging to Q ˘ with the corresponding eigentensor X ˘ , i.e.,  Q ˘ X ˘ = X ˘ λ ˘ . That is,
bcirc ( Q ˘ ) unfold ( X ˘ ) = unfold ( X ˘ ) λ ˘ .
Let X ˘ = unfold ( X ˘ ) , and from the above equation it is easy to see that
X ˘ H ( bcirc ( Q ˘ ) ) H = λ ˘ ¯ X ˘ H .
Due to the fact that bcirc ( Q ˘ ) = bcirc ( Q ˘ ) H , we have
X ˘ H bcirc ( Q ˘ ) = λ ˘ ¯ X ˘ H .
We multiply X ˘ from the right side of the above equation, then we obtain this equation:
X ˘ H bcirc ( Q ˘ ) X ˘ = λ ˘ ¯ X ˘ H X ˘ ,
and one step closer, we have
X ˘ H X ˘ λ ˘ = λ ˘ ¯ X ˘ H X ˘ ,
i.e., 
λ ˘ X ˘ Q 2 = λ ˘ ¯ X ˘ Q 2 .
Then, we have λ ˘ = λ ˘ ¯ .    □
Proposition 1. 
Given a Hermitian quaternion third-order tensor Q ˘ Q m × m × n , then each diagonal block in Equation (12) is a Hermitian matrix.
Proof. 
According to Theorem 3, it is easy to see that
{ [ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] } H = [ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) H [ ( P F ˘ μ ˘ ) H I m ) ] ,
                                                    = [ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] ,
which means that Q ˘ 1 Q ˘ 2 Q ˘ t D Q is a Hermitian matrix, i.e.,  D Q H = D Q .
Then, we have Q ˘ i H = Q ˘ i , i = 1 , 2 , t .    □
Very recently, Wu et al. [36] proposed a complex representation matrix (CRM) of third-order quaternion tensors under Qt-product, which provides a way to map quaternion operators to their complex counterparts, providing a promising avenue for generalizing classical tensor algorithms to the quaternion case. By this, the computational complexity generated by extra imaginary parts of quaternions can be reduced. Inspired by [36], here we consider complex representation matrix to compute right T-eigenvalues of third-order quaternion tensors. First, we revisit the complex representation operator for a quaternion matrix.
Definition 7 
(Complex representation operator for a quaternion matrix [31]). Given a quaternion matrix Q ˘ Q m × n in its Cayley–Dickson (CD) form Q ˘ = Q 1 + Q 2 j , where Q i C m × n , i = 1 , 2 .   Φ : Q m × n C 2 m × 2 n is an operator defined as follows:
Φ ( Q ˘ ) = Q 1 Q 2 Q 2 ¯ Q 1 ¯ .
Definition 8 
(Complex representation matrix of third-order quaternion tensors under t-product). Consider Q ˘ Q m × n × p and the corresponding block-diagonal matrix D Q in (12). Then, Ψ : Q m × n × p C 2 m p × 2 n p is an operator defined as Ψ ( Q ˘ ) = Φ ( Q ˘ 1 ) Φ ( Q ˘ 2 ) Φ ( Q ˘ t ) , where Φ is the complex representation operator for quaternion matrices.
Based on the proof of the theorems above, next we provide an algorithm for calculating the right T-eigenvalues belonging to a quaternion tensor Q ˘ Q m × m × n .
Upon the constructed algorithm, next we give a numerical experiment and compare our method with the command eig in Quaternion tool box [37] for computing the right eigenvalues of bcirc ( Q ˘ ) , i.e., the right T-eigenvalues of Q ˘ . For each right T-eigenvalue λ ˘ i and the corresponding T-eigentensor X ˘ i of Q ˘ , we define the residual by Q ˘ X ˘ i X ˘ i λ ˘ i F . Then, we define the error for calculating right T-eigenvalues of Q ˘ as follows: Error = i Q ˘ X ˘ i X ˘ i λ ˘ i   F 2 .
Example 1. 
Suppose Q ˘ Q 3 × 3 × 3 with the following structure:
Q ˘ ( : , : , 1 ) = 0.5244 0.4052 0.7897 i 0.1849 j 0.2486 k 0.2136 0.1193 i 0.0896 j + 0.0811 k 0.4052 + 0.7897 i + 0.1849 j + 0.2486 k 0.5731 0.1266 0.1104 i 0.1398 j 0.6492 k 0.2136 + 0.1193 i + 0.0896 j 0.0811 k 0.1266 + 0.1104 i + 0.1398 j + 0.6492 k 0.9014 ,
Q ˘ ( : , : , 2 ) = 1.4770 0.1757 i + 0.9177 j 0.2357 k 0.0746 + 0.2922 i + 1.4866 j 0.3078 k 0.4387 0.2311 i 0.7924 j + 0.2718 k 0.3402 0.6744 i + 0.2752 j 0.1544 k 1.0954 + 0.3069 i 0.9133 j 0.9556 k 0.7820 0.6189 i + 1.0518 j 0.4706 k 0.7543 + 0.5253 i 1.4818 j 0.2781 k 1.4399 + 0.6250 i + 0.9021 j + 0.0340 k 0.4441 + 0.0945 i 0.1625 j + 0.4622 k ,
Q ˘ ( : , : , 3 ) = 1.4770 + 0.1757 i 0.9177 j + 0.2357 k 0.3402 + 0.6744 i 0.2752 j + 0.1544 k 0.7543 0.5253 i + 1.4818 j + 0.2781 k 0.0746 0.2922 i 1.4866 j + 0.3078 k 1.0954 0.3069 i + 0.9133 j + 0.9556 k 1.4399 0.6250 i 0.9021 j 0.0340 k 0.4387 + 0.2311 i + 0.7924 j 0.2718 k 0.7820 + 0.6189 i 1.0518 j + 0.4706 k 0.4441 0.0945 i + 0.1625 j 0.4622 k .
By Algorithm 1, we can compute its right T-eigenvalues and the corresponding T-eigentensors as follows:
λ 1 = 4.0017 X ˘ 1 = 0.5555 0.5555 0.5555 0.0057 0.0367 i 0.0565 j + 0.0140 k 0.0057 0.0367 i 0.0565 j + 0.0140 k 0.0057 0.0367 i 0.0565 j + 0.0140 k 0.1004 + 0.0764 i 0.0393 j 0.0503 k 0.1004 + 0.0764 i 0.0393 j 0.0503 k 0.1004 + 0.0764 i 0.0393 j 0.0503 k ,
λ 2 = 4.6672 X ˘ 2 = 0.1238 0.1238 0.1238 0.0202 0.0588 i + 0.3867 j 0.1894 k 0.0202 0.0588 i + 0.3867 j 0.1894 k 0.0202 0.0588 i + 0.3867 j 0.1894 k 0.1526 0.1986 i + 0.1967 j + 0.1654 k 0.1526 0.1986 i + 0.1967 j + 0.1654 k 0.1526 0.1986 i + 0.1967 j + 0.1654 k ,
λ 3 = 0.4097 X ˘ 3 = 0.0972 0.0972 0.0972 0.0580 + 0.2848 i 0.1696 j + 0.1614 k 0.0580 + 0.2848 i 0.1696 j + 0.1614 k 0.0580 + 0.2848 i 0.1696 j + 0.1614 k 0.3797 0.1839 i 0.0259 j + 0.0767 k 0.3797 0.1839 i 0.0259 j + 0.0767 k 0.3797 0.1839 i 0.0259 j + 0.0767 k ,
λ 4 = 5.4785 X ˘ 4 = 0.0885 0.0476 i 0.1642 j + 0.2118 k 0.0443 0.2085 i + 0.1675 j 0.0919 k 0.0443 + 0.2561 i 0.0034 j 0.1199 k 0.2962 + 0.0151 i + 0.2791 j + 0.2094 k 0.1037 0.1208 i 0.1905 j 0.3848 k 0.3999 + 0.1057 i 0.0886 j + 0.1754 k 0.0230 0.1590 i 0.0848 j 0.0932 k 0.1800 + 0.0722 i + 0.0638 j 0.0020 k 0.1570 + 0.0868 i + 0.0210 j + 0.0952 k ,
λ 5 = 3.6183 X ˘ 5 = 0.2079 0.1533 i + 0.0128 j + 0.1405 k 0.1040 0.0912 i + 0.0365 j 0.2572 k 0.1040 + 0.2444 i 0.0493 j + 0.1167 k 0.2022 0.1117 i + 0.1590 j + 0.0069 k 0.1281 + 0.2330 i + 0.0809 j 0.0377 k 0.0740 0.1213 i 0.2398 j + 0.0308 k 0.0155 + 0.3049 i + 0.1364 j 0.2371 k 0.0944 + 0.0266 i 0.3470 j + 0.1951 k 0.1098 0.3315 i + 0.2106 j + 0.0421 k ,
λ 6 = 5.7744 X ˘ 6 = 0.1234 + 0.1455 i 0.2358 j + 0.0903 k 0.0617 0.2975 i + 0.0286 j + 0.0838 k 0.0617 + 0.1520 i + 0.2072 j 0.1741 k 0.0260 0.2498 i + 0.0963 j 0.2124 k 0.1699 + 0.2923 i 0.0164 j 0.0539 k 0.1960 0.0425 i 0.0799 j + 0.2663 k 0.0339 + 0.0895 i 0.1100 j + 0.3073 k 0.1265 0.2703 i + 0.1469 j 0.0708 k 0.1604 + 0.1808 i 0.0369 j 0.2364 k ,
λ 7 = 0.0916 X ˘ 7 = 0.1887 + 0.1837 i 0.1470 j 0.0367 k 0.0944 0.0526 i + 0.0577 j + 0.2781 k 0.0944 0.1311 i + 0.0893 j 0.2414 k 0.0430 0.0062 i + 0.0704 j 0.2568 k 0.0748 + 0.1882 i 0.1390 j + 0.1116 k 0.1178 0.1820 i + 0.0686 j + 0.1452 k 0.1055 0.0479 i 0.1379 j 0.3685 k 0.3299 + 0.0865 i 0.1441 j + 0.1765 k 0.2244 0.0386 i + 0.2820 j + 0.1920 k ,
λ 8 = 3.2685 X ˘ 8 = 0.3407 0.0823 i 0.1201 j + 0.2024 k 0.1704 + 0.0502 i + 0.3728 j + 0.0881 k 0.1704 + 0.0321 i 0.2527 j 0.2905 k 0.1337 + 0.0152 i 0.1322 j + 0.0583 k 0.0962 0.1697 i + 0.0208 j 0.0223 k 0.0374 + 0.1545 i + 0.1114 j 0.0360 k 0.1836 + 0.2650 i + 0.0897 j + 0.0641 k 0.1176 0.2115 i 0.2371 j 0.0362 k 0.3012 0.0535 i + 0.1474 j 0.0279 k ,
λ 9 = 1.9206 X ˘ 9 = 0.3396 0.0729 i + 0.0816 j 0.0087 k 0.1698 + 0.2513 i + 0.1611 j + 0.0969 k 0.1698 0.1785 i 0.2427 j 0.0882 k 0.1663 0.1670 i + 0.2986 j 0.0659 k 0.1819 + 0.2830 i + 0.0503 j 0.1826 k 0.0156 0.1160 i 0.3489 j + 0.1167 k 0.2151 0.0615 i + 0.0081 j + 0.0827 k 0.1222 + 0.1010 i + 0.1756 j + 0.0314 k 0.0929 0.0395 i 0.1837 j 0.1141 k .
Algorithm 1: Calculation for the right T-eigenvalues of a third-order quaternion tensor Q ˘
  • Input: One quaternion tensor Q ˘ Q m × m × n .
    Output: Right T-eigenvalues λ ˘ and T-eigentensors X ˘ such that
  • Q ˘ X ˘ = X ˘ λ ˘ .
  • step1: Construct the following block-diagonalization:
  • [ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] = d i a g ( Q ˘ 1 , , Q ˘ t ) D Q .
  • step2: Construct the complex representation matrix:
  • Ψ ( Q ˘ ) = d i a g ( Φ ( Q ˘ 1 ) , , Φ ( Q ˘ t ) ) .
  • step3: Calculate the right eigenvalues λ ˘ i and corresponding eigenvectors x ˘ i of each diagonal block Q ˘ i of D Q through Φ ( Q ˘ i ) by the method in [38].
  • step4: Compute the eigenvector X ˘ i = ( 0 , , x ˘ i , , 0 ) T of D Q corresponding to eigenvalue λ ˘ i .
  • step5: Compute the eigenvector Y ˘ i = [ ( P F ˘ μ ˘ ) H I m ] X ˘ i of bcirc ( Q ˘ ) corresponding to eigenvalue λ ˘ i .
  • step6: Compute the T-eigentensor X ˘ = fold ( Y ˘ i ) .
In this example, the Error of Algorithm 1 is 1.0931 × 10 14 and the CPU time is 0.0122253 s, compared with the Error 1.7225 × 10 14 and the CPU time 0.0409140 s of the method based on the command eig in Quaternion tool box [37], which means that our method for computing the right T-eigenvalues is faster while maintaining better computational accuracy.

4. Inequalities for Right T-Eigenvalues of Hermitian Quaternion Tensors

Next, we examine the inequalities for right T-eigenvalues belonging to Hermitian quaternion third-order tensor Q ˘ Q n × n × m , and we assume that the right T-eigenvalues λ i ( Q ˘ ) are arranged in nondecreasing order, i.e., λ 1 ( Q ˘ ) λ 2 ( Q ˘ ) λ n m ( Q ˘ ) .
Fact 1 
([31]). Vectors v 1 , v 2 , , v t R n × 1 are linearly independent over R if and only if they are linearly independent over Q , i.e., d i m R S p a n { v 1 , v 2 , , v t } is equal to d i m Q S p a n { v 1 , v 2 , , v t } .
Lemma 4. 
Given a Hermitian matrix S ˘ Q n × n , let u ˘ 1 , u ˘ 2 , , u ˘ n be orthonormal eigenvectors of S ˘ associated with real right eigenvalues λ 1 , λ 2 , , λ n , respectively.
Assume that W ˘ is spanned by the above eigenvectors, i.e., W ˘ = S p a n Q { u ˘ p , , u ˘ q } , 1 p q n . Thus for any unit x ˘ W ˘ , we have
λ p ( S ˘ ) x ˘ H S ˘ x ˘ λ q ( S ˘ ) .
Proof. 
Let x ˘ = u ˘ p x ˘ p + + u ˘ q x ˘ q , then x ˘ H = x ˘ ¯ p u ˘ p H + + x ˘ ¯ q u ˘ q H . One step closer, we have
x ˘ H S ˘ x ˘ = x ˘ H [ S ˘ ( u ˘ p x ˘ p + + u ˘ q x ˘ q ) ]                                                                                                                      
  = x ˘ H ( u ˘ p λ p x ˘ p + + u ˘ q λ q x ˘ q )                                                                                                            
= λ p x ˘ H u ˘ p x ˘ p + + λ q x ˘ H u ˘ q x ˘ q                                                                                                          
                        = λ p ( x ˘ ¯ p u ˘ p H + + x ˘ ¯ q u ˘ q H ) u ˘ p x ˘ p + + λ q ( x ˘ ¯ p u ˘ p H + + x ˘ ¯ q u ˘ q H ) u ˘ q x ˘ q
= λ p | x ˘ p | 2 + + λ q | x ˘ q | 2 .                                                                                                                          
Since i = p q | x ˘ i | 2 = 1 , then it is easy to determine that λ p ( S ˘ ) x ˘ H S ˘ x ˘ λ q ( S ˘ ) . □
Lemma 5 
(Rayleigh–Ritz). Consider a third-order Hermitian tensor Q ˘ Q n × n × m . Then,
λ m i n ( Q ˘ ) = min x ˘ H x ˘ = 1 x ˘ H bcirc ( Q ˘ ) x ˘ ,
and
λ m a x ( Q ˘ ) = max x ˘ H x ˘ = 1 x ˘ H bcirc ( Q ˘ ) x ˘ .
Proof. 
The eigenvectors of bcirc ( Q ˘ ) form an orthonormal basis for Q n m . By Lemma 4, it is easy to observe that
λ m i n ( Q ˘ ) = u ˘ 1 H bcirc ( Q ˘ ) u ˘ 1 a n d λ m a x ( Q ˘ ) = u ˘ n H bcirc ( Q ˘ ) u ˘ n .
The following theorem yields the lower and upper bounds for right T-eigenvalues of Q ˘ + S ˘ .
Theorem 7. 
Given two Hermitian tensors Q ˘ and S ˘ of the same size n × n × m , then the following hold:
1. 
λ i ( Q ˘ ) + λ 1 ( S ˘ ) λ i ( Q ˘ + S ˘ ) λ i ( Q ˘ ) + λ n m ( S ˘ ) ;
2. 
λ n m ( Q ˘ S ˘ ) + λ 1 ( S ˘ ) λ n m ( Q ˘ ) .
Proof. 
  • Let x ˘ Q n m be a unit vector. Then, we have
    x ˘ H bcirc ( Q ˘ ) x ˘ + min x ˘ H x ˘ = 1 x ˘ H bcirc ( S ˘ ) x ˘ x ˘ H bcirc ( Q ˘ + S ˘ ) x ˘ x ˘ H bcirc ( Q ˘ ) x ˘ + max x ˘ H x ˘ = 1 x ˘ H bcirc ( S ˘ ) x ˘ .
    Then,
    x ˘ H bcirc ( Q ˘ ) x ˘ + λ 1 ( bcirc ( S ˘ ) ) x ˘ H bcirc ( Q ˘ + S ˘ ) x ˘ x ˘ H bcirc ( Q ˘ ) x ˘ + λ n m ( bcirc ( S ˘ ) ) ,
    which gives the desired inequality.
  • Q ˘ = ( Q ˘ S ˘ ) + S ˘ ; according to Lemma 5, we have
    λ m a x ( Q ˘ ) = max x ˘ H x ˘ = 1 x ˘ H bcirc ( Q ˘ ) x ˘                                                                                                                                                      
    = max x ˘ H x ˘ = 1 x ˘ H [ ( bcirc ( Q ˘ ) bcirc ( S ˘ ) ) + bcirc ( S ˘ ) ] x ˘                  
                      = max x ˘ H x ˘ = 1 x ˘ H [ ( bcirc ( Q ˘ ) bcirc ( S ˘ ) ) ] x ˘ + max x ˘ H x ˘ = 1 x ˘ H bcirc ( S ˘ ) x ˘
                      max x ˘ H x ˘ = 1 x ˘ H [ ( bcirc ( Q ˘ ) bcirc ( S ˘ ) ) ] x ˘ + min x ˘ H x ˘ = 1 x ˘ H bcirc ( S ˘ ) x ˘
    = λ m a x ( Q ˘ S ˘ ) + λ m i n ( S ˘ ) ,                                                                                                            
    which gives to λ n m ( Q ˘ S ˘ ) + λ 1 ( S ˘ ) λ n m ( Q ˘ ) .
Next, we extend the Weyl theorem from matrices to third-order Hermitian tensors, and only the right T-eigenvalues are considered.
Lemma 6 
(Weyl [39]). Assume that Q ˘ Q m × m and R ˘ Q m × m are both Hermitian matrices, and let { λ r } r = 1 m , { μ r } r = 1 m , { ν r } r = 1 m be the right eigenvalues of Q ˘ , R ˘ and Q ˘ + R ˘ , respectively. All of them are arranged in nondecreasing order, then
ν r λ r + s + μ m s , s = 0 , 1 , , m r .
For each r = 1 , 2 , , m , the equality holds if and only if in the case that there exists x ˘ 0 , satisfying
Q ˘ x ˘ = x ˘ λ r + s , R ˘ x ˘ = x ˘ μ m s , ( Q ˘ + R ˘ ) x ˘ = x ˘ ν r .
Similarly, we have that
λ r s + 1 + μ s ν r , s = 1 , , r .
For each r = 1 , 2 , , m , the equality holds if and only if in the case that there exists x ˘ 0 such that
Q ˘ x ˘ = x ˘ λ r s + 1 , R ˘ x ˘ = x ˘ μ s , ( Q ˘ + R ˘ ) x ˘ = x ˘ ν r .
If there is no common right eigenvector between Q ˘ , R ˘ and Q ˘ + R ˘ , then each inequality in (28) and (29) is a strict inequality.
Theorem 8. 
Given two quaternion Hermitian tensors Q ˘ and R ˘ with the identical size n × n × m , let { λ r } i = 1 n m , { μ r } r = 1 n m , { ν r } r = 1 n m be the right T-eigenvalues of Q ˘ , R ˘ and Q ˘ + R ˘ , respectively. All of them are arranged in nondecreasing order, then
ν r λ r + s + μ n m s , s = 0 , 1 , , n m r .
For each r = 1 , 2 , , n m , the equality holds if and only if inthe case that there exists a nonzero tensor X ˘ , where X ˘ = fold ( [ ( P F ˘ μ ˘ ) H I n ) ] x ˘ )   ( x ˘ 0 ) such that
Q ˘ X ˘ = X ˘ λ r + s , R ˘ X ˘ = X ˘ μ n m s , ( Q ˘ + R ˘ ) X ˘ = X ˘ ν r ,
where P is a permutation matrix obtained by a series of multiplications of elementary permutation matrices like in Theorem 3, and F ˘ μ ˘ is the discrete quaternion Fourier matrix. Similarly, we have that
λ r s + 1 + μ s ν r , s = 1 , , r .
For each r = 1 , 2 , , n m , the equality holds if and only if in the case that there exists nonzero X ˘ Q n × 1 × m such that
Q ˘ X ˘ = X ˘ λ r s + 1 , R ˘ X ˘ = X ˘ μ s , ( Q ˘ + R ˘ ) X ˘ = X ˘ ν r .
If there is no common T-eigentensor between Q ˘ , R ˘ and Q ˘ + R ˘ , then each inequality in (30) and (31) is a strict inequality.
Proof. 
For simplicity, only the case where m is odd is taken into consideration and the even case can be similarly discussed.
It is not difficult to see that bcirc ( Q ˘ ) and bcirc ( R ˘ ) are both Hermitian matrices, as Q ˘ and R ˘ are Hermitian tensors. Then, so is bcirc ( Q ˘ + R ˘ ) , i.e., Q ˘ + R ˘ is a Hermitian tensor. According to the definition of T-eigenvalue, it is easy to see that the right T-eigenvalues of Q ˘ , R ˘ and Q ˘ + R ˘ are right eigenvalues of Hermitian matrices bcirc ( Q ˘ ) , bcirc ( R ˘ ) and bcirc ( Q ˘ + R ˘ ) , respectively. Then, inequalities (30) and (31) hold immediately according to Lemma 6. And the equalities in (30) and (31) hold if and only if there exists one vector α ˘ 0 such that
bcirc ( Q ˘ ) α ˘ = α ˘ λ r + s bcirc ( R ˘ ) α ˘ = α ˘ μ n m s ( bcirc ( Q ˘ + R ˘ ) ) α ˘ = α ˘ ν r
That is to say, α ˘ is the common eigenvector of bcirc ( Q ˘ ) , bcirc ( R ˘ ) and bcirc ( Q ˘ + R ˘ ) associated with right eigenvalues λ r + s , μ n m s and ν r . From Theorem 3, we have that [ ( P F ˘ μ ˘ ) I n ] α ˘ is the common eigenvector of [ ( P F ˘ μ ˘ ) I n ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I n ) ] , [ ( P F ˘ μ ˘ ) I n ] bcirc ( R ˘ ) [ ( P F ˘ μ ˘ ) H I n ) ] and [ ( P F ˘ μ ˘ ) I n ] bcirc ( Q ˘ + R ˘ ) [ ( P F ˘ μ ˘ ) H I n ) ] , i.e., D Q , D R and D Q + R , with the corresponding right eigenvalues λ r + s , μ n m s and ν r . For convenience in notation, we denote C ˘ t as the t-th diagonal block of D Q + R .
Suppose that β ˘ = [ ( P F ˘ μ ˘ ) I n ] α ˘ has the following partition:
β ˘ H = [ β ˘ 1 H 1 × n , β ˘ 2 H 1 × 2 n , , β ˘ ( m + 1 ) / 2 H 1 × 2 n ] ,
where β ˘ 1 Q n × 1 and β ˘ t Q 2 n × 1 , 2 t ( m + 1 ) / 2 . Based on the fact that D Q , D R and D Q + R are all block-diagonal matrices with the same block structure, and according to Theorem 3, it is easy to see that λ r + s must be a right eigenvalue belonging to some diagonal block in D Q and μ n m s a right eigenvalue belonging to some diagonal block in D R , similarly, ν r be a right eigenvalue associated with some diagonal block in D Q + R . Consequently, there exist three index sets denoted as I Q , I R and I Q + R , which are subsets of { 1 , 2 , , m + 1 2 } that satisfy the following equations:
Q ˘ t β ˘ t = β ˘ t λ r + s when t I Q Q ˘ t β ˘ t β ˘ t λ r + s when t I Q ,
R ˘ t β ˘ t = β ˘ t μ n m s when t I R R ˘ t β ˘ t β ˘ t μ n m s when t I R ,
C ˘ t β ˘ t = β ˘ t ν r when t I Q + R C ˘ t β ˘ t β ˘ t ν r when t I Q + R .
Since β ˘ is a common eigenvector of D Q , D R and D Q + R , we have I I Q I R I Q + R and β ˘ t 0 when t I . It is easy to find that x ˘ = ( 0 1 , β ˘ t , 0 2 ) Q n m × 1 is also a common eigenvector of D Q , D R and D Q + R when t I , where 0 1 and 0 2 are zero vectors of an appropriate size. It is worth pointing out that the column vector x ˘ has the same row partition with D Q , D R and D Q + R . This yields that [ ( P F ˘ μ ˘ ) H I n ) ] x ˘ is a common eigenvector of block circulant matrices bcirc ( Q ˘ ) , bcirc ( R ˘ ) and bcirc ( Q ˘ + R ˘ ) . Consequently, Q ˘ , R ˘ and Q ˘ + R ˘ have a common T-eigentensor fold ( [ ( P F ˘ μ ˘ ) H I n ) ] x ˘ ) .
Conversely, suppose that Q ˘ , R ˘ and Q ˘ + R ˘ share a common T-eigentensor X ˘ Q n × 1 × m of the form X ˘ = fold ( [ ( P F ˘ μ ˘ ) H I n ) ] x ˘ )   ( x ˘ 0 ) , which satisfies the following equations:
Q ˘ X ˘ = X ˘ λ r + s , R ˘ X ˘ = X ˘ μ n m s , ( Q ˘ + R ˘ ) X ˘ = X ˘ ν r .
Then, it is simple to confirm that the nonzero vector [ ( P F ˘ μ ˘ ) H I n ) ] x ˘ satisfies all the equalities in (32). The equality of (31) can be similarly proved by applying the proof of (30) to Q ˘ , R ˘ and ( Q ˘ + R ˘ ) ; we will not elaborate it here. □

5. The Estimation of Right T-Eigenvalues of Quaternion Tensors

To the best of our knowledge, the G e r s ˇ g o r i n disc theorem is a key result used to estimate the spectra of square matrices. This section is devoted to the localization of the right T-eigenvalues of a third-order quaternion tensor under the tensor–tensor product. Next, we extend the G e r s ˇ g o r i n theorem from matrices to third-order quaternion tensors via the t-product.
Lemma 7 
([28]). Given a quaternion matrix Q ˘ = ( q ˘ i j )   Q n × n , let R i = j = 1 , j i n | q ˘ i j | ,   i = 1 , 2 , , n . For each right eigenvalue λ r belonging to Q ˘ , there exists a nonzero quaternion μ ˘ that satisfies that μ ˘ 1 λ ˘ r μ ˘ (which is also a right eigenvalue) lies in the union of the G e r s ˇ g o r i n balls { z Q : | z q ˘ i i | R i } . Specifically, if λ r is a real number, it is located in a G e r s ˇ g o r i n ball.
Theorem 9 
( G e r s ˇ g o r i n theorem for right T-eigenvalues of third-order quaternion tensors). Given a third-order quaternion tensor Q ˘   Q n × n × m , the following hold:
  • Case 1: If m is odd, let P be a permutation matrix by swapping i-th and ( m i + 3 ) -th columns of an identity matrix for i = 3 , 4 , , m + 1 2 . Then, [ ( P F ˘ μ ˘ ) I n ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I n ) ] = d i a g ( Q ˘ 1 , Q ˘ 2 , , Q ˘ ( m + 1 ) / 2 ) D Q , where Q ˘ k = ( q ˘ i j ( k ) ) , i , j = 1 , 2 , , n when k = 1 ; i , j = 1 , 2 , , 2 n when k 2 . Let R i ( 1 ) = j = 1 , j i n | q ˘ i j ( 1 ) | ,   i = 1 , 2 , , n and R i ( k ) = j = 1 , j i 2 n | q ˘ i j ( k ) | ,   i = 1 , 2 , , 2 n , k 2 . Then, for each right T-eigenvalue λ ˘ r of Q ˘ , there exists a quaternion μ ˘ such that μ ˘ 1 λ ˘ r μ ˘ (which is also a right T-eigenvalue) lies in the union of m n closed G e r s ˇ g o r i n balls i = 1 n { z Q : | z q ˘ i i ( 1 ) | R i ( 1 ) } k = 2 ( m + 1 ) / 2 i = 1 2 n { z Q : | z q ˘ i i ( k ) | R i ( k ) } . Specifically, if λ r is a real T-eigenvalue of A ˘ , it is contained in a G e r s ˇ g o r i n ball.
  • Case 2: If m is even, let P be a permutation matrix by swapping i-th and ( m i + 3 ) -th columns of an identity matrix for i = 3 , 4 , , m 2 . Then, [ ( P F ˘ μ ˘ ) I n ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I n ) ] = d i a g ( Q ˘ 1 , Q ˘ 2 , , Q ˘ m / 2 + 1 ) D Q , where Q ˘ k = ( q ˘ i j ( k ) ) , i , j = 1 , 2 , , n when k = 1 and k = m / 2 + 1 ; i , j = 1 , 2 , , 2 n when k 2 and k ( m / 2 + 1 ) . Let R i ( 1 ) = j = 1 , j i n | q ˘ i j ( 1 ) | ,   i = 1 , 2 , , n , R i ( m / 2 + 1 ) = j = 1 , j i n | q ˘ i j ( m / 2 + 1 ) | ,   i = 1 , 2 , , n and R i ( k ) = j = 1 , j i 2 n | q ˘ i j ( k ) | ,   i = 1 , 2 , , 2 n , k 2 and k ( m / 2 + 1 ) . Then, for each right T-eigenvalue λ r belonging to Q ˘ , there exists a quaternion μ ˘ such that μ ˘ 1 λ ˘ r μ ˘ (which is also a right T-eigenvalue) lies in the union of m n closed G e r s ˇ g o r i n balls i = 1 n { z Q : | z q ˘ i i ( 1 ) | R i ( 1 ) } i = 1 n { z Q : | z q ˘ i i ( m / 2 + 1 ) | R i ( m / 2 + 1 ) } k = 2 m / 2 i = 1 2 n { z Q : | z q ˘ i i ( k ) | R i ( k ) } . Specifically, if λ r is a real T-eigenvalue of Q ˘ , it is contained in a G e r s ˇ g o r i n ball.
Proof. 
For simplicity, we only consider the odd case here as the even case can be similarly proved.
As shown in [33], a quaternion block circulant matrix Q ˘ Q n m × n m can be block-diagonalized into a block-diagonal matrix with n-by-n blocks and 2n-by-2n blocks. That is, given a tensor Q ˘ Q n × n × m , then we have
[ ( P F ˘ μ ˘ ) I n ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I n ) ] = Q ˘ 1 Q ˘ 2 Q ˘ ( m + 1 ) / 2 D Q ,
where Q ˘ 1 = ( q ˘ i j ( 1 ) ) , i , j = 1 , 2 , , n is of size n × n , while Q ˘ k = ( q ˘ i j ( k ) ) , i , j = 1 , 2 , , 2 n is of size 2 n × 2 n , k = 2 , 3 , , ( m + 1 ) / 2 .
Applying Theorem 3 and Lemma 7, it is easy to obtain the desired result. □
Remark 1. 
The even case can be similarly proved as the odd case, except that there exist one more n-by-n block at the right bottom of the block-diagonal matrix D Q , which we do not elaborate further here.
Example 2. 
Consider a third-order Hermitian tensor Q ˘ Q 3 × 3 × 3 of the following structure:
Q ˘ ( : , : , 1 ) = 1 i + j i i j 2 4 k i 4 k 3 ,
Q ˘ ( : , : , 2 ) = 4 i 2 k 3 j 5 i + j i + 3 k j + k 6 ,
Q ˘ ( : , : , 3 ) = 4 3 j i 3 k i 5 j k 2 k i j 6 .
By Algorithm 1, the right T-eigenvalues of Q ˘ are 6.7446, 11.9286, 17.3269, 6.4356, 3.5744, −2.2721, −11.2869, −9.0741 and −5.3769. According to Theorem 9, we have that the right T-eigenvalues of Q ˘ are contained within the union of the nine closed discs listed below:
C 1 = { z Q : | z 9 | 3.8284 } , C 2 = { z Q : | z 12 | 5.9907 } ,
C 3 = { z Q : | z 15 | 4.1623 } , C 4 = { z Q : | z + 3 | 10.4700 } ,
C 5 = { z Q : | z + 3 | 11.7952 } , C 6 = { z Q : | z + 3 | 15.1362 } ,
C 7 = { z Q : | z + 3 | 13.0092 } , C 8 = { z Q : | z + 3 | 12.6964 } ,
C 9 = { z Q : | z + 3 | 11.6958 } .
Lemma 8 
([28]). Consider a quaternion matrix Q ˘ Q n × n , if there exists t connected G e r s ˇ g o r i n balls, each of which is disjointed with others. Then, there exists at least t right eigenvalues of Q ˘ .
Theorem 10. 
Given a third-order quaternion tensor Q ˘ Q n × n × p , if there are m connected G e r s ˇ g o r i n balls that are disjoint with other G e r s ˇ g o r i n balls, then the connected region must contain at least m right T-eigenvalues of the third-order quaternion tensor (some of which may be counted multiple times).
Proof. 
Suppose an F-square tensor Q ˘ = Q 0 + Q 1 μ ˘ + Q 2 α ˘ + Q 3 β ˘ Q m × m × n is in a three-axis system ( μ ˘ , α ˘ , β ˘ ) , where μ ˘ is any given unit pure quaternion, α ˘ is a unit pure quaternion satisfying α ˘ μ ˘ and β ˘ = α ˘ μ ˘ . As the cases for even n and odd n are highly similar, we consider only the odd case. By the above proofs, we know that there exists an n × n quaternion Fourier transform matrix F ˘ μ ˘ and a n × n permutation matrix P such that the following equation holds:
[ ( P F ˘ μ ˘ ) I m ] bcirc ( Q ˘ ) [ ( P F ˘ μ ˘ ) H I m ) ] = Q ˘ 1 Q ˘ 2 Q ˘ n + 1 2 D Q ,
where P is obtained by swapping the t-th and ( n t + 3 ) -th columns of a n × n identity matrix for t = 3 , , n + 1 2 , and Q ˘ 1 = ( q ˘ i j ( 1 ) ) Q m × m while Q ˘ k = ( q ˘ i j ( k ) ) Q 2 m × 2 m k = 2 , 3 , , n + 1 2 . From Theorem 3, we know that σ r ( Q ˘ ) = σ r ( D Q ) = s = 1 n + 1 2 σ r ( Q ˘ s ) . Employing Lemma 7 yields the conclusion that for each right T-eigenvalue λ ˘ of Q ˘ there exists a quaternion q ˘ 0 such that q ˘ 1 λ ˘ q ˘ (which is again a right T-eigenvalue) is located in the union of those G e r s ˇ g o r i n balls { p ˘ 1 λ ˘ p ˘ : 0 p ˘ Q } { i = 1 m { z Q : | z q ˘ i i ( 1 ) | R i ( 1 ) } k = 2 ( n + 1 ) 2 i = 1 2 m { z Q : | z q ˘ i i ( k ) | R i ( k ) } } , where R i ( 1 ) = j = 1 , j i n | q ˘ i j ( 1 ) | ,   i = 1 , 2 , , m and R i ( k ) = j = 1 , j i 2 m | q ˘ i j ( k ) | ,   i = 1 , 2 , , 2 m , k = 2 , 3 , , n + 1 2 . The desired conclusion then can be obtained by applying the result of Lemma 8 to D Q in Equation (35). □

6. Conclusions and Prospects

In this paper, we explore the right T-eigenvalues of third-order quaternion tensors, and we give an algorithm to compute it, along with a specific example, which involves comparison with other methods in terms of computational error and CPU time to demonstrate the better accuracy and speed of our algorithm. We prove that the right T-eigenvalues are real numbers, and give the upper and lower bounds for the right T-eigenvalues of the sum of a pair of Hermitian tensors. Moreover, we extend the Weyl theorem and G e r s ˇ g o r i n theorem from matrices to third-order Hermitian quaternion tensors. However, there is still potential for progress in our research article. Recently, Miao et al. [40] have generalized the tensor–tensor product to higher-order cases, which is a flexible transform-based tensor product, i.e., Qt-product. Currently, research on the eigenvalues of higher-order quaternion tensors is relatively scarce. This finding opens new avenues for our future research. In the future, we hope to conduct more research on the eigenvalues of higher-order quaternion tensors.

Author Contributions

Conceptualization, Z.-H.H. and M.-L.D.; methodology, Z.-H.H. and M.-L.D.; software, Z.-H.H. and M.-L.D.; validation, Z.-H.H., M.-L.D. and S.-W.Y.; formal analysis, Z.-H.H. and M.-L.D.; writing—original draft preparation, Z.-H.H. and M.-L.D.; writing—review and editing, Z.-H.H., M.-L.D. and S.-W.Y.; supervision, Z.-H.H. and S.-W.Y.; funding acquisition, Z.-H.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research is supported by the National Natural Science Foundation of China [grant numbers 12271338, 12371023, 12426508].

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The authors would like to thank the editor and reviewers for their valuable suggestions, comments, and the Natural Science Foundation of China under Grant Nos. 12271338, 12371023, 12426508.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Hamilton, W.R. Theory of quaternions. Proc. R. Ir. Acad. 1844, 3, 1–16. [Google Scholar]
  2. Pletinckx, D. Quaternion calculus as a basic tool in computer graphics. Vis. Comput. 1989, 5, 2–13. [Google Scholar] [CrossRef]
  3. Diao, Q.K.; Xu, D.P.; Sun, S.N.; Mandic, D.P. Optimizing beamforming in quaternion signal processing using projected gradient descent algorithm. Signal Process. 2025, 227, 109738. [Google Scholar] [CrossRef]
  4. Jablonski, B. Quaternion Dynamic Time Warping. IEEE Trans. Signal Process. 2012, 60, 1174–1183. [Google Scholar] [CrossRef]
  5. Zou, C.M.; Kou, K.I.; Dong, L.; Zheng, X.W.; Tang, Y.Y. From Grayscale to Color: Quaternion Linear Regression for Color Face Recognition. IEEE Access 2019, 7, 154131–154140. [Google Scholar] [CrossRef]
  6. He, Z.H.; Qin, W.L.; Tian, J.; Wang, X.X.; Zhang, Y. A new Sylvester-type quaternion matrix equation model for color image data transmission. Comput. Appl. Math. 2024, 43, 227. [Google Scholar] [CrossRef]
  7. Zou, C.M.; Kou, K.I.; Wang, Y.L. Quaternion Collaborative and Sparse Representation with Application to Color Face Recognition. IEEE Trans. Image Process. 2016, 25, 3287–3302. [Google Scholar] [CrossRef]
  8. Vo, T.; Tran, D.; Ma, W.L. Tensor decomposition and application in image classification with histogram of oriented gradients. Neurocomputing 2015, 165, 38–45. [Google Scholar] [CrossRef]
  9. Shashua, A.; Hazan, T. Non-negative tensor factorization with applications to statistics and computer vision. In Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany, 7–11 August 2005; pp. 792–799. [Google Scholar]
  10. Zhou, H.; Li, L.X.; Zhu, H.T. Tensor Regression with Applications in Neuroimaging Data Analysis. J. Am. Stat. Assoc. 2013, 108, 540–552. [Google Scholar] [CrossRef]
  11. De Lathauwer, L.; De Moor, B.; Vandewalle, J. A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 2000, 21, 1253–1278. [Google Scholar] [CrossRef]
  12. Kolda, T.G.; Bader, B.W. Tensor decompositions and applications. SIAM Rev. 2009, 51, 455–500. [Google Scholar] [CrossRef]
  13. Zeng, C.; Ng, M.K. Decompositions of third-order tensors: HOSVD, T-SVD, and Beyond. Numer. Linear Algebra Appl. 2020, 27, e2290. [Google Scholar] [CrossRef]
  14. Song, G.; Ng, M.K.; Zhang, X. Robust tensor completion using transformed tensor singular value decomposition. Numer. Linear Algebra Appl. 2020, 27, e2299. [Google Scholar] [CrossRef]
  15. Jin, H.; Bai, M.; Benítez, J.; Liu, X. The generalized inverses of tensors and an application to linear models. Comput. Math. Appl. 2017, 74, 385–397. [Google Scholar] [CrossRef]
  16. He, Z.H.; Ng, M.K.; Zeng, C. Generalized singular value decompositions for tensors and their applications. Numer. Math. Theory Methods Appl. 2021, 14, 692–713. [Google Scholar]
  17. Gaidhane, V.H.; Hote, Y.V.; Singh, V. An efficient approach for face recognition based on common eigenvalues. Pattern Recognit. 2014, 47, 1869–1879. [Google Scholar] [CrossRef]
  18. Abadpour, A.; Kasaei, S. Color PCA eigenimages and their application to compression and watermarking. Image Vis. Comput. 2008, 26, 878–890. [Google Scholar] [CrossRef]
  19. Xu, M.X.; Wei, C.L. Remotely Sensed Image Classification by Complex Network Eigenvalue and Connected Degree. Comput. Math. Methods Med. 2008, 2012, 143–156. [Google Scholar] [CrossRef]
  20. Qi, L. Eigenvalues and invariants of tensors. J. Math. Anal. Appl. 2007, 325, 1363–1377. [Google Scholar] [CrossRef]
  21. Li, S.G.; Chen, Z.; Li, C.Q.; Zhao, J.X. Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices. Comput. Appl. Math. 2020, 39, 217. [Google Scholar] [CrossRef]
  22. Einstein, A. The foundation of the general theory of relativity. In The Collected Papers of Albert Einstein 6; Kox, A.J., Klein, M.J., Schulmann, R., Eds.; Princeton University Press: Princeton, NJ, USA, 2007; pp. 146–200. [Google Scholar]
  23. Kilmer, M.E.; Braman, K.; Hao, N.; Hoover, R.C. Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging. SIAM J. Matrix Anal. Appl. 2013, 34, 148–172. [Google Scholar] [CrossRef]
  24. He, Z.H.; Wang, X.X.; Zhao, Y.F. Eigenvalues of Quaternion Tensors with Applications to Color Video Processing. J. Sci. Comput. 2023, 94, 1. [Google Scholar] [CrossRef]
  25. He, Z.H.; Liu, T.T.; Wang, X.X. Eigenvalues of Quaternion Tensors: Properties, Algorithms and Applications. Adv. Appl. Clifford Algebr. 2024, 35, 4. [Google Scholar] [CrossRef]
  26. Liu, W.H.; Jin, X.Q. A study on T-eigenvalues of third-order tensors. Linear Algebra Appl. 2021, 612, 357–374. [Google Scholar] [CrossRef]
  27. Mo, C.X.; Ding, W.Y.; Wei, Y.M. Perturbation Analysis on T-Eigenvalues of Third-Order Tensors. J. Optimiz. Theory App. 2024, 202, 668–702. [Google Scholar] [CrossRef]
  28. Zhang, F.Z. Geršgorin type theorems for quaternionic matrices. Linear Algebra Appl. 2007, 424, 139–153. [Google Scholar] [CrossRef]
  29. Golub, G.H.; VanLoan, C.F. Matrix Computations, 4th ed.; Johns Hopkins University Press: Baltimore, MD, USA, 2014; pp. 357–358. [Google Scholar]
  30. Davis, C.; Kahan, W.M. The Rotation of Eigenvectors by a Perturbation. III. SIAM J. Numer. Anal. 1970, 7, 1–46. [Google Scholar] [CrossRef]
  31. Rodman, L. Topics in Quaternion Linear Algebra; Princeton University Press: Princeton, NJ, USA, 2014. [Google Scholar]
  32. Kilmer, M.E.; Martin, C.D. Factorization strategies for third-order tensors. Linear Algebra Appl. 2011, 435, 641–658. [Google Scholar] [CrossRef]
  33. Pan, J.J.; Ng, M.K. Block-Diagonalization of Quaternion Circulant Matrices with Applications. SIAM J. Matrix Anal. Appl. 2024, 45, 1429–1454. [Google Scholar] [CrossRef]
  34. Lund, K. The tensor t-function: A definition for functions of third-order tensors. Numer. Linear Algebr. 2020, 27, 1–17. [Google Scholar] [CrossRef]
  35. Zhang, F.Z. Matrix Theory: Basic Results and Techniques, 2nd ed.; Springer: New York, NY, USA, 2011; pp. 117–119. [Google Scholar]
  36. Wu, F.S.; Li, C.Q.; Li, Y.T.; Tang, N.S. Complex Representation Matrix of Third-Order Quaternion Tensors with Application to Video Inpainting. J. Optim. Theory Appl. 2025, 205, 27. [Google Scholar] [CrossRef]
  37. Sangwine, S.; Bihan, N.L. Quaternion Toolbox for Matlab. Available online: http://qtfm.sourceforge.net (accessed on 20 April 2025).
  38. Jiang, T.S. An algorithm for eigenvalues and eigenvectors of quaternion matrices in quaternionic quantum mechanics. J. Math. Phys. 2004, 45, 3334–3338. [Google Scholar] [CrossRef]
  39. Horn, R.A. Matrix Analysis, 2nd ed.; Cambridge University Press: Cambridge, UK, 2013; pp. 239–256. [Google Scholar]
  40. Miao, J.F.; Kou, K.I. Quaternion tensor singular value decomposition using a flexible transform-based approach. Signal Process. 2023, 206, 108910. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

He, Z.-H.; Deng, M.-L.; Yu, S.-W. T-Eigenvalues of Third-Order Quaternion Tensors. Mathematics 2025, 13, 1549. https://doi.org/10.3390/math13101549

AMA Style

He Z-H, Deng M-L, Yu S-W. T-Eigenvalues of Third-Order Quaternion Tensors. Mathematics. 2025; 13(10):1549. https://doi.org/10.3390/math13101549

Chicago/Turabian Style

He, Zhuo-Heng, Mei-Ling Deng, and Shao-Wen Yu. 2025. "T-Eigenvalues of Third-Order Quaternion Tensors" Mathematics 13, no. 10: 1549. https://doi.org/10.3390/math13101549

APA Style

He, Z.-H., Deng, M.-L., & Yu, S.-W. (2025). T-Eigenvalues of Third-Order Quaternion Tensors. Mathematics, 13(10), 1549. https://doi.org/10.3390/math13101549

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

Article Metrics

Back to TopTop