Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 30, Number 1, February 2025
Page(s) 60 - 68
DOI https://doi.org/10.1051/wujns/2025301060
Published online 12 March 2025

© Wuhan University 2025

Licence Creative CommonsThis is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

0 Introduction

The Weyl type theorem of bounded linear operator can well reflect the structure characteristics and distribution of operator's spectral[1-5]. Therefore, the Weyl type theorem is an important topic in spectral theory. In recent years, the research scope of Weyl type theorems has been extended from general operators to operator functions, operator matrices, etc. Numerous significant results have been obtained[6-9]. Property (WE)Mathematical equation and property (R)Mathematical equation are the latest variations of Weyl type theorems, which have attracted the attention and research of operator theorists[10-12]. In this paper, by decomposing and constructing the operator spectrum and using the topological uniform scaling property, we give a new method for bounded linear operators and operator functions to satisfy the property (WE)Mathematical equation and property (R)Mathematical equation. Furthermore, the perturbation of property (WE)Mathematical equation and property (R)Mathematical equation is characterized, and the necessary and sufficient conditions for the operator function to have both the property (WE)Mathematical equation and property (R)Mathematical equation are studied.

Throughout this paper, HMathematical equation denotes a complex separable infinite dimensional Hilbert space. Let B(H)Mathematical equation be the algebra of all bounded linear operators on HMathematical equation. For an operator TB(H)Mathematical equation we shall denote by n(T)Mathematical equation the dimension of the kernel N(T)Mathematical equation, and by d(T)Mathematical equation the codimension of the range R(T)Mathematical equation. We call TB(H)Mathematical equation is an upper semi-Fredholm operator if n(T)<Mathematical equation and R(T)Mathematical equation is closed. If TB(H)Mathematical equation is an upper semi-Fredholm operator and n(T)=0Mathematical equation, we call TMathematical equation a bounded below operator. If d(T)Mathematical equation<Mathematical equation, TMathematical equation is a lower semi-Fredholm operator. An operator TB(H)Mathematical equation is said to be Fredholm if R(T)Mathematical equation is closed and both n(T)Mathematical equation and d(T)Mathematical equation are finite. If TB(H)Mathematical equation is an upper (or a lower) semi-Fredholm operator, the index of TMathematical equation, ind(T)Mathematical equation, is defined to be ind(T)=Mathematical equationn(T)-d(T)Mathematical equation. The ascent of TMathematical equation, asc(T)Mathematical equation, is the least non-negative integer nMathematical equation such that N(Tn)=Mathematical equationN(Tn+1)Mathematical equation and the descent, des(T)Mathematical equation, is the least non-negative integer nMathematical equation such that R(Tn)Mathematical equation=Mathematical equationR(Tn+1)Mathematical equation. We call TMathematical equation a Drazin invertible operator if asc(T)Mathematical equation=des(T)<Mathematical equation. The operator TMathematical equation is Weyl if it is Fredholm of index zero, and TMathematical equation is said to be Browder if it is Fredholm "of finite ascent and descent". Let σ(T)Mathematical equation be the spectrum of TMathematical equation and σa(T)Mathematical equation be the approximate point spectrum of TMathematical equation. We write σw(T)Mathematical equation, σb(T)Mathematical equation, σe(T)Mathematical equation, σSF(T)Mathematical equation, σea(T)Mathematical equation and σab(T)Mathematical equation for the Weyl spectrum of TMathematical equation, the Browder spectrum of TMathematical equation, the essential spectrum of TMathematical equation, the semi-Fredholm spectrum of TMathematical equation, the essential approximate point spectrum of TMathematical equation and the Browder essential approximate point spectrum of TMathematical equation. Let ρ(T)=Mathematical equationC\σ(T)Mathematical equation, ρa(T)=Mathematical equationC\σa(T)Mathematical equation, ρw(T)=Mathematical equationC\σw(T)Mathematical equation, ρb(T)=Mathematical equationC\σb(T)Mathematical equation, ρe(T)=Mathematical equationC\σe(T)Mathematical equation, ρab(T)=Mathematical equationC\σab(T)Mathematical equation (CMathematical equation denotes the set of complex numbers). TB(H)Mathematical equation is called an isoloid operator if isoσ(T)Mathematical equationσp(T)Mathematical equation where σp(T)Mathematical equation={λC:n(T-λI)>0}Mathematical equation. For a set XCMathematical equation, we write isoXMathematical equation, accXMathematical equation and XMathematical equation for the set of isolated points, accumulation points and boundary points set of XMathematical equation. We denote by σ0(T)Mathematical equation the set of all normal eigenvalues of TMathematical equation, thus σ0(T)=σ(T)\σb(T)Mathematical equation. TB(H)Mathematical equation satisfies property (WE)Mathematical equation if σ(T)\σw(T)=E(T)Mathematical equation, where E(T)={λisoσ(T):n(T-λI)>Mathematical equation0}Mathematical equation[10]. TB(H)Mathematical equation satisfies property (R)Mathematical equation if σa(T)\σab(T)=π00(T)Mathematical equation, where π00(T)={λisoσ(T):0<n(T-λI)<+}Mathematical equation[10].

In this paper, we mainly study property (WE)Mathematical equation and property (R)Mathematical equation for bounded linear operators and its functions. Some meaningful conclusions are obtained.

1 Judgement of Property (WE)Mathematical equation and Property (R)Mathematical equation for Bounded Linear Operators

Although both property (WE)Mathematical equation and property (R)Mathematical equation are variations of Weyl's theorem based on their definitions, there is no necessary connection between them.

Remark 1   (i) TB(H)Mathematical equation satisfies property (WE)Mathematical equationMathematical equationTMathematical equation satisfies property (R)Mathematical equation.

Let A,BB(l2)Mathematical equation be defined by A(x1,x2,x3,)=(0,x1,x2,)Mathematical equation, B(x1,x2,x3,)=(0,x2,x3,)Mathematical equation. Suppose that T=(A00B)Mathematical equation. Then σ(T)={λC:|λ|1}=σw(T)Mathematical equation, E(T)=π00(T)=Mathematical equation, σa(T)={λC:|λ|=1}{0}Mathematical equation, σab(T)={λC:|λ|=1}Mathematical equation. TMathematical equation satisfies property (WE)Mathematical equation, but property (R)Mathematical equation does not hold for TMathematical equation.

(ii) TB(H)Mathematical equation satisfies property (R)Mathematical equationMathematical equationTMathematical equation satisfies property (WE)Mathematical equation.

