2002
DOI: 10.2298/fil0216019h
|View full text |Cite
|
Sign up to set email alerts
|

Variations on a theme of Kaplansky

Abstract: We explore the relationship between Kaplansky's Lemma about locally algebraic operators, a dual to Kaplansky's lemma, and non singularity for pairs of operators in the sense of Joseph L. Taylor. Kaplansky's Lemma ([7] Lemma 14;[10] Theorem 4.8;[11] (3.5)) says that, for bounded linear operators on Banach spaces, 0.1 locally algebraic =⇒ algebraic .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2004
2004
2013
2013

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…The first part of this is known as Kaplansky's Lemma; the proof [10], [12] is a combination of Baire's theorem and the Euclidean algorithm for polynomials. The Euclidean algorithm also gives equality…”
Section: Necessary and Sufficient For T To Have Finite Descent Is Thatmentioning
confidence: 99%
See 1 more Smart Citation
“…The first part of this is known as Kaplansky's Lemma; the proof [10], [12] is a combination of Baire's theorem and the Euclidean algorithm for polynomials. The Euclidean algorithm also gives equality…”
Section: Necessary and Sufficient For T To Have Finite Descent Is Thatmentioning
confidence: 99%
“…We cannot however remove the semi-Fredholm conditions: for example [12] if T = U ⊗ V is the tensor product of the shifts, then (14.3) holds but we never get T k (X) ∩ T −1 (0) = {0}. For operators which are both upper semi-Fredholm and of finite ascent, or lower semi-Fredholm of finite descent ("semi Browder" in the sense of [8], Definition 7.9.1) the conditions of Theorem 10 can be replaced by simple commutivity ( [8], Theorem 7.9.2).…”
Section: Theorem T ∈ Bl(x X) Is Of Finite Descent; Then So Is T −λImentioning
confidence: 99%