Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 28, Number 5, October 2023
Page(s) 392 - 398
DOI https://doi.org/10.1051/wujns/2023285392
Published online 10 November 2023

© Wuhan University 2023

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 research of Weyl type theorem is an important subject in spectral theory. In 1909, Weyl discovered Weyl's theorem when he studied the spectrum of the self-adjoint operator[1]. Then Harte and Lee defined Browder's theorem[2]. Rakočević gave two other variations of Weyl's theorem: a-Weyl's theorem and a-Browder's theorem[3,4]. These generalizations are called Weyl type theorems by scholars. The study on Weyl type theorems can well reflect the structural characteristics of spectrums. Hence the research of Weyl type theorem has attracted much attention and got many good results in resent years[5-7]. In this paper, we mainly study a-Browder's theorem and a-Weyl's theorem for bounded linear operators and operator functions by means of the property of the topological uniform descent.

In 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 R(T)Mathematical equation is closed and n(T)<Mathematical equation. We say that TMathematical equation is a lower semi-Fredholm operator when d(T)Mathematical equation<Mathematical equation. 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. 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". We call TMathematical equation a Drazin invertible operator if asc(T)Mathematical equation=des(T)<Mathematical equation. Let σ(T)Mathematical equation be the spectrum of TMathematical equation. The approximate point spectrum of TMathematical equation is denoted by σa(T)Mathematical equation. The Weyl spectrum σw(T)Mathematical equation, the upper semi-Fredholm spectrum σSF+(T)Mathematical equation, the Browder spectrum σb(T)Mathematical equation, the Drazin spectrum σD(T)Mathematical equation, are defined by σw(T)={λC:T-λIMathematical equation is not Weyl}Mathematical equation(CMathematical equation denotes the set of complex numbers ), σSF+(T)Mathematical equation={λMathematical equationC:T-λIMathematical equation is not upper semi-Fredholm}Mathematical equation, σb(T)Mathematical equation={λC:T-λIMathematical equation is not Browder}Mathematical equation, σD(T)Mathematical equation={λC:T-λIMathematical equation is not Drazin invertible}Mathematical equation. Let ρ(T)=Mathematical equationC\σ(T)Mathematical equation, ρa(T)=Mathematical equationC\σa(T)Mathematical equation, ρw(T)=Mathematical equationC\σw(T)Mathematical equation, ρSF+(T)=Mathematical equationC\σSF+(T)Mathematical equation, ρb(T)=Mathematical equationC\σb(T)Mathematical equation, ρD(T)=Mathematical equationC\σD(T)Mathematical equation. For a set ECMathematical equation, we write isoEMathematical equation (accEMathematical equation) for the set of isolated (accumulation) points of EMathematical equation, and we denote intEMathematical equation (EMathematical equation) for interior (boundary) points set of EMathematical equation. If λ0=σ(T)Mathematical equationρD(T)Mathematical equation, then λ0Mathematical equation is a pole of TMathematical equation. TB(H)Mathematical equation is called an a-isoloid operator if isoσa(T)Mathematical equationσp(T)Mathematical equation, where σp(T)Mathematical equation={λC:n(T-λI)>0}Mathematical equation.

T B ( H ) Mathematical equation satisfies a-Browder's theorem if

σ a b ( T ) = σ e a ( T ) Mathematical equation

where σab(T)Mathematical equation={λC:T-λIMathematical equation is not upper semi-Fredholm or asc(T-λI)=Mathematical equation}Mathematical equation and σea(T)=Mathematical equation{λC:T-λIMathematical equation is not upper semi-Fredholm or ind(T-λI)>0Mathematical equation}Mathematical equation. Let ρea(T)=Mathematical equationC\σea(T)Mathematical equation and ρab(T)=Mathematical equationC\σab(T)Mathematical equation. The a-Weyl's theorem holds for TMathematical equation if and only if

σ a ( T ) \ σ e a ( T ) = π 00 a ( T ) Mathematical equation

where we write π00a(T)Mathematical equation={λisoσa(T):0<n(T-λI)<}Mathematical equation. It can be shown that a-Weyl's theorem Mathematical equation a-Browder's theorem, but the converse is not true. Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=Mathematical equation(0,0,x22,x33,)Mathematical equation. Then σ(T)=σa(T)=σea(T)=σab(T)={0}Mathematical equation and π00a(T)={0}Mathematical equation. So TMathematical equation satisfies a-Browder's theorem, but a-Weyl's theorem does not hold for TMathematical equation.

If TB(H)Mathematical equation satisfies N(T)n=1R(Tn)Mathematical equation, then TMathematical equation is called a Sapher operator[8,9]. The Sapher spectrum is σs(T)Mathematical equation={λC:T-λIMathematical equation is not Sapher operator}Mathematical equation. Goldberg defined σc(T)=Mathematical equation{λC:R(T-λI)Mathematical equation is not closed}Mathematical equation[10]. TMathematical equation is called a Kato operator if R(T)Mathematical equation is closed and N(T)n=1R(Tn)Mathematical equation. Therefore, the Kato spectrum is σk(T)=σc(T)σs(T)Mathematical equation.

