Weighted Shift Matrices: Unitary Equivalence, Reducibility and Numerical Ranges

preprint2012arXivOpen access

Abstract

An nn-by-nn (n≥3n\ge 3) weighted shift matrix AA is one of the form $$[{array}{cccc}0 & a_1 & & & 0 & \ddots & & & \ddots & a_{n-1} a_n & & & 0{array}],$$ where the aja_j's, called the weights of AA, are complex numbers. Assume that all aja_j's are nonzero and BB is an nn-by-nn weighted shift matrix with weights b1,...,bnb_1,..., b_n. We show that BB is unitarily equivalent to AA if and only if b1...bn=a1...anb_1... b_n=a_1...a_n and, for some fixed kk, 1≤k≤n1\le k \le n, ∣bj∣=∣ak+j∣|b_j| = |a_{k+j}| (an+j≡aja_{n+j}\equiv a_j) for all jj. Next, we show that AA is reducible if and only if AA has periodic weights, that is, for some fixed kk, 1≤k≤⌊n/2⌋1\le k \le \lfloor n/2\rfloor, nn is divisible by kk, and ∣aj∣=∣ak+j∣|a_j|=|a_{k+j}| for all 1≤j≤n−k1\le j\le n-k. Finally, we prove that AA and BB have the same numerical range if and only if a1...an=b1...bna_1...a_n=b_1...b_n and Sr(∣a1∣2,...,∣an∣2)=Sr(∣b1∣2,...,∣bn∣2)S_r(|a_1|^2,..., |a_n|^2)=S_r(|b_1|^2,..., |b_n|^2) for all 1≤r≤⌊n/2⌋1\le r\le \lfloor n/2\rfloor, where SrS_r's are the circularly symmetric functions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.