Skip to Content
You are currently on the new version of our website. Access the old version .
MathematicsMathematics
  • Feature Paper
  • Article
  • Open Access

9 November 2026

28 Pages

Operator-Inequality Defects in Transform-Based Tensor Algebras: Invariance and Transform Sensitivity

and
1
Department of Applied Data Science, San Jose State University, San Jose, CA 95192, USA
2
Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong
*
Author to whom correspondence should be addressed.
This article belongs to the Section A: Algebra and Logic

Abstract

Transform-based tensor algebras induced by invertible linear transforms provide a unified framework for tensor operations and spectral analysis. This paper investigates how the choice of a unitary transform affects the quantitative tightness of classical operator inequalities. We first formulate a transform-domain transfer principle for matrix trace inequalities and examine its consequences for the Golden–Thompson, Jensen-type, Klein, and Lieb inequalities. We then study the Golden–Thompson defect through its exact slice-wise decomposition. Under bounded spectral assumptions, we establish an upper estimate in terms of squared transform-domain commutators and a matching-order lower estimate for an explicit Pauli-matrix family. We further establish qualitative transform sensitivity: explicit separation results for real orthogonal transforms, including a DFT–DCT separation at p = 4 . Finally, we investigate the non-universality of transform selection and formulate commutator-energy minimization as an operator-aware surrogate objective over the orthogonal group. The framework separates algebraic invariance from transform-dependent inequality tightness without assuming general equivalence between the defect and commutator-energy objectives.

1. Introduction

Tensor algebra based on transform-induced products has become a central tool in modern multilinear analysis [1,2]. The  ⋆ M -product framework of Kernfeld, Kilmer, and Aeron [3] defines a tensor–tensor product for any fixed invertible transform M, and the subsequent ⋆ M -algebra developed by Kilmer et al. [4] provides its algebraic and spectral foundations. The operator-theoretic interpretation of third-order tensors under the t-product was developed in [5]. When M is the discrete Fourier transform, this reduces to the classical t-product of Kilmer and Martin [6]. In this study, we specialize to unitary transforms Φ and study operator inequalities within this established algebra. This flexibility has led to a wide range of applications [7,8], including tensor completion, robust PCA, and signal processing, where different unitary transforms induce different notions of structure and sparsity.
A fundamental feature of these frameworks is that different choices of Φ lead to algebraically isomorphic tensor algebras. Consequently, the unitary transform is often viewed as a change in basis that does not alter intrinsic properties. However, this viewpoint overlooks an important phenomenon:
(Transform-dependent noncommutativity) The choice of transform Φ defines a coordinate system in which noncommutativity is measured, and different unitary transforms reveal fundamentally different commutative structures.
This observation suggests that while algebraic properties may be invariant, quantitative behavior can depend strongly on Φ . The goal of this paper is to develop a systematic theory of this phenomenon in the context of classical operator inequalities.
Classical operator inequalities for matrices—including the Golden–Thompson inequality [9,10] and related Jensen-, Klein-, and Lieb-type inequalities [11]—play a foundational role in matrix analysis and operator theory. Related inequalities for t-product tensors have been studied in [12,13]. Their significance lies not only in their validity, but also in how their defect (slack) reflects noncommutativity. A natural question arises in the tensor setting: Does the choice of unitary transform Φ affect operator inequalities, or is it merely a change of basis?
At the algebraic level, the answer is straightforward: operator inequalities remain valid for all Φ with exactly the same constants as in the matrix case. The algebraic structure of the ⋆ M algebra is already well understood [3,4]. Our starting point is the observation that this algebraic invariance conceals a deeper phenomenon: Algebraic invariance does not imply quantitative invariance.
While operator inequalities remain valid under all unitary transforms, their defect depends explicitly on transform-domain noncommutativity. For two tensors of the same size, we write A ⊕ Φ B for the tensor whose transform-domain lifting is the sum of the corresponding liftings:
A ⊕ Φ B ¯ Φ = A ¯ Φ + B ¯ Φ .
Since the transform is linear, this operation coincides with ordinary tensor addition. To formalize this phenomenon, we introduce the Φ -dependent Golden–Thompson defect
Δ Φ ( A , B ) : = Tr Φ exp Φ ( A ) ⋆ Φ exp Φ ( B ) − Tr Φ exp Φ ( A ⊕ Φ B ) ,
where A , B ∈ C n × n × p are Φ -Hermitian tensors whose transformed slices A ^ Φ ( ω ) and B ^ Φ ( ω ) are Hermitian for ω = 1 , … , p (see Definition 4), Tr Φ ( · ) and exp Φ ( · ) are the Φ -trace and Φ -exponential maps (see Definitions 2 and 3), and  ⋆ Φ ( · , · ) is the ⋆ Φ -product between two tensors (see Definition 1). The quantity Δ Φ ( A , B ) measures the failure of exact commutativity in the transform-based tensor algebra and quantifies the deviation between multiplicative and additive spectral propagation under the Φ -exponential map. Under a bounded spectral-domain assumption, we show that this defect is quantitatively controlled by the aggregate transform-domain commutator energy:
∑ ω = 1 p A ^ Φ ( ω ) , B ^ Φ ( ω ) F 2 .
A central consequence of this viewpoint is that no transform is universally optimal. While certain transforms, such as the discrete Fourier transform, may yield vanishing defect for specific tensor pairs, other transforms, such as the discrete cosine transform, may produce significantly smaller defects for different tensor configurations. Thus, optimal transform selection is inherently data-dependent. In this sense, the choice of Φ is not merely a change of basis, but rather a choice of spectral coordinate system that determines how commutativity is evaluated in the transform domain.
The main contributions of this paper are summarized as follows:
  • (Established foundation) We work within the transform-based ⋆ M tensor algebra of Kernfeld–Kilmer–Aeron [3] and its ⋆ M -algebra formulation [4], specialized to unitary transforms Φ .
  • (Operator-inequality transfer principle) Classical trace inequalities, including Golden–Thompson, Jensen, Klein, and Lieb, transfer to the transform-based tensor algebra with the same constants as in the matrix case.
  • (Defect characterization) Under a bounded spectral-domain assumption, the Golden–Thompson defect Δ Φ ( A , B ) is quantitatively controlled by the transform-domain commutator energy:
    ∑ ω = 1 p A ^ Φ ( ω ) , B ^ Φ ( ω ) F 2 .
  • (Transform sensitivity) The Golden–Thompson defect depends nontrivially on the choice of the unitary transform Φ . For certain tensor pairs, choosing Φ as the discrete Fourier transform (DFT) yields exact slice-wise commutativity in the transform domain, providing
    Δ DFT ( A , B ) = 0 .
    In contrast, choosing Φ as the discrete cosine transform (DCT) may produce significant transform-domain noncommutativity, leading to a strictly positive defect in suitable regimes. This demonstrates that transform selection fundamentally affects the geometry of noncommutativity in the transform-based tensor algebra.
  • (Non-universality and operator-aware transform selection) No unitary transform minimizes the Golden–Thompson defect for all tensor pairs. Optimal transforms are necessarily data-dependent. Transform selection can be formulated as minimizing transform-domain noncommutativity over the orthogonal group, thereby connecting the problem to approximate joint diagonalization of tensor slices.
These results establish that Φ induces a nontrivial geometry of inequality tightness, governed by transform-dependent noncommutativity. To the best of our knowledge, this is the first work that separates algebraic invariance from quantitative behavior in transform-based tensor algebras.
The organization of this paper is as follows. Section 2 introduces the transform-based tensor algebra and notation. Section 3 establishes the operator-inequality transfer principle. Section 4 develops the transform-sensitive defect theory, including quantitative bounds and separation results. Section 5 investigates optimization formulations for operator-aware transform selection. Section 6 contains concluding remarks and discusses broader implications and connections to numerical linear algebra and operator theory.

2. The Transform-Based Tensor Algebra

This section recalls the transform-based tensor algebra that underlies the operator-inequality analysis in the remainder of the paper. The tensor product used here is the established ⋆ M -product of Kernfeld, Kilmer, and Aeron [3] and its ⋆ M -algebra formulation [4], specialized to unitary transforms Φ ∈ C p × p . We denote the resulting product by ⋆ Φ and refer to it as the ⋆ Φ -product, or simply the Φ -product when the transform is clear from context. We then recall the associated block-diagonal representation and the basic operations—trace, exponential, and logarithm—that will be used to state and analyze operator inequalities in later sections.

2.1. Definition of the ⋆ Φ -Product and Basic Operations

Let A ∈ C n 1 × n 2 × p . For a unitary transform Φ ∈ C p × p , define the transformed tensor A ^ Φ ∈ C n 1 × n 2 × p by applying Φ to each tube (i.e., each third-mode fiber) of A . Denote by A ^ Φ ( i ) ∈ C n 1 × n 2 the i-th frontal slice of A ^ Φ . The associated block-diagonal matrix A ¯ Φ ∈ C p n 1 × p n 2 is defined as
A ¯ Φ = blockdiag A ^ Φ ( 1 ) , A ^ Φ ( 2 ) , … , A ^ Φ ( p ) .
Definition 1
( ⋆ Φ -product, following [3,4]). For A ∈ C n 1 × n 2 × p and B ∈ C n 2 × n 3 × p , the  ⋆ Φ -product C = A ⋆ Φ B ∈ C n 1 × n 3 × p is defined by
C ¯ Φ = A ¯ Φ · B ¯ Φ ,
where C ¯ Φ is the block-diagonal matrix constructed from the transformed tensor C ^ Φ in the same manner as above. This is the ⋆ M -product of [3,4] with M = Φ .
Remark 1.
When Φ is the discrete Fourier transform (DFT) matrix, the  ⋆ Φ -product reduces to the conventional t-product of Kilmer and Martin [6]. More generally, for an invertible transform M, the construction above coincides with the transform-based tensor–tensor product of [3].

2.2. Φ -Trace, Φ -Exponential, and  Φ -Logarithm

Definition 2
( Φ -trace). Let A ∈ C n × n × p . The Φ-trace of A is defined by
Tr Φ ( A ) : = Tr A ¯ Φ ,
where Tr ( · ) denotes the standard matrix trace.
Definition 3
( Φ -exponential and Φ -logarithm). Let A ∈ C n × n × p be Φ-Hermitian. The Φ-exponential and Φ-logarithm are defined via the block-diagonal lifting as
exp Φ ( A ) : = Φ H exp A ¯ Φ , log Φ ( A ) : = Φ H log A ¯ Φ ,
where the functions exp ( · ) and log ( · ) are applied blockwise to A ¯ Φ , i.e., to each diagonal block A ^ Φ ( i ) .
Here, Φ H [ · ] denotes the inverse transform applied to each mode-3 fiber, i.e., the inverse of the map X ↦ X ^ Φ . It does not denote ordinary matrix multiplication of Φ H with the block-diagonal matrix.

2.3. Φ -Hermitian Structure, Commutator, and Spectral Mapping