Let TB(H)Mathematical equation, 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 by kn(T)Mathematical equation the dimension of the null space of the induced map and put k(T)=n=0kn(T)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[11]. If TMathematical equation is upper semi-Fredholm, then TMathematical equation has topological uniform descent. Let ρτ(T)Mathematical equation={λC:T-λIMathematical equation has topological uniform descent}Mathematical equation, and στ(T)=Mathematical equationC\ρτ(T)Mathematical equation. We will use the following property which is discovered by Grabiner (Ref.[11], Corollary 4.9):

Lemma 1   Let TB(H)Mathematical equation, λσ(T)Mathematical equation. If T-λIMathematical equation has topological uniform descent, then λρD(T)Mathematical equation.

On the basis of analyzing distribution of various spectrums of bounded linear operators, the sufficient and necessary conditions holding a-Browder's theorem and a-Weyl's theorem are established by means of the property of the topological uniform descent. In addition, the new judgements of a-Browder's theorem and a-Weyl's theorem for operator function are discussed.

1 Judgement of A-Browder's Theorem and A-Weyl's Theorem for Bounded Linear Operator

First, we describe a-Browder's theorem by the relation between topological uniform descent and σb(T)Mathematical equation.

Theorem 1   T B ( H ) Mathematical equation satisfies a-Browder's theorem if and only if σb(T)=στ(T)intσea(T)Mathematical equationacc{λMathematical equationρab(T):n(T-λI)d(T-λI)}{λC:n(T-λI)=}Mathematical equation.

Proof   "Mathematical equation". Suppose

λ 0 σ τ ( T ) i n t σ e a ( T ) a c c { λ ρ a b ( T ) : n ( T - λ I ) d ( T - λ I ) } { λ C : n ( T - λ I ) = } . Mathematical equation

Then there exists a deleted neighborhood B(λ0;ε)Mathematical equation centered on λ0Mathematical equation such that for any μB(λ0;ε)Mathematical equation, μacc{λρab(T):n(T-λI)d(T-λI)}Mathematical equation. Moreover, for any deleted neighborhood B(λ0)Mathematical equation, there exists μ0B(λ0)Mathematical equation such that μ0ρea(T)Mathematical equation. Let B(λ0)B(λ0;ε)Mathematical equation, then we will get that T-μ0IMathematical equation is Browder operator since TMathematical equation satisfies a-Browder's theorem and λ0acc{λρab(T):n(T-λI)Mathematical equationd(T-λI)}Mathematical equation. It follows that λ0ρ(T)σ(T)Mathematical equation. Since λ0ρτ(T)Mathematical equation, n(T-λ0I)<Mathematical equation, we know that λ0σb(T)Mathematical equation according to Lemma 1.

"Mathematical equation". It's clear that

ρ e a ( T ) [ σ τ ( T ) i n t σ e a ( T ) { λ C : n ( T - λ I ) = } ] = Mathematical equation

Suppose λ0ρea(T)Mathematical equationacc{λρab(T):n(T-λI)d(T-λI)}Mathematical equation. According to perturbation theorem of semi-Fredholm operator, there exists ε>0Mathematical equation such that μρa(T)Mathematical equation if 0<|μ-λ0|<εMathematical equation. Then λ0isoσa(T)ρa(T)Mathematical equation. It follows that λ0Mathematical equationρab(T)Mathematical equation. If λ0ρea(T)Mathematical equation and λ0Mathematical equationacc{λρab(T):n(T-λI)d(T-λI)}Mathematical equation, then T-λ0IMathematical equation is Browder operator. Therefore, a-Browder's theorem holds for TMathematical equation.

Remark 1   (i) In Theorem 1, suppose TB(H)Mathematical equation satisfies a-Browder's theorem, then each part of the decomposition of σb(T)Mathematical equation cannot be deleted.

(a) Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=Mathematical equation(0,x1,x22,x33,)Mathematical equation. Then σea(T)=σab(T)=Mathematical equationσb(T)Mathematical equation={0}Mathematical equation, TMathematical equation satisfies a-Browder's theorem.

But intσea(T)acc{λρab(T):n(T-λI)d(T-λI)}{λC:n(T-λI)=}=Mathematical equation. Thus στ(T)Mathematical equation cannot be deleted.

(b) Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(x2,x3,x4,)Mathematical equation. We can get that σea(T)=σab(T)=Mathematical equationσb(T)={λC:|λ|1}Mathematical equation, a-Browder's theorem holds for TMathematical equation. However, σb(T)στ(T)Mathematical equationacc{λMathematical equationρab(T):Mathematical equationn(T-λI)d(T-λI)}Mathematical equation{λC:Mathematical equationn(T-λI)=}Mathematical equation,

which means intσea(T)Mathematical equation cannot be deleted.

(c) Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(0,x1,x2,)Mathematical equation. Then σea(T)=σab(T)=Mathematical equation{λC:Mathematical equation|λ|=1}Mathematical equation. TMathematical equation satisfies a-Browder's theorem. But σb(T)={λC:|λ|1}στ(T)intσea(T)Mathematical equation{λC:Mathematical equationn(T-λI)=}Mathematical equation. Therefore acc{λρab(T):n(T-λI)d(T-λI)}Mathematical equation cannot be deleted.

(d) Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(0,x2,x3,)Mathematical equation. We have σea(T)=σab(T)=σb(T)Mathematical equation={1}Mathematical equation, which implies a-Browder's theorem holds for TMathematical equation. Since στ(T)intσea(T)Mathematical equationacc{λρab(T):Mathematical equationn(T-λI)d(T-λI)}=Mathematical equation, {λC:Mathematical equationn(T-λI)=}Mathematical equation cannot be deleted.