Let A,BB(l2)Mathematical equation be defined by A(x1,x2,x3,)=(0,x1,x2,)Mathematical equation, B(x1,x2,x3,)=(x2,x3,)Mathematical equation, T=(A00B)Mathematical equation. We have that σ(T)={λC:|λ|1}σw(T)Mathematical equation, σa(T)=σab(T)={λC:|λ|1}Mathematical equation. π00(T)=E(T)=Mathematical equation. So TMathematical equation satisfies property (R)Mathematical equation and TMathematical equation does not have property (WE)Mathematical equation.

(iii) TB(H)Mathematical equation has property (R)Mathematical equation and property (WE)Mathematical equationMathematical equationσw(T)=σab(T)[ρa(T)σ(T)]Mathematical equation and π00(T)=E(T)=σ0(T)Mathematical equation.

Topological uniform descent is an important property of operators, which is widely used in spectral theory. If TB(H)Mathematical equation, then for each nonnegative integer nMathematical equation, TMathematical equation induces a linear transformation from the vector space R(Tn)/R(Tn+1)Mathematical equation to R(Tn+1)/R(Tn+2)Mathematical equation. We denote kn(T)Mathematical equation the dimension of the null space of the induced map and let k(T)=n=0kn(T)Mathematical equation. The following definition was introduced by Grabiner[13]. Let TB(H)Mathematical equation, if there is a nonnegative integer dMathematical equation for which kn(T)=0Mathematical equation for ndMathematical equation and R(Tn)Mathematical equation is closed in the operator range topology of R(Td)Mathematical equation for ndMathematical equation, then we say that TMathematical equation has topological uniform descent.

It can be shown that if TMathematical equation is upper semi-Fredholm, then TMathematical equation has topological uniform descent. Let ρτ(T)={λC:T-λIMathematical equation has topological uniform descent}, στ(T)=C\ρτ(T)Mathematical equation. Grabiner discovered many properties of topological uniform descent. We will use the following property (Ref. [13], Corollary 4.9): Suppose that TB(H)Mathematical equation, λσ(T)Mathematical equation, if T-λIMathematical equation has topological uniform descent, then λMathematical equation is a pole of TMathematical equation. Next, we will discuss property (WE)Mathematical equation and property (R)Mathematical equation by using the topological uniform descent.

Lemma 1   Let TB(H)Mathematical equation, the following statements are equivalent:

(1) TMathematical equation satisfies property (WE)Mathematical equation;

(2) σb(T)=[στ(T)accσ(T)]accσw(T){λσ(T):n(T-λI)=0}Mathematical equation;

(3) σb(T)=[στ(T)accσa(T)]accσea(T){λσ(T):n(T-λI)=0}acc{λC:n(T-λI)<d(T-λI)}.Mathematical equation

Proof   (1)Mathematical equation(2). Suppose that TMathematical equation satisfies property (WE)Mathematical equation. If λ0[στ(T)accσ(T)]accσw(T)Mathematical equation{λσ(T):n(T-λI)=0}Mathematical equation, then there exists a deleted neighborhood B°(λ0)Mathematical equation centered on λ0Mathematical equation such that for any λB°(λ0)Mathematical equation, T-λIMathematical equation is a Weyl operator. Since TMathematical equation has property (WE)Mathematical equation, we know that T-λIMathematical equation is a Browder operator. Then we get that λ0ρ(T)σ(T)Mathematical equation. We assume that λ0σ(T)Mathematical equation. If λ0ρτ(T)Mathematical equation, we get that T-λ0IMathematical equation is Drazin invertible. According to n(T-λ0I)>0Mathematical equation, we have λ0E(T)Mathematical equation. Since TMathematical equation satisfies property (WE)Mathematical equation, we can get that T-λ0IMathematical equation is a Browder operator. If λ0accσ(T)Mathematical equation, we can also get that λ0E(T)Mathematical equation and T-λ0IMathematical equation is Browder operators. The inclusion "Mathematical equation" is obviously true.

(2)Mathematical equation(1). Since σ(T)\σw(T)][στ(T)accσa(T)]=Mathematical equation and [σ(T)\σw(T)][accσw(T)Mathematical equation{λσ(T):n(T-λI)=0}]=Mathematical equation, we know that σ(T)\σw(T)E(T)Mathematical equation. Similarly, E(T)Mathematical equationσ(T)\σw(T)Mathematical equation. Hence TMathematical equation satisfies property (WE)Mathematical equation.

The fact that accσea(T)acc{λC:n(T-λI)<d(T-λI)}=accσw(T)Mathematical equation implies that (2)Mathematical equation(3).

The closeness of operator range is very important in spectral theory. According to the closeness of operator range, the following spectral set is defined: σc(T)={λC:R(T-λI)Mathematical equation is not closed}.

Lemma 2   Let TB(H)Mathematical equation, the following statements are equivalent:

(1) TMathematical equation satisfies property (R)Mathematical equation;

(2) σb(T)=[στ(T)accσ(T)]accσab(T){λσ(T):n(T-λI)=0}{λC:n(T-λI)=}[acc{λC:n(T-λI)<d(TMathematical equation

d ( T - λ I ) } σ c ( T ) ] Mathematical equation;

(3) σb(T)=[στ(T)accσa(T)]accσab(T){λσ(T):n(T-λI)=0}{λC:n(T-λI)=}[acc{λC:n(T-λI)<-λMathematical equation

I ) } σ c ( T ) ] Mathematical equation