Definition 4
( Φ -Hermitian). Let A ∈ C n × n × p . We say that A is Φ-Hermitian if its block-diagonal lifting A ¯ Φ is Hermitian, i.e.,
A ¯ Φ H = A ¯ Φ .
Equivalently, each transformed frontal slice A ^ Φ ( i ) is Hermitian for all i = 1 , … , p .
Definition 5
( Φ -commutator). Let A , B be tensors of compatible sizes. The Φ-commutator is defined by
[ A , B ] Φ : = A ¯ Φ B ¯ Φ − B ¯ Φ A ¯ Φ ,
where the right-hand side is the ordinary matrix commutator.
Lemma 1
(Spectral mapping). Let A ∈ C n × n × p be Φ-Hermitian, and let f be an analytic function defined on an open set containing the spectrum of A ¯ Φ . Then,
f Φ ( A ) = Φ H f A ¯ Φ ,
where f ( A ¯ Φ ) is applied blockwise to each diagonal block. This is the standard functional calculus in the transform-domain representation of the ⋆ M algebra [3,4].
Proof. 
Since A is Φ -Hermitian, the matrix A ¯ Φ is Hermitian and hence unitarily diagonalizable. Thus, there exists a unitary matrix U such that
A ¯ Φ = U Λ U H ,
where Λ is diagonal containing the eigenvalues of A ¯ Φ .
Using the standard functional calculus for Hermitian matrices,
f A ¯ Φ = U f ( Λ ) U H ,
where f ( Λ ) is obtained by applying f to each diagonal entry.
By definition of the Φ -functional calculus (cf. Section 2.2),
f Φ ( A ) = Φ H f A ¯ Φ ,
which establishes the claim.    □
Remark 2.
The Φ-Hermitian condition is essential for the spectral mapping lemma, as it guarantees that A ¯ Φ is unitarily diagonalizable with real eigenvalues. For non-Hermitian tensors, the exponential and logarithm remain well-defined via the blockwise matrix exponential and logarithm, but the spectral interpretation (e.g., eigenvalue mapping) does not hold in general.

3. An Operator-Inequality Transfer Principle

This section records a transfer principle for classical operator inequalities in the transform-based tensor algebra. The purpose of this section is two-fold. First, we recall that the standard trace inequalities—including Golden–Thompson, Jensen, Klein, and Lieb—transfer to the transform-based tensor algebra with the same constants as in the matrix case. Second, we emphasize that this transfer is a direct consequence of the established transform-domain representation of the ⋆ M algebra [3,4]; it is therefore not the main contribution of this study. The main contribution, developed in Section 4, concerns the quantitative behavior of the associated defect under a change of transform.

3.1. Transfer Principle

The following transfer principle separates the algebraic validity of a matrix inequality from its quantitative behavior under a change in transform. Its purpose is to identify which conclusions follow directly from the established block-diagonal representation before examining the transform-dependent defect in Section 4.
Theorem 1
(Operator-inequality transfer principle). Let I ( X 1 , … , X m ) be a trace or functional inequality that is preserved under finite direct sums of matrices. More precisely, assume that for all Hermitian matrices X 1 , … , X m of compatible sizes, the inequality I ( X 1 , … , X m ) ≥ 0 holds, and that the same inequality holds for finite direct sums
I ⨁ i = 1 p X 1 ( i ) , … , ⨁ i = 1 p X m ( i ) ≥ 0
whenever I ( X 1 ( i ) , … , X m ( i ) ) ≥ 0 for each i.
Then, for every unitary transform Φ ∈ C p × p , the corresponding inequality holds in the transform-based tensor algebra slice-wise. In particular, if  A 1 , … , A m ∈ C n × n × p are Φ-Hermitian tensors, then
I Φ ( A 1 , … , A m ) ≥ 0 ,
where I Φ denotes the Φ-lift of I obtained by replacing matrix operations with their Φ-counterparts.
Proof. 
Using Proposition 1, the transform-based tensor algebra is isomorphic to the block-diagonal matrix algebra
D Φ = blockdiag ( X 1 , … , X p ) : X i ∈ C n × n .
Under this isomorphism, every Φ -Hermitian tensor A corresponds to a block-diagonal Hermitian matrix:
A ¯ Φ = blockdiag A ^ Φ ( 1 ) , … , A ^ Φ ( p ) .
Since the inequality I is preserved under finite direct sums, it holds blockwise for each slice tuple ( A ^ 1 ( ω ) , … , A ^ m ( ω ) ) , ω = 1 , … , p : applying I to the direct sum ⨁ ω = 1 p ( A ^ 1 ( ω ) , … , A ^ m ( ω ) ) and using the direct-sum preservation yields I ⨁ ω A ^ 1 ( ω ) , … , ⨁ ω A ^ m ( ω ) ≥ 0 . For trace inequalities, the trace of a block-diagonal matrix is the sum of the traces of its blocks, so this blockwise inequality is equivalent to ∑ ω = 1 p I ( A ^ 1 ( ω ) , … , A ^ m ( ω ) ) ≥ 0 , which is exactly I Φ ( A 1 , … , A m ) ≥ 0 .    □
Because the block-diagonal functional calculus acts independently on each transformed slice, the matrix inequality applies to every block. For trace inequalities, the block contributions are additive. Therefore, summing the valid slice-wise inequalities establishes the tensor trace inequality:
I Φ ( A 1 , … , A m ) = ∑ ω = 1 p I A ^ 1 ( ω ) , … , A ^ m ( ω ) ≥ 0 .
This argument uses only the algebraic representation and the direct-sum property; it does not imply that the numerical slack of the inequality is invariant under changes of the transform.
Remark 3.
The transfer principle is a direct consequence of the standard transform-domain representation of the ⋆ M algebra [3,4]. Its role here is not to establish new inequalities, but to fix the algebraic setting in which the transform-dependent defect is analyzed in Section 4.

3.2. Corollaries: Golden–Thompson, Jensen, Klein, and Lieb

We now record the four classical inequalities as corollaries of Theorem 1. Throughout, ⊕ Φ denotes the Φ -sum, i.e.,
A ⊕ Φ B ¯ Φ = A ¯ Φ + B ¯ Φ .
Corollary 1
( Φ -Golden–Thompson inequality). Let A , B ∈ C n × n × p be Φ-Hermitian. Then,
Tr Φ exp Φ ( A ⊕ Φ B ) ≤ Tr Φ exp Φ ( A ) ⋆ Φ exp Φ ( B ) .
Proof. 
Apply Theorem 1 to the classical Golden–Thompson inequality,
Tr e A + B ≤ Tr e A e B ,
which holds for all Hermitian matrices A , B and is preserved under finite direct sums. Replacing A and B by the block-diagonal lifts A ¯ Φ and B ¯ Φ yields the claim.    □
Corollary 2
( Φ -Jensen inequality). Let ϕ : R → R be a convex function with ϕ ( 0 ) = 0 . If A ∈ C n × n × p is Φ-Hermitian, then
Tr Φ ϕ ( A ) ≥ 0 .
In the scalar case n = p = 1 , the inequality reduces to ϕ ( a ) ≥ 0 for a ∈ R , which follows from convexity and ϕ ( 0 ) = 0 . No normalization by n p is involved, and the previous counterexample ϕ ( x ) = x with Φ A = − 1 Φ is excluded by the hypothesis ϕ ( 0 ) = 0 .
Proof. 
Apply Theorem 1 to the classical Jensen trace inequality Tr ( ϕ ( A ) ) ≥ 0 for Hermitian A and convex ϕ with ϕ ( 0 ) = 0 , which is preserved under finite direct sums. Replacing A by the block-diagonal lift A ¯ Φ yields Tr ( ϕ ( A ¯ Φ ) ) ≥ 0 . Since Tr Φ ( ϕ ( A ) ) = Tr ( ϕ ( A ¯ Φ ) ) , the claim follows.    □
Corollary 3
( Φ -Klein inequality). Let ϕ be a convex function. If  A , B ∈ C n × n × p are Φ-Hermitian, then
Tr Φ ϕ ( A ) − ϕ ( B ) − ( A − B ) ϕ ′ ( B ) ≥ 0 .
Proof. 
Apply Theorem 1 to the classical Klein inequality for Hermitian matrices.    □
Corollary 4
( Φ -Lieb concavity). The function
( A , B ) ⟼ Tr Φ exp Φ log Φ ( A ) + log Φ ( B )
is jointly concave for A ≻ Φ 0 and B ≻ Φ 0 . In the scalar case n = p = 1 , the map reduces to ( a , b ) ↦ a b on a , b > 0 . This map is not jointly concave in the naive sense, but the classical Lieb theorem is stated for the equivalent reformulation ( A , B ) ↦ Tr ( A r B 1 − r ) with r ∈ [ 0 , 1 ] , which is jointly concave; the present statement follows this standard formulation.
Proof. 
Apply Theorem 1 to Lieb’s classical joint concavity theorem for positive definite matrices, which states that ( A , B ) ↦ Tr exp ( log A + log B ) is jointly concave on the cone of positive definite matrices (equivalently, ( A , B ) ↦ Tr ( A r B 1 − r ) is jointly concave for r ∈ [ 0 , 1 ] ). Replacing A , B with the block-diagonal lifts A ¯ Φ , B ¯ Φ and using Tr Φ ( · ) = Tr ( · ¯ Φ ) yields the claim.    □
Remark 4.
Corollaries 1–4 show that the classical matrix trace inequalities transfer to transform-based tensor algebra with the same constants as in the matrix setting, independent of the choice of unitary transform Φ. This invariance follows from the transform-domain representation of the ⋆ M algebra [3,4]. However, as we shall see in Section 4, the quantitative tightness of these inequalities—specifically the Golden–Thompson defect—is not invariant and depends critically on the choice of Φ.

3.3. Background: Transform-Domain Representation

For completeness, we recall the transform-domain representation that underlies Theorem 1. This representation is standard in the ⋆ M -algebra literature [3,4]; we state it here only to fix notation and to make the subsequent defect analysis self-contained.
Proposition 1
(Transform-domain representation, cf. [3,4]). Let
T Φ : = C n × n × p , ⋆ Φ
denote the transform-based tensor algebra associated with the unitary transform Φ. Then, the mapping
Ψ Φ : T Φ → D Φ : = blockdiag ( X 1 , … , X p ) : X i ∈ C n × n , Ψ Φ ( A ) = A ¯ Φ ,
is an algebra isomorphism. That is,
1. 
Ψ Φ ( A ⋆ Φ B ) = Ψ Φ ( A ) Ψ Φ ( B ) ,
2. 
Ψ Φ is bijective.
Proof. 
The map Ψ Φ is linear because the mode-3 transform and block-diagonal assembly are linear.
By the definition of the ⋆ Φ -product, Ψ Φ ( A ⋆ Φ B ) = Ψ Φ ( A ) Ψ Φ ( B ) , so Ψ Φ preserves multiplication.
If Ψ Φ ( A ) = 0 , every transformed frontal slice of A vanishes; since Φ is invertible, A = 0 , proving injectivity.
Conversely, for any block-diagonal matrix X = blockdiag ( X 1 , … , X p ) , form a transformed tensor with frontal slices X 1 , … , X p and apply the inverse mode-3 transform. The resulting tensor A satisfies Ψ Φ ( A ) = X ; hence, Ψ Φ is surjective.
Therefore, Ψ Φ is an algebra isomorphism.    □
Remark 5
(Limits of the representation). The representation Ψ Φ preserves algebraic structure and functional calculus, which explains the transfer results above. However, it does not preserve all quantitative properties of interest. In particular, the tightness of the Golden–Thompson inequality—measured by the defect Δ Φ ( A , B ) —depends critically on the choice of Φ. This sensitivity arises because the representation, while preserving the product, does not preserve the commutativity structure of the tensor slices in the transform domain. Different transforms Φ reveal different levels of noncommutativity, leading to transform-dependent defect magnitudes. We analyze this sensitivity in Section 4.