(ii) Since σ(T)=σb(T)σ0(T)Mathematical equation, TMathematical equation satisfies a-Browder's theorem if and only if σ(T)=στ(T)intσea(T)acc{λMathematical equationρab(T):n(T-λI)d(T-λI)}{λC:Mathematical equationn(T-λI)=}σ0(T)Mathematical equation.

(iii) By Theorem 1, if σb(T)=στ(T)Mathematical equation, then TMathematical equation satisfies a-Browder's theorem. But the converse is not true. Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(0,x1,x2,)Mathematical equation. We can get that a-Browder's theorem holds for TMathematical equation, but στ(T)={λC:|λ|=1}σb(T)Mathematical equation.

(iv) σb(T)=στ(T)TMathematical equation satisfies a-Browder's theorem and ρτ(T)ρw(T){λisoσw(T):Mathematical equationn(T-λI)<}Mathematical equation.

In fact, σb(T)=στ(T)Mathematical equation yields ρτ(T)=ρb(T)ρw(T){λisoσw(T):Mathematical equationn(T-λI)<}Mathematical equation.

For the converse, since [ρw(T){λisoσw(T):n(T-λI)<}][intσea(T)Mathematical equationacc{λMathematical equationρab(T):Mathematical equationn(T-λI)d(T-λI)}{λC:n(T-λI)=}]=Mathematical equation, by Theorem 1 we get ρτ(T)ρb(T)Mathematical equation.

(v) σD(T)=στ(T)TMathematical equation satisfies a-Browder's theorem and ρτ(T)=ρw(T)EMathematical equation, where EMathematical equation is denumerable.

"Mathematical equation". It is clear that σb(T)=σD(T){λC:n(T-λI)=}Mathematical equation. Then we can get that TMathematical equation satisfies a-Browder's theorem by Theorem 1. Since ρw(T)ρτ(T)=ρD(T)ρw(T)EMathematical equation, we have that ρτ(T)=Mathematical equationρw(T)Mathematical equationEMathematical equation. Since Eisoσ(T)Mathematical equation, it follows that EMathematical equation is denumerable.

"Mathematical equation". Suppose that λ0ρτ(T)Mathematical equation. If λ0ρw(T)Mathematical equation, then λ0σD(T)Mathematical equation by a-Browder's theorem holds for TMathematical equation. If λ0Eσw(T)Mathematical equation, then there exists a neighborhood B(λ0;ε)Mathematical equation centered on λ0Mathematical equation such that B(λ0;ε)ρτ(T)Mathematical equation=ρw(T)EMathematical equation. Since EMathematical equation is denumerable, for any B(λ0;δ)B(λ0;ε)Mathematical equation, there exists μ0B(λ0;δ)Mathematical equation such that T-μ0IMathematical equation is Weyl operator. It follows that λ0σ(T)Mathematical equation since TMathematical equation satisfies a-Browder's theorem. We can also get λ0σD(T)Mathematical equation.

By Theorem 1, the following results can be obtained.

Corollary 1   Let TB(H)Mathematical equation. The following statements are equivalent:

(1) TMathematical equation satisfies a-Browder's theorem;

(2) σb(T)=στ(T)accσea(T)Mathematical equationacc{λρab(T):n(T-λI)d(T-λI)}{λC:n(T-λI)=Mathematical equation}Mathematical equation;

(3) σb(T)=στ(T)accσea(T)Mathematical equationaccσk(T)acc[ρa(T)σ(T)]{λC:n(T-λI)=}Mathematical equation;

(4) σb(T)=στ(T)intσea(T)Mathematical equationaccσk(T)acc[ρa(T)σ(T)]{λC:n(T-λI)=}Mathematical equation;

(5) σb(T)=στ(T)accσea(T)Mathematical equationintσk(T)acc[ρa(T)σ(T)]{λC:n(T-λI)=}Mathematical equation.

