Cowen-Douglas operators and the third of Halmos’ ten problems
Chunlan Jiang, Junsheng Fang and Kui Ji
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, Hebei 050016, China
[email protected]
[email protected]
[email protected], [email protected]
Abstract.
Let T be a bounded linear operator on a complex separable infinite dimensional Hilbert space H. T is called intransitive if it leaves invariant spaces other than 0 or the whole space H; otherwise it is transitive.
In 1970, P. R. Halmos raised ten open problems on operator theory. In the past more than 50 years, nine of Halmos’ ten problems were answered, but only the third one has made little progress. The third problem of Halmos is the following: if an intransitive operator has an inverse, is its inverse also intransitive? In this paper, we establish a set of theoretical systems with the help of Cowen-Douglas operators and spectral analysis. We give an affirmative answer to this problem under certain spectral conditions, which make essential progress in the research of Halmos’ third problem. As the first application, we show that for an invertible hyponormal operator T, if T−1 is intransitive and intσ(T−1)∧ is not connected, then T is also intransitive. As the second application, we show that if T−1 has a proper strictly cyclic invariant subspace and there exists a bounded open set Ω which is a connected component of ρ(T−1) such that Ω∩U0=∅, where U0 is the connected component of int(σ(T−1)∧) containing zero point, then T is intransitive.
1. Introduction
Let H be a complex separable infinite dimensional Hilbert space and B(H) denote the set of bounded linear operators on H.
An operator T∈B(H) is called intransitive if it leaves invariant spaces other than 0 or the whole space H; otherwise it is transitive.
**Invariant subspace problem: **Let T∈B(H). Does T have a nontrivial invariant subspace?
It has been more than a century since the invariant subspace problem was raised, and it is still an open question.
A problem closely related to the famous invariant subspace problem is the third problem of Halmos. In 1970, P. R. Halmos raised ten open problems on operator theory. The third problem of Halmos is the following.
Problem 3 If an intransitive operator has an inverse, is its inverse also intransitive?
The third problem of Halmos can be expressed in the following way: If an invertible operator T has no nontrivial invariant subspaces, does T−1 also have no nontrivial invariant subspaces?
Or equivalently, if every nonzero vector x is a cyclic vector of T, is x also a cyclic vector of T−1.
A nonzero vector x in H is called a cyclic vector of T if span{Tkx}k=0∞=H, where span{Tkx,k≥0} is the norm closure of the linear span of elements in {Tkx}k=0∞.
In 2007, R. G. Douglas, C. Foias and C. Pearcy showed in [9] that
Problem 3 cannot be answered by proving that T and T−1 have the same set of cyclic vectors: three kinds of operators are given for which these two sets of cyclic vectors differ. In 2004, the first author discussed Halmos’ third problem with R.G.Douglas and came up Lemma 5.1 of this paper, which plays a key role in this paper. The first author thanks R.G.Douglas for many stimulating discussions on Halmos’ third problem.
R. G. Douglas, C. Foias and C. Pearcy also pointed out in [9] that the third problem of Halmos is the last unresolved open problem of the ten problems of Halmos. Unfortunately, we only find part of the literature.
In 1972, Problem 1 was solved by P. A. Fillmore, J. G. Stampfli and J. P. Williams in [10].
In 1974, Problem 7 was solved by C. Apostol and D. Voiculescu in [2].
In 1976, Problem 8 was solved by D. Voiculescu in [34].
In 1983, Problem 5 was resolved by C.C.Cowen, J.Long and S. Sun and the readers refer to references [7], [32], [33].
In 1997, Problem 6 was solved by G. Pisier in [28].
For T∈B(H), let σ(T) denote the spectrum of T and ρ(T)=C∖σ(T). Let LatT denote the invariant subspaces lattice of T. For a Hilbert space K⊆H, PK denote the orthogonal projection from H onto K.
Let σ(T)∧ denote the polynomial convex hull of σ(T). For a compact subset K of C, the polynomial convex hull K∧ of K
is defined by ( [31], p23)
[TABLE]
By ([31], p24), σ(T)∧ is the union of σ(T) and all of the bounded connected components of C∖σ(T).
In the past more than 50 years, nine of Halmos’ ten problems were answered, but only the third one has made little progress. In this paper, we have established a set of theoretical systems with the help of Cowen-Douglas operators and spectral analysis, which has made essential progress in the research of Halmos’ third problem. The specific results are as follows:
Theorem A. (Theorem 6.1)
Suppose T∈B(H) is an invertible operator, x is a nonzero noncyclic vector of T−1, and N(x)=span{T−kx:k≥1}. Let T1(x)=PN(x)T−1PN(x). If σ(T1(x))∧∩ρF(T1(x)) has a connected component which does not contain zero point, then T is intransitive.
Theorem B. (Theorem 6.4)
Suppose T∈B(H) is an invertible operator, x is a nonzero noncyclic vector of T−1, and N(x)=span{T−kx:k≥1}. Let T2(x)=PN(x)⊥T−1PN(x)⊥. If σ(T−1)⊆σ(T2(x)) and there exists a bounded open set Ω which is a connected component of ρ(T−1) such that Ω∩U0=∅, where U0 is the connected component of int(σ(T−1)∧) containing zero point, then T is intransitive.
As applications of Theorem A and Theorem B, we have the following results.
Theorem C. (Theorem 7.7)
For an invertible hyponormal operator T∈B(H), if T−1 is intransitive and intσ(T−1)∧ is not connected, then T is also intransitive.
Theorem D. (Theorem 7.11)
For an invertible operator T∈B(H), if T−1 has a proper strictly cyclic invariant subspace and there exists a bounded open set Ω which is a connected component of ρ(T−1) such that Ω∩U0=∅, where U0 is the connected component of int(σ(T−1)∧) containing zero point, then T is intransitive.
The difficulty in solving the third problem of Halmos is that we only have the information that T is invertible. Therefore, if we are able to answer this problem affirmatively, we need to give the operator T more structure; on the other hand, if the answer to this problem is negative, it means that the answer to the invariant subspace problem is also negative.
In view of this reason, we introduce the Cowen-Douglas operators as a bridge to solve this problem. In this paper, we use rigid structures of Cowen-Douglas operators to give partial answers to this problem.
This paper is divided into seven sections, organized as follows. In Section 2, we introduce some basic knowledge about operator spectrum theory. In Section 3, we introduce some results about Cowen-Douglas operators. In Section 4, we discuss cyclic vectors. In Section 5, we will study the operator structures of operators T and T−1 and build up connections between T, T−1 and Cowen-Douglas operators. In Section 6, the proofs of the main theorems are given.
In the last section, we give some applications of the main theorems including the descriptions of invariant subspace of hyponormal operators whose spectrums are not “thick” (In [5], Brown proved that each hypernormal operator with “thick” spectrum has a nontrivial invariant subspace) and invertible operators which have proper strictly cyclic invariant subspaces.
We refer to [3], [5], [11], [12], [14], [15], [17], [24], [25], [30] for more information on Halmos’ third problem and the invariant subspace problem. We refer to [18], [21], [27] for operator theory on Hilbert spaces.
Acknowledgements: C.Jiang, J.Fang and K.Ji contributed equally to this work. The authors thank Professor Cheng Lixin, Ji Youqing, Wang Kai, Wu jinsong, and Zhang yuanhang for many valuable discussions on the paper.
2. Preliminaries
In this paper, H is a complex separable infinite dimensional Hilbert space and B(H) is the set of bounded linear operators on H.
An operator T∈B(H) is called compact if the image of the unit ball of H under T is a compact subset of H.
Let K(H) be the ideal of compact operators in B(H), and
π:B(H)→B(H)/K(H) (Calkin algebra) be the natural homomorphism projection. The essential spectrum of T, σe(T), is the spectrum of π(T) in B(H)/K(H)
and C\σe(T) is called the Fredholm domain of T and is denoted by ρF(T). Operator T is called semi-Fredholm, if \mboxran(T) (the range of T) is closed, and either dimkerT or dimkerT∗ is finite. In this case,
\mboxindT=\mboxdimkerT−\mboxdimkerT∗. A semi-Fredholm operator T is called Fredholm if \mboxindT is finite.
By the famous Atkinson theorem, we know T is Fredholm if and only if π(T) is invertible in B(H)/K(H).
For T∈B(H), let σ(T) denote the spectrum of T and ρ(T)=C∖σ(T). The point spectrum of T, σp(T), is defined by σp(T)={λ:\mboxdimker(T−λ)≥1}. Let LatT denote the invariant subspaces lattice of T.
The definition of strongly irreducible operators was introduced by Gilfeather [13] and Jiang Zejian [22] in 1970’s, respectively.
Definition 2.1**.**
An operator T∈B(H) is called strongly irreducible, if the commutant of T, A′(T)={X∈B(H)∣XT=TX}, doesn’t have any nontrivial idempotent operator. Otherwise, it is called strongly reducible.
Recall that an operator P∈B(H) is called an idempotent if P2=P and a nontrivial idempotent if P=0 or I.
Definition 2.2**.**
A nonzero vector x∈H is called cyclic of T if span{Tkx,k≥0}=H, where “span” denote the norm closure of linear span of the set.
Let C(T)≜{x∣x is a cyclic vector of T}.
An operator T∈B(H) is transitive if and only if C(T)=H\{0}.
It is clear that an operator T∈B(H) is strongly reducible, then T is intransitive. When do T and T−1 have a common nontrivial invariant subspace? We have the following results.
Proposition 2.3**.**
Let T∈B(H) be an invertible operator. If T is strongly reducible, then so is T−1. Furthermore, T and T−1 have a common nontrivial invariant subspace.
Proof.
Suppose that P∈A′(T) is a nontrivial idempotent operator. Then P∈A′(T−1). Thus RanP and Ran(I−P) are both nontrivial invariant subspaces of T and T−1.
∎
Corollary 2.4**.**
Let T∈B(H) be an invertible operator. If σ(T) is not connected, then T and T−1 have a common nontrivial invariant subspace.
Proof.
Suppose σ(T) is not connected.
By the Riesz functional calculus, there is a nontrivial idempotent P such that P∈A′(T)∩A′(T−1).
Therefore, RanP∈Lat(T)∩Lat(T−1).
∎
Proposition 2.5**.**
Let T∈B(H) be invertible. If σp(T)∪σp(T∗)=∅, then T and T−1 have a common nontrivial invariant subspace.
Proof.
Without loss of generality, we assume that T is not a scalar operator.
Suppose that w∈σp(T)∪σp(T∗). We have two cases.
(1) If w∈σp(T), then we can find some 0=x∈H such that (T−w)x=0. This means
T−1((T−w)x)=(I−wT−1)x=0. Then x∈ker(T−1−w−1). Thus, ker(T−w)∈Lat(T−1)∩Lat(T).
(2) If w∈σp(T∗), then for x∈ker(T∗−w), we have x∈ker((T∗)−1−w−1). Thus,
[TABLE]
∎
Let σ(T)∧ denote the polynomial convex hull of σ(T). Note that σ(T)∧ is the union of σ(T) and all of the bounded connected components of C∖σ(T).
Proposition 2.6**.**
[9]**
Let T∈B(H) be an invertible operator. If 0∈/σ(T)∧, then
[TABLE]
At the end of this section, we give the following well-known result.
Lemma 2.7**.**
Let T∈B(H) and K be an invariant subspace of T. Write
[TABLE]
Then σ(T1)⊆σ(T)∧ and σ(T2)⊆σ(T)∧.
3. Cowen-Douglas operators
In this section, we introduce basic properties and techniques of Cowen-Douglas operators, which play important role in the proof of our main theorem.
Let Ω be a bounded open connected subset of the complex plane
C. In [8], M. J. Cowen and R. G. Douglas
introduced a class of operators denoted by Bn(Ω)
which contains Ω as eigenvalues of
constant multiplicity n. The class of Cowen-Douglas operators with
rank n, Bn(Ω) is defined as follows [8]:
[TABLE]
We recall the following results in [8].
Proposition 3.1** (1.7.1, [8]).**
Let T∈Bn(Ω) and w0∈Ω. Then
[TABLE]
Lemma 3.2**.**
[8]**
If Ω1⊂Ω2, then B1(Ω2)⊆B1(Ω1), where Ω1, Ω2 are bounded connected open subsets of the complex plane C.
For Cowen-Douglas operators with index one, we have the following observation.
Lemma 3.3**.**
Let T∈B1(Ω). Then σp(T∗)=∅.
Proof.
Suppose that e(w) is a non-zero vector such that T(e(w))=we(w). By Proposition 3.1, we know span{e(w),w∈Ω}=H. Note that (T−w1)e(w)=(w−w1)e(w),w1∈C.
When w1∈Ω, we have Ran(T−w1)=H by the definition of B1(Ω). If w1∈/Ω, it follows that w−w1 is non-zero.
Thus,
[TABLE]
This shows that Ran(T−w1) is dense in H and ker(T−w1)∗={0}. Therefore, σp(T∗)=∅.
∎
Remark 3.4**.**
For any T∈Bn(Ω), σp(T∗)=∅,n≥1.
Lemma 3.5**.**
For T∈B1(Ω), there exists a connected open subset Φ of C such that Ω⊆Φ and
- (1)
B1(Φ)⊆B1(Ω);
2. (2)
∂Φ⊂σe(T).
In this case, we call Φ is the maximal domain of T.
Proof.
By Zorn’s Lemma, we can find a maximal bounded connected open subset Φ of C such that
T∈B1(Φ).
Now, we need to prove ∂Φ⊂σe(T). Otherwise, there exists λ∈∂Φ such that λ∈ρF(T). That means ind(T−λ)=1 and there exists a neighborhood Oλ of λ such that ind(T−λ)=1,λ∈Oλ.
By Lemma 3.3, σp((T−λ)∗)=∅. We have dimker(T−λ)=1.
Let Φ′′=Φ∪Oλ. Then Φ′′ is connected. Thus, we have T∈B1(Φ′′). This contradicts to the maximality of Φ.
∎
Remark 3.6**.**
If Ω is the maximal domain of Cowen-Douglas operator T, then ∂Ω⊆σe(T).
For two operators A,B∈B(H), we call A∼sB if there exists an invertible operator X∈B(H) such that X−1AX=B.
Lemma 3.7**.**
Suppose that A∈B(H), A1∈B(H⊕Ce0), and
[TABLE]
If A1 is surjective and \mboxdimkerA1=1, then A∼sA1. In particular, if A1∈B1(Ω), 0∈Ω and A1e0=0, then A∼sA1.
Proof.
Since \mboxdimkerA1=1, we have kerA1=Ce0. Thus, (kerA1)⊥=H.
Let X=A1∣(kerA1)⊥. Then X:H=(kerA1)⊥→H⊕Ce0 is an invertible bounded linear operator.
By the next two equations,
[TABLE]
and
[TABLE]
we obtain A1X=XA, that is, A∼sA1.
∎
For more on Cowen-Douglas operators, we refer to [6], [19], [20], [21].
4. Cyclic vectors
In this section Ω is a connected open subset of C.
Lemma 4.1** ([23]).**
Suppose that T∈Bn(Ω). Then C(T)=∅, where C(T) is the set of cyclic vectors of T.
Lemma 4.2**.**
Suppose that A∈B1(Ω), 0∈Ω, and AB=I. If 0=e0∈kerA, then e0∈C(B). In particular, C(B)=∅.
Proof.
Since AB=I,
[TABLE]
Since A∈B1(Ω),
[TABLE]
It follows that
[TABLE]
Thus, we have e0∈C(B).
∎
The following result is due to P. A. Fillmore, J. G. Stampfli, J. P. Williams [10]. For the convenience of readers, we give a simple proof.
Proposition 4.3**.**
[10]**
Let T∈B(H). If there is a λ∈C such that dimker(T−λ)∗≥2, then C(T)=∅.
Proof.
Without loss of generality, we assume dimker(T−λ)∗=2. Suppose that {f1,f2} is an ONB of ker(T−λ)∗. Note that
[TABLE]
Let
[TABLE]
We have
[TABLE]
If C(T)=∅, then we can find some non-zero vector y∈C(T). There exist α1,α2∈C such that
[TABLE]
Notice that span{Tky,k≥0}=H. On the other hand,
[TABLE]
This contradicts to the fact that y∈C(T).
∎
The following proposition is due to D. A. Herrero.
Proposition 4.4**.**
[17]**
Let T∈B(H). If C(T)=∅, then ρs−F−1(T) is simply connected.
Proposition 4.5**.**
Suppose T∈B(H), T∗∈B1(Ω), and Ω is the maximal domain of T∗. If C(T)=∅, then Ω=ρs−F−1(T) and ρs−F(T)=ρF(T). Furthermore, assume Ω′ is a bounded connected component of ρF(T∗)=ρs−F(T∗) such that Ω′∩Ω=∅. Then Ω′⊂ρ(T∗).
Proof.
Clearly, we have Ω⊆ρs−F−1(T). Since C(T)=∅, ρs−F−1(T) is simply connected by Proposition 4.4. Therefore, Ω=ρs−F−1(T). Since C(T)=∅, ρs−F(T)=ρF(T) is a corollary of Lemma 3.3 and Proposition 4.3.
By Lemma 3.3, σp(T)=∅. Since Ω′ is a bounded connected component of ρF(T)=ρs−F(T) and Ω′∩Ω=∅, By Proposition 4.3 and Proposition 4.4, we have that
[TABLE]
This means \mboxdimker(T∗−λ)=0,λ∈Ω′. Hence, Ω′⊂ρ(T∗).
∎
5. Spectral structures of T and T−1
In this section, we first introduce a 2×2 matrix technique to obtain the spectral structures of T and T−1.
Let {ek}k=0∞ be an orthogonal normal basis (denoted by “ONB”) of a Hilbert space H and let
S1∗ be the backward shift operator defined as S1∗(e0)=0, S1∗(ek+1)=ek, k=0,1,2,⋯. For T∈B(H) and x∈H, x=0, define an operator Tx∈B(H⊕H) as the following
[TABLE]
The following lemma plays a key role throughout this section.
Lemma 5.1**.**
Let T∈B(H) with spectral radius r(T)<1 and let
[TABLE]
Let Σ be the connected component of D∖σ(T) which contains {w∈D:r(T)<∣w∣<1}. Then we have the following:
- (1)
For every w∈D∖σ(T), dimker(Tx−w)=1 and Ran(Tx−w)=H⊕H;
2. (2)
Tx∈B1(Σ)* if and only if x is a cyclic vector of T, i.e., span{Tnx:n≥0}=H.*
Proof.
(1). Let w∈D∖σ(T) and e(w)≜k=0∑∞wkek. Then e(w)∈ker(S1∗−w), w∈D. We calculate
[TABLE]
This is equivalent to (S1∗−w)η=0 and (T−w)ξ=−⟨η,e0⟩x. Since dimker(S1∗−w)=1, there is a w1∈C such that η=w1e(w). Without loss of generality, we assume that w1=1. Note that ⟨e(w),e0⟩=1 and T−w is invertible for w∈D∖σ(T). We have ξ=−(T−w)−1x. This proves that dimker(Tx−w)=1.
To show that Tx−w is surjective for w∈D∖σ(T), we need to find for every ξ′⊕η′∈H⊕H a vector ξ⊕η∈H⊕H satisfying the following equation:
[TABLE]
This is equivalent to (S1∗−w)η=η′ and (T−w)ξ=ξ′−⟨η,e0⟩x. Note that both S1∗−w and T−w are surjective for w∈D∖σ(T). The existence of ξ and η is clear.
(2). For w∈Σ, define y(w)=−(T−w)−1x. Then by (1), y(w)⊕e(w) is in ker(Tx−w). To show Tx∈B1(Σ), we need to prove that
[TABLE]
Suppose that there exists an x1⊕x2∈H⊕H such that ⟨y(w)⊕e(w),x1⊕x2⟩=0. Then ⟨y(w),x1⟩+⟨e(w),x2⟩=0.
Since ⟨e(w),x2⟩ is analytic on D and (w−T)−1=w1∑n=0∞(wT)n for ∣w∣>r(T), ⟨−(T−w)−1x,x1⟩ is analytic when ∣w∣>r(T). Furthermore,
[TABLE]
Thus, by the analytic continuation theorem, we know that ⟨y(w),x1⟩ is analytic on C. Since
[TABLE]
we see that ⟨y(w),x1⟩ is a bounded entire function on C. Thus we have
[TABLE]
Note that ⟨(w−T)−1x,x1⟩=0 for all ∣w∣>r(T), we have
[TABLE]
It follows that ⟨Tnx,x1⟩=0 for n=0,1,⋯. Suppose x is a cyclic vector of T. Then x1=0. Since S1∗∈B1(D)⊂B1(Σ), we have span{e(w):w∈Σ}=H. This means x2=0. Thus span{y(w)⊕e(w):w∈Σ}=H⊕H. Suppose x is not a cyclic vector of T. Let 0=x1⊥{Tnx:n≥0}. Then (x1⊕0)⊥span{y(w)⊕e(w):w∈Σ} and therefore span{y(w)⊕e(w):w∈Σ}=H⊕H. This implies that Tx∈/B1(Σ).
∎
Lemma 5.2**.**
For every x∈H, x=0, define S∈B(H⊕H) as follows
[TABLE]
Then Sx≜S is a right inverse of Tx.
Proof.
Notice that S1∗(e0)=0. Then we have (x⊗e0)S1=x⊗S1∗(e0)=0, and
[TABLE]
∎
Define
[TABLE]
Then
[TABLE]
for n≥1 and
[TABLE]
for all n≥0. Thus M(x)∈LatTx∩LatSx.
We set
[TABLE]
and
[TABLE]
Lemma 5.3**.**
Let an=PM(x)(0⊕en) and bn=PM(x)⊥(0⊕en) for n≥0. Then we have
[TABLE]
and
[TABLE]
Proof.
Since
[TABLE]
we have
[TABLE]
Thus T2bn=bn−1, ∀n≥1. A similar calculation shows that T2b0=PM(x)⊥(x⊕0).
Since
[TABLE]
we have
[TABLE]
Thus T^x∗an=an+1, ∀n≥0.
Since
[TABLE]
we have
[TABLE]
Thus S2bn=bn+1, ∀n≥0.
Since
[TABLE]
where we define e−1=0, we have
[TABLE]
Thus S^x∗an=an−1, ∀n≥1 and S^x∗a0=0.
∎
Note that
[TABLE]
In particular,
an=0 for all n≥0.
Lemma 5.4**.**
Let T∈B(H), w0∈C and δ>0. Suppose ∀w, ∣w−w0∣<δ, and
- (1)
Ran(T−w)=H;
2. (2)
dimker(T−w)=1.
Then span{ker(T−w0)n,n≥1}=span{ker(T−w),∣w−w0∣<δ}.
Proof.
We may assume that w0=0. Then RanT=H and dimkerT=1. Assume that Tξ=0 for some ξ=0. Let K=span{ker(T−w),∣w∣<δ}. Then K∈LatT and ξ∈K. Write
[TABLE]
Claim T2 is injective. Otherwise T2η=0 for some η=0. Let e(w) be a nonzero vector such that (T−w)e(w)=0. Then RanT1 contains span{we(w):∣w∣<δ} and RanT1 is dense in K. Therefore, there exists a sequence of vectors ξn∈K such that
[TABLE]
Write
[TABLE]
as an orthogonal decomposition. Note that T is an invertible map from [ξ⊕0]⊥ onto RanT. Therefore, there exists a K>0 such that
[TABLE]
So
[TABLE]
implies that
[TABLE]
Therefore, η=0. This is a contradiction and thus T2 is injective.
Since RanT=H, there is an operator
[TABLE]
satisfying
[TABLE]
This implies that T2S21=0 and T2S22=1. Since T2 is injective, S21=0 and T2 is invertible.
Then T1S11=1. So RanT1=K. Similarly, Ran(T1−w)=K for all ∣w∣<δ. Therefore, T1∈B1(Ω).
Note that for n≥1,
[TABLE]
So
[TABLE]
implies that T2nη=0 and therefore η=0. Furthermore, T1nξ=0 and kerTn=kerT1n. By Proposition 3.1,
[TABLE]
∎
Lemma 5.5**.**
Let T∈B(H) be invertible, r(T)<1, and
[TABLE]
Let Φ0 be the connected component of D∖σ(T) with 0∈Φ0. Let Σ be the connected component of D∖σ(T) which contains {w∈D:r(T)<∣w∣<1}. If x is a cyclic vector of T and M(x)=H⊕H, then
- (1)
T^x∈B1(Φ0)* and σ(T^x)⊂σ(T)∧ ;*
2. (2)
T2* is invertible and T2∈B1(Σ).*
Proof.
(1). By (1) of Lemma 5.1, ∀w∈Φ, Ran(Tx−w)=H⊕H=M(x)⊕M(x)⊥ and dimker(Tx−w)=1. By Lemma 5.4,
[TABLE]
Therefore, ker(Tx−w)⊂M(x) for w∈Φ0. So ker(T^x−w)=ker(Tx−w)=Cf(w)⊂M(x), where f(w)=y(w)⊕e(w) as in the proof of Lemma 5.1. Since
[TABLE]
Ran(T^x−w1) is dense in M(x), w1∈Φ0.
Suppose Ran(T^x−w)=M(x) for some w∈Φ0. Then there exists a y∈M(x) such that y∈/Ran(T^x−w) and y⊕0∈Ran(Tx−w). Therefore, there exists a vector ξ⊕η∈M(x)⊕M(x)⊥ such that η=0 and
[TABLE]
i.e.,
[TABLE]
Since Ran(T^x−w) is dense in M(x), there exists a sequence of vectors ξn such that
[TABLE]
i.e.,
[TABLE]
Write
[TABLE]
as an orthogonal decomposition. Note that (Tx−w) is an invertible map from [f(w)⊕0]⊥ onto Ran(Tx−w)=H⊕H. Therefore, there exists a K>0 such that
[TABLE]
So n→+∞lim(Tx−w)(ξn−αnf(w)η)=(00) implies that
[TABLE]
Thus η=0. This is a contradiction. Hence, T^x∈B1(Φ0).
Since T^x=Tx∣M(x), σ(T^x)⊆Dˉ. In the following we show ∀w∈D∖σ(T)∧, w∈ρ(T^x).
By (1) of Lemma 5.1, ∀w∈D∖σ(T)∧,
[TABLE]
Let
f(w) be a nonzero eigenvector of Tx−w. Then
[TABLE]
with respect to the decomposition H⊕H=M(x)⊕M(x)⊥.
Claim: f2(w)=0.
Suppose f2(w)=0. Then f(w)∈M(x). Note that
[TABLE]
and Ran(T^x−w)
is dense in M(x). So same argument as above shows that Ran(T^x−w)=M(x). Since Tx−w is surjective, T2−w is also surjective. Assume that T2−w is not injective. Then there exists an η∈M(x)⊥, η=0, such that (T2−w)η=0. Let ξ∈M(x) be such that (T^x−w)ξ=−T12η. Then
[TABLE]
So ξ⊕η,f(w)∈ker(Tx−w) are linearly independent. This contradicts to dimker(Tx−w)=1. Thus T2−w is injective and therefore T2−w is invertible. So there is a δ>0 such that T2−w′ is invertible for all w′ satisfying ∣w′−w∣<δ. Suppose
[TABLE]
Then (T2−w′)η=0 implies that η=0. So ker(Tx−w′)⊆M(x). Since w∈D∖σ(T)∧, w∈Σ. By (2) of Lemma 5.1,
[TABLE]
This contradicts to the assumption of the lemma.
Thus
[TABLE]
and f2(w)=0. Since dimker(Tx−w)=1, T^x−w is injective for w∈D∖σ(T)∧. Since T^x∈B1(Ω), Ran(T^x−w) is dense in H by Lemma 3.3. Claim T^x−w is surjective. Otherwise, there exists a sequence of unit vectors ξn∈M such that n→+∞lim(T^x−w)ξn=0.
So
[TABLE]
Let
[TABLE]
be an orthogonal decomposition. Then Tx−w is an invertible map from [f1(w)⊕f2(w)]⊥ onto Ran(Tx−w)=H⊕H. Therefore,
[TABLE]
implies that
[TABLE]
Notice that
[TABLE]
So n→+∞limαn=0. Thus n→+∞lim∥ξn⊕0∥=0, which contradicts to the assumption ∥ξn∥=1 for all n. This proves that ∀w∈D∖σ(T)∧, w∈ρ(T^x).
Therefore, σ(T^x)⊂σ(T)∧.
(2). By Lemma 5.1, Tx∈B1(Σ). Therefore, Ran(Tx−w)=H⊕H=M⊕M⊥, ∀w∈Σ. It is clear that Ran(T2−w)=M(x)⊥, ∀w∈Σ. Let f(w) be a nonzero eigenvector of Tx−w, w∈Σ. Then
[TABLE]
and f2(w)=0. It is clear that (T2−w)f2(w)=0. Assume that (T2−w)η=0. Then
[TABLE]
Since dimker(Tx−w)=1, f1(w)⊕f2(w) and (−(T^x−w)−1T12(η))⊕η are linearly dependent. Therefore f2(w) and η are linearly dependent. This implies that dimker(T2−w)=1.
Since
span{f(w):w∈Σ}=H⊕H,
span{f2(w):w∈Σ}=M(x)⊥. Hence, T2∈B1(Σ).
By Lemma 5.1, RanTx=H⊕H=M(x)⊕M(x)⊥, so RanT2=M(x)⊥. Also we have dimkerTx=1. This implies that kerTx=kerT^x. Since RanT^x=M(x), T2 is injective. This proves that T2 is invertible.
∎
Lemma 5.6**.**
Let T∈B(H) be an invertible bounded linear operator. For x∈H, let N−k(x)=span{T−nx:n≥k}. Then ∩k=1∞N−k(x)∈Lat(T).
Proof.
Choose y∈∩k=1∞N−k(x), we prove Ty∈∩k=1∞N−k(x). Since y∈N−2(x), ∀ϵ>0, there exists i=2∑m2αiT−ix, αi∈C, such that
[TABLE]
Thus
[TABLE]
It follows that Ty∈N−1(x). Similarly, we can show that Ty∈N−k(x) for all k≥1 and therefore, Ty∈∩k=1∞N−k(x).
∎
Lemma 5.7**.**
Suppose T∈B(H) is an invertible transitive operator. Let N−k(x)=span{Tnx:n≤−k} for k≥1. If N(x)≜N−1(x)=H, then {N−k(x)} is a strictly decreasing sequence and ∩k=1∞N−k(x)={0}.
Proof.
By Lemma 5.6, ∩k=1∞N−k(x)∈LatT. Since N(x)=N−1(x)=H, ∩k=1∞N−k(x)={0}. Suppose N−k(x)=N−(k+1)(x) for some k≥1. Then T−kx∈N−(k+1)(x). Hence, T−(k+1)x∈T−1N−(k+1)(x)=N−(k+2)(x). This implies that N−(k+2)(x)=N−(k+1)(x)=N−k(x). By induction, we have N−n(x)=N−k(x) for all n≥k. This contradicts to ∩k=1∞N−k(x)={0}.
∎
Lemma 5.8**.**
Suppose an invertible operator T∈B(H) is transitive, r(T)<1, and
[TABLE]
Then the map Bx:(−T−(n+1)x)⊕en→−T−(n+1)x, n≥0, extends to a bounded linear isomorphism from M(x)=span{(−T−(n+1)x)⊕en:n≥0} onto N(x).
Proof.
Recall that an=PM(x)(0⊕en) (see Lemma 5.3).
For n≥0, define fn(x)=⟨x,an⟩ for x∈H⊕H. By Lemma 5.5, σ(T^x∗)⊂σ(T)∧, so the spectral radius of T^x∗ is strictly less than a positive number r<1. By Lemma 5.3, T^x∗an=an+1 and an=(T^x∗)na0 for n≥0.
Thus ∥fn∥=∥an∥≤(r+ϵ)n∥a0∥ for sufficient large N such that n=N+1∑∞∥an∥=θ<1. For each y∈H⊕H, put
[TABLE]
Note that
[TABLE]
[TABLE]
Then for k≥N+1, we have
[TABLE]
[TABLE]
[TABLE]
Note that
[TABLE]
So A is an invertible bounded linear operator on H⊕H and A maps
[TABLE]
onto span{−T−(n+1)x:n≥N+1}.
Claim span{T−1x,⋯,T−(N+1)x}∩span{T−(N+2)x,T−(N+3)x,⋯}={0}. Suppose
[TABLE]
and
[TABLE]
satisfy w=v. If w=0, then w=i=1∑N+1αiT−ix=z. We may assume that αj=−1 and αi=0 for 1≤i<j. Then
[TABLE]
This implies that N−j(x)=N−(j+1)(x), which contradicts to Lemma 5.7. Let x′∈N(x). Then there exist a sequence of vectors {xn}∈N(x) such that each xn can be written as a finite linear combinations of {T−nx}n=1∞ and n→∞lim∥xn−x′∥=0. In particular, there is {yn}∈span{T−1x,T−2x,⋯,T−(N+1)x} and zn∈span{T−(N+2)x,T−(N+3)x,⋯} such that xn=yn+zn. Let π be the quotient map from N onto L/span{T−(N+2)x,T−(N+3)x,⋯}. Then π(yn)=π(xn) is a Cauchy sequence in L/span{T−(N+2)x,T−(N+3)x,⋯}. Clearly, π is a surjective map from span{T−1x,T−2x,⋯,T−(N+1)x} onto span{π(T−1x),π(T−2x),⋯,π(T−(N+1)x)}. Suppose π(w1T−1x+w2T−2x+⋯+wN+1T−(N+1)x)=0. Then there exists a
[TABLE]
such that w1T−1x+w2T−2x+⋯+wN+1T−(N+1)x=z. By the above argument, w1T−1x+w2T−2x+⋯+wN+1T−(N+1)x=z=0. So π is an injective map from
[TABLE]
onto
[TABLE]
Since span{T−1x,T−2x,⋯,T−(N+1)x} is finite dimensional, {yn} is a Cauchy sequence. Thus {zn} is also a Cauchy sequence. Let y=n→∞limyn and z=n→∞limzn. Then
[TABLE]
and
[TABLE]
such that x′=y+z. This implies that
[TABLE]
Similarly,
[TABLE]
Hence Bx:(−T−(n+1)x)⊕en→−T−(n+1)x extends to a bounded linear isomorphism from M(x) onto N(x).
∎
Lemma 5.9**.**
Suppose an invertible operator T∈B(H), r(T)<1, x is a cyclic vector of T and M(x)=H⊕H. If b0=0, then PM(x)⊥ is an invertible bounded linear operator from 0⊕H onto L(x)=span{b0,b1,⋯}, where bn=PM(x)⊥(0⊕en) (see in Lemma 5.3).
Proof.
By Lemma 5.3, T^x∗an=an+1 for n≥0. Then we have an=(T^x∗)na0 for n≥0 and
[TABLE]
By Lemma 5.5, σ(T^x∗)⊂σ(T)∧, so the spectral radius of T^x∗ is a positive number r<1. For arbitrary ϵ>0, there exists an N1 such that ∥an∥≤∣(r+ϵ)n∣∥a0∥ for n≥N1. This implies that there exists an N sufficiently large such that
[TABLE]
By Theorem 1.3.9 of [1], there exists an invertible bounded linear operator A from
[TABLE]
onto
[TABLE]
such that A(ek)=bk for k=N+1,N+2,⋯. So A is the restriction of PM(x)⊥ onto span{eN+1,eN+2,⋯} and {bN+1,bN+2,⋯} is a basic sequence.
Suppose PM(x)⊥(0⊕z)=0. Write z=n=0∑∞wn(0⊕en), where n=0∑∞∣wn∣2<∞. Then
[TABLE]
If z=0, then wk=0 for some k and wj=0 for all j<k. We may assume that wk=−1. Then bk=n=k+1∑∞wnbn. Recall that S2bn=bn+1 for all n≥0 (see Lemma 5.3). Thus
[TABLE]
This contradicts to the fact that {bN+1,bN+2,⋯} is a basic sequence.
Hence, z=0. So
we have PM(x)⊥ is an injective bounded linear operator from 0⊕H into L=span{b0,b1,⋯}. We need only to show the map is surjective.
Suppose w∈span{b0,b1,⋯,bN} and v∈span{bN+1,bN+2,⋯} satisfy w=v. Write w=i=0∑Nαibi and v=i=N+1∑∞αibi, where i=N+1∑∞∣αi∣2<∞. Let
[TABLE]
Then PM⊥(0⊕z)=w−v=0. This implies that z=0 and therefore, w=v=0. So
[TABLE]
Let x′∈L. Then there exists a sequence of vectors {xn}∈L such that each xn can be written as a finite linear combinations of {bn}n=1∞ and n→∞lim∥xn−x′∥=0. In particular, there is yn∈span{b0,b1,⋯,bN} and zn∈span{bN+1,bN+2,⋯} such that xn=yn+zn.
Let π be the quotient map from L(x) onto L(x)/span{bN+1,bN+2,⋯}. Then π(yn)=π(xn) is a Cauchy sequence in L(x)/span{bN+1,bN+2,⋯}. Clearly, π is a surjective map from span{b0,b1,⋯,bN} onto span{π(b0),π(b1),⋯,π(bN)}.
Suppose π(w0b0+w1b1+⋯+wNbN)=0. Then there exists a v∈span{bN+1,bN+2,⋯} such that
[TABLE]
Therefore,
[TABLE]
So π is an injective map from span{b0,b1,⋯,bN} onto span{π(b0),π(b1),⋯,π(bN)}.
Since span{b0,b1,⋯,bN} is finite dimensional, {yn} is a Cauchy sequence. Thus {zn} is also a Cauchy sequence. Let y=n→∞limyn and z=n→∞limzn. Then y∈span{b0,b1,⋯,bN} and z∈span{bN+1,bN+2,⋯} such that x′=y+z. This implies that
[TABLE]
and PM(x)⊥ is onto.
∎
Lemma 5.10**.**
Let L(x)=span{bn,n≥0}, N(x)=span{T−(n+1)x,n≥0}. Then
[TABLE]
where bn=PM(x)⊥(0⊕en) (see in Lemma 5.3.)
Proof.
We need only to prove M(x)⊕L(x)=N(x)⊕H. First, we show that
[TABLE]
Clearly, (−T−(n+1)x)⊕en∈N(x)⊕H for all n≥0. Thus M(x)⊂N(x)⊕H. Note that bn=(0⊕en)−an∈N(x)⊕H. Thus L(x)⊂N(x)⊕H and M(x)⊕L(x)⊆N(x)⊕H. Second, we show that N(x)⊕H⊆M(x)⊕L(x). Note that for n≥0,
[TABLE]
Also for n≥0, (−T−(n+1)x)⊕0=(−T−(n+1)x)⊕en−(0⊕en)∈M(x)⊕L(x). Thus
[TABLE]
∎
Corollary 5.11**.**
L(x)⊂M(x)⊥* and M(x)⊥⊖L(x)=N(x)⊥⊕0.*
By equation (5.2), Lemma 5.10 and Corollary 5.11, we have the following
[TABLE]
[TABLE]
In particular,
[TABLE]
where Tˉ2(x)=PN(x)⊥⊕0S2PN(x)⊥⊕0.
Recall that
[TABLE]
and
[TABLE]
Lemma 5.12**.**
S^x∗∈B1(sD), where s=r(T)−1.
Proof.
Since TxSx=I, Sx∗Tx∗=I. We have
[TABLE]
This implies that S^x∗T^x∗=I. By Lemma 5.5 and Theorem 16.12 of [27],
[TABLE]
For λ∈C, we have
[TABLE]
By Lemma 5.5, σ(T^x∗)⊆σ(T)∧⊆r(T)Dˉ. Hence, for ∣λ∣<s, ∣λ−1∣>r(T) and
I−λT^x∗ is invertible. This implies that S^x∗−λ is surjective for ∣λ∣<s. Therefore, dimker(S^x−λ)=0 for ∣λ∣<s. By the continuity of index, ind(S^x∗−λ)=1 for all ∣λ∣<s. So dimker(S^x∗−λ)=1 for all ∣λ∣<s.
By Lemma 5.3, S^x∗a0=0.
Let
[TABLE]
Since r(T^x∗)≤r(T), e(w) is well-defined for ∣w∣<s. We have
[TABLE]
Suppose
[TABLE]
for some ∣w0∣<s. Then
[TABLE]
Hence
[TABLE]
Therefore,
[TABLE]
This is a contradiction.
By Lemma 5.4,
[TABLE]
we conclude that S^x∗∈B1(sD).
∎
Lemma 5.13**.**
Let Σ be the connected component of D∖σ(T) which contains {w∈D:r(T)<∣w∣<1} and let Σ−1={w−1:w∈Σ}.
Then S2∈B1(Σ−1).
Proof.
Since TxSx=I, we have
[TABLE]
This implies that T2S2=I. By Lemma 5.5, for w∈Σ−1, we have w−1∈Σ and
[TABLE]
is surjective. By Lemma 5.5, T2 is invertible, so S2−w is surjective for w∈Σ−1. Also note that ∀w∈Σ−1, w−1∈Σ,
[TABLE]
So Ran(S2∗−wˉ)=Ran(w−1−T2)∗. This implies that
[TABLE]
is dimensional one and by Lemma 5.5,
[TABLE]
So S2∈B1(Σ−1).
∎
Lemma 5.14**.**
Let S2=(S2∣L(x)0G12PN(x)⊥⊕0S2PN(x)⊥⊕0)L(x)N(x)⊥⊕0. Then S2∣L(x) is similar to the unilateral shift operator and
PN(x)⊥⊕0S2PN(x)⊥⊕0∈B1(Σ−1).
Proof.
By Lemma 5.9,
[TABLE]
for all n≥0. So S2∣L(x) is similar to the unilateral shift operator.
By Lemma 5.13, S2−w is surjective for w∈Σ−1. Therefore, (PN(x)⊥⊕0S2PN(x)⊥⊕0−w) is also surjective.
For w∈Σ−1, there exists a nonzero vector f(w)=f1(w)⊕f2(w) such that
[TABLE]
Suppose f2(w)=0. Then f1(w)=0 and
(S2∣L(x)−w)f1(w)=0. So S2∣L(x)−w is not invertible. This is a contradiction. Thus f2(w)=0 and PM(x)⊥⊖L(x)(S2−w)PM(x)⊥⊖L(x)(f2(w))=0. Suppose η1,η2∈ker(PN(x)⊥⊕0S2PN(x)⊥⊕0−w). Then there exist ξ1,ξ2∈L(x) such that
[TABLE]
So ξ1⊕η1,ξ2⊕η2∈ker(S2−w). Since dimker(S2−w)=1, ξ1⊕η1,ξ2⊕η2 are linearly dependent. Therefore, η1,η2 are linearly dependent. So
[TABLE]
Since span{f1(w)⊕f2(w):w∈Ω1−1}=M(x)⊥, span{f2(w):w∈Ω1−1}=M(x)⊥⊖L(x). This implies that
[TABLE]
∎
Lemma 5.15**.**
Write
[TABLE]
Then Tˉ2(x)=PM(x)⊥⊖L(x)S2PM(x)⊥⊖L(x)∈B1(Σ−1) and Tˉ1∗(x)∈B1(Ω0∗), where Ω0 is the connected component of C∖σ(T−1) containing 0.
Proof.
By Lemma 5.8,
[TABLE]
This implies that Tˉ1(x)=BxS^xBx−1. By Lemma 5.12, we have Tˉ1∗(x)∈B1(sD), where s=r(T)−1. For λ∈Ω0, λ∈ρ(T−1). Hence, λ∈ρs−F(Tˉ1(x)). Since indTˉ1(x)=0. The continuity of index implies that ind(Tˉ1(x)−λ)=−1 for all λ∈Ω0. Since Tˉ1∗∈B1(sD), Lemma 3.3 implies that ker(Tˉ1(x)−λ)={0} and dimker(Tˉ1∗(x)−λˉ)=1 for all λ∈Ω0. Thus Tˉ1∗(x)∈B1(Ω0∗). By Lemma 5.14, Tˉ2(x)=PM(x)⊥⊖L(x)S2PM(x)⊥⊖L(x)=PN(x)⊥⊕0S2PN(x)⊥⊕0∈B1(Σ−1). This proves the lemma.
∎
Recall that Φ0 is the connected component of C∖σ(T) containing 0 and Ω0 is the connected component of C∖σ(T−1) containing 0. Note that
[TABLE]
By Lemma 5.8, the map Bx:(−T−(n+1)x)⊕en→−T−(n+1)x, n≥0, extends to a bounded linear isomorphism from M(x)=span{(−T−(n+1)x)⊕en:n≥0} onto N(x)=span{T−(n+1)x:n≥0}.
Proposition 5.16**.**
Suppose T is transitive, r(T)<1, x is a unit noncyclic vector of T−1. Then
[TABLE]
satisfy
- (1)
Tˉ1(x)=BxS^xBx−1, Tˉ1∗(x)∈B1(Ω0∗), and T−1x∈C(Tˉ1(x));
2. (2)
Tˉ2(x)∈B1(Ω0), Tˉ2(x)H2(x)=IN(x)⊥, and C(H2(x))=∅;
3. (3)
Hˉ1(x)≜BxT^xBx−1∈B1(Φ0), Hˉ1(x)Tˉ1(x)=IN(x), and C(Hˉ1∗(x))=∅;
4. (4)
H21(x)* is a rank one operator.*
Proof.
(1) Tˉ1∗(x)∈B1(Ω0∗) and Tˉ1(x)=BxS^xBx−1 follow from Lemma 5.15 and its proof. Note that
[TABLE]
Therefore, T−1x∈C(Tˉ1(x)).
(2)By Lemma 5.14 and Lemma 5.15, T2(x)∈B1(Φ), where
[TABLE]
Note that Φ⊆Ω0. Since Ω0⊂ρ(T−1) and T1∗(x)∈B1(Ω0), Ω0⊆ρF(T2(x)). By the continuity of index, we deduce that T2(x)∈B1(Ω0). Since Tˉ2(x)H2(x)=IN(x)⊥, by lemma 4.2, C(H2(x))=∅.
(3)
Hˉ1(x)≜BxT^xBx−1∈B1(Φ0) follows from Lemma 5.5.
[TABLE]
Also
[TABLE]
Then Tˉ1∗(x)Hˉ1∗(x)=IN(x). By Lemma 4.2, C(Hˉ1∗(x))=∅.
(4) Since H21(x)Tˉ1(x)=0, Tˉ1∗(x)H21∗(x)=0. So H21(x) is a rank one operator.
∎
6. The main theorems
In this section, it is helpful to keep the following special case in mind: σ(T−1) is the union of two circles, one is with center (0,0) and radius 2 and the other is with center (4,0) and radius 2. In this special case
[TABLE]
and
[TABLE]
Theorem 6.1**.**
Suppose T∈B(H) is an invertible operator, x is a nonzero noncyclic vector of T−1, and N(x)=span{T−kx:k≥1}. Let T1(x)=PN(x)T−1PN(x). If σ(T1(x))∧∩ρF(T1(x)) has a connected component which does not contain zero point, then T is intransitive.
Proof.
Suppose T is transitive. By (1) of Proposition 5.16, T1∗(x)∈B1(Ω0∗) and 0∈Ω0. By Lemma 3.5, let T1∗(x)∈B1(L0∗) such that L0∗⊇Ω0∗ is maximal. Suppose Ω is a connected component of σ(T1(x))∧∩ρF(T1(x)) such that 0∈/Ω. Then Ω∩L0=∅. By Proposition 5.16, T−1x∈C(T1(x)). By Proposition 4.5, Ω⊆ρ(T1(x)). Note that ∂Ω⊆σe(T1(x)). Since
H1(x)T1(x)=I and T1(x)∗∈B1(Ω0∗), π(H1(x))=π(T1(x))−1. Then (∂Ω)−1⊆σe(H1(x)) and Ω−1⊆ρF(H1(x)). By (3) of Proposition 5.16, we have H1(x)∈B1(Φ0) and 0∈Φ0. By Lemma 3.5, let H1(x)∈B1(L1) such that L1⊇Φ0 is maximal. Then Ω−1∩L1=∅. By (3) of Proposition 5.16, C(H1∗(x))=∅. By Proposition 4.5, Ω−1⊆ρ(H1(x)). Note that H1(x)T1(x)=IN(x). For λ∈Ω, λ1∈Ω−1 and
[TABLE]
Note that both H1(x)−λ1 and λ−T1(x) are invertible. Thus H1(x) is invertible. On the other hand H1(x)∈B1(Φ0) and 0∈Φ0. So H1(x) is not invertible. This is a contradiction.
∎
Lemma 6.2**.**
Suppose T is transitive, x is a nonzero noncyclic vector of T−1, and N(x)=span{T−kx:k≥1}. Let U0 denote the connected component of int(σ(T−1)∧) containing [math] and let Ω be a connected open subset of ρ(T−1). If Ω∩U0=∅, then Ω⊆ρ(T1(x))∩ρ(T2(x)).
Proof.
Recall that
[TABLE]
By Proposition 5.16, Tˉ1∗(x)∈B1(Ω0∗), Tˉ2(x)∈B1(Ω0) and 0∈Ω0. By Lemma 3.3,
[TABLE]
Suppose λ∈ρ(T−1). Write
[TABLE]
Then we have
[TABLE]
This implies that (T2(x)−λ)D=IN(x)⊥ and A(T1(x)−λ)=IN(x) or equivalently
[TABLE]
Therefore, Ran(T2(x)−λ) and Ran(T1(x)−λ)∗ are closed. Thus Ran(T1(x)−λ) is also closed. Since
[TABLE]
λ∈ρs−F(T1(x))∩ρs−F(T2(x)). We have
[TABLE]
Since Ω⊆ρ(T−1), Ω⊆ρs−F(T1(x))∩ρs−F(T2(x)).
Note that T1∗(x)∈B1(Ω0∗) and 0∈Ω0. By Lemma 3.5, T1∗(x)∈B1(L0∗) such that L0∗⊇Ω0∗ is maximal. Note that N(x)∈Lat(T−1). By Lemma 2.7, we have σ(T1(x))⊆σ(T−1)∧ and thus σ(T1(x))∧⊆σ(T−1)∧. Then the connected component of intσ(T1(x))∧ containing zero point is a subset of U0. Since L0⊆σ(T1(x)) is a connected open set containing zero point, L0⊆U0. By the assumption of Lemma 6.2, Ω∩U0=∅. Thus Ω∩L0=∅. By Proposition 5.16, T−1x∈C(T1(x)).
By Proposition 4.5,
Ω⊂ρ(T1(x)).
Notice that Ω⊆ρ(T−1)∩ρ(T1(x)). Therefore,
[TABLE]
Thus, we have \mboxind(T2(x)−λ)=0,∀λ∈Ω. By (2) of Proposition 5.16, T2(x)∈B1(Ω0).
By Lemma 3.3, σp(T2∗(x))=∅. Thus dimker(T2(x)−λ)=0, ∀λ∈Ω, and Ω⊆ρ(T2(x)).
∎
Lemma 6.3**.**
Let σe(T−1)=σ(T−1)⊆σ(T2(x)) and let
[TABLE]
[TABLE]
Then the following statements hold:
- (1)
Φ0={λ1:λ∈C∖σ(T2(x))∧∪{∞}};**
2. (2)
Φ0⊆R0;
3. (3)
H1(x)∈B1(R0), R0 is maximal and R0∗ is the connected component of ρF−1(H1∗(x1)) containing zero point.
Proof.
(1). By the assumption of Lemma 6.3 and Lemma 2.7,
[TABLE]
Then σ(T2(x))∧=σ(T−1)∧ and (1) holds.
(2). Since N(x)∈Lat(T−1), σ(T1(x))⊆σ(T−1)∧. Therefore, σ(T1(x))∧⊆σ(T−1)∧. Then Φ0⊆R0.
(3). By (3) of Proposition 5.16, H1(x)∈B1(Φ0). Since H1(x)T1(x)=IN(x),
[TABLE]
Since
[TABLE]
R0⊆ρ(π(H1(x))). By (2), Lemma 3.3, and continuity of index, H1(x)∈B1(R0). Since
[TABLE]
we have
[TABLE]
Thus
R0∗ is the connected component of ρF−1(H1∗(x)) containing zero point.
∎
Theorem 6.4**.**
Let T∈B(H) be an invertible operator. Suppose x is a nonzero noncyclic vector of T−1 and N(x)=span{T−kx:k≥1}. Let T2(x)=PN⊥(x)T−1PN⊥(x). If σ(T−1)⊆σ(T2(x)), and there exists a bounded open set Ω which is a connected component of ρ(T−1) such that Ω∩U0=∅, where U0 is the connected component of int(σ(T−1)∧) containing zero point, then T is intransitive.
Proof.
Suppose T is transitive. Then σ(T−1)=σe(T−1) and ρ(T−1)=ρF(T−1).
By Lemma 6.2, since Ω∩U0=∅,
(1.1) Ω⊆ρ(T1(x))∩ρ(T2(x)).
By Proposition 5.16, T1∗(x)∈B1(Ω0∗) and 0∈Ω0. By Lemma 3.5, let T1∗(x)∈B1(L0∗), and L0∗⊇Ω0∗ is maximal. By Proposition 5.16, T−1x∈C(T1(x)). By Proposition 4.5, L0 is the connected component of ρF−1(T1(x)) containing zero point.
Claim 1: L0⊆U0. By Lemma 2.7, σ(T1(x))⊆σ(T−1)∧. Thus
[TABLE]
Since 0∈L0, and U0 is the connected component of int(σ(T−1)∧ containing zero point, it follows that L0⊆U0 and Claim 1 holds.
By the assumption of Theorem 6.4, Ω is a bounded connected component of ρ(T−1). Since σ(T−1)⊆σ(T2(x)), ρ(T2(x))⊆ρ(T−1).
By (1.1), Ω⊆ρ(T2(x))⊆ρ(T−1) is a bounded connected component of ρ(T2(x))
and ∂Ω⊆σe(T2(x)). By Proposition 5.16, T2(x)∈B1(Ω0) and 0∈Ω0.
Since T2(x)H2(x)=IN(x)⊥,
[TABLE]
Thus
[TABLE]
and ∂Ω−1⊆σe(H2(x)). Since T2(x)∈B1(Ω0) and 0∈Ω0, ind(T2(x))=1. Since T2(x)H2(x)=I, indH2(x)=−1. Note that 0∈/Ω−1 and C(H2(x))=∅ by Proposition 5.16. We have Ω−1∩ρF−1(H2(x))=∅. By Proposition 4.3,
[TABLE]
Thus ind(H2(x)−λ)≥−1 for all λ∈C. Since Ω−1∩ρF−1(H2(x))=∅,
(1.2) ind(H2(x)−λ)≥0,∀λ∈Ω−1.
Claim 2. Ω−1⊆R0={λ1:λ∈C∖σ(T1(x))∧∪{∞}}.
Note that either Ω−1∩R0=∅ or Ω−1⊆R0. In fact, since H1(x)T1(x)=IN(x),
[TABLE]
By (1.1), Ω⊆ρ(T1(x)). Thus Ω−1⊆ρF(H1(x)). By (3) of Lemma 6.3, H1(x)∈B1(R0) and R0 is maximal. By Proposition 5.16, C(H1∗(x))=∅. By Proposition 4.5, R0=ρF1(H1(x)).
If λ0,λ1∈Ω−1 and λ0∈R0, λ1∈/R0, then
[TABLE]
and
[TABLE]
This contradicts to the continuity of index.
Now suppose Ω−1∩R0=∅. By Proposition 5.16,
C(H1∗(x))=∅. By Proposition 4.5, Ω−1⊆ρ(H1(x)). For λ∈Ω,
[TABLE]
By (1.1), both λ−T1(x) and H1(x)−λ1I are invertible. So H1(x) is invertible. By Proposition 5.16, H1(x)∈B1(Φ0) and 0∈Φ0. So H1(x) is not invertible.
This is a contradiction. Thus Claim 2 holds.
By Claim 2 and (3) of Lemma 6.3, we have ind(H1(x)−λ)=1 for λ∈Ω−1. Since Ω⊆ρ(T−1), Ω−1⊆ρ(T). By (1.2),
[TABLE]
This is a contradiction.
∎
7. Applications
7.1. Hyponormal operators
Definition 7.1**.**
Let T∈B(H). T is called hyponormal if T∗T−TT∗≥0.
The following proposition is well-known.
Proposition 7.2**.**
Let T∈B(H) be an invertible hyponormal operator and N∈Lat(T). Then T∣N and T−1 are both hypernormal.
Suppose A∈B1(Ω) and 0∈Ω. For n≥1, choose a unit vector en−1∈kerAn⊖kerAn−1. Then {en}n=0∞ is an ONB of H and
[TABLE]
Operator B is called the standard right inverse of A if AB=I and
[TABLE]
In order to prove the main result in this subsection, we need the following lemmas.
Lemma 7.3**.**
Suppose that A∈B1(Ω), 0∈Ω and B is the standard right inverse of A. Write
[TABLE]
Then ∣ak,k+1∣≥∥B∥1.
Proof.
Since B can be regarded as an invertible operator from H onto kerA⊥. So for any y∈kerA⊥, we have y=ABy=BAy. Then it follows that ∥y∥≤∥B∥⋅∥Ay∥, and
∥Ay∥≥∥B∥1∥y∥.
Note that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where y3 is in span{e1,e2}. By induction, we have
[TABLE]
where yk+1 is in span{e1,⋯,ek}.
Thus, we have that
[TABLE]
∎
Lemma 7.4**.**
Let T∈B(H) be invertible and transitive. Suppose that x is a nonzero noncyclic vector of T−1 and N(x)=\mboxspan{T−kx,k≥1}. Then
[TABLE]
Furthermore, there exists an ONB {uk}k=−∞∞ of H, uk∈kerT1∗(k+1)(x)⊖kerT1∗k(x) for k≥0, u−k∈kerT2k(x)⊖kerT2k−1(x) for k≥1, which satisfies
[TABLE]
and
[TABLE]
where ∣t−k,−k+1∣≥2∥T∥1,∣tk,k+1∣≥2∥T∥1,k=0,1,2⋯.
Proof.
Note that T1∗(x)H1∗(x)=IN(x). Write
[TABLE]
and
[TABLE]
Then T1∗(x)B=IN(x) and B is the standard right inverse of T1∗(x).
By Lemma 7.3, we have that
[TABLE]
Notice that T2(x)H2(x)=IN(x)⊥, we also have that
[TABLE]
∎
Lemma 7.5**.**
Suppose T∈B(H) is invertible and transitive, and there exists an ONB {uk}k=−∞∞ of H given as in Lemma 7.4 such that
[TABLE]
[TABLE]
Then a01=0.
Proof.
Notice that
[TABLE]
and set
[TABLE]
By Lemma 3.7, there exists an invertible operator G such that
[TABLE]
Since
C(T1(x))=∅, we have C(A∗)=∅. Thus, there exists an x−1 such that
[TABLE]
Since T is transitive, by Proposition 5.16, we have that T2(x−1)∈B1(Ω). If α01=0, we have \mboxdimkerT2(x−1)=2, which is a contradiction.
∎
Lemma 7.6**.**
Let T∈B(H) be invertible and transitive. Then there exists an xn∈H such that N(xn)=\mboxspan{uk,k≤n}, and satisfies
- (1)
T1(xn)∼sT1(xn−1);
2. (2)
PN(xn)⟶SOTI;
3. (3)
PN(xn)T−1∣N(xn)⟶SOTT−1.
Proof.
Firstly, we will find x1 such that N(x1)=\mboxspan{uk,k≤1}. Set
[TABLE]
By Lemma 7.5, we have a01=0. By Lemma 3.7, A1∼sT1∗(x0), where x0 is the vector x in Lemma 7.5. Since T−1x0∈C(T1(x0)), there exists some x1=0 such that
[TABLE]
Meanwhile,
[TABLE]
and T−1x1∈C(T1(x1)). Now set
[TABLE]
By Lemma 7.4, we have that ∣t1,2∣≥2∥T∥1. By Lemma 3.7, we have that A2∼sT1∗(x1). Since T−1x1∈C(T1(x1)), there exists an x2 such that
[TABLE]
In this case, set T1(x2)=A2∗. Repeating the steps above, we can find a sequence {xn}n=1∞. Notice that N(xn−1)⊆N(xn). Then {xn}n=1∞ satisfies the condition of this lemma.
∎
Theorem 7.7**.**
Let T∈B(H) be an invertible hyponormal operator. If T−1 is intransitive and there exist at least two bounded components of \mboxintσ(T−1)∧, then T is also intransitive.
Proof.
If \mboxintσ(T−1)=∅, by the result of S. Brown [5], we see that
T and T−1 both have nontrivial invariants subspaces. So in the following we assume \mboxintσ(T−1)=∅.
Let x be a nonzero noncyclic vector of T−1 and let N(x)=span{T−nx:n≥1}. Denote by T1(x)=PN(x)T−1PN(x). Suppose T is transitive. By Proposition 5.16, T1∗(x)∈B1(Ω0∗) and 0∈Ω0. By Lemma 3.5, let T1∗(x)∈B1(L0∗) such that L0∗⊇Ω0∗ is maximal. By Proposition 5.16, C(T1(x))=∅. By Proposition 4.5, L0=ρF−1(T1(x)).
Let U0 and U1 be two bounded components of \mboxintσ(T−1)∧ such that 0∈U0. By the assumption \mboxintσ(T−1)=∅, we have U0,U1⊆ρ(T−1). Since N(x)∈Lat(T−1), σ(T1(x))⊆σ(T−1)∧ and σ(T1(x))∧⊆σ(T−1)∧. Therefore, L0⊆U0 and L0∩U1=∅.
Suppose ∂U1⊆σe(T1(x)). Since U1⊆ρ(T−1), U1⊆ρs−F(T1(x)). Note that L0∩U1=∅ and C(T1(x))=∅. By Proposition 4.5, U1⊆ρ(T1(x)) and σ(T1(x))∧∩ρF(T1(x)) has a connected component U1 which does not contain zero point. By Theorem 6.1, T is intransitive. This contradicts to the assumption that T is transitive. Thus there exists a λ∈∂U1 such that λ∈ρF(T1(x)). Since C(T1(x))=∅, by Lemma 3.3 and Proposition 4.3, λ∈ρF−1(T1(x)) or λ∈ρ(T1(x)). Note that L0=ρF−1(T1(x)) and L0∩U1=∅. We have λ∈/ρF−1(T1(x)). Thus λ∈ρ(T1(x)).
By Lemma 7.6, there exists a sequence of vectors {xn}n=0∞∈H such that N(xn−1)⊆N(xn). Then PN(xn)⟶SOTI, T1(xn)⟶SOTT−1 and T1(xn)∼sT1(xn−1) and thus σ(T1(xn))=σ(T1(x0)),n≥0. Furthermore, for any ξ∈H, by [Proposition 2.1, page 72] of [26], we have
[TABLE]
Notice that
[TABLE]
It follows that
[TABLE]
Therefore, (T−1−λ) is bounded below. On the other hand, λ∈∂U1⊆∂σ(T−1). This is a contradiction.
∎
7.2. Strictly cyclic invariant subspaces
Definition 7.8**.**
Let T∈B(H) and let A(T) be the closed subalgebra of B(H) generated by T and I. A vector ξ∈H is called a strictly cyclic vector of T if {Sξ:S∈A(T)}=H. An invariant subspace K⊆H of T is called a strictly cyclic invariant subspace if T∣K∈B(K) has a strictly cyclic vector.
The following lemma is due to B.Barnes (Corollary 3 of [4]).
Lemma 7.9**.**
Suppose T∈B(H) is strictly cyclic. Then σp(T∗)=σ(T∗).
Lemma 7.10**.**
Let T∈B(H) be an invertible operator. If T−1 is intransitive and satisfies the following properties:
- (1)
there exists a bounded open set Ω which is a connected component of ρ(T−1) such that Ω∩U0=∅, where U0 is the connected component of int(σ(T−1)∧) containing zero point;
2. (2)
σp((PN(x)T−1∣N(x))∗)=σ((PN(x)T−1∣N(x))∗),**
then T is also intransitive.
Proof.
Suppose T is transitive.
Claim: σ(T−1)⊆σ(T2(x)). Otherwise, there exists a λ∈σ(T−1) such that λ∈ρ(T2(x)). If λ∈ρ(T1(x)), then direct computation shows that λ∈ρ(T−1). It is a contradiction. Suppose λ∈σ(T1(x)). Then λˉ∈σ((T1(x))∗)=σp((T1(x))∗). Thus there exists a nonzero vector ξ∈N(x) such that (T1(x)−λ)∗ξ=0. Note that (T2(x)−λ)∗ is invertible. There exists a vector η∈N(x)⊥ such that
[TABLE]
This implies that
[TABLE]
Thus σp(T−1∗)=∅ and T is intransitive. It is a contradiction and the Claim is true. By Theorem 6.4, T is intransitive.
∎
Theorem 7.11**.**
Let T∈B(H) be invertible. If T−1 has a proper strictly cyclic invariant subspace and there exists a bounded open set Ω which is a connected component of ρ(T−1) such that Ω∩U0=∅, where U0 is the connected component of int(σ(T−1)∧) containing zero point, then T is intransitive.
Proof.
Suppose N(x) is a strictly cyclic invariant subspace of T−1. By Lemma 7.9, σp(Tˉ1∗(x))=σ(Tˉ1∗(x)). By Lemma 7.10, T has a nontrivial invariant subspace.
∎