4. Transform-Dependent Golden–Thompson Defect

Having fixed the algebraic setting in Section 3, we now isolate the quantitative object whose transform dependence is the subject of this paper. The section proceeds in three steps: the slice-wise reduction in the defect (Lemma 2), the bounded-spectral upper and lower estimates (Theorem 2), and the qualitative separation results (Theorems 3 and 4).

4.1. Golden–Thompson Defect

The classical Golden–Thompson inequality is tight when the two matrices commute. In the transform-based tensor setting, the gap between the two sides of the inequality quantifies the effect of noncommutativity in the transform domain. This gap is the central object of our sensitivity analysis.
Definition 6
(Golden–Thompson defect). Let A , B ∈ C n × n × p be Φ-Hermitian tensors. The Golden–Thompson defect is defined by
Δ Φ ( A , B ) : = Tr Φ exp Φ ( A ) ⋆ Φ exp Φ ( B ) − Tr Φ exp Φ ( A ⊕ Φ B ) .
Using Corollary 1, we have
Δ Φ ( A , B ) ≥ 0 .
Remark 6
(Role of the defect). The defect Δ Φ ( A , B ) is the natural measure of inequality tightness for three reasons:
1. 
It vanishes exactly when A and B commute in the transform domain, i.e., [ A ¯ Φ , B ¯ Φ ] = 0 .
2. 
It is quantitatively controlled by the transform-domain commutator.
3. 
It is sensitive to the choice of Φ, making it the right objective for operator-aware transform selection.

4.2. Main Theorem: Transform-Sensitive Defect

We now formalize the central phenomenon of this work: while operator inequalities in the transform-based tensor algebra transfer with the same constants as in the matrix case, their defect exhibits quantitative dependence on transform-domain noncommutativity.
Lemma 2
(Slice-wise reduction of the defect). Let A , B ∈ C n × n × p be Φ-Hermitian tensors. Under the transform-domain representation Ψ Φ ( A ) = A ¯ Φ of Proposition 1, the Golden–Thompson defect decomposes as a sum of slice-wise classical defects:
Δ Φ ( A , B ) = ∑ ω = 1 p Tr e A ω e B ω − Tr e A ω + B ω ,
where A ω : = A ^ Φ ( ω ) and B ω : = B ^ Φ ( ω ) are Hermitian matrices.
Proof. 
Using the definitions of Tr Φ , exp Φ , ⋆ Φ , and  ⊕ Φ , and the representation Ψ Φ from Proposition 1,
Δ Φ ( A , B ) = Tr e A ¯ Φ e B ¯ Φ − Tr e A ¯ Φ + B ¯ Φ .
Since A ¯ Φ and B ¯ Φ are block-diagonal with diagonal blocks A ω and B ω , the trace decomposes as a sum over blocks. The exponential of a block-diagonal matrix is block-diagonal with exponentials of each block. Hence,
Δ Φ ( A , B ) = ∑ ω = 1 p Tr e A ω e B ω − Tr e A ω + B ω .
The Hermiticity of A ω and B ω follows from the Φ -Hermitian assumption. This completes the proof.    □
Theorem 2
(Transform-sensitive defect under bounded spectral domain). Let A , B ∈ C n × n × p be Φ-Hermitian tensors, and assume that there exists R > 0 , such that
∥ A ^ Φ ( ω ) ∥ 2 ≤ R , ∥ B ^ Φ ( ω ) ∥ 2 ≤ R ∀ ω = 1 , … , p .
Then, the following statements hold.
(i) 
(Upper bound) There exists a constant C R > 0 , depending only on R, such that
Δ Φ ( A , B ) ≤ C R ∑ ω = 1 p [ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] F 2 .
(ii) 
(Matching-order lower bound on an explicit family) For every R > 0 there exist ε 0 ( R ) > 0 and a one-parameter family ( A ε , B ε ) 0 < ε < ε 0 ( R ) in the bounded spectral class, such that
Δ Φ ( A ε , B ε ) ≥ c R ∑ ω = 1 p ∥ [ A ^ Φ , ε ( ω ) , B ^ Φ , ε ( ω ) ] ∥ F 2
for some c R > 0 . This lower estimate is asserted only for the constructed family.
(iii) 
(Transform sensitivity) There exist tensors A , B and unitary transforms Φ 1 , Φ 2 ∈ C p × p , such that
Δ Φ 1 ( A , B ) = 0 , Δ Φ 2 ( A , B ) > 0 .
(iv) 
(Vanishing condition) If
[ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] = 0 , ∀ ω = 1 , … , p ,
then
Δ Φ ( A , B ) = 0 .
Consequently, on the bounded spectral class ∥ A ^ Φ ( ω ) ∥ 2 , ∥ B ^ Φ ( ω ) ∥ 2 ≤ R , the defect satisfies the upper bound in (i) for all admissible tensors, and the lower bound in (ii) on the one-parameter family ( A ε , B ε ) 0 < ε < ε 0 ( R ) constructed in the proof of (ii). For this family, the two-sided estimate
c R ∑ ω = 1 p [ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] F 2 ≤ Δ Φ ( A , B ) ≤ C R ∑ ω = 1 p [ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] F 2
holds on the explicit family of part (ii). A general lower bound valid for all tensors in the bounded spectral class is not claimed; see Remark 7.
Proof. 
Using Lemma 2, we obtain the slice-wise decomposition
Δ Φ ( A , B ) = ∑ ω = 1 p δ ( A ω , B ω ) ,
where
δ ( A , B ) : = Tr ( e A e B ) − Tr ( e A + B ) ≥ 0
is the classical Golden–Thompson defect for Hermitian matrices, and  A ω = A ^ Φ ( ω ) , B ω = B ^ Φ ( ω ) .
Part (i): Upper bound. For Hermitian matrices A , B with ∥ A ∥ 2 , ∥ B ∥ 2 ≤ R , classical quantitative versions of the Golden–Thompson inequality (see, e.g., [14]) provide a constant of C R > 0 , depending only on R, such that
δ ( A , B ) ≤ C R ∥ [ A , B ] ∥ F 2 .
Applying this to each slice pair ( A ω , B ω ) and summing over ω = 1 , … , p yields
Δ Φ ( A , B ) ≤ C R ∑ ω = 1 p ∥ [ A ω , B ω ] ∥ F 2 ,
which establishes part (i).
Part (ii): Lower bound. For every transformed slice, choose A ω = ε σ x , B ω = ε σ z , where
σ x = 0 1 1 0 , σ z = 1 0 0 − 1 .
Since σ x 2 = σ z 2 = I and σ x σ z + σ z σ x = 0 ,
e A ω = cosh ε I + sinh ε σ x , e B ω = cosh ε I + sinh ε σ z ,
so
e A ω e B ω = cosh 2 ε I + cosh ε sinh ε σ x + cosh ε sinh ε σ z + sinh 2 ε σ x σ z .
Taking traces and using Tr I = 2 , Tr σ x = Tr σ z = 0 , Tr ( σ x σ z ) = 0 ,
Tr ( e A ω e B ω ) = 2 cosh 2 ε .
Since σ x + σ z is Hermitian with eigenvalues ± 2 ,
Tr ( e A ω + B ω ) = 2 cosh ( 2 ε ) .
Hence,
δ ( A ω , B ω ) = 2 cosh 2 ε − 2 cosh ( 2 ε ) = ε 4 3 + ε 6 15 + O ( ε 8 ) .
Moreover, [ A ω , B ω ] = 2 i ε 2 σ y and ∥ σ y ∥ F 2 = 2 , so ∥ [ A ω , B ω ] ∥ F 2 = 8 ε 4 . Therefore,
δ ( A ω , B ω ) = 1 24 ∥ [ A ω , B ω ] ∥ F 2 + O ( ε 6 ) .
For sufficiently small positive ε , there exists c R > 0 , such that δ ( A ω , B ω ) ≥ c R ∥ [ A ω , B ω ] ∥ F 2 . Summing over ω yields the lower bound for the constructed family.
Part (iii): Transform sensitivity. Let Φ 1 = Φ DFT and Φ 2 = Φ DCT . The qualitative separation is established in Theorems 3 and 4 below. In particular, Theorem 4 constructs tensors A , B , such that all slices commute in the DFT domain and hence Δ Φ 1 ( A , B ) = 0 , while the DCT domain produces a strictly positive defect, i.e., Δ Φ 2 ( A , B ) > 0 . The continuity of Φ ↦ Δ Φ ( A , B ) follows from the facts:
  • A ^ Φ ( ω ) and B ^ Φ ( ω ) depend linearly on Φ ;
  • the matrix exponential and trace are continuous;
  • the unitary group U ( p ) is compact.
Thus, the mapping is continuous and therefore locally Lipschitz on compact subsets of U ( p ) .
Part (iv): Vanishing condition. If [ A ω , B ω ] = 0 for all ω , then each pair ( A ω , B ω ) consists of commuting Hermitian matrices. Commuting Hermitian matrices are simultaneously diagonalizable, which implies
e A ω e B ω = e A ω + B ω .
Hence, δ ( A ω , B ω ) = 0 for each ω . Summing over ω and applying Lemma 2 yields Δ Φ ( A , B ) = 0 .
This completes the proof of Theorem 2.    □
Remark 7
(Scope of the lower bound). Part (ii) establishes the lower bound only on the explicitly constructed one-parameter family. All subsequent statements that invoke a two-sided estimate are to be read as restricted to this family, or are reformulated as surrogate statements in Section 5.
Remark 8.
The constants C R and c R in Theorem 2 depend only on the spectral bound R, not on the tensor dimensions n and p or on the specific choice of Φ. This bounded spectral-domain formulation avoids the use of a universal constant, which would be inconsistent with the exponential scaling of the Golden–Thompson defect under rescaling A ↦ t A , B ↦ t B .
Remark 9.
On the bounded spectral class of Theorem 2, Δ Φ defines a non-negative, transform-dependent functional on the admissible transform space, whose magnitude is bounded above by the squared commutator energy under the bounded spectral assumption of Theorem 2(i). This endows the unitary group U ( p ) with a noncommutativity geometry; Δ Φ is not asserted to be a quadratic functional of Φ.

4.3. Qualitative Transform Separation: DFT vs. DCT