Proof   (1)Mathematical equation(2). Using Theorem 1, we have σb(T)=στ(T)intσea(T)acc{λρab(T):n(T-λId(T-λI)}{λMathematical equationC:n(T-λI)=}Mathematical equationwhen TMathematical equation satisfies a-Browder's theorem. Since intσea(T)accσea(T)Mathematical equation, it follows that (2) holds.

(2)Mathematical equation(3). Let λ0{λρab(T):n(T-λI)d(T-λI)}Mathematical equation and T-λ0IMathematical equation is Kato operator. Then λ0Mathematical equationρa(T)σ(T)Mathematical equation (Ref. [12], Lemma 3.4). Therefore {λρab(T):n(T-λI)d(T-λI)}σk(T)[ρa(T)Mathematical equationσ(T)]Mathematical equation. By (2) we know that (3) holds.

(3)Mathematical equation(4). Suppose λ0στ(T)intσea(T)accσk(T)acc[ρa(T)σ(T)]{λC:Mathematical equationn(T-λI)Mathematical equation=}Mathematical equation. Then there exists a deleted neighborhood B(λ0;ε)Mathematical equation centered on λ0Mathematical equation such that for any μB(λ0;ε)Mathematical equation, μρa(T)σ(T)Mathematical equation. Since λ0intσea(T)Mathematical equation, for any B(λ0;δ)Mathematical equation, there exists μ0B(λ0;δ)Mathematical equation such that μ0Mathematical equationρea(T)Mathematical equation. Let δ<εMathematical equation, it follows that

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

Thus we can get T-μ0IMathematical equation is Browder operator by (3). From the proof of Theorem 1, we have λ0σb(T)Mathematical equation.

(4)Mathematical equation(5). Let λ0στ(T)accσea(T)intσk(T)acc[ρa(T)σ(T)]{λC:Mathematical equationn(T-λI)Mathematical equation=}Mathematical equation. Then there exists a deleted neighborhood B(λ0;ε)Mathematical equation centered on λ0Mathematical equation such that for any μB(λ0;ε)Mathematical equation, μρa(T)σ(T)Mathematical equation and μρea(T)Mathematical equation. Since λ0intσk(T)Mathematical equation, we know that for any B(λ0)B(λ0;ε)Mathematical equation, there exists

μ 0 σ τ ( T ) i n t σ e a ( T ) a c c σ k ( T ) a c c [ ρ a ( T ) σ ( T ) ] { λ C : n ( T - λ I ) = } .   Mathematical equation

It follows that T-μ0IMathematical equation is Browder operator. This implies that (5) holds.

(5)Mathematical equation(1). It is clear that

ρ e a ( T ) [ σ τ ( T ) a c c σ e a ( T ) i n t σ k ( T ) { λ C : n ( T - λ I ) = } ] = .   Mathematical equation

If λ0ρea(T)Mathematical equationacc[ρa(T)σ(T)]Mathematical equation, then λ0isoσa(T)ρa(T)Mathematical equation, therefore λ0ρab(T)Mathematical equation. If λ0ρea(T)Mathematical equation and λ0acc{λρab(T):n(T-λI)d(T-λI)}Mathematical equation, then T-λ0IMathematical equation is Browder operator. We can conclude that TMathematical equation satisfies a-Browder's theorem.

Corollary 2   Let TB(H)Mathematical equation. The following statements are equivalent:

(1) TMathematical equation satisfies a-Browder's theorem;

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

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

a c c σ ( T ) ] Mathematical equation

Proof   (1)Mathematical equation(2). We only need to prove

σ a b ( T ) σ τ ( T ) a c c σ e a ( T ) [ a c c { λ C : n ( T - λ I ) < d ( T - λ I ) } a c c σ k ( T ) ] { λ C : n ( T - λ I ) = } [ i s o σ a ( T ) σ c ( T ) ] Mathematical equation.Suppose λ0στ(T)accσea(T)[acc{λC:n(T-λI)<d(T-λI)}accσk(T)]{λC:n(T-λI)=}[isoσa(T)σc(T)]Mathematical equation. Then there exists a deleted neighborhood B(λ0;ε1)Mathematical equation centered on λ0Mathematical equation such that for any μB(λ0;ε1)Mathematical equation, μρea(T)Mathematical equation. If λ0acc{λC:n(T-λI)<d(T-λI)}Mathematical equation, there exists B(λ0;ε2)Mathematical equation such that for any μB(λ0;ε2)Mathematical equation, n(T-μI)>d(T-μI)Mathematical equation. Let ε=min{ε1,ε2}Mathematical equation. It follows that for any μMathematical equationB(λ0;ε)Mathematical equation, T-μIMathematical equation is Weyl operator. From the a-Browder's theorem holds for TMathematical equation and the proof of Theorem 1, we can get that T-λ0IMathematical equation is Browder operator. If λ0accσk(T)Mathematical equation, then there exists a deleted neighborhood B(λ0;δ)Mathematical equation centered on λ0Mathematical equation such that for any μB(λ0;δ)Mathematical equation, μρa(T)Mathematical equation since TMathematical equation satisfies a-Browder's theorem. Therefore λ0ρa(T)isoσa(T)Mathematical equation. Moreover, by n(T-λ0I)<0Mathematical equation and λ0ρc(T)=C\σc(T)Mathematical equation, we know that λ0σab(T)Mathematical equation.

(2)Mathematical equation(3). It is clear that σb(T)=σab(T)[σb(T)ρab(T)]=στ(T)accσea(T)[acc{λC:n(T-λI)<d(T-λI)accσk(T)]Mathematical equation{λC:Mathematical equationn(T-λI)=}Mathematical equation[isoσa(T)σc(T)]Mathematical equation[σb(T)ρab(T)]Mathematical equation. Since isoσa(T)σc(T)isoσ(T)=isoσ(T)σc(T)[isoσ(T)Mathematical equationσc(T){λC:n(T-λI)=}]Mathematical equation[isoσ(T)σc(T){λC:n(T-λI)<}]Mathematical equation, and isoσ(T)σc(T){λC:n(T-λI)<}στ(T)Mathematical equation, we can get that isoσa(T)σc(T)[isoσa(T)accσ(T)]{λC:n(T-λI)=}στ(T)Mathematical equation. Also, ρab(T)σb(T)[ρa(T)Mathematical equationaccσ(T)][isoσa(T)accσ(T)]Mathematical equation. Then we have

σ b ( T ) σ τ ( T ) a c c σ e a ( T ) [ a c c { λ C : n ( T - λ I ) < d ( T - λ I ) } a c c σ k ( T ) ] { λ C : n ( T - λ I ) = } [ ( ρ a ( T ) i s o σ a ( T ) ) a c c σ ( T ) ] .   Mathematical equation

Hence (2)Mathematical equation(3) is true.

(3)Mathematical equation(1). We know that ρea(T)[στ(T)accσea(T)Mathematical equation{λC:Mathematical equationn(T-λI)=}]=Mathematical equation, and ρea(T)[acc{λC:n(T-λI)<n(T-λI)}accσk(T)]=Mathematical equation. If λ0ρea(T)[(ρa(T)isoσa(T))Mathematical equationaccσ(T)]Mathematical equation, then λ0ρab(T)Mathematical equation. If λ0ρea(T)Mathematical equation and λ0[ρa(T)isoσa(T)]accσ(T)Mathematical equation, then T-λ0IMathematical equation is Browder operator. Thus TMathematical equation satisfies a-Browder's theorem.

In the following, we will discuss the a-Weyl's theorem for TMathematical equation.

Theorem 2   Let TB(H)Mathematical equation. The following statements are equivalent:

(1) TMathematical equation satisfies a-Weyl's theorem;

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

σ a ( T ) : n ( T - λ I ) = 0 } Mathematical equation;

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

