We introduce the spectral mapping factorization of tuples of circulant matrices and its matrix version. We prove that every tuple of circulant contractions has a unitary N-dilation. We show that von Neumann’s inequality holds for tuples of circulant contractions. We construct completely contractive homomorphisms over the algebra of complex polynomials defined on
In 1953, Sz-Nagy [
‖ p ( T ) ‖ ≤ ‖ p ‖ ∞ ,
holds for all complex polynomials p ( z ) over the unit disk, where ‖ p ‖ ∞ denotes the supremum norm of p over the unit disk. In 1963, Ando proved that every pair of commuting contractions has a simultaneous commuting dilation [
This result has many engineering applications [
In the present paper, we introduce the spectral mapping factorization of tuples of circulant matrices and its matrix version. Circulant matrices have many applications in graph theory, cryptography, physics, signal and image processing, probability, statistics, numerical analysis, algebraic coding theory and many other areas [
Theorem 1.1. Let N ∈ ℕ be a positive integer. Every tuple of circulant contractions has a unitary N-dilation.
Theorem 1.2. von Neumann’s inequality holds for tuples of circulant contractions.
The matrix version of the spectral mapping factorization of tuples of circulant matrices allows us to introduce a new family of completely contractive homomorphisms over the algebra of complex polynomials defined on D n .
Throughout this paper H is a Hilbert space of finite dimension n. Let
D = [ d i , j ] i , j = 1 n ∈ M n ( ℂ )
be a complex matrix. Denote by D * = [ d j , i * ] i , j = 1 n .
Definition 2.1. Let A be a unital Banach algebra. We say that a ∈ A is invertible if there is an element b ∈ A such that a b = b a = 1 . In this case b is unique and written a − 1 . The set
I n v ( A ) = { a ∈ A : ∃ b ∈ A , a b = b a = 1 }
is a group under multiplication.
If a is an element of A , the spectrum of a is defined as
σ ( a ) = { λ ∈ ℂ : a − λ .1 ∉ I n v ( A ) } ,
and its spectral radius is defined to be
r ( a ) = sup { | λ | : λ ∈ σ ( a ) } .
Definition 2.2. Let H be a Hilbert space and let T ∈ B ( H ) be a linear bounded operator on H. Then the operator norm of T denoted by ‖ T ‖ is defined by
‖ T ‖ = sup { ‖ T ( x ) ‖ ‖ x ‖ : x ≠ 0 } = sup { ‖ T ( x ) ‖ : ‖ x ‖ ≤ 1 } = sup { ‖ T ( x ) ‖ : ‖ x ‖ = 1 } .
If ‖ T ‖ ≤ 1 , then the linear bounded operator T is called a contraction. In the case, H is a finite dimensional Hilbert space, then
‖ T ‖ = r ( T * T ) = sup { | λ | : λ ∈ σ ( T * T ) } .
Let D n = { z ∈ ℂ : | z | ≤ 1 } be the unit poly disk and let
f ( z 1 , ⋯ , z n ) = ∑ ( k 1 , ⋯ , k n ) ∈ S f ^ ( k 1 , ⋯ , k n ) z 1 k 1 ⋯ z n k n ,
be a complex polynomial over D n . Then
‖ f ‖ ∞ = sup { | f ( z 1 , ⋯ , z n ) | : | z 1 | = ⋯ = | z n | = 1 } .
Let P n be the algebra of complex polynomials over D n . Given
f ( z 1 , ⋯ , z n ) = ∑ ( k 1 , ⋯ , k n ) ∈ S f ^ ( k 1 , ⋯ , k n ) z 1 k 1 ⋯ z n k n ,
a complex polynomial over D n , let us set
‖ f ‖ u = sup ‖ f ( T 1 , ⋯ , T n ) ‖ ,
where the supremum is taken over the family of all n-tuples of contractions on all Hilbert spaces. It is easy to see that ‖ f ‖ u is finite, since it is bounded by the sum of the absolute values of the Fourier coefficients of f, and that this quantity defines a norm on the algebra P n of complex polynomials over D n . For each polynomial p in P n , there is always an n-tuple of contractions where this supremum is achieved. Therefore, ( P n , ‖ . ‖ ∞ ) and ( P n , ‖ . ‖ u ) are both two normed algebras.
Let f i , j ( z 1 , ⋯ , z n ) , i , j = 1 , ⋯ , m , be complex polynomials in n variables over D n . Then
‖ ( f i , j ) ‖ ∞ = sup { ‖ ( f i , j ( z 1 , ⋯ , z n ) ) ‖ M m : | z i | ≤ 1 } .
Definition 2.3. Let N ∈ ℕ and let ( T 1 , ⋯ , T k ) be a tuple of commuting contractions on H. A unitary N-dilation for ( T 1 , ⋯ , T k ) is a k-tuple of commuting unitaries ( U 1 , ⋯ , U k ) acting on a space K ⊇ H such that
T 1 n 1 ⋯ T k n k = P H U 1 n 1 ⋯ U k n k | H ,
for all n 1 , ⋯ , n k satisfying n 1 + ⋯ + n k ≤ N .
Definition 2.4. A finite set { B 1 , ⋯ , B n } of matrices is said to be doubly commuting if B i B j = B j B i and B i * B j = B j B i * , for every i ≠ j .
The following results will enable us to prove our main results [
Theorem 2.5. (Sz-Nagy-Foias). Given k doubly commuting contractions T 1 , ⋯ , T k ∈ B ( H ) , there is a Hilbert space K containing H and doubly commuting unitaries U 1 , ⋯ , U k ∈ B ( K ) so that
T 1 n 1 ⋯ T k n k = P H U 1 n 1 ⋯ U k n k | H ,
for all n 1 , ⋯ , n k ∈ ℤ .
Theorem 2.6. Let ( T 1 , ⋯ , T k ) be a k-tuple of doubly commuting contractions on H. Then for every N ∈ ℕ , the k-tuple ( T 1 , ⋯ , T k ) has a unitary N-dilation that acts on a space of dimension ( N + 1 ) k n .
In finite dimensional, every tuple of commuting contractions which has a unitary N-dilation acting on a finite dimensional Hilbert space satisfies von Neumann’s inequality [
Theorem 2.7. Let N ∈ ℕ , and let ( T 1 , ⋯ , T k ) be a k-tuple of commuting contractions on H that has a unitary N-dilation acting on a finite dimensional Hilbert space K. Put m = dim K. Then there exist m points { w i = ( w 1 i , ⋯ , w k i ) } i = 1 m on the k-torus T k such that for every polynomial f ( z 1 , ⋯ , z k ) of degree less than or equal to N,
‖ f ( T 1 , ⋯ , T k ) ‖ ≤ max { | f ( w i ) | : i = 1 , ⋯ , m } .
In particular,
‖ f ( T 1 , ⋯ , T k ) ‖ ≤ sup { | f ( z 1 , ⋯ , z k ) | : | z i | = 1 , i = 1 , ⋯ , k } = ‖ f ‖ ∞ .
Now, let us turn our attention to a particular family of doubly commuting sets of matrices which have many applications in several areas such as graph theory, cryptography, physics, signal and image processing, probability, statistics, numerical analysis, algebraic coding theory and many other areas [
Let { a 0 , a 1 , ⋯ , a m − 1 } ⊂ ℂ be a finite set of complex numbers, denote by C ( a 0 , a 1 , ⋯ , a m − 1 ) the following Toeplitz matrix:
C ( a 0 , a 1 , ⋯ , a m − 1 ) = ( a 0 a 1 ⋱ a m − 1 a m − 1 a 0 ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ a 1 … a m − 1 a 0 ) ∈ M n ( ℂ ) .
This matrix is called a complex circulant matrix of order m. It is possible to write this matrix as a single variable matrix polynomial in P, where P is the cyclic permutation matrix given by
P = ( 0 1 0 ⋱ 0 0 0 0 1 0 ⋱ 0 ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ 0 0 ⋯ 0 0 1 1 0 ⋯ 0 0 0 ) .
Indeed,
C ( a 0 , a 1 , ⋯ , a m − 1 ) = a 0 I m + ∑ k = 1 m − 1 a k P k .
The matrix
( a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 9 a 9 a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 8 a 9 a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 7 a 8 a 9 a 1 a 2 a 3 a 4 a 5 a 6 a 6 a 7 a 8 a 9 a 1 a 2 a 3 a 4 a 5 a 5 a 6 a 7 a 8 a 9 a 1 a 2 a 3 a 4 a 4 a 5 a 6 a 7 a 8 a 9 a 1 a 2 a 3 a 3 a 4 a 5 a 6 a 7 a 8 a 9 a 1 a 2 a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 9 a 1 ) , a i ∈ ℂ ,
is a 9 × 9-complex circulant matrix. It is well known that the set of m × m-circulant matrices
Circ ( m ) = { b 0 I m + ∑ k = 1 m − 1 b k P k : b k ∈ ℂ }
is a commutative algebra. Let ε = e 2 π i m be a primitive m-th root of unity. Let us denote by U the following matrix:
U = 1 m ( 1 1 ⋯ 1 1 1 1 1 ε ⋯ ⋯ ε m − 3 ε m − 2 ε m − 1 ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ 1 ε m − 3 ⋯ ⋯ ε ( m − 3 ) 2 ε ( m − 3 ) ( m − 2 ) ε ( m − 1 ) ( m − 3 ) 1 ε m − 2 ⋯ ⋯ ε ( m − 2 ) ( m − 3 ) ε ( m − 2 ) 2 ε ( m − 1 ) ( m − 2 ) 1 ε m − 1 ⋯ ⋯ ε ( m − 1 ) ( m − 3 ) ε ( m − 1 ) ( m − 2 ) ε ( m − 1 ) 2 ) .
This matrix is called Vandermonde matrix. It is well known that this matrix has the following properties:
det ( U ) = 1 m m 2 ∏ i , j = 0 m − 1 ( ε j − ε i ) ≠ 0 ,
U is non-singular, unitary, U − 1 = U ¯ T , U T = U and U − 1 = U ¯ = U * . It is well known that all elements of Cir(m) are simultaneously diagonalised by the same unitary matrix U [
U * A U = D A
with D A is a diagonal matrix with diagonal entries given by the ordered eigenvalues of A: λ 1 A , λ 2 A , ⋯ , λ m A . The factorization U * A U = D A is called the spectral factorization of A.
In this section, we introduce the spectral mapping factorization of tuples of circulant matrices and its matrix version. We prove our main two results.
Theorem 3.1. Let A be a m × m-complex circulant matrix. Then
‖ A ‖ = sup { | λ | : λ ∈ σ ( A ) } = r ( A ) .
Proof. Let A be a m × m-complex circulant matrix. The spectral factorization of the matrix A allows us to claim that
A = U D A U − 1 , D A = ( λ 1 A 0 ⋱ 0 0 λ 2 A ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 λ m A ) , λ l A ∈ σ ( A ) .
It follows that
D A = U − 1 A U .
A simple calculation shows that
‖ A ‖ ≤ ‖ U − 1 ‖ ‖ D A ‖ ‖ U ‖ ≤ ‖ D A ‖
and
‖ D A ‖ ≤ ‖ U ‖ ‖ A ‖ ‖ U − 1 ‖ ≤ ‖ A ‖ .
Therefore,
‖ A ‖ = ‖ D A ‖ = sup { | λ | : λ ∈ σ ( A ) } = r ( A ) . □
Theorem 3.2. Let A be a m × m-complex circulant matrix. Then
‖ f ( A ) ‖ = sup { | f ( λ ) | : λ ∈ σ ( A ) } = r ( f ( A ) ) , ∀ f ∈ P 1 .
Proof. Let A be a m × m-complex circulant matrix. We know that
A = U D A U − 1 , D A = ( λ 1 A 0 ⋱ 0 0 λ 2 A ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 λ m A ) , λ l A ∈ σ ( A ) .
Then
f ( D A ) = ( f ( λ 1 A ) 0 ⋱ 0 0 f ( λ 2 A ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f ( λ m A ) ) , λ i A ∈ σ ( A ) .
Therefore,
‖ f ( A ) ‖ = ‖ U − 1 f ( D ) U ‖ = ‖ f ( D ) ‖ = sup { | f ( λ ) | : λ ∈ σ ( A ) } = r ( f ( A ) ) . □
The spectral factorization of circulant matrices [
Theorem 3.3. Let S = { A 1 , A 2 , ⋯ , A n } be a set of m × m-complex circulant matrices. Then
f ( A 1 , ⋯ , A n ) = U ( f ( λ 1 A 1 , ⋯ , λ 1 A n ) 0 ⋱ 0 0 f ( λ 2 A 1 , ⋯ , λ 2 A n ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f ( λ m A 1 , ⋯ , λ m A n ) ) U − 1 ,
λ l A i ∈ σ ( A i ) , ∀ f ∈ P n .
Proof. Let S = { A 1 , A 2 , ⋯ , A n } be a set of m × m-complex circulant matrices. From the spectral factorization of every A i , we can say that there exist a complex m × m-unitary matrix U and m × m-diagonal matrices D A i , i = 1 , ⋯ , n such that
A i = U D A i U − 1 , D A i = ( λ 1 A i 0 ⋱ 0 0 λ 2 A i ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 λ m A i ) , λ l A i ∈ σ ( A i ) , l = 1 , ⋯ , m .
A simple calculation shows that
f ( A 1 , ⋯ , A n ) = U f ( D A 1 , ⋯ , D A n ) U − 1 , ∀ f ∈ P n .
It is straightforward to see that
f ( D A 1 , ⋯ , D A n ) = ( f ( λ 1 A 1 , ⋯ , λ 1 A n ) 0 ⋱ 0 0 f ( λ 2 A 1 , ⋯ , λ 2 A n ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f ( λ m A 1 , ⋯ , λ m A n ) ) ,
∀ f ∈ P n . Therefore,
f ( A 1 , ⋯ , A n ) = U ( f ( λ 1 A 1 , ⋯ , λ 1 A n ) 0 ⋱ 0 0 f ( λ 2 A 1 , ⋯ , λ 2 A n ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f ( λ m A 1 , ⋯ , λ m A n ) ) U − 1 ,
λ l A i ∈ σ ( A i ) , ∀ f ∈ P n . □
Now, we are ready to establish the matrix version of the spectral mapping factorization of tuples of circulant matrices.
Theorem 3.4. Let k ∈ ℕ and let S = { A 1 , A 2 , ⋯ , A n } be a set of m × m-complex circulant matrices and let [ f i , j ( z 1 , ⋯ , z n ) ] i , j = 1 k be a k × k-matrix with complex polynomials as entries. Let us denote by
B = [ f i , j ( A 1 , ⋯ , A n ) ] i , j = 1 k
and
a i , j = ( f i , j ( λ 1 A 1 , ⋯ , λ 1 A n ) 0 ⋱ 0 0 f i , j ( λ 2 A 1 , ⋯ , λ 2 A n ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f i , j ( λ m A 1 , ⋯ , λ m A n ) ) ,
λ l A r ∈ σ ( A r ) , i , j = 1 , ⋯ , k . Then
B = ( U 0 ⋱ 0 0 U ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 U ) ( a 1 , 1 a 1 , 2 ⋱ a 1 , k a 2 , 1 a 2 , 2 ⋱ a 2 , k ⋮ ⋮ ⋮ ⋮ a k , 1 ⋯ ⋯ a k , k ) ( U 0 ⋱ 0 0 U ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 U ) − 1 .
Proof. Let S = { A 1 , A 2 , ⋯ , A n } be a set of m × m-complex circulant matrices and let [ f i , j ( z 1 , ⋯ , z n ) ] i , j = 1 k be a k × k-matrix with complex polynomials as entries, k ∈ ℕ . Suppose that
B = [ f i , j ( A 1 , ⋯ , A n ) ] i , j = 1 k , f i , j ∈ P n ,
and
a i , j = ( f i , j ( λ 1 A 1 , ⋯ , λ 1 A n ) 0 ⋱ 0 0 f i , j ( λ 2 A 1 , ⋯ , λ 2 A n ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f i , j ( λ m A 1 , ⋯ , λ m A n ) ) ,
λ l A r ∈ σ ( A r ) . Theorem 3.3 allows us to claim that
f i , j ( A 1 , ⋯ , A n ) = U a i , j U − 1 ,
f i , j ∈ P n , λ l A r ∈ σ ( A r ) . It follows that
B = [ U a i , j U − 1 ] i , j = 1 k .
A simple calculation shows that
B = ( U 0 ⋱ 0 0 U ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 U ) ( a 1,1 a 1,2 ⋱ a 1, k a 2,1 a 2,2 ⋱ a 2, k ⋮ ⋮ ⋮ ⋮ a k ,1 ⋯ ⋯ a k , k ) ( U 0 ⋱ 0 0 U ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 U ) − 1 . □
Proof of Theorem 1.1
We just need to show that every tuple of circulant contractions is a doubly commuting set of contractions. Let k ∈ ℕ and let
( C 1 ( a 0,1 , a 1,1 , ⋯ , a m − 1,1 ) , ⋯ , C k ( a 0, k , a 1, k , ⋯ , a m − 1, k ) )
be a k-tuple of circulant contractions. Assume that
P = ( 0 1 0 ⋱ 0 0 0 0 1 0 ⋱ 0 ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ 0 0 ⋯ 0 0 1 1 0 ⋯ 0 0 0 ) ∈ M m ( ℂ ) .
It is clear that
C i ( a 0, i , a 1, i , ⋯ , a m − 1, i ) = ( a 0, i a 1, i ⋱ a m − 1, i a m − 1, i a 0, i ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ a 1, i ⋯ 0 a 0, i ) .
Also,
C i ( a 0 , i , a 1 , i , ⋯ , a m − 1 , i ) = a 0 , i I m + ∑ r = 1 m − 1 a r , i P r , 1 ≤ i ≤ k .
Let us show that the set
{ C 1 ( a 0,1 , a 1,1 , ⋯ , a m − 1,1 ) , ⋯ , C k ( a 0, k , a 1, k , ⋯ , a m − 1, k ) }
is a doubly commuting set of contractions. We already know that this set is commutative. Let us observe that
C j ( a 0 , j , a 1 , j , ⋯ , a m − 1 , j ) * = a 0 , j ¯ I m + ∑ r = 1 m − 1 a n − r , j ¯ P r .
Therefore, the adjoint of a complex m × m-circulant matrix is another m × m-circulant matrix. The fact that the set of m × m-circulant matrices is a commutative algebra implies that the matrices C i ( a 0, i , a 1, i , ⋯ , a m − 1, i ) and C j ( a 0, j , a 1, j , ⋯ , a m − 1, j ) * , i ≠ j , commute. Therefore, the set
{ C 1 ( a 0,1 , a 1,1 , ⋯ , a m − 1,1 ) , ⋯ , C k ( a 0, k , a 1, k , ⋯ , a m − 1, k ) }
is a doubly commuting set of contractions. Theorem 2.5 and Theorem 2.6 allow us to claim that, for each N ∈ ℕ , the k-tuple of circulant contractions
{ C 1 ( a 0,1 , a 1,1 , ⋯ , a m − 1,1 ) , ⋯ , C k ( a 0, k , a 1, k , ⋯ , a m − 1, k ) }
has a unitary N-dilation acting on a finite dimensional Hilbert space. Finally, for each N ∈ ℕ , every tuple of circulant contractions has a unitary N-dilation. □
The above proof allows us to observe the following: every finite set of circulant matrices is a doubly commuting set of matrices. This enables us to prove our second main result.
First proof of Theorem 1.2
Let ( A 1 , ⋯ , A n ) be an n-tuple of circulant contractions of order m. The set { A 1 , ⋯ , A n } is a doubly commuting set of contractions. Theorem 2.7 allows us to claim that von Neumann’s inequality holds for this set { A 1 , ⋯ , A n } . Therefore,
‖ f ( A 1 , ⋯ , A n ) ‖ ≤ ‖ f ‖ ∞ , ∀ f ∈ P n . □
Second proof of Theorem 1.2
Let { A 1 , A 2 , ⋯ , A n } be a set of m × m-complex circulant contractions. Theorem 3.3 allows us to claim that
f ( A 1 , ⋯ , A n ) = U ( f ( λ 1 A 1 , ⋯ , λ 1 A n ) 0 ⋱ 0 0 f ( λ 2 A 1 , ⋯ , λ 2 A n ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f ( λ m A 1 , ⋯ , λ m A n ) ) U − 1 ,
λ l A i ∈ σ ( A i ) , | λ l A i | ≤ 1, ∀ f ∈ P n . It follows that
‖ f ( A 1 , ⋯ , A n ) ‖ = ‖ ( f ( λ 1 A 1 , ⋯ , λ 1 A n ) 0 ⋱ 0 0 f ( λ 2 A 1 , ⋯ , λ 2 A n ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f ( λ m A 1 , ⋯ , λ m A n ) ) ‖ ,
λ l A i ∈ σ ( A i ) , for all f ∈ P n . Therefore,
‖ f ( A 1 , ⋯ , A n ) ‖ ≤ ‖ f ‖ ∞ , ∀ f ∈ P n . □
In this section, we construct completely contractive homomorphisms over the algebra of complex polynomials defined on D n .
Theorem 4.1. Let S = { A 1 , A 2 , ⋯ , A n } be a set of m × m-complex circulant contractions. Then the map ϕ S : P n → M m given by
ϕ S ( f ) = f ( A 1 , ⋯ , A n )
is a completely contractive homomorphism.
Proof. Let S = { A 1 , A 2 , ⋯ , A n } be a set of m × m-complex circulant contractions. The spectral factorization of the matrix A i allows us to claim that
A i = U D A i U − 1 , D A i = ( λ 1 A i 0 ⋱ 0 0 λ 2 A i ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 λ m A i ) , λ l A i ∈ σ ( A i ) .
It follows that
D A i = U − 1 A i U .
A simple calculation shows that
‖ A i ‖ = ‖ D A i ‖ = sup { | λ | : λ ∈ σ ( A i ) } .
Finally, | λ l A i | ≤ 1, λ l A i ∈ σ ( A i ) , since ‖ A i ‖ ≤ 1 . Suppose that ϕ S : P n → M m is the map given by
ϕ S ( f ) = f ( A 1 , ⋯ , A n ) .
It is well known that the map ϕ S is a homomorphism [
‖ ϕ S ‖ = sup { ‖ ϕ S ( f ) ‖ ‖ f ‖ ∞ : f ≠ 0 , f ∈ P n }
‖ ϕ S ‖ = sup { ‖ f ( A 1 , ⋯ , A n ) ‖ ‖ f ‖ ∞ : f ≠ 0 , f ∈ P n } .
First of all, let us show that the map ϕ S is a contractive map. Due to the fact that the elements of the set S = { A 1 , A 2 , ⋯ , A n } doubly commute implies that
‖ f ( A 1 , ⋯ , A n ) ‖ ≤ ‖ f ‖ ∞ , ∀ f ∈ P n .
Therefore,
‖ ϕ S ‖ = sup { ‖ f ( A 1 , ⋯ , A n ) ‖ ‖ f ‖ ∞ : f ≠ 0 , f ∈ P n } ≤ 1.
Let k ∈ ℕ and define the map ϕ k S : M k ( P n ) → M k ( M m ) by setting
ϕ k S ( [ f i , j ] i , j = 1 k ) = [ f i , j ( A 1 , ⋯ , A n ) ] i , j = 1 k
Let us show that the map ϕ k S is contractive. Theorem 3.4 allows us to claim that if
B = [ f i , j ( A 1 , ⋯ , A n ) ] i , j = 1 k , f i , j ∈ P n ,
we can say that
B = ( U 0 ⋱ 0 0 U ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 U ) ( a 1,1 a 1,2 ⋱ a 1, k a 2,1 a 2,2 ⋱ a 2, k ⋮ ⋮ ⋮ ⋮ a k ,1 ⋯ ⋯ a k , k ) ( U 0 ⋱ 0 0 U ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 U ) − 1
with
a i , j = ( f i , j ( λ 1 A 1 , ⋯ , λ 1 A n ) 0 ⋱ 0 0 f i , j ( λ 2 A 1 , ⋯ , λ 2 A n ) ⋱ ⋱ ⋮ ⋮ ⋮ ⋮ 0 ⋯ 0 f i , j ( λ m A 1 , ⋯ , λ m A n ) ) ,
λ l A r ∈ σ ( A r ) . Recall that | λ l A r | ≤ 1 , l = 1, ⋯ , m and r = 1, ⋯ , n . It follows that
‖ [ f i , j ( A 1 , ⋯ , A n ) ] i , j = 1 k ‖ = ‖ ( a 1 , 1 a 1 , 2 ⋱ a 1 , k a 2 , 1 a 2 , 2 ⋱ a 2 , k ⋮ ⋮ ⋮ ⋮ a k , 1 ⋯ ⋯ a k , k ) ‖ ≤ ‖ [ f i , j ] i , j = 1 k ‖ ∞ .
Finally,
‖ ϕ k S ‖ = sup { ‖ [ f i , j ( A 1 , ⋯ , A n ) ] i , j = 1 k ‖ ‖ [ f i , j ] i , j = 1 k ‖ ∞ : [ f i , j ] i , j = 1 k ∈ M k ( P n ) } ≤ 1 , k ∈ ℕ . □
The authors declare no conflicts of interest regarding the publication of this paper.
Mouanda, J.M., Koubemba, E.J.M. and Dehainsala, D. (2023) On Unitary N-Dilations for Tuples of Circulant Contractions and von Neumann’s Inequality. American Journal of Computational Mathematics, 13, 594-606. https://doi.org/10.4236/ajcm.2023.134032