We now construct an explicit example showing that the Golden–Thompson defect can differ dramatically between two standard transforms. This example demonstrates that algebraic invariance does not imply quantitative invariance.
Theorem 3
(Explicit separation for real orthogonal transforms). Let p ≥ 2 and let Φ 1 , Φ 2 ∈ O ( p ) be real orthogonal transforms, such that
U : = Φ 2 Φ 1 ⊤
is not a signed permutation matrix. Then, there exist tensors A , B ∈ R n × n × p (with n ≥ 2 ) that are both Φ 1 -Hermitian and Φ 2 -Hermitian and satisfy
Δ Φ 1 ( A , B ) = 0 , Δ Φ 2 ( A , B ) > 0 .
Proof. 
Step 1: A row of U with two nonzero entries. Since U ∈ O ( p ) and U is not a signed permutation matrix, U has a row containing at least two nonzero entries. Indeed, if every row of U had exactly one nonzero entry, then, since each row of an orthogonal matrix has unit Euclidean norm, that entry would have modulus 1; the rows would then be distinct standard basis vectors, so U would be a signed permutation matrix, contradicting the hypothesis. Hence, there exist a row index r and distinct column indices j ≠ k , such that U r j ≠ 0 and U r k ≠ 0 .
Step 2: Choice of noncommuting Hermitian matrices. Let
H 1 = 0 1 1 0 , H 2 = 1 0 0 − 1 ,
embedded in the upper-left 2 × 2 block of an n × n matrix and zero-padded elsewhere. Then, H 1 , H 2 are real symmetric and
[ H 1 , H 2 ] = 2 i σ y ≠ 0 , σ y = 0 − i i 0 ,
so [ H 1 , H 2 ] ≠ 0 .
Step 3: Construction of the Φ 1 -domain slices. Choose λ ∈ R ∖ { 1 } (e.g., λ = 2 ). Define frontal slices A ^ Φ 1 ( ω ) and B ^ Φ 1 ( ω ) for ω = 1 , … , p by
A ^ Φ 1 ( j ) = H 1 , B ^ Φ 1 ( j ) = H 1 ,
A ^ Φ 1 ( k ) = H 2 , B ^ Φ 1 ( k ) = λ H 2 ,
and A ^ Φ 1 ( ω ) = B ^ Φ 1 ( ω ) = 0 for all other ω .
Define the physical tensors by the inverse mode-3 transform:
A : = Φ 1 H A ^ Φ 1 , B : = Φ 1 H B ^ Φ 1 .
Because Φ 1 is real orthogonal, Φ 1 H = Φ 1 ⊤ is real, so A , B are real tensors.
Step 4: Φ 1 -Hermiticity and Φ 2 -Hermiticity. Every slice A ^ Φ 1 ( ω ) and B ^ Φ 1 ( ω ) is either 0, H 1 , H 2 , or  λ H 2 , and hence, real symmetric. Therefore, A ¯ Φ 1 and B ¯ Φ 1 are block-diagonal with real symmetric blocks, and hence, Hermitian; this is exactly Φ 1 -Hermiticity.
For Φ 2 -Hermiticity, we use the slice-wise mixing formula. For every ω ,
A ^ Φ 2 ( ω ) = ∑ ℓ = 1 p U ω ℓ A ^ Φ 1 ( ℓ ) , B ^ Φ 2 ( ω ) = ∑ ℓ = 1 p U ω ℓ B ^ Φ 1 ( ℓ ) .
Since U is real and every A ^ Φ 1 ( ℓ ) and B ^ Φ 1 ( ℓ ) is real symmetric, each transformed slice A ^ Φ 2 ( ω ) and B ^ Φ 2 ( ω ) is a real linear combination of real symmetric matrices, hence real symmetric. Therefore, A , B are Φ 2 -Hermitian.
Step 5: Δ Φ 1 ( A , B ) = 0 . For every ω , the pair ( A ^ Φ 1 ( ω ) , B ^ Φ 1 ( ω ) ) is one of
( 0 , 0 ) , ( H 1 , H 1 ) , ( H 2 , λ H 2 ) ,
so the two matrices are scalar multiples of a common matrix (or both zero) and, therefore, commute the following: [ A ^ Φ 1 ( ω ) , B ^ Φ 1 ( ω ) ] = 0 for all ω . Using Theorem 2(iv), Δ Φ 1 ( A , B ) = 0 .
Step 6: A nonzero commutator in the Φ 2 domain. Set a : = U r j and b : = U r k . For the distinguished row r, only ℓ = j and ℓ = k contribute:
A ^ Φ 2 ( r ) = a H 1 + b H 2 , B ^ Φ 2 ( r ) = a H 1 + λ b H 2 .
Their commutator is
[ A ^ Φ 2 ( r ) , B ^ Φ 2 ( r ) ] = [ a H 1 + b H 2 , a H 1 + λ b H 2 ] = a λ b [ H 1 , H 2 ] + a b [ H 2 , H 1 ] = a b ( λ − 1 ) [ H 1 , H 2 ] .
Since a ≠ 0 , b ≠ 0 , λ ≠ 1 , and  [ H 1 , H 2 ] ≠ 0 , we obtain [ A ^ Φ 2 ( r ) , B ^ Φ 2 ( r ) ] ≠ 0 .
Step 7: Strict positivity of Δ Φ 2 . Using Lemma 2,
Δ Φ 2 ( A , B ) = ∑ ω = 1 p δ A ^ Φ 2 ( ω ) , B ^ Φ 2 ( ω ) ,
where δ ( A , B ) = Tr ( e A e B ) − Tr ( e A + B ) is the classical Golden–Thompson defect for Hermitian matrices. Each summand is non-negative using the Golden–Thompson inequality. At  ω = r , the pair is Hermitian (by Step 4) and noncommuting (by Step 6); for Hermitian matrices, equality in the Golden–Thompson inequality holds if and only if the matrices commute; hence, δ ( A ^ Φ 2 ( r ) , B ^ Φ 2 ( r ) ) > 0 . Therefore,
Δ Φ 2 ( A , B ) ≥ δ A ^ Φ 2 ( r ) , B ^ Φ 2 ( r ) > 0 .
This completes the proof.    □
Theorem 4
(Explicit DFT–DCT separation). For p = 4 , there exist real tensors A , B ∈ R 2 × 2 × 4 whose physical frontal slices are symmetric, such that
Δ DFT ( A , B ) = 0 , Δ DCT ( A , B ) > 0 .
Proof. 
Let H 1 = σ x and H 2 = σ z , i.e.,
H 1 = 0 1 1 0 , H 2 = 1 0 0 − 1 .
Using zero-based frequency indices, prescribe the DFT-domain slices by
A 0 = H 2 , B 0 = 2 H 2 , A 1 = A 3 = B 1 = B 3 = H 1 , A 2 = B 2 = 0 .
These arrays satisfy the conjugate-symmetry conditions A ω = A 4 − ω ¯ and B ω = B 4 − ω ¯ (for ω = 0 , 1 , 2 , 3 ), so their inverse DFT yields real symmetric physical frontal slices.
A direct computation, recorded in Appendix A, shows that the second DCT-domain slice pair is
A 1 ′ = c H 1 + s H 2 , B 1 ′ = c H 1 + 2 s H 2 ,
where
c = cos ( π / 8 ) , s = sin ( π / 8 ) .
Consequently,
[ A 1 ′ , B 1 ′ ] = c s [ H 1 , H 2 ] ≠ 0 .
All DCT-domain slices are real symmetric because they are real linear combinations of the real symmetric physical frontal slices. The strict equality condition in the Golden–Thompson inequality therefore yields
δ ( A 1 ′ , B 1 ′ ) > 0 .
All remaining slice defects are non-negative. Using Lemma 2,
Δ DCT ( A , B ) ≥ δ ( A 1 ′ , B 1 ′ ) > 0 .
This completes the proof.    □
Remark 10
(Scope of the DFT–DCT construction). Theorem 4 presents an explicit analytical witness for p = 4 under the orthonormal DFT and DCT-II conventions. It shows that the specific real-symmetric Pauli construction of Theorem 3 is not the only admissible route: using conjugate-paired DFT-domain slices allows the complex mixing coefficients to combine into real symmetric DCT-domain slices while preserving noncommutativity. Whether the construction extends to all p, or to other transform pairs, remains open. In particular, for general p the DCT-domain slices are obtained from the DFT-domain slices via the mixing matrix U = Φ DCT Φ DFT H , and the individual terms U ω k U ω ℓ [ A ^ DFT ( k ) , B ^ DFT ( ℓ ) ] in the resulting commutator can in principle cancel; the explicit computation in Appendix A rules out such cancellation only for p = 4 . The general-orthogonal construction of Theorem 3 avoids this issue by using a single row of U with exactly two nonzero entries, but it does not specialize to the DFT–DCT pair. A general-p DFT–DCT qualitative separation, or a general non-cancellation theorem for U = Φ DCT Φ DFT H , is left open; the conditional quantitative statement in Theorem 5 makes the required non-cancellation property an explicit hypothesis.
For the construction of Theorem 4, the DCT-domain slice pair ( A 1 ′ , B 1 ′ ) satisfies ∥ [ A 1 ′ , B 1 ′ ] ∥ F = c s ∥ [ H 1 , H 2 ] ∥ F > 0 and ∥ A 1 ′ ∥ 2 , ∥ B 1 ′ ∥ 2 ≤ R for a suitable R, so the non-degeneracy hypothesis of Theorem 5 is satisfied with n = 2 and p = 4 .
Remark 11
(On quantitative separation). A stronger quantitative separation of the form Δ DCT ( A , B ) ≥ c p requires additional structural assumptions on the mixing matrix U = Φ DCT Φ DFT H , such as a non-cancellation property of its entries across opposite-parity indices. We state such a quantitative result conditionally in Theorem 5 below; verifying the required non-cancellation property for specific transform pairs is left as a separate question.
Theorem 5
(Conditional quantitative separation). Consider a sequence of tensor pairs ( A p , B p ) with transformed slices of fixed matrix dimension n, and two unitary transforms Φ 1 , p , Φ 2 , p ∈ C p × p , such that A p , B p are both Φ 1 , p -Hermitian and Φ 2 , p -Hermitian. Suppose that
Δ Φ 1 , p ( A p , B p ) = 0 .
Assume that there exist constants η > 0 , R > 0 , and  α > 0 , all independent of p, and a subset S p ⊆ { 1 , … , p } with | S p | ≥ α p such that for every ω ∈ S p ,
[ A ^ Φ 2 , p ( ω ) , B ^ Φ 2 , p ( ω ) ] F ≥ η , ∥ A ^ Φ 2 , p ( ω ) ∥ 2 ≤ R , ∥ B ^ Φ 2 , p ( ω ) ∥ 2 ≤ R .
Then, there exist constants d 0 = d 0 ( n , R , η ) > 0 and c > 0 , independent of p, such that
δ A ^ Φ 2 , p ( ω ) , B ^ Φ 2 , p ( ω ) ≥ d 0 ∀ ω ∈ S p ,
and hence, Δ Φ 2 , p ( A p , B p ) ≥ c p .
Proof. 
Step 1: Uniform positivity on the compact set. Let
K : = ( A , B ) ∈ H n × H n : ∥ A ∥ 2 ≤ R , ∥ B ∥ 2 ≤ R , ∥ [ A , B ] ∥ F ≥ η ,
where H n is the space of n × n Hermitian matrices. The set K is closed and bounded, and hence compact. The map
( A , B ) ↦ δ ( A , B ) = Tr ( e A e B ) − Tr ( e A + B )
is continuous on K . For Hermitian matrices, the Golden–Thompson defect δ ( A , B ) is non-negative, and it vanishes if and only if [ A , B ] = 0 . Since ∥ [ A , B ] ∥ F ≥ η > 0 on K , we have δ ( A , B ) > 0 for every ( A , B ) ∈ K . By compactness,
d 0 : = d 0 ( n , R , η ) : = min ( A , B ) ∈ K δ ( A , B ) > 0 .
Step 2: Linear lower bound. Since A p , B p are Φ 2 , p -Hermitian, Lemma 2 yields
Δ Φ 2 , p ( A p , B p ) = ∑ ω = 1 p δ A ^ Φ 2 , p ( ω ) , B ^ Φ 2 , p ( ω ) .
Each summand is non-negative. For  ω ∈ S p , the corresponding slice pair belongs to K , so δ ( A ^ Φ 2 , p ( ω ) , B ^ Φ 2 , p ( ω ) ) ≥ d 0 . Hence,
Δ Φ 2 , p ( A p , B p ) ≥ ∑ ω ∈ S p d 0 = | S p | d 0 ≥ α d 0 p .
Setting c : = α d 0 > 0 completes the proof.
Remark on the role of the hypothesis Δ Φ 1 , p = 0 . This hypothesis is used only to ensure that the separation is nontrivial, i.e., that Φ 1 , p achieves zero defect while Φ 2 , p is strictly suboptimal. The linear lower bound itself depends only on the Φ 2 , p -domain non-degeneracy and on the Φ 2 , p -Hermiticity of A p , B p .    □
Remark 12
(Failure of the hypotheses of Theorems 5 and 6). The hypothesis ∥ [ A ^ Φ 2 , p ( ω ) , B ^ Φ 2 , p ( ω ) ] ∥ F ≥ η with η > 0 independent of p is essential and can fail. For instance, take A ^ Φ 2 , p ( ω ) = ε p H 1 and B ^ Φ 2 , p ( ω ) = ε p H 2 with ε p → 0 as p → ∞ . Then, the commutator norm equals ε p 2 ∥ [ H 1 , H 2 ] ∥ F → 0 , so no uniform η > 0 exists, and the compactness argument of Theorem 5 cannot be applied. In this regime, one can only conclude Δ Φ 2 , p ( A p , B p ) → 0 , not a linear-in-p lower bound.
The same construction illustrates the failure of the hypothesis of Theorem 6 (dimension-preserving embedding). That theorem requires a pair ( A ( 2 ) , B ( 2 ) ) that is Φ 1 -Hermitian and Φ 2 -Hermitian and satisfies Δ Φ 1 = 0 , Δ Φ 2 > 0 . If the relative transform U = Φ 2 Φ 1 ⊤ is a signed permutation matrix, then the Φ 2 -domain slices are obtained from the Φ 1 -domain slices by a signed permutation, so commutativity in one domain is equivalent to commutativity in the other; consequently, no such pair exists, and the embedding theorem cannot be applied. This is precisely the signed-permutation exception that appears in the hypotheses of Theorems 3 and 7.
Theorem 6
(Dimension-preserving embedding). Let Φ 1 , Φ 2 ∈ C p × p be unitary transforms. Suppose a pair A ( 2 ) , B ( 2 ) ∈ C 2 × 2 × p is both Φ 1 -Hermitian and Φ 2 -Hermitian and satisfies
Δ Φ 1 ( A ( 2 ) , B ( 2 ) ) = 0 , Δ Φ 2 ( A ( 2 ) , B ( 2 ) ) > 0 .
Then, for every n ≥ 2 , there exist tensors A , B ∈ C n × n × p with the same two defect values.
Proof. 
Embed each physical frontal slice into the upper-left 2 × 2 block:
A ( k ) = A ( 2 ) , ( k ) 0 0 0 n − 2 , B ( k ) = B ( 2 ) , ( k ) 0 0 0 n − 2 .
Because the transforms act only along the third mode, this direct-sum structure is preserved in each transform domain. For every transformed slice,
e A ω = e A ω ( 2 ) 0 0 I n − 2 , e B ω = e B ω ( 2 ) 0 0 I n − 2 ,
and similarly for e A ω + B ω . Hence,
Tr ( e A ω e B ω ) = Tr ( e A ω ( 2 ) e B ω ( 2 ) ) + ( n − 2 ) ,
Tr e A ω + B ω = Tr e A ω ( 2 ) + B ω ( 2 ) + ( n − 2 ) .
The additional terms cancel in the defect, so Δ Φ i ( A , B ) = Δ Φ i ( A ( 2 ) , B ( 2 ) ) for i = 1 , 2 .    □
Remark 13.
Combining Theorem 4 with Theorem 6 yields an explicit DFT–DCT separation in any matrix dimension n ≥ 2 .