Proof   (1)Mathematical equation(2). Since TMathematical equation satisfies a-Weyl's theorem, we know that π00a(T)στ(T)=Mathematical equation, π00a(T)Mathematical equationσc(T)=Mathematical equation. From Corollary 2, we have σab(T)=στ(T)accσea(T)[acc{λC:n(T-λI)<d(T-λI)}accσk(T)]{λC:n(T-λI)=}Mathematical equation[isoσa(T)σc(T)]Mathematical equation. Moreover, στ(T)=[στ(T)Mathematical equationaccσa(T)][στ(T)isoσa(T)]Mathematical equation. Since [στ(T)isoσa(T)]=[στ(T)isoσa(T)Mathematical equation{λC:n(T-λI)=}][στ(T)isoσa(T){λC:n(T-λI)=0}][στ(T)isoσa(T){λC:0<n(T-λI)<}]{λC:Mathematical equationn(T-λI)=}{λσa(T):n(T-λI)=0}[στ(T)π00a(T)]{λC:n(T-λI)=}{λσa(T):n(T-λI)=0}Mathematical equation. We get στ(T)Mathematical equation[στ(T)accσa(T)]{λC:n(T-λI)=}Mathematical equation{λσa(T):n(T-λI)=0}Mathematical equation.

Also, isoσa(T)σc(T)[isoσa(T)σc(T){λC:n(T-λI)=}][isoσa(T)σc(T){λC:n(T-λI)=0}][isoσa(T)Mathematical equationσc(T){λC:0<n(T-λI)<}]Mathematical equation{λC:n(T-λI)=}Mathematical equation{λσa(T):n(T-λI)=0}Mathematical equation[σc(T)π00a(T)]Mathematical equation{λC:n(T-λI)=}Mathematical equation{λσa(T):n(T-λI)Mathematical equation=0}Mathematical equation. Hence σab(T)[στ(T)accσa(T)]accσea(T)[acc{λC:n(T-λI)<d(T-λI)}accσk(T)]Mathematical equation{λC:n(T-λI)=}Mathematical equation{λσa(T):n(T-λI)=0}Mathematical equation. Then we know that (2) holds.

(2)Mathematical equation(3). Since σb(T)=[σb(T)σab(T)][σb(T)ρab(T)]=σab(T)[σb(T)ρab(T)]Mathematical equation and σb(T)ρab(T)=accσ(T)Mathematical equationρab(T)Mathematical equation, it follows that σb(T)=[στ(T)accσa(T)]accσea(T)[acc{λC:n(T-λI)<d(T-λI)}accσk(T)]{λC:Mathematical equationn(T-λI)=}[ρab(T)accσ(T)]Mathematical equation{λMathematical equationσa(T):Mathematical equationn(T-λI)=0}Mathematical equation.

