Documenta Mathematica
Journal der Deutschen Mathematiker-Vereinigung
Band 2 1997
ISSN 1431-0635 Print ISSN 1431-0643Internet
Documenta Mathematica, Journal der Deutschen Mathematiker-Vereinigung, ver-
offentlicht Forschungsarbeiten aus allen mathematischen Gebieten und wird in tradi- tioneller Weise referiert.
Documenta Mathematicaerscheint am World Wide Web unter der Adresse:
http://www.mathematik.uni-bielefeld.de/documenta
Artikel konnen als TEX-Dateien per E-Mail bei einem der Herausgeber eingereicht werden. Hinweise fur die Vorbereitung der Artikel konnen unter der obigen WWW- Adresse gefunden werden.
Documenta Mathematica, Journal der Deutschen Mathematiker-Vereinigung,pub- lishes research manuscripts out of all mathematical elds and is refereed in the tradi- tional manner.
Documenta Mathematicais published on the World Wide Web under the address:
http://www.mathematik.uni-bielefeld.de/documenta
Manuscripts should be submitted as TEX les by e-mail to one of the editors. Hints for manuscript preparation can be found under the above WWW-address.
Geschaftsfuhrende Herausgeber / Managing Editors:
Alfred K. Louis, Saarbrucken [email protected]
Ulf Rehmann (techn.), Bielefeld [email protected] Peter Schneider, Munster [email protected]
Herausgeber / Editors:
Don Blasius, Los Angeles [email protected] Joachim Cuntz, Heidelberg [email protected] Bernold Fiedler, Berlin (FU) [email protected]
Friedrich Gotze, Bielefeld [email protected] Wolfgang Hackbusch, Kiel [email protected] Ursula Hamenstadt, Bonn [email protected] Max Karoubi, Paris [email protected] Rainer Kre, Gottingen [email protected]
Stephen Lichtenbaum, Providence Stephen [email protected] Alexander S. Merkurjev, St.Petersburg [email protected]
Anil Nerode, Ithaca [email protected]
Thomas Peternell, Bayreuth [email protected] Wolfgang Soergel, Freiburg [email protected] Gunter M. Ziegler, Berlin (TU) [email protected]
ISSN 1431-0635Documenta Mathematica(Print) ISSN 1431-0643Documenta Mathematica(Internet)
Anschrift des technischen geschaftsfuhrenden Herausgebers:
Ulf Rehmann, Fakultat fur Mathematik, Universitat Bielefeld, Postfach 100131, D-33501 Bielefeld Copyright c1997 fur das Layout: Ulf Rehmann
Documenta Mathematica
Journal der Deutschen Mathematiker-Vereinigung Band 2, 1997
A. Bottcher
On the Approximation Numbers
of Large Toeplitz Matrices 1{29
Amnon Besser
On the Finiteness of X for Motives
Associated to Modular Forms 31{46
A. Langer
Selmer Groups and Torsion Zero Cycles on the
Selfproduct of a Semistable Elliptic Curve 47{59 Christian Leis
Hopf-Bifurcation in Systems with Spherical Symmetry
Part I : Invariant Tori 61{113
Jane Arledge, Marcelo Laca and Iain Raeburn Semigroup Crossed Products and Hecke Algebras
Arising from Number Fields 115{138
Joachim Cuntz
Bivariante K-Theorie fur lokalkonvexe Algebren
und der Chern-Connes-Charakter 139{182
Henrik Kratz
Compact Complex Manifolds
with Numerically Effective Cotangent Bundles 183{193 Ekaterina Amerik
Maps onto Certain Fano Threefolds 195{211
Jonathan Arazy and Harald Upmeier Invariant Inner Product in Spaces of Holomorphic Functions
on Bounded Symmetric Domains 213{261
Victor Nistor
Higher Index Theorems and
the Boundary Map in Cyclic Cohomology 263{295 Oleg T. Izhboldin and Nikita A. Karpenko
On the Group H3(F( ;D)=F) 297{311
Udo Hertrich-Jeromin and Franz Pedit Remarks on the Darboux Transform of
Isothermic Surfaces 313{333
iii
Udo Hertrich-Jeromin
Supplement on Curved Flats in the Space of Point Pairs and Isothermic Surfaces:
A Quaternionic Calculus 335{350
Ernst-Ulrich Gekeler
On the Cuspidal Divisor Class Group of a
Drinfeld Modular Curve 351{374
Mikael Rrdam
Stability ofC-Algebras is Not a Stable Property 375{386
iv
Doc. Math. J. DMV 1
On the Approximation Numbers of Large Toeplitz Matrices
A. Bottcher Received: January 14, 1997 Communicated by Alfred K. Louis
Abstract. The kth approximation number s(kp)(An) of a complex nn matrix Anis dened as the distance of An to the nn matrices of rank at most n k. The distance is measured in the matrix norm associated with the lp norm (1 < p < 1) on
C
n. In the case p = 2, the approximation numbers coincide with the singular values.We establish several properties of s(kp)(An) provided Anis the nn trunca- tion of an innite Toeplitz matrix A and n is large. As n!1, the behavior of s(kp)(An) depends heavily on the Fredholm properties (and, in particular, on the index) of A on lp.
This paper is also an introduction to the topic. It contains a concise history of the problem and alternative proofs of the theorem by G. Heinig and F.
Hellinger as well as of the scalar-valued version of some recent results by S.
Roch and B. Silbermann concerning block Toeplitz matrices on l2.
1991 Mathematics Subject Classication: Primary 47B35; Secondary 15A09, 15A18, 15A60, 47A75, 47A58, 47N50, 65F35
1. Introduction
Throughout this paper we tacitly identify a complex nn matrix with the operator it induces on
C
n. For 1 < p <1, we denote byC
npthe spaceC
nwith the lp norm,kxkp:=jx1jp+ ::: +jxnjp1=p; and given a complex nn matrix An, we put
kAnkp:= supx
6=0
kAnxkp=kxkp
: (1)
Research supported by the Alfried Krupp Forderpreis fur junge Hochschullehrer of the Krupp Foundation
2 A. Bottcher
We let B(
C
np) stand for the Banach algebra of all complex nn matrices with the norm (1). For j2f0;1;:::;ng, letFj(n)be the collection of all complex nn matrices of rank at most j, i.e., letF
(n)
j :=nF 2B(
C
np) : dimImFjo:The kth approximation number (k2f0;1;:::;ng) of An2B(
C
np) is dened as s(kp)(An) := dist(An;Fn k(n)) := minnkAn Fnkp: Fn2Fn k(n)o: (2) (note thatFj(n)is a closed subset ofB(
C
np)). Clearly,0 = s(0p)(An)s(1p)(An):::s(np)(An) =kAnkp: It is easy to show (see Proposition 9.2) that
s(1p)(An) =
1=kAn1kp if An is invertible;
0 if An is not invertible: (3) Notice also that in the case p = 2 the approximation numbers s(2)1 (An);:::;s(2)n (An) are just the singular values of An, i.e., the eigenvalues of (AnAn)1=2.
Let
T
be the complex unit circle and let a2L1:= L1(T
). The nn Toeplitz matrix Tn(a) generated by a is the matrixTn(a) := (aj k)nj;k=1 (4)
where al(l2
Z
) is the lth Fourier coecient of a, al:= 12Z02a(ei)e ild:This paper is devoted to the limiting behavior of the numbers s(kp)(Tn(a)) as n goes to innity.
Of course, the study of properties of Tn(a) as n!1leads to the consideration of the innite Toeplitz matrix
T(a) := (aj k)1j;k=1:
The latter matrix induces a bounded operator on l2 := l2(
N
) if (and only if) a2L1. Acting with T(a) on lp:= lp(N
) is connected with a multiplier problem in case p6= 2.We let Mpstand for the set of all a2L1for which T(a) generates a bounded operator on lp. The norm of this operator is denoted by kT(a)kp. The function a is usually referred to as the symbol of T(a) and Tn(a).
In this paper, we prove the following results.
Theorem 1.1. If a2Mp then for eachk,
s(n kp) Tn(a)!kT(a)kp as n!1:
Approximation Numbers of Toeplitz Matrices 3
Theorem 1.2. If a2Mp and T(a)is not normally solvable on lp then for eachk, s(kp)Tn(a)!0 as n!1
Let Mh2i := L1. For p6= 2, we dene Mhpi as the set of all functions a2L1 which belong to Mp~for all ~p in some open neighborhood of p (which may depend on a). A well known result by Stechkin says that a 2 Mp for all p 2(1;1) whenever a2L1and the total variation V1(a) of a is nite and that in this case
kT(a)kpCpkak1+ V1(a) (5) with some constant Cp<1(see, e.g., [5, Section 2.5(f)] for a proof). We denote by PC the closed subalgebra of L1 constituted by all piecewise continuous functions.
Thus, a2PC if and only if a2L1and the one-sided limits a(t0) := lim"
!00a(ei(+"))
exist for every t = ei2
T
. By virtue of (5), the intersection PC\Mhpi contains all piecewise continuous functions of nite total variation.Throughout what follows we dene q2(1;1) by 1=p + 1=q = 1 and we put [p;q] :=hminfp;qg;maxfp;qgi:
One can show that if a 2 Mp, then a 2 Mr for all r 2 [p;q] (see, e.g., [5, Section 2.5(c)]).
Here is the main result of this paper.
Theorem 1.3. Leta be a function in PC\Mhpi and suppose T(a) is Fredholm of the same index k (2
Z
)onlr for allr2[p;q]. Thennlim!1s(jkp)jTn(a)= 0 and liminfn
!1
s(jkp)j+1Tn(a)> 0:
For p = 2, Theorems 1.2 and 1.3 are special cases of results by Roch and Silber- mann [20], [21]. Since a Toeplitz operator on l2 with a piecewise continuous symbol is either Fredholm (of some index) or not normally solvable, Theorems 1.2 and 1.3 completely identify the approximation numbers (= singular values) which go to zero in the case p = 2.
Now suppose p 6= 2. If a 2 C\Mhpi, then T(a) is again either Fredholm or not normally solvable, and hence Theorems 1.2 and 1.3 are all we need to see which approximation numbers converge to zero. In the case where a2PC\Mhpi we have three mutually excluding possibilities (see Section 3):
(i) T(a) is Fredholm of the same index k on lr for all r2[p;q];
(ii) T(a) is not normally solvable on lp or not normally solvable on lq;
4 A. Bottcher
(iii) T(a) is normally solvable on lp and lq but not normally solvable on lr for some r2(p;q) := [p;q]nfp;qg.
In the case (i) we can apply Theorem 1.3. Since
s(kp)Tn(a)= s(kq)Tn(a) (6) (see (35)), Theorem 1.2 disposes of the case (ii). I have not been able to settle the case (iii). My conjecture is as follows.
Conjecture 1.4. In the case(iii)we have
s(kp)Tn(a)!0 as n!1 for every xed k.
The paper is organized as follows. Section 2 is an attempt at presenting a short history of the topic. In Section 3 we assemble some results on Toeplitz operators on lp which are needed to prove the three theorems stated above. Their proofs are given in Sections 4 to 6. The intention of Sections 7 and 8 is to illustrate how some simple constructions show a very easy way to understand the nature of the Heinig/Hellinger and Roch/Silbermann results. Notice, however, that the approach of Sections 7 and 8 cannot replace the methods of these authors. They developed some sort of high technology which enabled them to tackle the block case and more general approximation methods, while in these two sections it is merely demonstrated that in the scalar case (almost) all problems can be solved with the help of a few crowbars (Theorems 7.1, 7.2, 7.4). Nevertheless, beginners will perhaps appreciate reading Sections 7 and 8 before turning to the papers [13] and [25], [20].
2. Brief history
The history of the lowest approximation number s(1p)(Tn(a)) is the history of the nite section method for Toeplitz operators: by virtue of (3), we have
s(1p)Tn(a)!0()kTn1(a)kp!1:
We denote by k(lp) the collection of all Fredholm operators of index k on lp. The equivalence
limsupn
!1
kTn1(a)kp<1()T(a)20(lp) (7) was proved by Gohberg and Feldman [7] in two cases: if a2C\Mhpi(where C stands for the continuous functions on
T
) or if p = 2 and a2PC. For a2PC\Mhpi, the equivalencelimsupn
!1
kTn1(a)kp<1()T(a)20(lr) for all r2[p;q] (8)
Approximation Numbers of Toeplitz Matrices 5
holds. This was shown by Verbitsky and Krupnik [30] in the case where a has a single jump, by Silbermann and the author [3] for symbols with nitely many jumps, and nally by Silbermann [23] for symbols with a countable number of jumps. In the work of many authors, including Ambartsumyan, Devinatz, Shinbrot, Widom, Silbermann, it was pointed out that (7) is also true if
p = 2 and a2(C + H1)[(C + H1)[PQC
(see [4], [5]). Also notice that the implication \=)" of (8) is valid for every a2Mp. Treil [26] proved that there exist symbols a 2 Mh2i = L1 such that T(a)2 0(l2) butkTn1(a)k2is not uniformly bounded; concrete symbols with this property can be found in the recent article [2, Section 7.7].
The Toeplitz matrices Tn(') =
1 j k +
n
j;k=1 ( 62
Z
)are the elementary building blocks of general Toeplitz matrices with piecewise contin- uous symbols and have therefore been studied for some decades. The symbol is given by '(ei) = sin eie i; 2[0;2):
This is a function in PC with a single jump at ei = 1. Tyrtyshnikov [27] focussed attention on the singular values of Tn('). He showed that
s(2)1 Tn(')= O(1=njj 1=2) if 2
R
and jj> 1=2 and that there are constants c1;c22(0;1) such thatc1=logns(2)1 Tn('1=2)c2=logn:
Curiously, the case jj< 1=2 was left as an open problem in [27], although from the standard theory of Toeplitz operators with piecewise continuous symbols it is well known that
T(')20(l2)()jRej< 1=2
(see, e.g., [7, Theorem IV.2.1] or [5, Proposition 6.24]), which together with (7) (for p = 2 and a2PC) implies that
liminfn
!1
s(2)1 Tn(')= 0 if jRej1=2 (9)
and liminfn
!1
s(2)1 Tn(')> 0 if jRej< 1=2
(see [20]). A simple and well known argument (see the end of Section 3) shows that in (9) the liminf can actually be replaced by lim.
Also notice that it was already in the seventies when Verbitsky and Krupnik [30]
proved that
nlim!1s(1p)Tn(')= 0 () jRejminf1=p;1=qg
6 A. Bottcher
(full proofs are also in [4, Proposition 3.11] and [5, Theorem 7.37; in part (iii) of that theorem there is a misprint: the 1=p < Re < 1=q must be replaced by
1=q < Re < 1=p]).
As far as I know, collective phenomena of s(1p)(Tn(a));:::;s(np)(Tn(a)) have been studied only for p = 2, and throughout the rest of this section we abbreviate s(2)k (Tn(a)) to sk(Tn(a)).
In 1920, Szego showed that if a2L1 is real-valued and F is continuous on
R
,then 1
n
n
X
k=1Fsk(Tn(a))! 1 2
2
Z
0 Fja(ei)jd: (10)
In the eighties, Parter [15] and Avram [1] extended this result to arbitrary (complex- valued) symbols a2L1. Formula (10) implies that
nsk(Tn(a))onk=1 and nja(e2ik=n)jonk=1 (11) are equally distributed (see [9] and [29]).
Research into the asymptotic distribution of the singular values of Toeplitz ma- trices was strongly motivated by a phenomenon discovered by C. Moler in the middle of the eighties. Moler observed that almost all singular values of Tn('1=2) are concen- trated in [ ";] where " is very small. Formula (10) provides a way to understand this phenomenon: letting F = 1 on [0; 2"] and F = 0 on [ ";] and taking into account thatj'1=2j= 1, one gets
n1
n
X
k=1Fsk(Tn('1=2))! 1 2
2
Z
0 F(1)d = F(1) = 0;
which shows that the percentage of the singular values of Tn('1=2) which are located in [0; 2"] goes to zero as n increases to innity.
Widom [32] was the rst to establish a second order result on the asymptotics of singular values. Under the assumption that
a2L1 and X
n2Zjnjjanj2<1 and that F 2C3(
R
), he showed thatn
X
k=1Fs2k(Tn(a))= n2Z02Fja(ei)j2d + EF(a) + o(1)
with some constant EF(a), and he gave an expression for EF(a). He also introduced two limiting sets of the sets
(Tn(a)) :=ns1(Tn(a));:::;sn(Tn(a))o;
Approximation Numbers of Toeplitz Matrices 7
which, following the terminology of [19], are dened by part
(Tn(a)) := f2
R
: is partial limit of some sequencefng with n2(Tn(a))g; unif
(Tn(a)) := f2
R
: is the limit of some sequencefng with n2(Tn(a))g: It turned out that for large classes of symbols a we have
part
(Tn(a))= unif
(Tn(a))= spT(a)T(a)1=2 (12) where spA := f 2
C
: A I is not invertibleg denotes the spectrum of A (on l2) and a is dened by a(ei) := a(ei). Note that T(a) is nothing but the adjoint T(a) of T(a). Widom [32] proved (12) under the hypothesis that a2PC or that a is locally self-adjoint, while Silbermann [24] derived (12) for locally normal symbols.Notice that symbols in PC or even in PQC are locally normal.
In the nineties, Tyrtyshnikov [28], [29] succeeded in proving that the sets (11) are equally distributed under the sole assumption that a2L2:= L2(
T
). His approach is based on the observation that if kAn BnkF = o(n), where kkF stands for the Frobenius (or Hilbert-Schmidt) norm, then Anand Bn have equally distributed singular values. The result mentioned can be shown by taking An = Tn(a) and choosing appropriate circulants for Bn.The development received a new impetus from Heinig and Hellinger's 1994 paper [13]. They considered normally solvable Toeplitz operators on l2 and studied the problem whether the Moore-Penrose inverses of Tn+(a) of Tn(a) converge strongly on l2to the Moore-Penrose inverse T+(a) of T(a). Recall that the Moore-Penrose inverse of a normally solvable Hilbert space operator A is the (uniquely determined) operator A+ satisfying
AA+A = A; A+AA+= A+; (A+A)= A+A; (AA+)= AA+:
If a 2C, then T(a) is normally solvable on l2 if and only if a(t)6= 0 for all t 2
T
. When writing Tn+(a)!T+(a), we actually mean that Tn+(a)Pn!T+(a), where Pnis the projection dened by
Pn:fx1;x2;x3;:::g7!fx1;x2;:::;xn;0;0;:::g: (13) It is not dicult to verify that Tn+(a) !T+(a) strongly on l2 if and only if T(a) is normally solvable and
limsupn
!1
kTn+(a)k2<1: (14) Heinig and Hellinger investigated normally solvable Toeplitz operators T(a) with symbols in the Wiener algebra W,
a2W ()kakW :=X
n2Z
janj<1;
and they showed that then (14) is satised if and only if there is an n01 such that Ker T(a)ImPn0 and Ker T(a)ImPn0; (15)
8 A. Bottcher
where Ker A :=fx2l2: Ax = 0gand ImA :=fAx : x2l2g. (This formulation of the Heinig-Hellinger result is due to Silbermann [25].) Conditions (15) are obviously met if T(a) is invertible, in which case even kTn1(a)k2 is uniformly bounded. The really interesting case is the one in which T(a) is not invertible, and in that case (15) and thus (14) are highly instable. For example, if a is a rational function (without poles on
T
) and 2spT(a), thenlimsupn
!1
kTn+(a )k2<1 (16) can only hold if belongs to spTn(a) for all suciently large n. Consequently, (16) implies that lies in unif(sp Tn(a)), and the latter set is extremely \thin": it is contained in a nite union of analytic arcs (see [22] and [6]).
What has Moore-Penrose invertibility to do with singular values ? The answer is as follows: if An2B(
C
n2) and sk(An) is the smallest nonzero singular value of An, thenkA+nk2= 1=sk(An):
Thus, (14) holds exactly if there exists a d > 0 such that
(Tn(a))f0g[[d;1) (17)
for all suciently large n.
Now Silbermann enters the scene. He replaced the Heinig-Hellinger problem by another one. Namely, given T(a), is there a sequence fBngof operators Bn2B(
C
n2) with the following properties: there exists a bounded operator B on l2 such thatBn!B and Bn!B strongly on l2 and
kTn(a)BnTn(a) Tn(a)k2!0; kBnTn(a)Bn Bnk2!0;
k(BnTn(a)) BnTn(a)k2!0; k(Tn(a)Bn) Tn(a)Bnk2!0 ? Such a sequence fBngis referred to as an asymptotic Moore-Penrose inverse of T(a).
In view of the (instable) conditions (15), the following result by Silbermann [25] is surprising: if a2PC and T(a) is normally solvable, then T(a) always has an asymp- totic Moore-Penrose inverse. And what is the concern of this result with singular values ? One can easily show T(a) has an asymptotic Moore-Penrose inverse if and only if there is a sequence cn!0 and a number d > 0 such that
(Tn(a))[0;cn][[d;1): (18) One says that (Tn(a)) has the splitting property if (18) holds with cn!0 and d > 0.
Thus, Silbermann's result implies that if a2PC and T(a) is normally solvable on l2, then (Tn(a)) has the splitting property.
Only recently, Roch and Silbermann [20], [21] were able to prove even much more. The sets (Tn(a)) are said to have the k-splitting property, where k0 is an integer, if (18) is true for some sequence cn !0 and some d > 0 and, in addition, exactly k singular values lie in [0;cn] and n k singular values are located in [d;1)
Approximation Numbers of Toeplitz Matrices 9
(here multiplicities are taken into account). Equivalently, (Tn(a)) has the k-splitting property if and only if
nlim!1sk(Tn(a)) = 0 and liminfn
!1
sk+1(Tn(a)) > 0: (19) A normally solvable Toeplitz operator T(a) on l2 with a symbol a 2 PC is automatically Fredholm and therefore has some index k2
Z
. Roch and Silbermann [20], [21] discovered that then (Tn(a)) has thejkj-splitting property. In other words, if a2PC and T(a)2k(l2) then (19) holds with k replaced byjkj. Notice that this Theorem 1.3 for p = 2.In fact, it was the Roch and Silbermann papers [20], [21] which stimulated me to do some thinking about singular values. It was the feeling that the jkj-splitting property must have its root in the possibility of \ignoringjkjdimensions" which led me to the observation that none of the works cited in this section makes use of the fact that sk(An) may alternatively be dened by (2), i.e. that singular values may also be viewed as approximation numbers. I then realized that some basic phenomena of [20]
and [21] can be very easily understood by having recourse to (2) and that, moreover, using (2) is a good way to pass from l2 and C-algebras to lpand Banach algebras.
3. Toeplitz operators on lp
We henceforth always assume that 1 < p <1and 1=p + 1=q = 1.
Let Mp and Mhpi be as in Section 1. The set Mp can be shown to be a Banach algebra with pointwise algebraic operations and the norm kakMp := kT(a)kp. It is also well known that
Mp= MqM2= L1 and
kakMp =kakMqkakM2 =kak1 (20) (see, e.g., [5, Section 2.5]). We remark that working with Mhpiinstead of Mpis caused by the need of somehow reversing the estimate in (20). Suppose, for instance, p > 2 and a 2Mhpi. Then a 2Mp+" for some " > 0, and the Riesz-Thorin interpolation theorem gives
kakMp kakM2kak1p+"=kak1kak1Mp+" (21) with some 2(0;1) depending only on p and ". ThekakMp+"on the right of (21) may in turn be estimated by Cp(kak1+ V1(a)) (recall Stechkin's inequality (5)) provided a has bounded total variation.
A bounded linear operator A on lp is said to be normally solvable if its range, ImA, is a closed subset of lp. The operator A is called Fredholm if it is normally solvable and the spaces
Ker A :=fx2lp: Ax = 0g and CokerA := lp=ImA have nite dimensions. In that case the index IndA is dened as
IndA := dimKer A dimCokerA:
10 A. Bottcher
We denote by (lp) the collection of all Fredholm operators on lp and by k(lp) the operators in (lp) whose index is k. The following four theorems are well known.
Comments are at the end of this section.
Theorem 3.1. Leta2Mp.
(a)Ifadoes not vanish identically, then the kernel ofT(a)onlp or the kernel ofT(a) on lq is trivial.
(b) The operatorT(a) is invertible onlp if and only if T(a)20(lp). Of course, part (b) is a simple consequence of part (a).
Theorem 3.2. Let a2C\Mhpi. Then T(a) is normally solvable on lp if and only if a(t)6= 0 for allt2
T
. In that case T(a)2(lp)andIndT(a) = winda;
where windais the winding number ofa about the origin.
Now let a2PC; t2
T
, and suppose a(t 0)6= a(t + 0). We denote byAp(a(t 0);a(t + 0))
the circular arc at the points of which the line segment [a(t 0);a(t+0)] is seen at the angle maxf2=p;2=qgand which lies on the right of the straight line passing rst a(t 0) and then a(t + 0) if 1 < p < 2 and on the left of this line if 2 < p <1. For p = 2,Ap(a(t 0);a(t+0)) is nothing but the line segment [a(t 0);a(t+0)] itself. Let a#p denote the closed, continuous, and naturally oriented curve which results from the (essential) rangeR(a) of a by lling in the arcs Ap(a(t 0);a(t + 0)) for each jump.
In case this curve does not pass through the origin, we let winda#p be its winding number.
Theorem 3.3. Leta2PC\Mhpi. ThenT(a)is normally solvable on lp if and only if 062a#p. In that case T(a)2(lp)and
IndT(a) = winda#p: For a2PC and t2
T
, putOp
a(t 0); a(t + 0):= [
r2[p;q]
Ar
a(t 0); a(t + 0): (22) If a(t 0)6= a(t + 0) and p6= 2, thenOp(a(t 0);a(t + 0)) is a certain lentiform set.
Also for a2PC, let
a#[p;q] := [
r2[p;q]a#r :
Approximation Numbers of Toeplitz Matrices 11
Thus, a#[p;q] results fromR(a) by lling in the sets (22) between the endpoints of the jumps. If 062a#[p;q], then necessarily 0 62a#2 and we dene winda#[p;q] as winda#2 in this case.
From Theorem 3.3 we deduce that the conditions (i) to (iii) of Section 1 are equivalent to the following:
(i') 062a#[p;q] and winda#[p;q] = k;
(ii') 02a#p [a#q;
(iii') 02a#[p;q]n(a#p [a#q ).
For a 2Mp, let Tn(a) 2 B(
C
np) be the operator given by the matrix (4). One says that the sequence fTn(a)g:=fTn(a)g1n=1is stable iflimsupn
!1
kTn1(a)kp<1: Here we follow the practice of putting
kTn1(a)kp =1 if Tn(a) is not invertible.
In other words, fTn(a)gis stable if and only if Tn(a) is invertible for all nn0 and there exists a constant M <1 such thatkTn1(a)kp M for all nn0. From (3) we infer that
fTn(a)g is stable ()liminfn
!1
s(1p)(Tn(a)) > 0:
Theorem 3.4. (a)If a2C\Mhpi then
fTn(a)g is stable () 062a(
T
) and winda = 0:(b) If a2PC\Mhpi then
fTn(a)g is stable () 062a#[p;q] and winda#[p;q]= 0:
As already said, these theorems are well known. Theorem 3.1 is due to Coburn (p = 2) and Duduchava (p 6= 2), Theorem 3.2 is Gohberg and Feldman's, Theorem 3.3 is the result of many authors in the case p = 2 and was established by Duduchava for p6= 2, Theorem 3.4 goes back to Gohberg and Feldman for a2C\Mhpi (general p) and a 2 PC (p = 2), and it was obtained in the work of Verbitsky, Krupnik, Silbermann, and the author for a2PC\Mhpi and p6= 2. Precise historical remarks and full proofs are in [5].
Part (a) of Theorem 3.4 is clearly a special case of part (b). In fact, Theo- rem 3.4(b) may also be stated as follows: fTn(a)g contains a stable subsequence
12 A. Bottcher
fTnj(a)g(nj !1) if and only if 062a#[p;q] and winda#[p;q] = 0. Hence, we arrive at the conclusion that if a2PC\Mhpi, then
s(1p)(Tn(a))!0
()fTn(a)g is stable
()02a#[p;q] or 062a#[p;q] and winda#[p;q] 6= 0:
At this point the question of whether the lowest approximation number of Tn(a) goes to zero or not is completely disposed of for symbols a2PC\Mhpi.
4. Proof of Theorem 1.1.
Contrary to what we want, let us assume that there is a c < kT(a)kp such that s(n kp) (Tn(a)) c for all n in some innite set N. Since s(n kp) (Tn(a)) = dist(Tn(a);Fk(n)), we can nd Fn2 Fk(n)(n 2N) so that kTn(a) Fnkp c. For x = (x1;:::;xn) and y = (y1;:::;yn), we dene
(x;y) := x1y1+ :::+ xnyn: (23) By [16, Lemma B.4.11], there exist e(jn)2
C
np; fj(n)2C
np; j(n)2C
such thatFnx =Xk
j=1(jn)x;fj(n)e(jn) (x2
C
np);ke(jn)kp= 1; kfj(n)kq = 1, and
jj(n)jkFnkpkTn(a)kp+kFn Tn(a)kpkT(a)kp+ c (24) for all j2f1;:::;kg.
Fix x2
C
np;y2C
nq and supposekxkp= 1; kykq= 1. We then have
Tn(a)x;y Xk
j=1j(n)x;fj(n)e(jn);ykTn(a) Fnkpc: (25) Clearly, (Tn(a)x;y)!(T(a)x;y). From (24) and the Bolzano-Weierstrass theorem we infer that the sequence f((1n);:::;k(n))gn2N has a converging subsequence. Without loss of generality suppose the sequence itself converges, i.e.
1(n);:::;k(n)!(1;:::;k)2
C
kas n 2 N goes to innity. The vectors e(jn) and fj(n) all belong to the unit sphere of lp and lq, respectively. Hence, by the Banach-Alaoglu theorem (see, e.g., [18, Theorem IV.21]), fe(jn)gn2N and ffj(n)gn2N have subsequences converging in the weak -topology. Again we may without loss of generality assume that
e(jn)!ej 2lp; fj(n)!fj 2lq
Approximation Numbers of Toeplitz Matrices 13
in the weak-topology as n2N goes to innity.
From (25) we now obtain that if x 2 lp and y 2 lq have nite support and
kxkp= 1; kykq = 1, then
T(a)x;y) Xk
j=1j(x;fj)(ej;y)c:
This implies that
kT(a) Fkpc (26)
where F is the nite-rank operator given by Fx :=Xk
j=1j(x;fj)ej (x2lp): (27) Let kT(a)k(ess) denote the essential norm of T(a) on lp, i.e. the distance of T(a) to the compact operators on lp. By (26) and (27),
kT(a)k(ess)p kT(a) Fkpc <kT(a)kp:
However, one always has kT(a)k(ess)p = kT(a)kp (see, e.g., [5, Proposition 4.4(d)]).
This contradiction completes the proof.
5. Proof of Theorem 1.2.
We will employ the following two results.
Theorem 5.1. LetAbe a bounded linear operator on lp. (a)The operator Ais normally solvable on lp if and only if
kA:=x sup
2lp;kxkp=1dist(x;KerA) <1:
(b) If M is a closed subspace oflp and dim(lp=M) <1, then the normal solv- ability ofAjM : M!lp is equivalent to the normal solvability of A : lp!lp. A proof is in [8, pp. 159{160].
Theorem 5.2. IfM is ak-dimensional subspace of
C
np, then there exists a projection :C
np!C
np such thatIm = M andkkpk.This is a special case of [16, Lemma B.4.9].
Theorem 1.2 is trivial in case a vanishes identically. So suppose a2Mpnf0gand T(a) is not normally solvable on lp. Then the adjoint operator T(a) is not normally solvable on lq. By Theorem 3.1(a), KerT(a) =f0gon lp or Ker T(a) = f0gon lq.