4.4. Numerical Illustration

We provide a numerical illustration of the transform sensitivity predicted by the theory. Two distinct objects are involved, and we keep them separate throughout:
(i)
the explicit p = 4 analytical witness of Theorem 4, which establishes the existence of a strict separation between DFT and DCT;
(ii)
a family of commuting DFT-domain slices parametrized by the tensor depth p, used only to visualize the empirical trend of the DCT defect as p grows.
The numerical experiment in (ii) is not the p = 4 witness of Theorem 4; it is a separate construction whose purpose is to illustrate the qualitative phenomenon, not to verify the non-degeneracy hypothesis of Theorem 5 for all p.
The analytical p = 4 witness. For the construction of Theorem 4, the DFT-domain slices are
A 0 = H 2 , B 0 = 2 H 2 , A 1 = A 3 = B 1 = B 3 = H 1 , A 2 = B 2 = 0 ,
with H 1 = σ x and H 2 = σ z . The DCT-domain slice pair at ω = 1 is
A 1 ′ = c H 1 + s H 2 , B 1 ′ = c H 1 + 2 s H 2 , c = cos ( π / 8 ) , s = sin ( π / 8 ) ,
so [ A 1 ′ , B 1 ′ ] = c s [ H 1 , H 2 ] ≠ 0 , and hence, Δ DCT ( A , B ) > 0 , while Δ DFT ( A , B ) = 0 . This is a single, analytically verified data point at p = 4 ; it is not a curve in p.
The numerical family used in Figure 1. To visualize the dependence of the defect on the tensor depth, we use a separate family of commuting DFT-domain slices, parametrized by p ∈ { 4 , 8 , 16 , 32 , 64 , 128 } , in which each slice pair consists of scalar multiples of a single Pauli matrix (alternating between H 1 and H 2 across the frequency index). Using Theorem 2(iv), this construction yields Δ DFT ( A , B ) ≈ 0 up to numerical precision. Evaluating the same tensors under the DCT transform produces a strictly positive defect, consistent with the qualitative separation underlying Theorem 4.
Figure 1. Transform separation under different spectral bases. The Golden–Thompson defect Δ Φ ( A , B ) is plotted as a function of the tensor depth p for the DFT and DCT transforms. The DFT construction yields defects at the level of numerical precision, while the DCT transform produces a strictly positive defect that grows approximately linearly with p. The dashed line is the linear fit Δ DCT ≈ 5.93 × 10 − 4 p discussed in the text; it is almost indistinguishable from, and essentially overlaps with, the DCT defect curve over the displayed range of p, confirming that the empirical growth is approximately linear. This figure is a numerical illustration of the qualitative separation underlying Theorem 4; it is not the explicit p = 4 witness of that theorem, and the fitted line is empirical and does not by itself establish a quantitative lower bound.
Figure 1 plots Δ Φ ( A , B ) as a function of the tensor depth p for the DFT and DCT transforms. The DFT construction yields defects at the level of numerical precision, reflecting exact slice-wise commutativity in the Fourier domain. In contrast, the DCT transform produces a strictly positive defect that grows approximately linearly with p. A linear fit yields
Δ DCT ( A , B ) ≈ 5.93 × 10 − 4 p .
This empirical trend is consistent with the qualitative separation underlying Theorem 4; it does not verify the non-degeneracy hypothesis of Theorem 5 for all p, nor does it assert a dimension-independent quantitative lower bound. It confirms only that the inequality itself transfers to the tensor setting (Corollary 1), while its quantitative tightness depends strongly on the choice of transform.

5. Operator-Aware Transform Selection