(3)Mathematical equation(1). [σa(T)\σea(T)][στ(T)accσa(T)]=Mathematical equation, [σa(T)\σea(T)][accσea(T){λC:Mathematical equationn(T-λI)=}{λσa(T):n(T-λI)Mathematical equation=0}]=Mathematical equation, [σa(T)\σea(T)][acc{λC:n(T-λI)<d(T-Mathematical equationλI)accσk(T)]=Mathematical equation. If λ0σa(T)\σea(T)Mathematical equation and λ0ρab(T)accσ(T)Mathematical equation, then T-λ0IMathematical equation is Browder operator. Moreover, [σa(T)\σea(T)][ρab(T)accσ(T)]π00a(T)Mathematical equation. Therefore σa(T)\σea(T)π00a(T)Mathematical equation. Similarly, we can prove that π00a(T)σa(T)\σea(T)Mathematical equation. So the a-Weyl's theorem holds for TMathematical equation.

Remark 2   (i) By Theorem 2, we can get that if σb(T)=στ(T)accσa(T)Mathematical equation, then TMathematical equation satisfies a-Weyl's theorem. But the converse is not true. Let TB(l2)Mathematical equation be defined by T(x1,x2,x3,)=(x2,x3,x4,)Mathematical equation. Then TMathematical equation satisfies a-Weyl's theorem, but σb(T)στ(T)accσa(T)Mathematical equation.

(ii) σb(T)=στ(T)accσa(T)TMathematical equation satisfies a-Weyl's theorem, ρτ(T)π00a(T)=isoσa(T)Mathematical equation and σa(T)=σ(T)Mathematical equation.

In fact, suppose that σb(T)=στ(T)accσa(T)Mathematical equation. Then ρa(T)ρb(T)Mathematical equation, so σa(T)=σ(T)Mathematical equation. Similarly, since isoσa(T)ρb(T)Mathematical equation and ρτ(T)ρb(T)Mathematical equation, we know that ρτ(T)π00a(T)=isoσa(T)Mathematical equation.

For the converse, let λ0στ(T)accσa(T)Mathematical equation. If λ0ρa(T)Mathematical equation, then T-λ0IMathematical equation is invertible. If λ0isoσa(T)=isoσ(T)Mathematical equation, we can get that T-λ0IMathematical equation is Browder operator by π00a(T)=isoσa(T)Mathematical equation and the a-Weyl's theorem holds for TMathematical equation. If λ0ρτ(T)Mathematical equation, by ρτ(T)π00a(T)=π00(T)Mathematical equation we can get T-λ0IMathematical equation is Browder operator.

2 Judgement of A-Browder's Theorem and A-Weyl's Theorem for Operator Function

In the following, we will research the a-Browder's theorem and a-Weyl's theorem for operator function by means of the property of the topological uniform descent.

Theorem 3   Let TB(H)Mathematical equation. Then for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Browder's theorem if and only if

(1) TMathematical equation satisfies a-Browder's theorem;

(2) If ρSF++(T)={λρSF+(T):ind(T-λI)>0}Mathematical equation, then ρτ(T)intσea(T){λC:n(T-λI)Mathematical equation=}ρb(T)Mathematical equation.

Proof   Suppose p(T)Mathematical equation satisfies a-Browder's theorem for any polynomial pMathematical equation. We only need to prove (2) holds. We can assert that if ρSF++(T)Mathematical equation, then for any λρSF+(T)Mathematical equation, ind(T-λI)0Mathematical equation. In fact, suppose there exists λ1ρSF+(T)Mathematical equation, ind(T-λ1I)=-m<0Mathematical equation where mMathematical equation is finite or m=+Mathematical equation. Let λ2ρSF++(T)Mathematical equation, ind(TMathematical equation-λ2I)=n>0Mathematical equation. We can see that nMathematical equation is finite. If m<+Mathematical equation, let p0(T)=(T-λ1I)n(T-λ2I)mMathematical equation. Moreover, let p0(T)=(T-λ1I)(T-λ2I)Mathematical equation if m=+Mathematical equation. Then 0ρea(p0(T))=ρab(p0(T))Mathematical equation. It follows that asc(TMathematical equation-λ2I)<Mathematical equation. It is in contradiction to the fact that ind(TMathematical equation-λ2I)>0Mathematical equation. Then we will prove that ρτ(T)intσea(T){λMathematical equationC:n(T-λI)=}ρb(T)Mathematical equation. If λ0ρτ(T)Mathematical equation and λ0intσea(T){λC:n(T-λI)=}Mathematical equation, then for any deleted neighborhood B(λ0)Mathematical equation centered on λ0Mathematical equation, there exists μ0B(λ0)Mathematical equation such that μ0ρea(T)Mathematical equation. Since for any λρSF+(T)Mathematical equation, ind(T-λI)0Mathematical equation, we know that T-μ0IMathematical equation is Weyl operator. By TMathematical equation satisfing a-Browder's theorem, we can get T-μ0IMathematical equation is Browder operator. Thus λ0σ(T)ρ(T)Mathematical equation. From λ0ρτ(T)Mathematical equation and n(T-Mathematical equationλ0I)<Mathematical equation, we conclude that T-λ0IMathematical equation is Browder operator.

For the converse, if ρSF++(T)=Mathematical equation, then for any λρSF+(T)Mathematical equation, ind(T-λI)0Mathematical equation. If ρSF++(T)Mathematical equation, we can get that ρSF+-(T)={λρSF+(T):ind(T-λI)<0}=Mathematical equation since ρSF+-(T)ρτ(T)Mathematical equation but ρSF+-(T)Mathematical equation[intσea(T)Mathematical equation{λC:n(T-λI)=}]=Mathematical equation. Let μ0ρea(p(T))Mathematical equation and p(T)-μ0I=a(T-λ1I)n1Mathematical equation(T-λ2I)n2Mathematical equation(T-λtI)ntMathematical equation, where λiλj(ij)Mathematical equation and μ0=p(λi)Mathematical equation, 1itMathematical equation. It follows that T-λiIMathematical equation is upper semi-Fredholm operator and ind(T-λiI)0Mathematical equation for all λiMathematical equation. From TMathematical equation satisfing a-Browder's theorem, we have that asc(T-λiI)Mathematical equation<(1it)Mathematical equation. Hence μ0ρab(p(T))Mathematical equation, p(T)Mathematical equation satisfies a-Browder's theorem.

By Theorem 3 and the proof procedure, we can get the following results.

Corollary 3   Let TB(H)Mathematical equation. Then for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Browder's theorem if and only if

(1) TMathematical equation satisfies a-Browder's theorem;

(2) If ρSF++(T)Mathematical equation, then ρτ(T)accσea(T){λC:n(T-λI)Mathematical equation=}ρb(T)Mathematical equation.

Remark 3   (i) Suppose ρτ(T)intσea(T){λC:n(T-λI)Mathematical equation=}ρb(T)Mathematical equation, then TMathematical equation satisfies a-Browder's theorem and ρSF+-(T)=Mathematical equation. This implies that for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Browder's theorem. However, the converse is not true. Let T(x1,x2,x3,)=(0,x1,x2,)Mathematical equation. The a-Browder's theorem holds for p(T)Mathematical equation, but ρτ(T)intσea(T){λC:n(T-λI)Mathematical equation=}ρb(T)Mathematical equation.

ρ τ ( T ) i n t σ e a ( T ) { λ C : n ( T - λ I ) Mathematical equation = } ρ b ( T ) Mathematical equation for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Browder's theorem, σea(T)=σw(T)Mathematical equation.

In fact, suppose ρτ(T)intσea(T){λC:n(T-λI)Mathematical equation=}ρb(T)Mathematical equation. This implies that ρSF+-(T)=Mathematical equation. So σea(T)=σw(T)Mathematical equation.

For the converse, let λ0ρτ(T)Mathematical equation and λ0intσea(T){λC:n(T-λI)=}Mathematical equation. Then for any deleted neighborhood B(λ0)Mathematical equation centered on λ0Mathematical equation, there exists μ0B(λ0)Mathematical equation such that μ0ρea(T)=ρw(T)Mathematical equation. Thus T-Mathematical equationμ0IMathematical equation is Browder operator. So λ0σ(T)ρ(T)Mathematical equation. By λ0ρτ(T)Mathematical equation and n(T-λ0I)<Mathematical equation, we know that T-λ0IMathematical equation is Browder operator.

(ii) ρτ(T)accσea(T){λC:n(T-λI)Mathematical equation=}ρb(T)Mathematical equation for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Browder's theorem, σea(T)=σw(T)Mathematical equation.

In the following, we will establish sufficient and necessary conditions for operator functions holding a-Weyl's theorem.

Theorem 4   Let TB(H)Mathematical equation. Then TMathematical equation is a-isoloid and for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Weyl's theorem if and only if:

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

a c c σ ( T ) ] Mathematical equation;

