2017
DOI: 10.1016/j.jmaa.2016.02.074
|View full text |Cite
|
Sign up to set email alerts
|

Numerical radius attaining compact linear operators

Abstract: Abstract. We show that there are compact linear operators on Banach spaces which cannot be approximated by numerical radius attaining operators.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 25 publications
(38 reference statements)
0
6
0
Order By: Relevance
“…As both C[0, 1] and L 1 [0, 1] have the BPBp for numerical radius [6,23], this shows that there is no possible valid reciprocal results for Theorem 4.1 and Proposition 4.7. On the other hand, the sets NRA(C[0, 1] ⊕ 1 L 1 [0, 1]) ∩ K(C[0, 1] ⊕ 1 L 1 [0, 1]) and NRA(C[0, 1] ⊕ ∞ L 1 [0, 1]) ∩ K(C[0, 1] ⊕ ∞ L 1 [0, 1]) are dense in K(C[0, 1] ⊕ 1 L 1 [0, 1]) and K(C[0, 1] ⊕ ∞ L 1 [0, 1]), respectively (see [12,Example 3.4]). Nevertheless, we do not know if there is some reciprocal result for the BPBp-nu for compact operators.…”
Section: Results For Numerical Radiusmentioning
confidence: 99%
See 1 more Smart Citation
“…As both C[0, 1] and L 1 [0, 1] have the BPBp for numerical radius [6,23], this shows that there is no possible valid reciprocal results for Theorem 4.1 and Proposition 4.7. On the other hand, the sets NRA(C[0, 1] ⊕ 1 L 1 [0, 1]) ∩ K(C[0, 1] ⊕ 1 L 1 [0, 1]) and NRA(C[0, 1] ⊕ ∞ L 1 [0, 1]) ∩ K(C[0, 1] ⊕ ∞ L 1 [0, 1]) are dense in K(C[0, 1] ⊕ 1 L 1 [0, 1]) and K(C[0, 1] ⊕ ∞ L 1 [0, 1]), respectively (see [12,Example 3.4]). Nevertheless, we do not know if there is some reciprocal result for the BPBp-nu for compact operators.…”
Section: Results For Numerical Radiusmentioning
confidence: 99%
“…We denote by NRA(X) the set of all numerical radius attaining operators on X. We refer the reader to the classical books [9,10] for background on numerical radius of operators and to [1,12,32] and the references therein for background on the study of the density of the set of numerical radius attaining operators.…”
Section: Introductionmentioning
confidence: 99%
“…Stability on the denseness. Started from [20], there have been many efforts for instance in [3,9,15] to construct an operator which cannot be approximated by numerical radius attaining operators. However, all of those counterexamples are based on a non-injective operator, so we cannot apply the same kind of argument to the case of the Crawford number attaining operators.…”
Section: Questions and Remaining Problemsmentioning
confidence: 99%
“…The study of numerical radius was one of main interest in the field of functional analysis in recent decades. In particular, phenomenon of numerical radius attaining operators was discovered in many sources such as [1,2,3,4,9,20]. It has not been that long since the minimum norm of an operator became an issue as a separated topic.…”
Section: Introductionmentioning
confidence: 99%
“…Recall that for a Banach space X, a bounded linear operator T ∈ L(X, X) is said to be a numerical radius attaining operator when the supremum in the equation ( 1) is attained by an element (x, x * ) such that x * (x) = 1. Numerical radius attaining operators, introduced in [40], have been investigated by many researchers (see, for instance, [1,8,9,37] and the references therein). In a similar spirit, we now define a Lipschitz numerical radius attaining map.…”
Section: Lipschitz Numerical Radii Indices and Daugavet Centersmentioning
confidence: 99%