The separation results above show that a transform (e.g., DFT) can outperform another (e.g., DCT) for specific tensor pairs. This raises a fundamental question: can one identify a transform that minimizes the defect uniformly over all tensor pairs? As we show below, the answer is negative (Theorem 7), and this motivates the operator-aware formulation over O ( p ) (Definition 7 and Corollary 5), together with the Riemannian gradient scheme (Algorithm 1).
Algorithm 1: Riemannian gradient scheme for operator-aware transform selection
Mathematics 14 04110 i001
The answer is negative. Transform optimality is not globally ordered: different transforms can be optimal for different data. In other words, the choice of Φ is inherently data-dependent rather than universally optimal. The following theorem formalizes this non-universality.
Theorem 7
(Transform non-universality). Let Φ 1 , Φ 2 ∈ R p × p be two distinct orthogonal transforms, such that U : = Φ 2 Φ 1 ⊤ is not a signed permutation matrix. Then, the following statements hold:
1. 
There exist tensors A , B ∈ C n × n × p that are both Φ 1 -Hermitian and Φ 2 -Hermitian, such that
Δ Φ 1 ( A , B ) = 0 , Δ Φ 2 ( A , B ) > 0 .
2. 
There exist tensors A ′ , B ′ ∈ C n × n × p that are both Φ 1 -Hermitian and Φ 2 -Hermitian, such that
Δ Φ 1 ( A ′ , B ′ ) > 0 , Δ Φ 2 ( A ′ , B ′ ) = 0 .
In particular, no single orthogonal transform is universally optimal; the optimal transform depends on the joint structure of the tensor pair.
Proof. 
We prove the two statements separately.
Part 1: Φ 1 optimal, Φ 2 suboptimal. Let U = Φ 2 Φ 1 ⊤ . Since U is not a signed permutation matrix, there exists at least one row of U containing two nonzero entries. Fix such a row index r, and choose two column indices j ≠ k with U r j ≠ 0 and U r k ≠ 0 .
Let H 1 , H 2 ∈ C n × n be two Hermitian matrices that do not commute, i.e., [ H 1 , H 2 ] ≠ 0 . A concrete choice is the Pauli matrices σ x and σ z embedded in the upper-left 2 × 2 block, with zeros elsewhere. This ensures that the tensors are Φ -Hermitian for any real orthogonal Φ , because the zero padding preserves Hermiticity under real linear combinations.
Construct tensors A , B by specifying their Φ 1 -domain frontal slices as follows. Set all slices to zero except:
A ^ Φ 1 ( j ) = H 1 , B ^ Φ 1 ( j ) = H 1 ,
A ^ Φ 1 ( k ) = H 2 , B ^ Φ 1 ( k ) = λ H 2 ,
where λ ∈ R is a scalar with λ ≠ 1 (e.g., λ = 2 ). All other slices are set to the zero matrix.
Since Φ 1 and Φ 2 are real orthogonal, and the constructed Φ 1 -domain slices are Hermitian (they are either H 1 , λ H 2 , or zero), the resulting physical tensors are both Φ 1 -Hermitian and Φ 2 -Hermitian. This follows because the inverse transforms Φ 1 ⊤ and Φ 2 ⊤ are also real, so Hermiticity is preserved under real linear combinations.
Now, we study the defect under Φ 1 . For every slice index ω , the pair ( A ^ Φ 1 ( ω ) , B ^ Φ 1 ( ω ) ) consists of scalar multiples of the same Hermitian matrix (or both are zero). Hence they commute:
[ A ^ Φ 1 ( ω ) , B ^ Φ 1 ( ω ) ] = 0 ∀ ω .
Using Theorem 2(iv), commuting slices imply vanishing defect:
Δ Φ 1 ( A , B ) = 0 .
For the defect under Φ 2 , the Φ 2 -domain slices are obtained by mixing the Φ 1 -domain slices via the matrix U = Φ 2 Φ 1 ⊤ :
A ^ Φ 2 ( ω ) = ∑ ℓ = 1 p U ω ℓ A ^ Φ 1 ( ℓ ) , B ^ Φ 2 ( ω ) = ∑ ℓ = 1 p U ω ℓ B ^ Φ 1 ( ℓ ) .
For the distinguished row index r, only columns j and k contribute nonzero terms (all other slices are zero). Therefore,
A ^ Φ 2 ( r ) = U r j H 1 + U r k H 2 , B ^ Φ 2 ( r ) = U r j H 1 + λ U r k H 2 .
Their commutator is
[ A ^ Φ 2 ( r ) , B ^ Φ 2 ( r ) ] = U r j U r k ( 1 − λ ) [ H 1 , H 2 ] ≠ 0 ,
since U r j , U r k ≠ 0 , λ ≠ 1 , and [ H 1 , H 2 ] ≠ 0 .
Because this slice has a nonzero commutator, the classical Golden–Thompson defect for this slice pair is strictly positive. Using the slice-wise decomposition (Lemma 2) and the fact that the defect sums over slices with non-negative contributions, we obtain
Δ Φ 2 ( A , B ) > 0 .
Part 2: Φ 2 optimal, Φ 1 suboptimal. The second statement follows by symmetry. Consider the matrix U ′ = Φ 1 Φ 2 ⊤ = U ⊤ . Since U is not a signed permutation matrix, U ⊤ is also not a signed permutation matrix. Hence, the same construction applied with the roles of Φ 1 and Φ 2 exchanged yields tensors A ′ , B ′ , such that
Δ Φ 2 ( A ′ , B ′ ) = 0 , Δ Φ 1 ( A ′ , B ′ ) > 0 .
This completes the proof. □
Remark 14
(Data-dependent optimality). Theorem 7 establishes that no fixed transform is universally optimal; the optimal Φ * depends on the joint commutativity structure of ( A , B ) . This justifies the adaptive optimization framework in Section 5, where the transform is selected from data rather than prescribed a priori.
Remark 15
(Relation to representation-oriented transform learning). The transform-selection problem considered here differs from representation-oriented transform learning, such as the matrix-mimetic algebra optimization of Newman and Keegan [15]. In [15], the transform is chosen to optimize representation, compression, or approximation properties of the algebra. In contrast, our objective is operator-aware: we select Φ to minimize transform-domain noncommutativity,
∑ ω = 1 p A ^ Φ ( ω ) , B ^ Φ ( ω ) F 2 .
Hence, this improves the tightness of operator inequalities for a given tensor pair ( A , B ) .

5.1. Operator-Aware Transform Selection

Theorem 2 shows that, under a bounded spectral-domain assumption, the defect Δ Φ is quantitatively controlled by transform-domain noncommutativity. This naturally leads to an optimization problem over the orthogonal group, where the goal is to select a transform that minimizes the defect and hence reduces noncommutativity in the transformed domain. This reveals that transform selection is equivalent to searching for a coordinate system that minimizes noncommutative interaction.
We restrict to real orthogonal transforms Φ ∈ O ( p ) for two reasons. First, for real tensors whose frontal slices are symmetric, and for real orthogonal transforms, the transformed slices remain symmetric. This ensures that the optimization domain is well-defined and that Φ -Hermiticity is preserved along the optimization path. Second, the orthogonal group O ( p ) is compact and admits standard Riemannian optimization techniques. The complex unitary case is discussed in Section 6.
Definition 7
(Admissible transform selection). Let A , B ∈ R n × n × p have symmetric frontal slices. Define the defect objective D ( Φ ) = Δ Φ ( A , B ) and the commutator-energy surrogate J ( Φ ) = ∑ ω = 1 p ∥ [ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] ∥ F 2 on O ( p ) . The optimal defect problem is min Φ ∈ O ( p ) D ( Φ ) ; the surrogate problem is min Φ ∈ O ( p ) J ( Φ ) . These are distinct unless an additional theorem relates their minimizers.
Example 1
(Hermiticity is automatic in the real symmetric setting). If A , B ∈ R n × n × p have symmetric frontal slices and Φ ∈ O ( p ) is real orthogonal, then each transformed slice is a real linear combination of symmetric matrices, and hence real symmetric. Thus, A , B are Φ-Hermitian for every Φ ∈ O ( p ) .
Theorem 8
(Existence and zero-defect optimality). Let A , B satisfy the assumptions of Definition 7. Then,
(i) 
Both D and J attain global minima on O ( p ) .
(ii) 
If J ( Φ 0 ) = 0 for some Φ 0 ∈ O ( p ) , then D ( Φ 0 ) = 0 , and Φ 0 is a global minimizer of both objectives.
(iii) 
If D ( Φ 0 ) = 0 and equality in the Golden–Thompson inequality is characterized by commutativity for every transformed slice, then J ( Φ 0 ) = 0 .
(iv) 
No equality of the complete minimizer sets is claimed when their minimum values are strictly positive.
Proof. 
(i) Existence. The transformed slices depend continuously on Φ , and matrix exponentiation, trace, and commutator operations are continuous. Consequently, D and J are continuous on the compact group O ( p ) , and both attain their minima.
(ii) Zero-defect optimality. If J ( Φ 0 ) = 0 , every transformed slice pair commutes. The Golden–Thompson defect vanishes slice-wise, so D ( Φ 0 ) = 0 . Non-negativity of both objectives establishes global optimality.
(iii) Converse under equality characterization. If D ( Φ 0 ) = 0 , all non-negative slice-wise defects vanish. Under the Golden–Thompson equality characterization, each transformed slice pair commutes; hence, J ( Φ 0 ) = 0 .
(iv) This is a statement of scope and requires no proof. □
Corollary 5
(Commutator energy as a surrogate objective). Let A , B satisfy the bounded spectral assumption of Theorem 2, and define
D ( Φ ) : = Δ Φ ( A , B ) , J ( Φ ) : = C ( Φ ) : = ∑ ω = 1 p [ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] F 2 , Φ ∈ O ( p ) .
Then, the following statements hold:
(i) 
(Existence) Both D and J attain global minima on O ( p ) ; see Theorem 8(i).
(ii) 
(Upper surrogate bound) There exists C R > 0 , depending only on the spectral bound R, such that
D ( Φ ) ≤ C R J ( Φ ) for all admissible Φ ∈ O ( p )
on the bounded spectral class. Consequently, for every Φ J ∈ arg min Φ ∈ O ( p ) J ( Φ ) ,
min Φ ∈ O ( p ) D ( Φ ) ≤ D ( Φ J ) ≤ C R J ( Φ J ) = C R min Φ ∈ O ( p ) J ( Φ ) .
Thus, J is an upper surrogate for D on this class, and minimizing J controls D up to the constant C R .
(iii) 
(Matching lower bound on the explicit family at the fixed transform of Theorem 2(ii)) Let ( A ε , B ε ) 0 < ε < ε 0 ( R ) be the one-parameter Pauli family constructed in the proof of Theorem 2(ii), and let Φ 0 denote the transform with respect to which this family is constructed. By Theorem 2(ii) and Remark 7, there exists c R > 0 , depending only on R, such that
D ε ( Φ 0 ) ≥ c R J ε ( Φ 0 ) .
No lower bound of the form D ε ( Φ ) ≥ c R J ε ( Φ ) is asserted for all Φ ∈ O ( p ) ; establishing such a uniform-in-transform lower bound would require proving inf Φ ∈ O ( p ) , J ε ( Φ ) > 0 D ε ( Φ ) / J ε ( Φ ) > 0 , which is not attempted here. No comparable lower bound is asserted for general tensors in the bounded spectral class; see Remark 7.
(iv) 
(Zero-defect case) If min Φ ∈ O ( p ) J ( Φ ) = 0 , then using Theorem 8(ii), every minimizer Φ 0 of J satisfies D ( Φ 0 ) = 0 , so Φ 0 is also a global minimizer of D, and the minimizer sets coincide at the zero level. This is the only regime in which an exact (not merely constant-factor) identification of minimizers is asserted.
(v) 
(Scope and interpretation) When min Φ ∈ O ( p ) J ( Φ ) > 0 , statement (ii) provides an upper surrogate bound on the bounded spectral class, and statement (iii) provides a two-sided constant-factor comparison only at the fixed transform Φ 0 of Theorem 2(ii) and on the explicit Pauli family constructed there. No equality of the full minimizer sets arg min Φ ∈ O ( p ) D ( Φ ) and arg min Φ ∈ O ( p ) J ( Φ ) is claimed in this regime; cf. Theorem 8(iv). Accordingly, minimizing Δ Φ is analogous to finding an orthogonal transform that makes the transformed slices as commuting as possible, and J is to be regarded as a surrogate for D rather than as an equivalent objective. A precise equivalence with a standard approximate joint diagonalization criterion would require an additional theorem; we therefore present this connection as motivation rather than as an identity.
Proof. 
(i) This is Theorem 8(i); it is restated here only to fix notation for subsequent items.
(ii) Using Theorem 2(i), on the bounded spectral class there exists C R > 0 , depending only on R, such that D ( Φ ) ≤ C R J ( Φ ) for all admissible Φ ∈ O ( p ) . Let Φ J ∈ arg min Φ ∈ O ( p ) J ( Φ ) , which exists by (i). Then,
min Φ ∈ O ( p ) D ( Φ ) ≤ D ( Φ J ) ≤ C R J ( Φ J ) = C R min Φ ∈ O ( p ) J ( Φ ) .
This is the asserted upper surrogate bound.
(iii) Using Theorem 2(ii) and Remark 7, on the one-parameter Pauli family ( A ε , B ε ) , at the fixed transform Φ 0 of Theorem 2(ii), there exists C R > 0 , depending only on R, such that D ε ( Φ 0 ) ≥ c R J ε ( Φ 0 ) . At this fixed Φ 0 , the upper bound of (ii) also holds, so
c R J ε ( Φ 0 ) ≤ D ε ( Φ 0 ) ≤ C R J ε ( Φ 0 ) .
No statement is made about min Φ ∈ O ( p ) D ε ( Φ ) or min Φ ∈ O ( p ) J ε ( Φ ) .
(iv) If min Φ J ( Φ ) = 0 , then any minimizer Φ 0 of J satisfies J ( Φ 0 ) = 0 , so every transformed slice pair commutes. By Theorem 2(iv), D ( Φ 0 ) = 0 ; since D ≥ 0 by Corollary 1, Φ 0 is a global minimizer of D. Conversely, if D ( Φ 0 ) = 0 and the Golden–Thompson equality characterization applies slice-wise, then J ( Φ 0 ) = 0 by Theorem 8(iii), so Φ 0 is a global minimizer of J. Hence the two minimizer sets agree at the zero level.
(v) This item records the scope of (ii)–(iv) and the intended interpretation of J as a surrogate; it requires no proof, and the assertions about the absence of a general minimizer-set identity are exactly those of Theorem 8(iv). □
Remark 16
(Conditional uniform surrogate guarantee). If, in addition to the assumptions of Corollary 5, a uniform estimate D ( Φ ) ≤ C J ( Φ ) holds on all of O ( p ) with a constant C independent of Φ (for instance, if the bounded spectral assumption is strengthened to hold uniformly in Φ), then any minimizer Φ J of J satisfies
D ( Φ J ) ≤ C J ( Φ J ) = C min Φ ∈ O ( p ) J ( Φ ) ,
and in the zero case min Φ J ( Φ ) = 0 , this makes Φ J a global minimizer of D as well. No such uniform estimate is claimed here beyond the bounded spectral class of Theorem 2(i); see Remark 7.
Remark 17
(Geometric interpretation). The optimization problem seeks a coordinate system (via the orthogonal transform Φ) in which the transformed frontal slices A ^ Φ ( ω ) and B ^ Φ ( ω ) are as close as possible to commuting. This is analogous to finding a basis that approximately simultaneously diagonalizes a family of matrices. When exact simultaneous diagonalization is possible, the defect becomes zero, and the Golden–Thompson inequality is tight.
Remark 18
(Connection to transform separation). The strict separation example (DFT vs. DCT) demonstrates that the choice of Φ matters: for the same tensors A , B , one transform may yield a vanishing defect while another yields a strictly positive defect. This shows that the optimal transform problem is nontrivial and that solving it can lead to substantial improvements.