(2) If ρSF++(T)Mathematical equation, then ρτ(T)intσea(T){λC:n(T-λI)Mathematical equation=}ρb(T)Mathematical equation.

Proof   "Mathematical equation". First, we will prove that TMathematical equation is a-isoloid. If there exists λ0isoσa(T)Mathematical equation and n(T-λ0I)=0Mathematical equation, then λ0[στ(T)accσa(T)]accσea(T)Mathematical equation[acc{λC:n(T-λI)<d(T-λI)}accσk(T)]Mathematical equation{λMathematical equationC:n(T-λI)=}Mathematical equation. If λ0ρab(T)Mathematical equationaccσ(T)Mathematical equation, then λ0ρa(T)Mathematical equation. It is a contradiction. If λ0ρab(T)Mathematical equationaccσ(T)Mathematical equation, then T-λ0IMathematical equation is Browder operator, so λ0ρ(T)Mathematical equation. It is a contradiction too. Thus TMathematical equation is a-isoloid. From (1) we know that TMathematical equation satisfies a-Browder's theorem. By Theorem 3, we have that for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Browder's theorem. Suppose μ0π00a(p(T))Mathematical equation, let p(T)-μ0I=a(T-λ1I)n1Mathematical equation(T-λ2I)n2Mathematical equation(T-λtI)ntMathematical equation, where λiλj(ij)Mathematical equation and μ0=p(λi)Mathematical equation, 1itMathematical equation. BecauseTMathematical equation is a-isoloid, we get that λiπ00a(T)Mathematical equation. From (1) and the proof of Theorem 3, we have π00a(T)σa(T)\σea(T)Mathematical equation. Then λiρab(T)Mathematical equation, hence μ0Mathematical equationρab(p(T))Mathematical equation. Thus for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Weyl's theorem.

"Mathematical equation". By Theorem 3 we know (2) holds. Suppose λ0[στ(T)accσa(T)]accσea(T)[acc{λC:n(T-λI)<d(T-λI)}accσk(T)]{λC:n(T-λI)=}[ρab(T)accσ(T)]Mathematical equation. If λ0accσa(T)Mathematical equation, then λ0ρab(T)Mathematical equation. In fact, if λ0isoσa(T)Mathematical equation, from TMathematical equation is a-isoloid we can get that λ0π00a(T)Mathematical equation. Hence λ0ρab(T)Mathematical equation. Since λ0ρab(T)accσ(T)Mathematical equation, it follows that T-λ0IMathematical equation is Browder operator. If λ0στ(T)Mathematical equation, from the proof of Theorem 2, we get (1) holds.

Remark 4   (i) By Theorem 2, we can get that if σb(T)=στ(T)accσa(T)Mathematical equation, then for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Weyl's theorem. But from Remark 2(ii), we know that the converse is not true. However,

σ b ( T ) = σ τ ( T ) a c c σ a ( T ) Mathematical equation for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Weyl's theorem, ρτ(T)Mathematical equationπ00a(T)=isoσa(T)Mathematical equation and σa(T)=σ(T)Mathematical equation.