Proof   (1)Mathematical equation(2). Suppose λ0[στ(T)accσ(T)]accσab(T){λσ(T):n(T-λI)=0}{λC:n(T-λI)=}[acc{λMathematical equation

C : n ( T - λ I ) < d ( T - λ I ) } σ c ( T ) ] Mathematical equation. Without loss of generality, we assume that λ0σ(T)Mathematical equation. Then we have 0<n(T-λ0I)<Mathematical equation. There exists a deleted neighborhood B°(λ0;ε)Mathematical equation centered on λ0Mathematical equation such that for any λB°(λ0;ε)Mathematical equation, λρab(T)Mathematical equation. If λ0accσ(T)Mathematical equation, then λ0π00(T)Mathematical equation. Since TMathematical equation satisfies property (R)Mathematical equation, we have that T-λ0IMathematical equation is a Browder operator. Suppose that λ0ρτ(T)Mathematical equation, if λ0ρc(T)Mathematical equation, then T-λ0IMathematical equation is an upper semi-Fredholm operator. By λB°(λ0;ε)Mathematical equation, λρab(T)Mathematical equation and λ0isoσa(T)Mathematical equation, we know that λ0σa(T)\σab(T)Mathematical equation. Because TMathematical equation has property (R)Mathematical equation, we can get that λ0ρb(T)Mathematical equation. If λ0acc{λC:n(T-λI)<d(T-λI)}Mathematical equation, then exists a deleted neighborhood B°(λ0)B°(λ0;ε)Mathematical equation centered on λ0Mathematical equation such that for any λB°(λ0)Mathematical equation, λρb(T)Mathematical equation. Therefore λ0σ(T)Mathematical equation. Since λ0ρτ(T)Mathematical equation and n(T-λ0I)<Mathematical equation, we can also get that λ0ρb(T)Mathematical equation.

(2)Mathematical equation(1). Suppose that λ0σa(T)\σab(T)Mathematical equation. It follows that λ0[στ(T)accσ(T)]accσab(T){λσ(T):n(T-λI)=0}{λC:n(T-λI)=}[acc{λC:n(T-λI)<Mathematical equationd(T-λI)}σc(T)]Mathematical equation. So T-λ0IMathematical equation is a Browder operator. Then we have σa(T)\σab(T)π00(T)Mathematical equation. Similarly, we can get the inclusion "Mathematical equation". Hence TMathematical equation satisfies property (R)Mathematical equation.

If (2) holds, then TMathematical equation has property (R)Mathematical equation. This implies that {λC:0<n(T-λI)<}ρc(T)acc[ρa(T)σ(T)]=Mathematical equation, where ρc(T)=C\σc(T)Mathematical equation. It follows that accσ(T)=accσa(T){acc[ρa(T)σ(T)]σc(T)}{acc[ρa(T)σ(T)]ρc(T){λMathematical equation

σ ( T ) : n ( T - λ I ) = 0 } } { a c c [ ρ a ( T ) σ ( T ) ] ρ c ( T ) { λ C : n ( T - λ I ) = } } Mathematical equation. Hence [στ(T)accσ(T)]{[στ(T)accσa(T)]Mathematical equation

Mathematical equation { λ σ ( T ) : n ( T - λ I ) = 0 } { λ C : n ( T - λ I ) = } [ a c c { λ C : Mathematical equation n ( T - λ I ) < d ( T - Mathematical equation λ I ) } σ c ( T ) ] } Mathematical equation. Then we have that σb(T)[στMathematical equation

( T ) a c c σ ( T ) ] a c c σ a b ( T ) { λ σ ( T ) : n ( T - λ I ) = 0 } { λ C : n ( T - λ I ) = } [ a c c { λ C : n ( T - λ I ) < d ( T - λ I ) } σ c ( T ) ] Mathematical equation

The inclusion "Mathematical equation" is obviously true. This implies that (3) holds. For the converse, if (3) holds, by accσa(T)accσ(T)Mathematical equation we know that (2) holds. Therefore (2)Mathematical equation(3).

Based on Lemma 1 and Lemma 2, the following results demonstrate that the two properties can be valid at the same time:

Theorem 1   T B ( H ) Mathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation if and only if σb(T)=[στ(T)accσa(T)][accσab(T)σw(T)]{λσ(T):n(T-λI)=0}{λaccσ(T):n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)].Mathematical equation

Proof   "Mathematical equation". Suppose TMathematical equation has property (R)Mathematical equation. Using Lemma 2, we have that σb(T)=[στ(T)accσa(T)]accσab(T){λσ(T):n(T-λI)=0}{λC:n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)].Mathematical equation Since TMathematical equation has property (WE)Mathematical equation, we know that ρw(T)=ρb(T) and E(T)=σ0(T). Hence accσab(T)ρw(T)=, {λisoσ(T):n(T-λI)=}=.Mathematical equation Thus accσab(T)=[accσab(T)σw(T)][accσab(T)ρw(T)]=accσab(T)σw(T). {λC:n(T-λI)=}={λaccσ(T):n(T-λI)=}{λisoσ(T):n(T-λI)=}={λaccσ(T):n(T-λI)=}. Therefore σb(T)=[στ(T)accσa(T)][accσab(T)σw(T)]{λσ(T):n(T-λI)=0}{λaccσ(T):n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)].Mathematical equation

"Mathematical equation". By the condition, we get that σb(T)[στ(T)accσa(T)]accσab(T){λσ(T):n(T-λI)=0}{λC:n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)].Mathematical equation The inclusion "Mathematical equation" is obviously true. From Lemma 2, we know that TMathematical equation satisfies property (R)Mathematical equation.

If λ0σ(T)\σw(T)Mathematical equation, then λ0[στ(T)accσa(T)][accσab(T)σw(T)]{λσ(T):n(T-λI)=0}{λaccσ(T):n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]. Thus T-λ0IMathematical equation is a Browder operator, σ(T)\σw(T)E(T)Mathematical equation. The converse is similar. Therefore TMathematical equation satisfies property (WE)Mathematical equation.

Remark 2   (i) In Theorem 1, suppose TB(H)Mathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation, then each part of the decomposition of σb(T)Mathematical equation cannot be deleted.

(aMathematical equation) Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(0,x22,x33,)Mathematical equation. Hence TMathematical equation has property (R)Mathematical equation and property (WE)Mathematical equation. But σb(T)[accσab(T)σw(T)]{λσ(T):n(T-λI)=0}{λaccσ(T):n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]. Mathematical equationThus [στ(T)accσa(T)]Mathematical equation cannot be deleted.