5.2. Computing the Optimal Transform: Riemannian Gradient Flow

We consider the nonconvex optimization problem:
min Φ ∈ O ( p ) Δ Φ ( A , B ) ,
where O ( p ) is the orthogonal group. Using Theorem 2, under the bounded spectral-domain assumption, the defect Δ Φ is quantitatively controlled by transform-domain noncommutativity.
To obtain a smooth objective suitable for gradient-based optimization, we consider the squared surrogate
J ( Φ ) = ∑ ω = 1 p A ^ Φ ( ω ) , B ^ Φ ( ω ) F 2 .
Here, Φ acts as an orthogonal mixing operator along the third (tube) mode. Concretely, for any tensor X ∈ C n × n × p with frontal slices X ( k ) ∈ C n × n , the transformed slices are provided by
X ^ Φ ( ω ) = ∑ k = 1 p Φ ω k X ( k ) , ω = 1 , … , p .
Thus, Φ mixes the frontal slices linearly along the third dimension; it is not a similarity transform within each slice but an orthogonal combination of whole slices.
In the Riemannian formulation, we equip O ( p ) with the canonical Riemannian metric induced by the Frobenius inner product
⟨ X , Y ⟩ = Re ( Tr ( X H Y ) ) .
The tangent space at Φ ∈ O ( p ) is
T Φ O ( p ) = { Φ Ω : Ω ⊤ = − Ω } ,
where O ( p ) = { Ω ∈ R p × p : Ω ⊤ = − Ω } is the Lie algebra of skew-symmetric matrices.
Let G Φ = ∇ Φ J denote the Euclidean gradient of J with respect to Φ . The Riemannian gradient is obtained by projecting G Φ onto the tangent space:
∇ O ( p ) J ( Φ ) = Φ skew Φ ⊤ G Φ , skew ( X ) : = 1 2 ( X − X ⊤ ) .
A first-order gradient flow update along the negative Riemannian gradient direction is provided by
Φ ˜ = Φ − η Φ skew Φ ⊤ G Φ ,
where η > 0 is a step size.
Since Φ ˜ may not be orthogonal, we project it back to O ( p ) using a retraction R . For example, the polar retraction is yielded by
R ( X ) = X ( X ⊤ X ) − 1 / 2 ,
which maps any invertible matrix to the nearest orthogonal matrix in the Frobenius norm. The complete update is
Φ ← R Φ ( I − η skew ( Φ ⊤ G Φ ) ) .
Under standard assumptions on the step size, the Riemannian gradient descent scheme converges to a stationary point of J; see [16,17] for details. We summarize the resulting Riemannian gradient scheme below.
Example 2
(One iteration on a 2 × 2 × 4 tensor). Take n = 2 , p = 4 , Φ 0 = I , η = 0.1 , and the tensor pair ( A , B ) from Theorem 4. The Euclidean gradient G Φ 0 is computed by automatic differentiation through the mixing formula and the commutator, and the polar retraction R ( X ) = X ( X ⊤ X ) − 1 / 2 is used. Numerically, J ( Φ 0 ) = J 0 and one Riemannian gradient step yield J ( Φ 1 ) = J 1 < J 0 ; the values J 0 , J 1 , ∥ G Φ 0 ∥ F , and ∥ Ω 0 ∥ F are reported in Table 1 (double-precision arithmetic).
Table 1. One iteration of Algorithm 1 on the 2 × 2 × 4 tensor pair of Theorem 4 ( Φ 0 = I , η = 0.1 ).
Proposition 2
(Stationary accumulation-point property). Assume that J is continuously differentiable and that its Riemannian gradient is Lipschitz continuous with constant L > 0 on O ( p ) . Then, for sufficiently small step size η < 2 / L , the iteration generated by Algorithm 1 satisfies ∥ ∇ O ( p ) J ( Φ ( k ) ) ∥ F → 0 , and every accumulation point Φ * of { Φ ( k ) } is a stationary point of J on O ( p ) , i.e., ∇ O ( p ) J ( Φ * ) = 0 . No iterate convergence Φ ( k ) → Φ * is asserted without additional second-order sufficient conditions.
Proof. 
The update Φ ˜ = Φ − η ∇ O ( p ) J ( Φ ) is a Riemannian gradient step on O ( p ) . The retraction R is a first-order approximation of the exponential map and preserves feasibility. Using standard results from Riemannian optimization [16], the Lipschitz continuity of the Riemannian gradient implies a sufficient decrease condition:
J ( Φ ( k + 1 ) ) ≤ J ( Φ ( k ) ) − η 2 ∥ ∇ O ( p ) J ( Φ ( k ) ) ∥ F 2
for sufficiently small η . Summing this inequality over k yields
∑ k = 0 ∞ ∥ ∇ O ( p ) J ( Φ ( k ) ) ∥ F 2 ≤ 2 η ( J ( Φ ( 0 ) ) − inf J ) < ∞ ,
hence ∥ ∇ O ( p ) J ( Φ ( k ) ) ∥ F → 0 . By continuity of the Riemannian gradient, any accumulation point Φ * satisfies ∇ O ( p ) J ( Φ * ) = 0 , i.e., is a stationary point. Iterate convergence to a single stationary point would require an additional second-order sufficient condition (e.g., nondegeneracy of the Hessian at Φ * ), which is not assumed here. □
Remark 19
(Computational complexity). Each iteration of Algorithm 1 requires the following:
  • O ( p 2 n 2 ) operations for the dense mode-3 transform mixing X ^ Φ ( ω ) = ∑ k Φ ω k X ( k ) (or O ( p n 2 log p ) when Φ is DFT/DCT and implemented by a fast transform);
  • O ( p n 3 ) operations to evaluate the p commutators of n × n matrices;
  • O ( p 3 ) operations for the retraction (QR or polar decomposition).
The overall complexity per iteration is O ( p 2 n 2 + p n 3 + p 3 ) , which is acceptable for moderate n and p (e.g., n ≤ 100 , p ≤ 64 ).
Remark 20
(Initialization strategies). The choice of initial transform Φ 0 can affect convergence speed and the quality of the final solution. Natural initializations include the following:
  • DFT or DCT (standard choices in the tensor literature);
  • the identity transform (baseline);
  • a data-dependent transform (e.g., SVD of the unfolded tensor).
In practice, we observe that Algorithm 1 consistently reduces J ( Φ ) regardless of initialization.
Remark 21
(Connection to the commuting case). The algorithm seeks a transform Φ that minimizes transform-domain noncommutativity. If a transform Φ 0 exists that renders all slices commuting, i.e.,
[ A ^ Φ 0 ( ω ) , B ^ Φ 0 ( ω ) ] = 0 , ∀ ω ,
then Δ Φ 0 = 0 using Theorem 8(iii), so Φ 0 is a global minimizer of J and of D. However, since J is nonconvex on O ( p ) , Riemannian gradient descent from an arbitrary initialization is not guaranteed to reach Φ 0 ; it is only guaranteed to reach a stationary point (Proposition 2).

5.3. Numerical Illustration of Operator-Aware Transform Selection

We now demonstrate numerically that standard transforms such as DFT and DCT are not necessarily optimal. For a fixed tensor dimension ( n = 2 , p = 16 ) , we consider a tensor pair ( A , B ) for which the DFT transform yields a small but nonzero defect. We then compute an optimized transform Φ * using the Riemannian gradient descent scheme in Algorithm 1.
Using Corollary 5(ii), minimizing Δ Φ ( A , B ) is controlled from above by the commutator energy
C ( Φ ) = ∑ ω = 1 p ∥ [ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] ∥ F 2 ,
which is the objective optimized by Algorithm 1.
The results in Table 2 reveal several key observations. The DCT transform produces a large defect, indicating strong noncommutativity induced by transform-domain mixing. The DFT transform significantly reduces the defect but does not eliminate it. The optimized transform Φ * further reduces the defect by approximately one order of magnitude compared to DFT and by several orders of magnitude compared to DCT. In particular, we observe that
Δ Φ * ( A , B ) < Δ DFT ( A , B ) < Δ DCT ( A , B ) ,
demonstrating that operator-aware transform selection can outperform both standard transforms.
Table 2. Golden–Thompson defect for different transforms ( n = 2 , p = 16 ). The optimized transform Φ * is obtained by minimizing transform-domain noncommutativity, not representation error. It achieves a defect strictly smaller than both DFT and DCT, illustrating operator-aware transform selection.
This example illustrates both aspects of the theory. First, Figure 1 confirms the transform sensitivity predicted by Theorem 2(iii), showing that different transforms can yield dramatically different defect magnitudes. Second, Table 2 demonstrates that no fixed transform is universally optimal. Even when a standard transform (such as DFT) performs well, the optimization framework can identify a superior transform tailored to the specific tensor pair. The substantial reduction in defect achieved by Φ * highlights the practical value of the Riemannian optimization approach. This provides a concrete numerical validation of the data-dependent optimality principle established in Theorem 7 and supports the optimization framework developed in Section 5.1.