(ii) Let π0fa(T)={λisoσa(T):n(T-λI)<}Mathematical equation. If π0fa(T)ρτ(T)intσea(T){λC:Mathematical equationn(T-λI)=}ρb(T)Mathematical equation, then for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Weyl's theorem. In fact, if μ0π00a(p(T))Mathematical equation, let p(T)-μ0I=a(T-λ1I)n1Mathematical equation(T-λ2I)n2Mathematical equation(T-λtI)ntMathematical equation, where λiλj(ij)Mathematical equation and μ0=p(λi)Mathematical equation, 1itMathematical equation. Then λiπ0fa(T)Mathematical equation. Since ρτ(T)intσea(T){λC:Mathematical equationn(T-λI)=}ρb(T)Mathematical equation, we have λiisoσ(T)Mathematical equation. By λiρτ(T)Mathematical equation we know that T-λiIMathematical equation is Browder operator. Thus p(T)-μ0IMathematical equation is Browder operator. By Remark 3, we can get that p(T)Mathematical equation satisfies a-Weyl's theorem for any polynomial pMathematical equation. But the converse is not true. Let T(x1,x2,x3,)=(0,x1,x2,)Mathematical equation. Then for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Weyl's theorem. However, ρτ(T)intσea(T)Mathematical equation{λC:n(T-λI)=}ρb(T)Mathematical equation.

π 0 f a ( T ) ρ τ ( T ) a c c σ e a ( T ) { λ C : Mathematical equation n ( T - λ I ) = } ρ b ( T ) Mathematical equation if and only if for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Weyl's theorem, TMathematical equation is a-isoloid and σea(T)=σw(T)Mathematical equation.

In fact, if π0fa(T)ρτ(T)accσea(T){λC:Mathematical equationn(T-λI)=}ρb(T)Mathematical equation, we only need to prove TMathematical equation is a-isoloid. If λ0isoσa(T)Mathematical equation and n(T-λ0I)=0Mathematical equation. Then λ0Mathematical equationπ0fa(T)ρτ(T)accσea(T){λC:Mathematical equationn(T-λI)=}ρb(T)Mathematical equation. It follows that T-λ0IMathematical equation is Browder operator. So T-λ0IMathematical equation is invertible. It is in contradiction to the fact that λ0isoσa(T)Mathematical equation.

For the converse, we only need to prove that π0fa(T)ρτ(T)Mathematical equation. Since TMathematical equation is a-isoloid, this implies that π0fa(T)=π00a(T)Mathematical equation. By a-Weyl's theorem holds for TMathematical equation, we get that π0fa(T)ρτ(T)Mathematical equation.

Corollary 4   Let TB(H)Mathematical equation. Then TMathematical equation is a-isoloid and for any polynomial pMathematical equation, p(T)Mathematical equation satisfies a-Weyl's theorem if and only if:

(1) σb(T)=[στ(T)accσa(T)]accσea(T)Mathematical equation[int{λC:n(T-λI)<d(T-λI)}accσk(T)]Mathematical equation{λC:Mathematical equationn(T-λI)=}[ρab(T)Mathematical equationaccσ(T)]Mathematical equation;

(2) ρSF++(T)Mathematical equation, ρτ(T)accσea(T){λC:n(T-λI)Mathematical equation=}ρb(T)Mathematical equation.

References

  1. Weyl H. Über beschränkte quadratische formen, deren differenz vollstetig ist[J]. Rendiconti Del Circolo Matematico Di Palermo, 1909, 27(1): 373-392. [CrossRef] [Google Scholar]
  2. Harte R, Lee W Y. Another note on Weyl's theorem[J]. Transactions of the American Mathematical Society, 1997, 349(5): 2115-2124. [CrossRef] [MathSciNet] [Google Scholar]
  3. Rakočević V. Operators obeying a-Weyl's theorem[J]. Revue Roumaine des Mathematiques Pures et Appliquees, 1989, 34(10): 915-919. [Google Scholar]
  4. Rakočević V. On a class of operators[J]. Mathematicki Vesnik, 1985, 37(4): 423-426. [Google Scholar]
  5. Li C G, Zhu S, Feng Y L. Weyl's theorem for functions of operators and approximation[J]. Integral Equations and Operator Theory, 2010, 67(4): 481-497. [CrossRef] [MathSciNet] [Google Scholar]
  6. Sun C H, Cao X H. Criteria for the property (UWE) and the a-Weyl theorem[J]. Functional Analysis and Its Applications, 2022, 56(3):76-88. [Google Scholar]
  7. Cao X H, Guo M Z, Meng B. Weyl's spectra and Weyl's theorem[J]. Journal of Mathematical Analysis and Applications, 2003, 288(2): 758-767. [CrossRef] [MathSciNet] [Google Scholar]
  8. Saphar P. Contribution à l'étude des applications linéaires dans un espace de Banach[J]. Bulletin de la Societe Mathematique de France, 1964, 92: 363-384. [CrossRef] [MathSciNet] [Google Scholar]
  9. Harte R E. On Kato non-singularity[J]. Studia Mathematica, 1996, 117: 107-114. [CrossRef] [MathSciNet] [Google Scholar]
  10. Goldberg S. Unbounded Linear Operators[M]. New York: McGrawHill, 1966. [Google Scholar]
  11. Grabiner S. Uniform ascent and descent of bounded operaters[J]. Journal of Mathematical Society of Japan, 1982, 34(2): 317-337. [MathSciNet] [Google Scholar]
  12. Taylor A E. Theorems on ascent, descent, nullity and defect of linear operators[J]. Mathematische Annalen, 1966, 163(1): 18-49. [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.