(bMathematical equation) Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(x2,x3,x4,)Mathematical equation. Then TMathematical equation has property (R)Mathematical equation and property (WE)Mathematical equation. But σb(T)[στ(T)accσa(T)]{λσ(T):n(T-λI)=0}Mathematical equation{λaccσ(T):Mathematical equationn(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. Thus [accσab(T)σw(T)]Mathematical equation cannot be deleted.

(cMathematical equation) Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(0,x1,x2,x3,)Mathematical equation. We know that TMathematical equation has property (R)Mathematical equation and property (WE)Mathematical equation. But σb(T)[στ(T)accσa(T)][accσab(T)σw(T)]{λaccσ(T):Mathematical equationn(T-λI)Mathematical equation=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. Hence {λσ(T):n(T-λI)=0}Mathematical equation cannot be deleted.

(dMathematical equation) Let A,BB(l2)Mathematical equation be defined by A(x1,x2,)=(0,x1,x2,)Mathematical equation, B(x1,x2,x3,)=(x1,0,x3,0,)Mathematical equation. And suppose T=(A00B)Mathematical equation. Then TMathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation. But σb(T)[στ(T)Mathematical equationaccσa(T)]Mathematical equation[accσab(T)σw(T)]{λσ(T):n(T-λI)=0}[acc{λC:n(T-λI)<Mathematical equationd(T-λI)}Mathematical equationσc(T)]Mathematical equation. Therefore {λaccσ(T):n(T-λI)=}Mathematical equation cannot be deleted.

(eMathematical equation) Let A,BB(l2)Mathematical equation be defined by A(x1,x2,)=(0,x1,x2,)Mathematical equation, B(x1,x2,x3,)=Mathematical equation(0,0,x22,x33,)Mathematical equation. And suppose T=(A00B)Mathematical equation. Thus TMathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation. But σb(T)[στ(T)accσa(T)][accσab(T)Mathematical equationσw(T)]{λσ(T):n(T-λI)=0}Mathematical equation{λMathematical equationaccσ(T):Mathematical equationn(T-λI)=}Mathematical equation. It follows that [acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation cannot be deleted.

(ii) The conditions in Theorem 1 can be transformed as follows: accσa(T)Mathematical equation can be replaced by accσ(T)Mathematical equation, accσab(T)σw(T)Mathematical equation can be replaced by accσab(T)accσw(T)Mathematical equation.

From Lemma 1 and Lemma 2, we can get the following Corollary.

Corollary 1   Let TB(H)Mathematical equation. Then:

(1) TMathematical equation satisfies property (WE)Mathematical equationMathematical equationE(T)ρτ(T)ρb(T)accσw(T)Mathematical equationMathematical equationE(T)ρτ(T)Mathematical equationρb(T)accσea(T)acc{λC:n(T-λI)<d(T-λI)}Mathematical equation;

(2) TMathematical equation satisfies property (R)π00(T)ρτ(T)ρb(T)accσa(T){λC:n(T-λI)=0}{λC:n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]π00(T)ρτ(T)ρb(T)accσab(T){λC:n(T-λI)=0}{λC:n(T-λI)=}[acc{λC:n(T-λI)<d(T-[λI)}σc(T)]].Mathematical equation

By Theorem 1 and Corollary 1, we can get the following Corollary.

Corollary 2   Let TB(H)Mathematical equation. Then TMathematical equation satisfies property (R)Mathematical equation and property (WE)E(T)ρτ(T)ρb(T)[accσab(T)Mathematical equation

σ w ( T ) ] { λ C : n ( T - λ I ) = 0 } { λ C : n ( T - λ I ) = } [ a c c { λ C : n ( T - λ I ) < d ( T - λ I ) } σ c ( T ) ] . Mathematical equation

Proof   Using Theorem 1, TMathematical equation satisfies property (R)Mathematical equation and property (WE)σb(T)=[στ(T)accσa(T)][accσab(T)σwMathematical equation

( T ) ] { λ σ ( T ) : n ( T - λ I ) = 0 } { λ a c c σ ( T ) : n ( T - λ I ) = } [ a c c { λ C : n ( T - λ I ) < d ( T - λ I ) } σ c ( T ) ] . Mathematical equation

"Mathematical equation". E(T)ρτ(T)Mathematical equation is obvious. If λ0ρτ(T)Mathematical equation and λ0[accσab(T)σw(T)]{λσ(T):Mathematical equationn(T-λI)=0}{λaccσ(T):n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation, by Theorem 1 we know that λ0ρb(T)Mathematical equation.

"Mathematical equation". Suppose λ0σ(T)Mathematical equation and λ0[στ(T)accσa(T)][accσab(T)σw(T)]{λσ(T):Mathematical equationn(T-λI)=0}{λaccσ(T):n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. If λ0ρτ(T)Mathematical equation, we have λ0ρb(T)Mathematical equation by the condition. Suppose λ0accσa(T)Mathematical equation, if λ0ρc(T)Mathematical equation, we can get that λ0ρτ(T)Mathematical equation, then T-λ0IMathematical equation is a Browder operator. If λ0acc{λC:n(T-λI)<d(T-λI)}Mathematical equation, using λ0accσa(T)Mathematical equation we have λ0isoσ(T)Mathematical equation. It also follows that λ0ρb(T)Mathematical equation. From Theorem 1, we can get that TMathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation.

2 The Perturbation of Property (WE)Mathematical equation and Property (R)Mathematical equation

Suppose TB(H)Mathematical equation satisfies property (R)Mathematical equation or property (WE)Mathematical equation and KB(H)Mathematical equation is a compact operator or even a finite rank operator, but we cannot deduce that T+KMathematical equation satisfies property (R)Mathematical equation or property (WE)Mathematical equation. For example, let T,KB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(0,x1,x22,x33,)Mathematical equation, K(x1,x2,x3,)=Mathematical equation(0,x1,0,0,)Mathematical equation. It is obviously that TMathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation and KMathematical equation is a finite rank operator. However, calculations indicate that T+KMathematical equation does not satisfy either property (R)Mathematical equation or property (WE)Mathematical equation.

The operator FMathematical equation is called a power finite rank operator, if there is a positive integer nMathematical equation such that dimR(Fn)<Mathematical equation. A power finite rank operator is a Riesz operator, therefore, when FMathematical equation is a power finite rank operator, operator TMathematical equation is commutative with FMathematical equation, then it has the following properties: σ1(T+F)=σ1(T)Mathematical equation, where σ1{σw,σb,Mathematical equationσe,σSF,σea}Mathematical equation and isoσ(T+F)isoσ(T)ρ(T)Mathematical equation[14].

Due to the complexity of general compact perturbations, this section focuses on the power finite rank perturbation of property (WE)Mathematical equation and property (R)Mathematical equation.

Lemma 3   Let TB(H)Mathematical equation and FMathematical equation is a power finite rank operator with FT=TFMathematical equation. The following statements are equivalent:

(1) T+FMathematical equation satisfies property (WE)Mathematical equation and is an isoloid operator;

(2) σb(T)=[στ(T)accσ(T)]accσw(T)Mathematical equation;

(3) σb(T)=[στ(T)accσa(T)]accσea(T)acc{λC:n(T-λI)<d(T-λI)}Mathematical equation.

Proof   (1)Mathematical equation(2). Since T+FMathematical equation satisfies property (WE)Mathematical equation and σw(T+F)=σw(T)Mathematical equation, σb(T+F)=Mathematical equationσb(T)Mathematical equation, we have that σw(T)=σb(T)Mathematical equation. If λ0[στ(T)accσ(T)]accσw(T)Mathematical equation, when λ0στ(T)Mathematical equation, by the proof of Lemma 1, we know that T-λ0IMathematical equation is Drazin invertible. Thus λ0isoσ(T+F)ρ(T+F)Mathematical equation. If n(T+F-λ0I)=Mathematical equation, then λ0E(T+F)Mathematical equation. Since T+FMathematical equation has property (WE)Mathematical equation, we get that T+F-λ0IMathematical equation is a Browder operator. It is a contradiction. Therefore n(T+F-λ0I)<Mathematical equation, hence n(T-λ0I)<Mathematical equation. By T-λ0IMathematical equation is Drazin invertible we have that λ0σb(T)Mathematical equation. Suppose that λ0accσ(T)Mathematical equation. Without loss of generality, we assume that λ0isoσ(T)Mathematical equation. Then λ0isoσ(T+F)Mathematical equation. The fact that T+FMathematical equation is isoloid implies that λ0E(T+F)Mathematical equation. Because T+FMathematical equation has the property (WE)Mathematical equation, T+F-λ0IMathematical equation is a Browder operator. We also have that λ0σb(T)Mathematical equation.

(2)Mathematical equation(1). Suppose that λ0σ(T+F)\σw(T+F)Mathematical equation. Then we have that T-λ0IMathematical equation is a Weyl operator. So λ0[στ(T)accσ(T)]accσw(T)Mathematical equation. By condition (2), we can get that T-λ0IMathematical equation is a Browder operator. Thus T+F-λ0IMathematical equation is a Browder operator. Then λ0E(T+F)Mathematical equation. Contrarily, if λ0E(T+F)Mathematical equation, then λ0ρ(T)Mathematical equationisoσ(T)Mathematical equation. Therefore λ0[στ(T)accσ(T)]accσw(T)Mathematical equation. Hence T-λ0IMathematical equation and T+F-λ0IMathematical equation are Browder operators.

If there exists λ0isoσ(T+F)Mathematical equation such that n(T+F-λ0I)=0Mathematical equation, then λ0isoσ(T)ρ(T)Mathematical equation. By condition (2), we have that T-λ0IMathematical equation is a Browder operator. It follows that T+F-λ0IMathematical equation is a Browder operator. The fact that n(T+F-λ0I)=0Mathematical equation implies that T+F-λ0IMathematical equation is invertible, which is a contradiction. Therefore T+FMathematical equation is an isoloid operator.

(1)Mathematical equation(3). Suppose λ0[στ(T)accσa(T)]accσea(T)acc{λC:n(T-λI)<d(T-λI)}Mathematical equation. If λ0στ(T)Mathematical equation, from the proof of (1) Mathematical equation (2) we can get that λ0σb(T)Mathematical equation. If λ0accσa(T)Mathematical equation, we assume that λ0σ(T)Mathematical equation without loss of generality. Since λ0accσea(T)acc{λC:n(T-λI)<d(T-λI)}Mathematical equation, we have that λ0isoσ(T)Mathematical equation. Hence λ0isoσ(T+F)Mathematical equation. Since T+FMathematical equation is isoloid and satisfies property (WE)Mathematical equation, we have that T+F-λ0IMathematical equation is a Browder operator. Thus λ0σb(T)Mathematical equation.

(3)Mathematical equation(1). The proof for (3)Mathematical equation(1) is the same as the proof for (2)Mathematical equation(1).

Lemma 4   Let TB(H)Mathematical equation and FMathematical equation is a power finite rank operator with FT=TFMathematical equation. The following statements are equivalent:

(1) T+FMathematical equation is an isoloid operator and satisfies property (R)Mathematical equation, σa(T+F)=σ(T+F)Mathematical equation;

(2) σb(T)=[στ(T)accσ(T)]accσab(T){λC:n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation;

(3) σb(T)=[στ(T)accσa(T)]accσab(T){λC:n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)].Mathematical equation

Proof   (1)Mathematical equation(2). Suppose λ0[στ(T)accσ(T)]accσab(T){λC:n(T-λI)=}Mathematical equation[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. We assume that λ0σ(T)Mathematical equation. If λ0ρτ(T)Mathematical equation, when λ0acc{λC:n(T-λI)<d(T-λI)}Mathematical equation, we can get that λ0σ(T)Mathematical equation. Then T-λ0IMathematical equation is a Browder operator. When λ0σc(T)Mathematical equation, we have that T-λ0IMathematical equation is a Weyl operator. Hence λ0ρw(T+F)Mathematical equation. The fact that T+FMathematical equation satisfies property (R)Mathematical equation implies that T+F-λ0IMathematical equation is a Browder operator. Hence λ0ρb(T)Mathematical equation. If λ0Mathematical equationaccσ(T)Mathematical equation, then λ0isoσ(T+F)ρ(T+F)Mathematical equation. We can assume that λ0isoσ(T+F)Mathematical equation. Since T+FMathematical equation is an isoloid operator, we have that λ0π00(T+F)Mathematical equation. Since T+FMathematical equation satisfies property (R)Mathematical equation, we can get that T+F-λ0IMathematical equation is a Browder operator. Therefore λ0ρb(T)Mathematical equation.

(2)Mathematical equation(1). Let's first prove that T+FMathematical equation is an isoloid operator. If there exists λ0isoσ(T+F)Mathematical equation such that n(T+F-λ0I)=0Mathematical equation. We assume that λ0σ(T)Mathematical equation without loss of generality. Thus n(T-λ0I)<Mathematical equation, λ0isoσ(T)Mathematical equation. Therefore λ0[στ(T)accσ(T)]accσab(T){λC:n(T-λI)=}Mathematical equation[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. It follows that T-λ0IMathematical equation is a Browder operator. Then T+F-λ0IMathematical equation is a Browder operator. Hence T+F-λ0IMathematical equation is invertible, which is a contradiction. Thus T+FMathematical equation is an isoloid operator.

Next we will prove σa(T+F)=σ(T+F)Mathematical equation. If λ0ρa(T+F)Mathematical equation, then λ0[στ(T)accσ(T)]Mathematical equationaccσab(T){λC:n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. It implies that both T-λ0IMathematical equation and T+F-λ0IMathematical equation are Browder operators. Hence λ0σ(T+F)Mathematical equation.

If λ0σa(T+F)\σab(T+F)Mathematical equation, then λ0[στ(T)accσ(T)]accσab(T){λC:n(T-Mathematical equationλI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. Hence T-λ0IMathematical equation and T+F-λ0IMathematical equation are Browder operators. Thus λ0π00(T+F)Mathematical equation. Conversely, suppose that λ0π00(T+F)Mathematical equation, then λ0isoσ(T)ρ(T)Mathematical equation. Then we also have that λ0[στ(T)accσ(T)]accσab(T){λC:n(T-λI)=}Mathematical equation

[ a c c { λ C : Mathematical equation n ( T - λ I ) < d ( T - λ I ) } σ c ( T ) ] Mathematical equation. Thus T-λ0IMathematical equation and T+F-λ0IMathematical equation are Browder operators. Hence T+FMathematical equation satisfies property (R)Mathematical equation.

The proof for (1)Mathematical equation(3) is the same as the proof for (1)Mathematical equation(2).

Then we obtain the finite rank perturbation with two properties held at the same time.

Theorem 2   Let TB(H)Mathematical equation and FMathematical equation is a power finite rank operator with FT=TFMathematical equation. The following statements are equivalent:

(1) T+FMathematical equation is an isoloid operator and satisfies property (R)Mathematical equation and property (WE)Mathematical equation, σa(T+F)Mathematical equation=σ(T+F)Mathematical equation;

(2) σb(T)=[στ(T)accσa(T)][accσab(T)σw(T)]{λaccσ(T):n(T-λI)=}[acc{λC:n(T-λI)<d(T-λI)}Mathematical equation

σ c ( T ) ] Mathematical equation

Proof   (1)Mathematical equation(2). Suppose λ0[στ(T)accσa(T)][accσab(T)σw(T)]{λaccσ(T):n(TMathematical equation-λI)=}[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. If λ0accσab(T)Mathematical equation, by Lemma 4 we have that λ0σb(T)Mathematical equation. If λ0σw(T)Mathematical equation, by Lemma 3 we also get that λ0σb(T)Mathematical equation.

(2)Mathematical equation(1). The statement (2) implies that σw(T)=σb(T)Mathematical equation. Suppose λ0[στ(T)accσ(T)]Mathematical equationaccσw(T)Mathematical equation, then λ0[στ(T)accσa(T)][accσab(T)σw(T)][acc{λC:n(T-λI)<Mathematical equationd(T-λI)}σc(T)]Mathematical equation. If λ0accσ(T)Mathematical equation, then λ0{λaccMathematical equation

σ ( T ) : n ( T - λ I ) = } Mathematical equation. If λ0ρτ(T)Mathematical equation, we have that λ0ρ(T)σ(T)Mathematical equation. Thus T-λ0IMathematical equation is Drazin invertible. Therefore λ0{λMathematical equationaccσ(T):n(T-λI)=}Mathematical equation. Hence λ0[στ(T)accσa(T)][accσab(T)σw(T)]{λMathematical equationaccσ(T):Mathematical equationn(T-λI)=}[accMathematical equation{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. Then T-λ0IMathematical equation is a Browder operator. Thus σb(T)=[στ(T)Mathematical equationaccσ(T)]accσw(T)Mathematical equation. With Lemma 3 we get that T+FMathematical equation is isoloid and satisfies property (WE)Mathematical equation.

By condition (2) we have that σb(T)=[στ(T)accσa(T)]accσab(T){λC:Mathematical equationn(T-λI)=}Mathematical equation[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation. Then according to Lemma 4 we have that T+FMathematical equation satisfies property (R)Mathematical equation and σa(T+F)=σ(T+F)Mathematical equation. Therefore (1) holds.

3 Property (WE)Mathematical equation and Property (R)Mathematical equation for Operator Functions

Let H(T)Mathematical equation be the class of all complex-valued functions which are analytic on a neighborhood of σ(T)Mathematical equation and are not constant on any component of σ(T)Mathematical equation. For the function's properties, we discuss property (WE)Mathematical equation first.

Lemma 5   Let TB(H)Mathematical equation. For any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (WE)Mathematical equation if and only if λMathematical equation, μρe(T)Mathematical equation, ind(T-λI)ind(T-μI)0Mathematical equation and one of the following conditions holds:

(1) σ(T)=[στ(T)accσ(T)]accσw(T){λσ(T):n(T-λI)=0}Mathematical equation;

(2) σb(T)=[στ(T)accσ(T)]accσw(T)Mathematical equation.

Proof   "Mathematical equation". Suppose (1) holds. Then σ0(T)=Mathematical equation, σ(T)=σb(T)=σw(T)Mathematical equation, thus for any fH(T)Mathematical equation, σ(f(T))=f(σ(T))=f(σw(T))=σw(f(T))Mathematical equation, σ(f(T))\σw(f(T))=Mathematical equation. Since E(f(T))Mathematical equationf(E(T))Mathematical equation, we have that E(f(T))=Mathematical equation. So f(T)Mathematical equation satisfies property (WE)Mathematical equation. If (2) holds, then isoσ(T)Mathematical equationσ0(T)Mathematical equation, σw(T)=σb(T)Mathematical equation. Hence σw(f(T))=f(σw(T))=f(σb(T))=σb(f(T))Mathematical equation. It follows that σ(f(T))\σw(f(T))σ0(f(T))E(f(T))Mathematical equation. For the converse, let μ0E(f(T))Mathematical equation, and let f(T)-Mathematical equationμ0I=(T-λ1I)n1(T-λ2I)n2(T-λtI)ntg(T)Mathematical equation, where λiλj(i,j=1,2,,t)Mathematical equation, and g(T)Mathematical equation is inverse. We assume that λiσ(T)Mathematical equation, then λiisoσ(T)Mathematical equation, thus λiσ0(T)Mathematical equation. It follows that f(T)-μ0IMathematical equation is a Browder operator.

"Mathematical equation". If there exists λ1,λ2ρe(T)Mathematical equation such that ind(T-λ1I)=n>0Mathematical equation, ind(T-λ2I)=-m<0Mathematical equation, suppose that f1(T)=(T-λ1I)m(T-λ2I)nMathematical equation, then 0σ(f1(T))\σw(f1(T))Mathematical equation. By f1(T)Mathematical equation satisfies property (WE)Mathematical equation, we have that f1(T)Mathematical equation is a Browder operator. Hence both T-λ1IMathematical equation and T-λ2IMathematical equation are Browder operators. It is a contradiction. Thus λ, μρe(T)Mathematical equation, ind(T-λI)ind(T-μI)0Mathematical equation.

If σ0(T)=Mathematical equation, then the fact that TMathematical equation satisfies property (WE)Mathematical equation implies that σ(T)=σw(T)=σb(T)Mathematical equation, E(T)=Mathematical equation. According to Lemma 1, we can get (1) holds. When σ0(T)Mathematical equation, we can assert that {λMathematical equationisoσ(T):n(T-λI)=0}=Mathematical equation. If not, suppose that λ3{λisoσ(T):n(T-λI)=0}Mathematical equation, λ4σ0(T)Mathematical equation. Let f2(T)=(T-λ3I)(T-λ4I)Mathematical equation, then 0E(f2(T))Mathematical equation. Since f2(T)Mathematical equation satisfies property (WE)Mathematical equation, then f2(T)Mathematical equation is a Browder operator, so is T-λ3IMathematical equation, which is a contradiction. Therefore {λisoσ(T):n(T-λI)=0}=Mathematical equation. By Lemma 1 and its proof, we get that (2) holds.

Similarly, we can obtain the following conclusion. Let TB(H)Mathematical equation, for any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (WE)Mathematical equation if and only if λ, μρe(T)Mathematical equation, ind(T-λI)ind(T-μI)0Mathematical equation and one of the following conditions holds:

(1) σ(T)=[στ(T)accσa(T)]accσea(T){λσ(T):n(T-λI)=0}acc{λC:n(T-λI)<Mathematical equationd(T-λI)}Mathematical equation;

(2) σb(T)=[στ(T)accσa(T)]accσea(T)acc{λC:n(T-λI)<d(T-λI)}Mathematical equation.

Corollary 3   Let TB(H)Mathematical equation, for any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (WE)Mathematical equation if and only if λ,μρe(T)Mathematical equation, ind(T-λI)ind(T-μI)0Mathematical equation and the following conditions holds:

(1) TMathematical equation satisfies property (WE)Mathematical equation;

(2) If σ0(T)Mathematical equation, then σb(T)=[στ(T)accσ(T)]accσw(T)Mathematical equation.

For property (R)Mathematical equation of operator functions, we have the following conclusions.

Lemma 6   Let TB(H)Mathematical equation, for any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (R)Mathematical equation if and only if one of the following conditions holds:

(1) σ(T)=[στ(T)accσ(T)]accσab(T){λσ(T):n(T-λI)=0}{λC:n(T-λI)=}Mathematical equation[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation;

(2) σb(T)=[στ(T)accσ(T)]accσab(T){λC:n(T-λI)=}Mathematical equation.

Proof   "Mathematical equation". If σ0(T)=Mathematical equation, then σ(T)=σb(T)=σw(T)Mathematical equation. By Lemma 2, we can get that (1) holds.

If σ0(T)Mathematical equation, we can assert that σ(T)=σa(T)Mathematical equation. If not, suppose that λ1ρa(T)σ(T)Mathematical equation, λ2σ0(T)Mathematical equation, let f(T)=(T-λ1I)(T-λ2I)Mathematical equation, then 0σa(f(T))\σab(f(T))Mathematical equation. Since f(T)Mathematical equation satisfies property (R)Mathematical equation, we can get that f(T)Mathematical equation is a Browder operator. Then T-λ1IMathematical equation is a Browder operator, which is a contradiction. Therefore σ(T)=σa(T)Mathematical equation. Similarly, we have {λisoσ(T):n(T-λI)=0}=Mathematical equation in this situation. Suppose that λ0[στ(T)accσ(T)]accσab(T){λC:n(T-λI)=}Mathematical equation. If λ0στ(T)Mathematical equation, by TMathematical equation satisfies property (R)Mathematical equation and σ(T)=σa(T)Mathematical equation we have that λ0σ(T)Mathematical equation. The fact that n(T-λ0I)<Mathematical equation implies that T-λ0IMathematical equation is a Browder operator. If λ0accσ(T)Mathematical equation, we can assume that λ0σ(T)Mathematical equation. Since {λisoσ(T):Mathematical equationn(T-λI)=0}=Mathematical equation, we have λ0π00(T)Mathematical equation. By TMathematical equation has property (R)Mathematical equation, we can get that T-λ0IMathematical equation is a Browder operator. Therefore (2) holds.

"Mathematical equation". If condition (1) holds, then σ0(T)=Mathematical equation, π00(T)=Mathematical equation, σa(T)=σab(T)Mathematical equation. Then for any fMathematical equationH(T)Mathematical equation, σa(f(T))=f(σa(T))=f(σab(T))=σab(f(T))Mathematical equation. Hence σa(f(T))\σab(f(T))=Mathematical equation. Since π00(f(T))f(π00(T))Mathematical equation, we have that π00(f(T))=Mathematical equation. Therefore f(T)Mathematical equation satisfies property (R)Mathematical equation.

If conditions (2) holds, then σab(T)=σb(T)Mathematical equation, σa(T)=σ(T)Mathematical equation, {λisoσ(T):Mathematical equationn(T-λI)=0}=Mathematical equation. Hence σa(f(T))\σab(f(T))σ0(f(T))π00(f(T))Mathematical equation. Suppose that μ0π00(f(T))Mathematical equation. Let f(T)-Mathematical equationμ0I=(T-λ1I)n1(T-λ2I)n2(T-λtI)ntg(T)Mathematical equation, where λiλjMathematical equation, g(T)Mathematical equation is invertible. We can assume that λiσ(T)Mathematical equation, then λiπ00(T)Mathematical equation. Since TMathematical equation has property (R)Mathematical equation, we get λiρb(T)Mathematical equation. So f(T)-μ0IMathematical equation is a Browder operator. Therefore f(T)Mathematical equation satisfies property (R)Mathematical equation.

By the proof of Lemma 6, we can get that:

Corollary 4   Let TB(H)Mathematical equation. For any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (R)Mathematical equation if and only if the following conditions holds:

(1) TMathematical equation satisfies property (R)Mathematical equation;

(2) If σ0(T)Mathematical equation, then σb(T)=[στ(T)accσ(T)]accσab(T){λC:n(T-λI)=}Mathematical equation.

Then we obtain the condition that the operator function satisfies both two properties.

Theorem 3   Let TB(H)Mathematical equation. For any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation if and only if λ, μρe(T)Mathematical equation, ind(T-λI)ind(T-μI)0Mathematical equation and:

(1) TMathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation;

(2) If σ0(T)Mathematical equation, then σb(T)=[στ(T)accσ(T)][accσab(T)σw(T)]Mathematical equation.

Proof   "Mathematical equation". According to Corollary 3 and Corollary 4, we know that we only need to prove (2). Suppose that λ0[στ(T)accσ(T)][accσab(T)σw(T)]Mathematical equation. If λ0σw(T)Mathematical equation, by Corollary 3 we know that T-λ0IMathematical equation is a Browder operator. Suppose λ0accσab(T)Mathematical equation. When n(T-λ0I)=0Mathematical equation, by Corollary 4 we can get that λ0ρb(T)Mathematical equation. When n(T-λ0I)>0Mathematical equation, the fact that σ(T)=σa(T)Mathematical equation implies λ0isoσ(T)Mathematical equation. Thus λ0E(T)Mathematical equation. We also get that T-λ0IMathematical equation is a Browder operator. The converse is obviously true. Hence (2) holds.

The sufficiency is easy to get from Corollary 3 and Corollary 4.

Corollary 5   Let TB(H)Mathematical equation. For any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation if and only if λ,μρe(T)Mathematical equation, ind(T-λI)ind(T-μI)0Mathematical equation and one of the following conditions holds:

(1) σ(T)=[στ(T)accσ(T)]accσab(T){λσ(T):n(T-λI)=0}{λC:n(T-Mathematical equationλI)=}Mathematical equation[acc{λC:n(T-λI)<d(T-λI)}σc(T)]Mathematical equation;

(2) σb(T)=[στ(T)accσ(T)]accσab(T){λC:n(T-λI)=}Mathematical equation.

Proof   "Mathematical equation". If σ0(T)=Mathematical equation, then σ(T)=σw(T)=σb(T)Mathematical equation. Since {λC:n(T-λI)=}Mathematical equation={λaccσ(T):n(T-λI)=}Mathematical equation, by Theorem 1 and Remark 2 we can get that (1) holds. If σ0(T)Mathematical equation, the condition (2) hold.

"Mathematical equation". According to Theorem 1 and Theorem 3, we know that for any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation.

Example 1 Let A,BB(l2)Mathematical equation be defined by: A(x1,x2,)=(x2,x3,)Mathematical equation, B(x1,x2,x3,)Mathematical equation=(x1,0,0,0,)Mathematical equation. Suppose that T=(A00I+B)Mathematical equation. Then: (1) TMathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation; (2) For any λρe(T)Mathematical equation, ind(T-λI)0Mathematical equation; (3) σ0(T)Mathematical equation, and σb(T)=[στ(T)accσ(T)][accσab(T)σw(T)]Mathematical equation.

Therefore by Theorem 3, we can get that for any fH(T)Mathematical equation, f(T)Mathematical equation satisfies property (R)Mathematical equation and property (WE)Mathematical equation.

References

  1. Djordjević D S. Operators obeying a-Weyl's theorem[J]. Publicationes Mathematicae Debrecen, 1999, 55(3/4): 283-298. [CrossRef] [MathSciNet] [Google Scholar]
  2. Cao X H, Guo M Z, Meng B. Weyl spectra and Weyl's theorem[J]. Journal of Mathematical Analysis and Applications, 2003, 288(2): 758-767. [CrossRef] [MathSciNet] [Google Scholar]
  3. Gupta A, Kumar A. Properties (BR) and (BgR) for bounded linear operators[J]. Rendiconti Del Circolo Matematico Di Palermo Series 2, 2020, 69(2): 601-611. [CrossRef] [MathSciNet] [Google Scholar]
  4. Sun C H, Wang N, Cao X H. Topological uniform descent and judgement of a-Weyl's theorem [J]. Wuhan University Journal of Natural Sciences, 2023, 28(5): 392-398. [CrossRef] [EDP Sciences] [Google Scholar]
  5. Aiena P, Triolo S. Weyl-type theorems on Banach spaces under compact perturbations[J]. Mediterranean Journal of Mathematics, 2018, 15(3): 126. [CrossRef] [Google Scholar]
  6. Wu X F, Huang J J, Chen A. Weylness of 2 × 2 operator matrices[J]. Mathematische Nachrichten, 2018, 291(1): 187-203. [CrossRef] [MathSciNet] [Google Scholar]
  7. Dong J, Cao X H, Dai L. On weyl's theorem for functions of operators[J]. Acta Mathematica Sinica, English Series, 2019, 35(8): 1367-1376. [CrossRef] [MathSciNet] [Google Scholar]
  8. Dai L, Yi J L. Property (ω) and Hypercyclic Property for Operators[J]. Wuhan University Journal of Natural Sciences, 2024, 29(6): 499-507. [CrossRef] [EDP Sciences] [Google Scholar]
  9. Zhu S, Li C G, Zhou T T. Weyl type theorems for functions of operators [J]. Glasgow Mathematical Journal, 2012, 54(3): 493-505. [CrossRef] [MathSciNet] [Google Scholar]
  10. Berkani M, Kachad M. New Browder and weyl type theorems[J]. Bulletin of the Korean Mathematical Society, 2015, 52(2): 439-452. [CrossRef] [MathSciNet] [Google Scholar]
  11. Yang L L, Cao X H. Property (R) for functions of operators and its perturbations[J]. Mediterranean Journal of Mathematics, 2022, 19(1): 25. [CrossRef] [Google Scholar]
  12. Ren Y X, Jiang L N, Kong Y Y. Property Formula and topological uniform descent [J]. Bulletin of the Belgian Mathematical Society - Simon Stevin, 2022, 29(1): 1-17. [MathSciNet] [Google Scholar]
  13. Grabiner S. Uniform ascent and descent of bounded operators[J]. Journal of the Mathematical Society of Japan, 1982, 34(2): 317-337. [CrossRef] [MathSciNet] [Google Scholar]
  14. Rakočević V. Semi-Browder operators and perturbations[J]. Studia Mathematica, 1997, 122(2): 131-137. [CrossRef] [MathSciNet] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.