6. Discussion and Conclusions

This study separates algebraic invariance from quantitative behavior in transform-based tensor algebras. While all unitary transforms Φ induce algebraically isomorphic tensor algebras via the standard transform-domain representation of the ⋆ M framework [3,4], the Golden–Thompson defect shows that inequality tightness depends intrinsically on the transform. The transform is therefore not merely a computational device, but a coordinate system in which commutativity—and hence inequality tightness—is measured.
  • Transform as geometry.
The mapping A ↦ A ¯ Φ preserves algebraic operations but alters commutativity. Different transforms induce different commutator structures, endowing tensor operators with a transform-dependent noncommutativity geometry. This geometry is encoded in the defect Δ Φ ( A , B ) and in its associated commutator-energy form
C ( Φ ) = ∑ ω = 1 p [ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] F 2 .
In this sense, the choice of Φ defines a coordinate system on the space of tensor slices, and the defect measures how far the tensor pair is from being simultaneously diagonalizable in that coordinate system.
  • Joint diagonalization connection.
Under the bounded spectral-domain assumption of Theorem 2, minimizing Δ Φ ( A , B ) is controlled, up to constants depending only on the spectral bound R, by the commutator energy
∑ ω = 1 p [ A ^ Φ ( ω ) , B ^ Φ ( ω ) ] F 2
in the sense of Corollary 5(ii)–(iii): the upper bound holds pointwise in Φ on the bounded spectral class, while the lower bound holds at the fixed transform Φ 0 of Theorem 2(ii) and on the explicit Pauli family constructed there. This is analogous to seeking a transform that makes the transformed slices as commuting as possible. This aligns with approximate joint diagonalization, where the optimal transform Φ * selects a coordinate system maximizing operator compatibility. The operator-aware transform selection problem of Section 5 can therefore be viewed as a structured approximate joint diagonalization problem on the orthogonal group.
  • Implications for numerical linear algebra and operator theory.
The defect Δ Φ provides a quantitative measure of noncommutativity. Thus, transform selection becomes a principled tool for improving spectral stability and reducing operator interaction, complementing classical rank- and sparsity-based criteria. More broadly, Φ influences both the representation of the data and the operator-level behavior of the resulting algebra, linking algebraic modeling with analytical performance. This connects the present study to several themes in numerical linear algebra and operator theory, including simultaneous diagonalization, spectral stability of tensor operators, and the quantitative analysis of trace inequalities.
  • No free transform principle.
Transform selection is not merely a change of basis. Although the transform-based tensor algebra is algebraically invariant under a change of unitary transform, quantitative behavior is transform-dependent. Using Theorem 7, no transform is universally optimal: for any two orthogonal transforms whose relative transform Φ 2 Φ 1 ⊤ is not a signed permutation matrix, there exist tensor pairs for which each transform is strictly better than the other. (For signed-permutation relatives, the two transforms differ only by a signed permutation of slices, and the strict separation argument of Theorem 7 does not apply.)
Each transform defines a coordinate system in which commutativity is evaluated, and optimality is inherently data-dependent. This parallels “no free lunch” principles: no single basis simultaneously diagonalizes all operators. Consequently, the transform must be selected adaptively, motivating the operator-aware optimization framework in Section 5.
  • Conclusion and Future Directions
In summary, this work shows that algebraic invariance in transform-based tensor algebras does not imply quantitative invariance of operator inequalities. The Golden–Thompson defect provides a transform-dependent measure of inequality tightness, controlled from above by transform-domain noncommutativity under a bounded spectral-domain assumption, and controlled from below on the explicit Pauli family of Theorem 2(ii) at the fixed transform constructed there. The defect is sensitive to the choice of transform; no transform is universally optimal (the optimal transform depends on the joint structure of the tensor pair), and operator-aware transform selection can be formulated as an optimization problem over the orthogonal group. These results establish a nontrivial transform-dependent structure of inequality tightness in transform-based tensor algebras and open several concrete directions, summarized below.
Several questions remain open. First, a general lower bound for Δ Φ valid for all tensors in the bounded spectral class, beyond the explicit one-parameter Pauli family of Theorem 2(ii), is not established. Second, the DFT–DCT construction of Theorem 4 is established for p = 4 under the orthonormal DFT and DCT-II conventions; extending it to general p and to other transform pairs remains open. Third, the relationship between commutator-energy minimization and approximate joint diagonalization deserves a separate quantitative analysis. Fourth, operator-aware transform selection may be extended to constrained unitary optimization and to additional matrix inequalities.

Author Contributions

Conceptualization, S.-Y.C. and M.K.N.; Methodology, S.-Y.C.; Software, S.-Y.C.; Validation, S.-Y.C.; Formal analysis, S.-Y.C.; Investigation, S.-Y.C.; Resources, S.-Y.C.; Data curation, S.-Y.C.; Writing—original draft, S.-Y.C. and M.K.N.; Writing—review and editing, S.-Y.C. and M.K.N.; Project administration, S.-Y.C. All authors have read and agreed to the published version of the manuscript.

Funding

M. Ng’s research is supported by the GDSTC: Guangdong and Hong Kong Universities “1 + 1 + 1” Joint Research Collaboration Scheme JRCS-25-26-MATH-01, National Key Research and Development Program of China under Grant 2024YFE0202900, RGC GRF 12300125, and ITF Funding PRP/104/24FX.

Data Availability Statement

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

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Explicit DFT–DCT Mixing at p = 4

We use the orthonormal DFT
F 4 = 1 2 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i ,
and the orthonormal DCT-II
C 4 = 1 2 1 2 1 2 1 2 c + − c − − c − c + 1 2 − 1 2 − 1 2 1 2 c − c + − c + c − , c ± = 2 ± 2 2 2 .
Set U = C 4 F 4 H . A direct computation yields
U 1 , : = ( 1 , 0 , 0 , 0 ) ,
U 2 , : = sin π 8 , cos ( π / 8 ) 2 ( 1 − i ) , 0 , cos ( π / 8 ) 2 ( 1 + i ) ,
U 3 , : = 0 , 1 − i 2 , 0 , 1 + i 2 , U 4 , : = 0 , cos ( π / 8 ) 2 ( 1 + i ) , 0 , cos ( π / 8 ) 2 ( 1 − i ) .
The construction of Theorem 4 uses the second row U 2 , : : the conjugate pair ( U 22 , U 24 ) = ( cos ( π / 8 ) 2 ( 1 − i ) , cos ( π / 8 ) 2 ( 1 + i ) ) acts on the DFT-domain slices at ω = 1 and ω = 3 (both equal to H 1 ), while the entry U 21 = sin ( π / 8 ) acts on the slice at ω = 0 (equal to H 2 ). Since U 23 = 0 , the slice at ω = 2 does not contribute. Hence,
A 1 ′ = c H 1 + s H 2 , B 1 ′ = c H 1 + 2 s H 2 , c = cos ( π / 8 ) , s = sin ( π / 8 ) ,
and
[ A 1 ′ , B 1 ′ ] = c s [ H 1 , H 2 ] ≠ 0 .

References

  1. Zhang, X.; Ng, M.K. Sparse nonnegative tensor factorization and completion with noisy observations. IEEE Trans. Inf. Theory 2022, 68, 2551–2572. [Google Scholar] [CrossRef] [Scilit]
  2. Song, G.J.; Ng, M.K.; Zhang, X. Tensor completion by multi-rank via unitary transformation. Appl. Comput. Harmon. Anal. 2023, 65, 348–373. [Google Scholar] [CrossRef] [Scilit]
  3. Kernfeld, E.; Kilmer, M.; Aeron, S. Tensor–tensor products with invertible linear transforms. Linear Algebra Appl. 2015, 485, 545–570. [Google Scholar] [CrossRef] [Scilit]
  4. Kilmer, M.E.; Horesh, L.; Avron, L.; Newman, E. Tensor-tensor algebra for optimal representation and compression. Proc. Natl. Acad. Sci. USA 2021, 118, e2015851118. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  5. 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] [Scilit]
  6. Kilmer, M.E.; Martin, C.D. Factorization strategies for third-order tensors. Linear Algebra Appl. 2011, 435, 641–658. [Google Scholar] [CrossRef] [Scilit]
  7. Lu, C.; Feng, J.; Chen, Y.; Liu, W.; Lin, Z.; Yan, S. Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Trans. Pattern Anal. Mach. Intell. 2020, 42, 925–938. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  8. 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] [Scilit]
  9. Golden, S. Lower bounds for the Helmholtz function. Phys. Rev. 1965, 137, B1127–B1128. [Google Scholar] [CrossRef] [Scilit]
  10. Thompson, C.J. Inequality with applications in statistical mechanics. J. Math. Phys. 1965, 6, 1812–1813. [Google Scholar] [CrossRef] [Scilit]
  11. Lieb, E.H. Convex trace functions and the Wigner–Yanase–Dyson conjecture. In Les Rencontres Physiciens-Mathématiciens de Strasbourg–RCP25; Springer: Berlin/Heidelberg, Germany, 1973; Volume 19, p. 35. [Google Scholar]
  12. Chang, S.-Y.; Wei, Y. T-product tensors—Part II: Tail bounds for sums of random t-product tensors. arXiv 2021, arXiv:2107.06224. [Google Scholar]
  13. Chang, S.-Y.; Wei, Y. T-square tensors—Part I: Inequalities. Comput. Appl. Math. 2022, 41, 62. [Google Scholar] [CrossRef] [Scilit]
  14. Hiai, F.; Petz, D. Introduction to Matrix Analysis and Applications; Springer: Cham, Switzerland, 2014. [Google Scholar]
  15. Newman, E.; Keegan, K. Optimal matrix-mimetic tensor algebras via variable projection. SIAM J. Matrix Anal. Appl. 2025, 46, 1764–1790. [Google Scholar] [CrossRef] [Scilit]
  16. Absil, P.-A.; Mahony, R.; Sepulchre, R. Optimization Algorithms on Matrix Manifolds; Princeton University Press: Princeton, NJ, USA, 2008. [Google Scholar]
  17. Edelman, A.; Arias, T.A.; Smith, S.T. The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 1998, 20, 303–353. [Google Scholar] [CrossRef] [Scilit]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.