z-logo
Premium
Resolvent Tests for Similarity to a Normal Operator
Author(s) -
Benamara NourEddine,
Nikolski Nikolai
Publication year - 1999
Publication title -
proceedings of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.899
H-Index - 65
eISSN - 1460-244X
pISSN - 0024-6115
DOI - 10.1112/s0024611599001756
Subject(s) - mathematics , resolvent , resolvent formalism , operator (biology) , spectrum (functional analysis) , linear map , mathematical analysis , hilbert space , bounded operator , finite rank operator , quasinormal operator , compact operator , bounded function , pure mathematics , banach space , biochemistry , chemistry , physics , repressor , quantum mechanics , transcription factor , gene , computer science , extension (predicate logic) , programming language
The main result of this paper is the resolvent similarity criterion which says that linear growth of the resolvent towards the spectrum is sufficient for a Hilbert space contraction with finite rank defect operators and spectrum not covering the unit disc to be similar to a normal operator. Similar results are proved for operators having a spectral set bounded by a Dini‐smooth Jordan curve; in particular, a dissipative operator with finite rank imaginary part is similar to a normal operator if and only if its resolvent grows linearly towards the spectrum. Relevant results on the insufficiency of linear resolvent growth not accompanied by smallness of defect operators are presented. Also it is proved that there is no restriction on the spectrum, other than finiteness, which together with linear resolvent growth implies similarity to a normal operator. The construction of corresponding examples depends on a characterization of well‐known Ahlfors curves as curves of linear length growth with respect to linear fractional transformations. 1991 Mathematics Subject Classification : 11D25, 11G05, 14G05.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here