You are on page 1of 42

Algebra i analiz St. Petersburg Math. J.

Tom. 17 (2005), vyp. 4 Vol. 17 (2006), No. 4, Pages 641–682


S 1061-0022(06)00924-1
Article electronically published on May 3, 2006

CONDITION NUMBERS OF LARGE MATRICES,


AND ANALYTIC CAPACITIES

N. K. NIKOLSKI

Abstract. Given an operator T : X −→ X on a Banach space X, we compare the


condition number of T , CN(T ) = T  · T −1 , and the spectral condition number
defined as SCN(T ) = T  · r(T −1 ), where r(·) stands for the spectral radius. For a
set Υ of operators, we put Φ(∆) = sup{CN(T ) : T ∈ Υ, SCN(T ) ≤ ∆}, ∆ ∈ [1, ∞),
and say that Υ is spectrally Φ-conditioned. As Υ we consider certain sets of (n × n)-
matrices or, more generally, algebraic operators with deg(T ) ≤ n that admit a specific
functional calculus. In particular, the following sets are included: Hilbert (Banach)
space power bounded matrices (operators), polynomially bounded matrices, Kreiss
type matrices, Tadmor–Ritt type matrices, and matrices (operators) admitting a
s -functional calculus. The above function Φ is estimated in terms
Besov class Bp,q
of the analytic capacity capA (·) related to the corresponding function class A. In
s , the quantity Φ(∆) is equivalent to ∆n ns as ∆ −→ ∞ (or
particular, for A = Bp,q
as n −→ ∞) for s > 0, and is bounded by ∆n (log(n))1/q for s = 0.

§1. Introduction
What this paper is about. How do we bound the resolvent of a matrix or an operator
in terms of its “spectral data”? For instance, for (n × n)-matrices acting on Cn the
question is, given a set Υn of invertible (n × n)-matrices, how do we find a function Φn
such that
T −1  ≤ Φn (δ)
for every T ∈ Υn , where δ stands for the minimum modulus of the eigenvalues of T ,
δ = min |λi (T )|? What does the best possible majorant Φn look like? How does it
behave as n −→ ∞? Does it always exist?
It is well known that, to be meaningful, these questions require a kind of normalization
(see below in this Introduction). In numerical analysis, the usual normalization is to
replace T −1  by the condition number CN(T ) = T  · T −1  and then look for an
estimate for CN(T ) in terms of T /δ. An equivalent approach is simply to include the
normalization condition T  ≤ 1 into the definition of Υ. See below for more comments
and references in a more general Banach algebra setting.
In this paper, we use the second kind of normalization conditions and consider op-
erators T : X −→ X acting on a finite-dimensional Banach/Hilbert space X, dim X =
N < ∞ (“(N × N )-matrices”). In order to have a more flexible classification of these
operators than those given by the normalization T  ≤ 1 mentioned above, we consider
families Υ of operators obeying a functional calculus over a function space (algebra) A

2000 Mathematics Subject Classification. Primary 47A60, 65F35, 15A12; Secondary 15A60, 32A38,
46J15.
Key words and phrases. Condition numbers, algebraic operators, function algebras, Wiener algebra,
Besov spaces, capacity.

2006
c American Mathematical Society

641

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


642 N. K. NIKOLSKI

(see the definition in Subsection 3.1), i.e.,


f (T ) ≤ Cf A
for every polynomial f . Let AC be the set of all such operators. We shall see that, when
using this functional calculus classification for (N × N )-matrices, we should not view
the dimension N as a true parameter for asymptotics of inverses or condition numbers;
instead, we should take another integer n, namely, the degree of the minimal annihilating
polynomial of T , n = deg(mT ) ≤ N . That is why we can pass for free from (N × N )-
matrices to infinite-dimensional algebraic operators of degree not exceeding n on an
arbitrary Banach/Hilbert space X. Recall that T is algebraic if there exists a polynomial
p = 0 such that p(T ) = 0; we write the minimal annihilating polynomial in a monic form,

mT (z) = mσ (z) = (λk − z),
1≤k≤n

where σ = {λ1 , . . . , λn } is the spectrum σ(T ) of T (σ(T ) consists of the eigenvalues of


T , with possible multiplicities as they occur in the minimal polynomial).
Given a function space A on the unit disk D = {z : |z| < 1}, a constant C ≥ 1, and a
family σ = {λ1 , . . . , λn } in D\{0}, we denote by
Υ(mσ , AC )
the set of all algebraic operators T such that T ∈ AC and mσ (T ) = 0. In order to
measure the size of inverses and condition numbers, we use the following quantities:
 
ϕ(mσ , AC ) = sup T −1  : T ∈ Υ(mσ , AC ) ,
 
Φn (∆, AC ) = sup ϕ(mσ , AC ) : σ ⊂ {z : 1/∆ ≤ |z| ≤ 1}, card(σ) ≤ n
 
= sup T −1  : T ∈ AC , r(T −1 ) ≤ ∆, deg(T ) ≤ n ,
where r(·) stands for the spectral radius. If A is a Banach algebra, then the worst
operator realizing the supremum in ϕ(mσ , A1 ) is the quotient operator S/mσ A of the shift
operator S : A −→ A, Sf = zf , or equivalently, its adjoint operator S ∗ f = z1 (f − f (0))
(the backward shift) acting on the subspace Kmσ ⊂ A∗ ,
 1 
Kmσ = span :λ∈σ ,
1 − λz
with an obvious modification in the case of multiplicities in σ = {λ1 , . . . , λn } (a point λ
j , 1 ≤ j ≤ m); see [N5, N3] for more information
1
repeated m times gives the series (1−λz)
about such “model operators”.
Notice also that the standard normalization T  ≤ 1 is equivalent to the condition
T ∈ A1 , where  · A is the uniform norm  · ∞ for the case of a Hilbert space X,

f ∞ = max|z|≤1 |f (z)|, and is the Wiener class norm f W = k≥0 |fˆ(k)| for the case
of an arbitrary Banach space X. Consequently, a specific A-functional calculus can be
viewed as a qualified normalization for the above problem of bounding the inverses and
condition numbers. This also makes the setting independent of the geometric nature of
the space X, at least if we already know how to establish an A-functional calculus for a
given operator T : X −→ X.
However, to begin with, in §2 we give a short proof for a slightly improved version of
a well-known specifically Hilbert space result. Namely, we show that
T −1  ≤ (r(T −1 ))N
for every invertible contraction T : CN −→ CN , T  ≤ 1, and describe all T for which
T −1  = (r(T −1 ))N .

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 643

The case of N -dimensional operators (matrices) acting on a Banach space, T : X −→


X, dim X = N , starts with a result of Schäffer [Sch] who, answering a question of
−1 N −1
√ T  · | det(T )| ≤ kN T 
B. L. van der Waerden, showed that for every invertible
(N × N )-matrix T , where kN ≤ eN for an arbitrary X, and kN = 2 for X = lN 1
(RN
1
endowed with the l -norm). It follows that

T −1  ≤ eN (r(T −1 ))N
for every contraction T  ≤ 1 on an N -dimensional Banach space X. It was also con-
jectured in [Sch] that kN = 2 for every space X. In [GMP], Gluskin, Meyer, and Pajor
gave another proof to Schäffer’s result anddisproved Schäffer’s conjecture, showing by a
probabilistic method that kN ≥ log log(N
c1
)
N
log(N ) . The same paper contains a stronger

counterexample by J. Bourgain giving kN ≥ c2 log(N N
) . Finally, Queffelec [Q] used a
deterministic
√ (number theory) approach to prove that Schäffer’s inequality is sharp, i.e.,
kN ≥ c3 N .
In this paper, considering an operator T in Υ(AC , mσ ), we begin with the observation
that, at least for σ ⊂ D\{0}, we have f (T ) ≤ Cf A/mσ A for every polynomial f ,
where A/mσ A stands for the quotient algebra by the subspace of functions belonging
to A and vanishing on σ. This reduces the problem of estimates of T −1 to an estimate
of f A/mσ A , where f is a solution of the Bezout equation zf + mσ g = 1, that is, to
an estimate of 1/zA/mσ A . In the case where A is a Banach algebra, this leads to a
two-sided estimate
a · capA (σ) ≤ ϕ(mσ , AC ) ≤ b · capA (σ),
where a, b > 0 are constants and capA stands for the A-zero capacity (at z = 0)
capA (σ) = inf{f A : f (0) = 1, f |σ = 0}.
In complex analysis, the A-zero capacities are closely related to the problem of uniqueness
sets for a function space A (the problem is to describe all σ such that f ∈ A, f |σ =
0 =⇒ f = 0). This means that they are of interest in the case of finite sets σ ⊂ D with
maxλ∈σ |λ| −→ 1. On the contrary, for bounding condition numbers and inverses, these
capacities are of interest in the case of finite sets σ ⊂ D\{0} with minλ∈σ |λ| −→ 0.
Therefore, in order to estimate ϕ(mσ , AC ), or to know an asymptotics for Φn (∆, AC )
as ∆ −→ ∞ and/or n −→ ∞, we need to bound capA (σ) or the following maximal
capacities (an annular and a circular one):
 
κn (∆, A) = sup capA (σ) : σ ⊂ {z : 1/∆ ≤ |z| ≤ 1}, card(σ) ≤ n ,
 
κn (∆, A) = sup capA (σ) : σ ⊂ {z : |z| = 1/∆}, card(σ) ≤ n .
Applying this approach to the case of the Wiener algebra A = W and using an unpub-
lished estimate of Nazarov [Na], we obtain yet another short proof of the Schäffer upper
estimate.
When applied to the analytic Besov spaces A = Bp,q s
(s ≥ 0, 1 ≤ p, q ≤ ∞; see the
definition in Subsection 3.1 below), the same idea gives
(card(σ))s
s (σ) ≤ c ) ≤ c∆n ns
s
capBp,q , κn (∆, Bp,q
|mσ (0)|
for s > 0, where c = c(s, q), and
(log(card(σ)))1/q
s (σ) ≤ c ) ≤ c∆n (log(n))1/q
s
capBp,q , κn (∆, Bp,q
|mσ (0)|

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


644 N. K. NIKOLSKI

for s = 0, where c > 0 is a numerical constant. It is also shown that for s > 0 these
estimates are asymptotically sharp, namely
k κn (∆, A) κn (∆, A)
ns ≤ lim ≤ lim .
2s+1 ∆−→∞ ∆ n
∆−→∞ ∆n
The corresponding inequalities for the inverses and the condition numbers are immediate
consequences of these estimates; see Corollary 3.35 in Subsection 3.6.
Recall that Besov classes functional calculi apply to the following operators.
(1) The set Υ of Hilbert space power bounded operators,
sup T k  = a.
k≥0

Peller’s result [Pe1] gives the bound f (T ) ≤ kG a2 f B∞1


0 for every polynomial f ,
where kG is an absolute (Grothendieck) constant. This implies a logarithmic bound for
the growth of inverses and condition numbers in terms of the degree deg(mT ) = n of the
minimal polynomial of T :
kG a2 log(n)
T −1  ≤ c .
|mT (0)|
(2) The same bound holds for the Banach space Tadmor–Ritt operators T : X −→ X,
that is, for the operators satisfying the resolvent estimate
R(λ, T ) ≤ C|λ − 1|−1
for |λ| > 1. This result is based on Vitse’s functional calculus for Tadmor–Ritt operators
(see [Vi3], f (T ) ≤ 300C 5 f B∞1
0 for every polynomial f ).
(3) The set of Banach space Kreiss operators T defined by the resolvent estimate
R(λ, T ) ≤ C(|λ| − 1)−1
for |λ| > 1. In this case, we use yet another Vitse’s functional calculus [Vi1], f (T ) ≤
Cf B1,1
1 for every polynomial f (see also Peller [Pe2]). The corresponding asymptotics
1 1
for the capacity κn (∆, B1,1 ) and for inverses/condition numbers Φn (∆, (B1,1 )C ) are ∆n n
(up to constants not depending on ∆ and n), where as before n = deg(T ), ∆ > 1. A
higher growth of the resolvent R(λ, T ) ≤ C(|λ| − 1)−s , s > 1, leads to a B1,1s
calculus
(see [Pe2, Vi1]), and hence to the corresponding estimates for inverses and condition
s
numbers in terms of the B1,1 capacity (which is of the order of ∆n ns ).
(4) The set of Hilbert space operators T satisfying C = supk≥1 T k /kβ < ∞, β > 0.

By a theorem of Peller [Pe1], T obeys a B∞,1 -functional calculus. Therefore,

(deg(T ))2β
T −1  ≤ c ,
|mT (0)|
for every algebraic operator of this class. For β < 1/2, this is better than the estimate
1
implied by the lA (kβ )-functional calculus, which is valid for all Banach space operators
satisfying supn≥1 T k /kβ < ∞ (see the next paragraph). By the way, for β > 1/2, the
1
obvious lA (kβ )-functional calculus cannot be improved even for operators on a Hilbert
space: there exists a Hilbert space operator satisfying supk≥1 T k /kβ < ∞ and such
that the norm f −→ f (T ) is equivalent to f lA 1 (k β ) ; see Varopoulos [Va].

Another series of function spaces considered in Subsection 3.6 below is


  1/q

q
lA (wk ) = f = fˆ(k)z k : f lA
q
(wk ) = |fˆ(k)|q wkq <∞ ,
k≥0 k≥0

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 645

1/k wk+1 wk+1


where wk > 0 is such that limk wk = 1, 0 < inf k wk ≤ supk wk < ∞ and 1 ≤ q ≤ ∞.
It is shown that
γq (card(σ))
caplA
q
(wk ) (σ) ≤
,
|mσ (0)|
where γq (n) is defined in terms of the so-called Lagrange transform of the weight sequence
(wk )k≥0 ; in particular, for wk = kβ , k ≥ 1 (w0 = 1), we have
γq (n) ≤ nβ
for q ≥ 2, and
γq (n) ≤ anβ+ q − 2 + b
1 1

for 1 ≤ q < 2, where a, b > 0 are constants depending only on q and β. As a corollary,
one can get the estimate
bCnβ+(1/2)
T −1  ≤
|mT (0)|
(where b > 0 is a constant depending on (wk )) for every Banach space operator T with
deg(T ) ≤ n and C = supk≥1 T k /kβ < ∞.
Previous results can be viewed as bounding the ratio
1/zA/mσ A : 1/zH ∞ /mσ H ∞ ,
since 1/zH ∞ /mσ H ∞ = 1/|mσ (0)|; see Subsection 3.3. In Subsection 3.4, we briefly
consider the problem of comparison of the norms a −→ aA/mσ A , where A is a function
Banach algebra on D, and a −→ aH ∞ /mσ H ∞ (H ∞ is the largest function Banach
algebra on D having the weakest norm). This is a kind of Nevanlinna–Pick interpolation
problem for a function algebra A. In fact, we consider three function algebras only,
1 0
namely, B1,1 , W , and B∞,1 , obtaining estimates for the quantity
 
kn (A) = sup k(σ, A) : σ ⊂ D, card(σ) ≤ n ,
where
 a

A/mσ A
k(σ, A) = sup : a ∈ A, a = 0
aH ∞ /mσ H ∞
(in Subsection 3.4 this notation is used for slightly different objects). For the case of
1
A = B1,1 , the problem of estimation k(σ, A) was raised in [Vi1], where it was related to
1
the B1,1 -functional calculus for Kreiss operators (matrices). In Subsection 3.4 we show
that kn n for all three algebras. Namely,
3
10−6 n ≤ kn (B∞,1
0
) ≤ kn (W ) ≤ kn (B1,1 1
) ≤ 9n
2
and kn (W ) ≤ 2n, despite the fact that these (strictly) embedded algebras B1,11
⊂W ⊂

B∞,1 ⊂ H ∩ C(D) are quite different. For instance, z B1,1 is equivalent to n as
0 n 1

n −→ ∞, but for the other three algebras z n  is bounded; the constants describing the
asymptotics of the worst norm T −1  as T ∈ AC , n = deg(T ) −→ ∞, that is
 1/z

A/mσ A
kn (1/z, A) = sup : card(σ) ≤ n ,
1/zH ∞ /mσ H ∞
also behave differently for all three algebras. Namely, from the preceding results it follows
that
0
kn (1/z, B∞,1 ) ≤ b · log(n + 1),
√ √
a n ≤ kn (1/z, W ) ≤ b n,
an ≤ kn (1/z, B1,1
1
) ≤ bn

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


646 N. K. NIKOLSKI

for the corresponding constants a > 0, b > 0. A slightly weaker estimate for kn( W ),
namely, kn (W ) ≤ πn + 1, has been known for a long time; see [KM]. For other similar
results see [AFP, N2, VSh].
Subsection 3.7 contains a comparison of the above capacities capA (·) and the Beurling–
Carleson capacity Carl(·) introduced in [GrN]. The latter is responsible for the uniqueness
theorems for spaces of holomorphic functions in D having a “positive smoothness” up to
the boundary,
1  2 
Carl(σ) = exp log dm(t) ,
|mσ (0)| T dist(t, σ)
where σ = {λ1 , . . . , λn } is a family in D\{0}. We show that among all n-point families
on the circle {z : |z| = 1/∆}, ∆ > 1, the worst Carl(σ) is attained at equidistributed
sets σ∗ , and
n∆n n∆n
a ≤ Carl(σ∗ ) ≤ b
1 + n(∆ − 1) 1 + n(∆ − 1)
for some numerical constants a > 0, b > 0. This contrasts with Queffelec’s construction
mentioned above for the worst capW (σ), since capW (σ∗ ) ≤ 2 for an equidistributed σ∗ .
(α) (β)
It is also shown that for a function space X such that CA (D) ⊂ X ⊂ CA (D) for some
(α)
α, β > 0, where CA (D) consists of holomorphic functions f on D having (α − [α])-
Lipschitz derivative f ([α]) , there exist two increasing functions ϕX , ψX on [1, ∞) such
that 1 ≤ ϕα (x) ≤ limx−→∞ ϕα (x) = ∞ (and similarly for ψα ) and
 n∆n   n∆n 
ϕX a ≤ κn (∆, X) ≤ ψX b
1 + n(∆ − 1) 1 + n(∆ − 1)
for every ∆ > 1. No estimates for ϕX , ψX are given.
Subsection 3.8 contains a few comments on the limit case of the peripheral spectrum,
that is, on the case of operators in Υ(mσ , AC ) with σ ⊂ T = {z ∈ C : |z| = 1}. It was
already observed in [GMP] that in this case T −1  ≤ limk−→∞ T k  for every Banach
space algebraic operator T . We complete this observation
√ by showing that capW (σ) ≤ 2
for every finite σ ⊂ T. The same phenomenon of a “ n lost” with respect to σ’s located
inside the disk can be observed for estimates of an arbitrary function f (T ) (and not
for f = 1/z only). Namely, the well-known Helson and Rudin–Shapiro theorems (see
[GrMcG]) imply that

card(σ)/2 ≤ k(σ, A) ≤ card(σ)
for every finite set σ ⊂ T.
Whenever possible, the author sought constants explicitly depending on all incoming
parameters, without insisting, however, on their sharpness. I am sorry if this business
would sometimes entail some boring computations.

A few general comments on condition numbers and efficient inversions. As is


well known, condition numbers and the problem of efficient inversions (that is, inversions
with numerical estimates of inverses) are ubiquitous subjects for many applied fields.
For instance, they are related to the error analysis. Namely, recall that if we look for a
numerical solution to a linear equation
T x = y,
say, in a Banach space or simply in C , then computational errors may occur, and in
n

reality we deal with nearby data y+∆y and the corresponding nearby (unknown) solution
x + ∆x. The starting problem is to bound the relative error ∆x
x of the solution in terms

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 647

∆y
of the relative error of the data y . Writing T (x + ∆x) = y + ∆y and then x + ∆x =
x + T −1 (∆y), one obtains
∆y ∆y
∆x ≤ T −1  · ∆y = T −1  · · T x ≤ T −1  · T  · · x,
y y
whence
∆x ∆y
≤ T −1  · T  · .
x y
This simple estimate gives a reason (one of many) why the condition number CN(T ) =
T −1 ·T  of a matrix T plays a crucial role in the numerical linear algebra, as well as in
numerical realizations of many other equations (differential, convolution, etc.). From the
applied analysis point of view, the question “Is T invertible?” is replaced now by “How
large is T −1  · T ?”. For more about that, we refer the reader, e.g., to [GVL, HRS].
Similar questions arise not only in various applications, suvh as signal processing or
control theory, but also in many theoretical problems. For instance, in operator theory,
when constructing a functional calculus

1
f −→ f (T ) = f (λ)(λI − T )−1 dλ,
2πi γ

we need to bound the norm of the resolvent R(λ, T ) = (λI −T )−1 (usually, in terms of the
distance dist(λ, σ(T )) = 1r ((λI − T )−1 )). Many other problems require similar estimates:
constructions of “skew” resolutions of the identity for a nonselfadjoint operator, stabil-
ity problems for semigroups of operators, completeness of eigenvectors and generalized
eigenvectors, the similarity problem, the existence of nontrivial invariant subspaces, etc.
etc.
In harmonic analysis, the action of a function on the Fourier transforms ϕ ◦ (fˆ) = ĝ
on various classes of functions or distributions, the harmonic synthesis problem, and the
so-called deconvolution formulas heavily depend on estimates of the functional calculus,
and hence on the growth of the resolvent.
We refer to the survey [N7] and the books [N3, N5] for more explanations, examples,
and references.
Returning to the initial question on the condition number of a matrix T : Cn −→ Cn ,
we recall that for normal (Hermitian, unitary, . . . ) matrices the number CN(T ) is simply
|λi |
the discrepancy of the set of eigenvalues, CN(T ) = maxmin |λi | , and for the standard algebra
C(K) of all continuous functions, endowed with the uniform norm f  = maxK |f |, we
|f |
also have CN(f ) = max min |f | . This may give an impression that the “wild” behaviour of
the condition numbers can appear only for norms depending on derivatives, or — for
matrix algebras — is due to the spectral multiplicity phenomenon, like Jordan blocks,
etc. However, this is not the case. Even in “flat” commutative Banach algebras (without
any smoothness or quasinilpotency), such as the Wiener algebra of absolutely convergent
Fourier series or integrals, or (n×n)-matrices with a rather sparse spectrum, the condition
numbers may be arbitrarily larger than the corresponding “spectral condition numbers”
defined geometrically. Their real behavior depends on some latent relations between the
norm and the spectrum in a given algebra; these relations are not completely understood.
Now, we make a few comments on “efficient inversions” as they were treated in [N1,
ENZ]. Namely, for a commutative Banach algebra A, one can look for an estimate of
a−1  in terms of δ = mint∈M(A) |â(t)|, where M(A) stands for the space of maximal
ideals of A and â for the Gelfand transform of an element a ∈ A. In fact, it often happens
in applications that only a part of M(A) is available, say X ⊂ M(A), a “visible part” of

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


648 N. K. NIKOLSKI

M(A). In this case we need to bound a−1  in terms of the “visible part” of the spectral
data δ = inf t∈X |â(t)|.
It is known that, without any normalization, the above problem has a positive solution
only for uniform algebras A, and this case is of limited interest for the problem. Namely,
the following lemma (perhaps, known earlier) was proved in [N1]. For the reader’s con-
venience we reproduce a short proof.
Lemma 1.1. Let A be a unital commutative Banach algebra, and let X ⊂ M(A). If for
some positive δ and C the condition
|â(x)| ≥ δ(x ∈ X)
−1
implies that a  ≤ C, then A is a uniform algebra whose norm is equivalent to the sup
norm on X, namely,
âX ≤ a ≤ (2Cδ + 1)âX
for all a ∈ A, where âX = supX |â|.
Proof. First, we observe that if inf X |â| = > 0, then |â(x)δ/ | ≥ δ, x ∈ X, and hence a
is invertible and a−1  ≤ Cδ/ = Cδâ−1 X . Now, given b ∈ A, we take λ = b̂X +
and apply the previous remark to a = (b − λe)−1 :
b = b − λe + λe ≤ Cδb̂ − λX + λ
≤ Cδb̂X + (Cδ + 1)λ = (2Cδ + 1)b̂X + (Cδ + 1) .
Letting −→ 0, we get b ≤ (2Cδ + 1)b̂X for all b ∈ A. 
As mentioned before, the problem can be “normalized” in two equivalent ways. First,
we can simply restrict ourselves to elements a ∈ A with a ≤ 1. Second, following a
custom of numerical analysis (see above), we can try to bound the classical condition
number
CN(a) = a · a−1 
in terms of the corresponding spectral condition number defined by
SCN(a) = a · r(a−1 ),
where r(∗) stands for the spectral radius of ∗. Recall that for a commutative algebra,
r(a−1 ) = mint∈M(A)
1
|â(t)| . In the case of an “incompletely visible” spectrum X ⊂ M(A)
we can set
SCN(X, a) = a · rX (a−1 ),
where rX (a−1 ) = inf t∈X1 |â(t)| . Next, following [N1], we define the quantities
 
C1 (∆, B, X) = sup CN(a) : a ∈ B, SCN(X, a) ≤ ∆ , ∆ ≥ 1,
 
C1 (∆, B) = sup CN(a) : a ∈ B, SCN(a) ≤ ∆ , ∆ ≥ 1,
 
∆1 (B) = sup ∆ : C1 (∆, B) < ∞ .
Note that ∆1 (B) and C1 (∆, B), where B ⊂ A, are well defined for an arbitrary Banach
algebra A, and even for a family B containing elements of different Banach algebras,
whereas their X-visible analogs refer to the maximal ideals, and so to a commutative
Banach algebra.
Since the function C1 (·, B) increases,
I(B) = {∆ ≥ 1 : C1 (∆, B) < ∞} = [1, ∆1 
is the largest interval where the set B is well conditioned in the following sense: there
exists a function Φ such that
CN(a) ≤ Φ(SCN(a))

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 649

for every a ∈ B with SCN(a) ∈ I. On the complementary interval [1, ∞)\I, the set B is
ill conditioned. In the case where ∆1 = ∞ (i.e., I = [1, ∞)), we also say that elements
of B are efficiently invertible.
As explained above, in this paper we deal with bounding functions Φ for sets of
(n × n)-matrices and algebraic operators satisfying a specific functional calculus. In
a forthcoming paper, we plan to treat the same problem for n × n Toeplitz matrices,
Toeplitz (Wiener–Hopf) operators on the Wiener algebra WA = Fl1 (Z+ ) and on the
Hardy space H 2 , as well as for lp multipliers and Toeplitz operators acting on Flp (Z+ ),
p = 1, 2, ∞.

Acknowledgements. This paper took its final form during my Fall semester stay at
Universität Ulm, Germany, 2004. I am very thankful to Prof. Dr. Wolfgang Arendt
for making this visit possible, as well as to all colleagues of the Abteilung Angewandte
Analysis for a friendly and encouraging atmosphere and for many useful conversations.

§2. C1 (∆) for the case of all matrices


We start with the algebra A = Mn = L(Cn ) of all (n × n)-matrices (equivalently,
the algebra of operators on an n-dimensional Hilbert space) endowed with the usual
operator norm A = A : Cn −→ Cn . The following theorem gives the (known)
exact value of C1 (∆, Mn ) and describes all matrices for which the supremum in the
definition is attained. Note that, by von Neumann’s inequality (f (A) ≤ f H ∞ for
every polynomial f and every contraction A (A ≤ 1)), and a result of Subsection 3.3
below, we have C1 (∆, Mn ) = Φn (∆, H1∞ ). But here we give an independent elementary
proof to the following.
Theorem 2.1. C1 (∆, Mn ) = ∆n for every ∆ ≥ 1, which means in particular that
T −1  ≤ (r(T −1 ))n for every T with T  ≤ 1.
Equality T −1  = (r(T −1 ))n occurs for a matrix T with T  = 1 if and only if
(1) either r(T −1 ) = 1, and then T is an arbitrary unitary matrix;
(2) or ∆ = r(T −1 ) > 1, and then T is unitarily equivalent to a matrix constructed by
the following rule: take any family σ = {λ0 , . . . , λn−1 } on the circle |z| = 1/∆ and find
the solutions ζj , j = 1, . . . , n, of the equation B(ζ) = −1 sitting on T, where B stands for
the Blaschke product 0≤j<n bλj (see the definition in the proof), then set U = diag(ζj )
aζ ∆n +1
and x = (x1 , . . . , xn ) with any vector having |xj |2 = − B  (ζjj ) , where a = ∆n −1 , and
finally set
1
T x = n U x, and T = U on the orthogonal complement of x.

The spectrum of T is σ.
Proof. The upper estimate C1 (∆, Mn ) ≤ ∆n is an immediate consequence of the follow-
ing identities:
|λ0 (T ) · · · λn−1 (T )|2 = | det(T )|2 = det(T ∗ T ) = s0 (T )2 · · · sn−1 (T )2 ,
where the λk (T ) (respectively, sk (T ) = λk ((T ∗ T )1/2 )) are the eigenvalues (respectively,
singular values) of T ordered so that the |λj (T )| (respectively, the sj (T )) decrease. (We
refer to [G] for the properties of sk (T ).) Indeed, the singular numbers sk (T ) are precisely
the diagonal elements of the positive factor in the polar decomposition of T , T = U R,
where R ≥ 0 and U is unitary, and hence T −1  = 1/sn−1 (T ), CN(T ) = s0 (T )/sn−1 (T ).
By the above identities,
|λn−1 (T )|n ≤ |λ0 (T ) · · · λn−1 (T )| = s0 (T ) · · · sn−1 (T ) ≤ s0 (T )n−1 sn−1 (T ),

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


650 N. K. NIKOLSKI

which means
s0 (T )  s (T ) n
0
CN(T ) = ≤ = (SCN(T ))n .
sn−1 (T ) λn−1 (T )
This shows that C1 (∆, Mn ) ≤ ∆n .
To prove the reverse inequality C1 (∆, Mn ) ≥ ∆n , one can use Horn’s theorem (see
[Hor] and also [MO, Chapter 9, Section E]), which gives a converse to the famous Weyl
inequalities. But to describe all cases of equality T −1  = r(T −1 )n , T  = 1, we need
more, as is stated below in Lemma 2.2. Now, consider the matrices T turning the
inequality
s0 (T ) · · · sn−1 (T ) ≤ s0 (T )n−1 sn−1 (T )
into equality, that is, the matrices for which s0 (T ) = · · · = sn−2 (T ). Lemma 2.2 shows
that if positive numbers s0 , sn−1 and complex numbers λk , 0 ≤ k < n, satisfy 0 <
sn−1 < s0 and |λk | ≤ s0 for 0 ≤ k < n − 1, |λ0 · · · λn−1 | = sn−1 0 sn−1 , then there
exists a matrix T = T (λ, s) such that λk = λk (T ) and sk = sk (T ) for 0 ≤ k < n.
Now, let s0 = 1 and |λk | = 1/∆ < 1 for every k, 0 ≤ k < n. Then, the same lemma
claims that every such matrix T (λ, s) is of the form described in the statement of the
theorem. Moreover, sn−1 (T ) = 1/∆n and CN(T ) = ∆n , whereas SCN(T ) = ∆. This
shows that C1 (∆, Mn ) ≥ ∆n and gives the required description of all cases of equality
T −1  = r(T −1 )n , T  = 1. 

Lemma 2.2. For any positive numbers s0 = s1 = · · · = sn−2 > sn−1 > 0 and complex
numbers λk , 0 ≤ k < n, satisfying |λk | ≤ s0 for 0 ≤ k < n, and |λ0 · · · λn−1 | = sn−1
0 sn−1 ,
there exists an (n × n)-matrix T such that λk = λk (T ) and sk = sk (T ) for 0 ≤ k < n.
Moreover, for s0 = 1 and |λj | < 1 (0 ≤ j < n), all such matrices T are unitarily
equivalent to the following matrix: let ζj , j = 1, . . . , n, be all solutions
of the equation
B(ζ) = −1 sitting on T, where B stands for the Blaschke product 0≤j<n bλj (see the
definition in the proof), then set U = diag(ζj ) and x = (x1 , . . . , xn ) with any vector
−aζ j 1+sn−1
having |xj |2 = B  (ζj ) , where a = 1−sn−1 , and finally define
T x = sn−1 U x, and T = U on the orthogonal complement of x.
Proof. First, we consider the case where |λk | < s0 for 0 ≤ k < n. Let T = U R, where
⎛ ⎞
s0 0 0
⎜ 0 s0 0 ⎟
⎜ ⎟
⎜0 0 ⎟
R=⎜ ⎜ ⎟
⎜ 0 0 ⎟

⎝ 0 s0 0 ⎠
0 0 sn−1
in an orthonormal basis, and U is an unknown unitary matrix. This means that T =
U (s0 I + (sn−1 − s0 )P ), where P = (·, x)x is a rank one orthogonal projection. Without
loss of generality, s0 = 1. The equation for the eigenvalues of T is
0 = det(zI − T ) = det(zI − U ) · det(I − R(z, U )(sn−1 − 1)U P ),
where R(z, U ) = (zI − U )−1 stands for the resolvent of U . Thus, for the eigenvalues z
with |z| < 1 we have the equation

dµ(ζ)
1 = (1 − sn−1 ) ζ ,
T ζ −z

where dµ = (dEx, x) is a scalar spectral measure of U . Therefore, we look for a proba-


bility measure µ on the unit circle T such that card(supp(µ)) ≤ n and the roots of the

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 651

equation

1 dµ(ζ)
=
1 − sn−1 T 1 − ζz
coincide with the given numbers λk , 0 ≤ k < n. Writing the equation in the form

1 + sn−1 1 + ζz
a= = dµ(ζ),
1 − sn−1 T 1 − ζz

denoting the integral on the right by f , and using the Herglotz theorem on holomorphic
functions with positive real part (see, for instance, [N2, Theorem 3.9.2]), we can restate
the problem as follows:
Find a rational function f ∈ Hol(D), D = {z ∈ C : |z| < 1}, having its a-points
f (z) = a at the given places λk , 0 ≤ k < n, and such that deg(f ) ≤ n, Re f (z) ≥ 0 in D,
f (0) = 1, and Re f (z) = 0 on T.
Setting B = a−f a+f , we need to find a rational function B, deg(B) ≤ n, with |B(z)| = 1
on T, B(0) = sn−1 , and having the prescribed set of zeros λk , 0 ≤ k < n. Clearly, such
a function exists and is unique, namely, this is the Blaschke product B = k bλk , where
λ−z
bλ (z) = 1−λz · |λ|
λ
. This completes the proof of the existence statement in the case where
|λk | < s0 for 0  ≤ k < n.
To find µ = j pj δζj , we observe that the ζj are points on T where f = ∞, that is B =
−1, and the point masses at ζj are given by pj = limr−→1 1−r 2 f (rζj ). Once the measure

µ is found, we can realize U as diag(ζj ) on the space Cn . Then, (dEx, x) = j |xj |2 δζj
and hence x is any vector having pj = |xj |2 . The matrix T is defined, therefore, by
T x = sn−1 U x and T = U on the orthogonal complement of x (recall that we assume
s0 = 1).
If |λk | = s0 for some k (notice that we do not need this case for the proof of Theorem
2.1), we can consider the modified eigenvalues λ∗k = rλk , 0 ≤ k < n − 1, and s∗n−1 =
r n sn−1 , where 0 < r < 1. Constructing a matrix Tr by the previous rule for these
modified spectral data, we can then use compactness arguments and choose a sequence
Trj , rj −→ 1, tending to a desired matrix. 

Remark 2.3. In order to prove merely the inequality C1 (∆, Mn ) ≥ ∆n , in the lemma we
1/n
only need to exhibit an example of a matrix T with |λk (T )| = ∆
1
= sn−1 , 0 ≤ k < n, and
n−1
s0 = · · · = sn−2 . To this end, we can simply take µ = n k=0 δζk , where ζk = ζ k and
1

ζ = e2πi/n is the nth root of unity. Then



1 k j pn
n−1
dµ(t) 1
g(z) = = (ζ z) = z =
1 − tz n 1 − zn
k=0 j≥0 p≥0

for every z, |z| < 1. Since the eigenvalues are the solutions of (1 − sn−1 )g(z) = 1, we get
1/n
λk = ζ k sn−1 , 0 ≤ k < n. The corresponding vector x is x = ( √1n , . . . , √1n ).

§3. Matrices and operators obeying a functional calculus


Now, we consider the problem of bounding the inverses in a general framework of
functional calculi. For a given operator, a bounded functional calculus over a function
algebra or a function space is a kind of restriction of a more specialized form than a
normalization. We shall see that such an approach is well adapted to operators acting
both on a Hilbert space and on a Banach space. In this context, it is also natural to seek
for bounds for general functions a(T ) of an operator T , not only for T −1 . We use the
following language and notation.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


652 N. K. NIKOLSKI

3.1. Norms related to a functional calculus. A function algebra (on D) is a unital


Banach algebra, say A, such that
(i) A is continuously embedded into the algebra Hol(D) of all holomorphic functions
on the unit disk D = {z ∈ C : |z| < 1};
1/n
(ii) A contains all polynomials and limn z n A = 1; and
(iii)
a
(a ∈ A, λ ∈ D, and a(λ) = 0) =⇒ ∈ A.
z−λ
An A-functional calculus for an operator T : X −→ X on a Banach space X means a
bounded homomorphism A −→ L(X) of a function algebra A into the algebra L(X) of
bounded linear operators on X such that z −→ T and 1 −→ I. In particular,
a(T ) ≤ CT aA
for every a ∈ A, where CT stands for the norm of the homomorphism. Clearly, an
operator T possessing a calculus over a function algebra on D has its spectrum in the
closed unit disk, σ(T ) ⊂ D.
In order to define and to use a calculus, we do not really need to require that A be
an algebra. Below, we often work with merely a function space in D, that is, a Banach
space A satisfying (i)–(iii) and such that pf ∈ A for every f ∈ A and every polynomial
p. The calculus over such a space A means a bounded mapping f −→ f (T ) such that
(pf )(T ) = p(T )f (T ) for every f ∈ A and every polynomial p. See also Remark 3.27
below.
Let Υ be a family of operators. We say that Υ obeys an A-calculus with a constant
C > 0 if CT ≤ C for every T ∈ Υ. This inequality plays a role of a normalization when
we consider the problem of uniform estimates of inverses.
Finally, an operator T is algebraic (of degree deg(T ) ≤ n) if there exists a polynomial
p such that p = 0, p(T ) = 0, and deg(p) ≤ n. By mT we denote the minimal annihilator
in the form of a monic polynomial

n−1
mT (z) = (λj − z).
j=0

It is clear that in this case the spectrum σ(T ) = {λj : 0 ≤ j < n} consists of eigenvalues,
and T is invertible if and only if mT (0) = 0.
We start with the following elementary lemma.
Lemma 3.1. If an algebraic operator T admits a calculus over a function space/algebra
A, then so it does over the quotient space/algebra A/mA for every polynomial m, m = 0,
such that m(T ) = 0 (in particular, for m = mT ), and
a(T ) ≤ CT aA/mA
for every a ∈ A, where aA/mA = inf{a + mgA : g ∈ A}.
Proof. It is clear that a(T ) ≤ CT inf{bA : b = a+mg, g ∈ A}. The result follows. 

In this section, we consider some sets Υ of algebraic operators having the same an-
nihilating polynomial m and satisfying an A-calculus (hence, an A/mA-calculus). Our
aim is to compute or estimate the quantity
|a|Υ = sup{a(T ) : T ∈ Υ},
where a ∈ A (or a ∈ A/mA), in terms of m and the family a(σ), where σ is the family
of zeros of m. The case of the inverses corresponds to the choice a = z −1 ∈ A/mA.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 653

It should be noted that for an arbitrary bounded set Υ of operators (or elements of a
Banach algebra) the function p −→ |p|Υ is well defined on the algebra of complex poly-
nomials and is a seminorm satisfying the normed algebra submultiplicativity conditions
|pq|Υ ≤ |p|Υ |q|Υ , |1|Υ = 1.
In what follows, for the sake of simplicity and to avoid unessential notational complica-
tions, we often assume that the minimal polynomial mT of an algebraic operator T has
simple zeros. This does not result in any problem when arriving at final estimates of
inverses or functions of operators because one can pass to simple zeros (and back) by
the standard “small movings” of the spectrum. The key point is that the function α,
α(T ) = sup{f (T ) : f ∈ A, f A ≤ 1}, defined on the operators T : X −→ X with
dim X = N < ∞ and having σ(T ) ⊂ D, is continuous.
Lemma 3.2. Let T be an algebraic operator satisfying an A-calculus and having a min-
imal polynomial m = mσ with simple zeros, σ = {λ0 , . . . , λn−1 } ⊂ D\{0}. Then
CT   m − m(0) 

T −1  ≤  
|m(0)| z A/mA
 1 − g 

 
= CT inf   : g ∈ A, g(0) = 1, g(λ) = 0 for λ ∈ σ
z A
= CT inf{hA : h ∈ A, h(λ) = 1/λ for λ ∈ σ}.

Proof. It is clear that T −1 = a(T ) for every a ∈ A satisfying a Bezout equation


za + mT g = 1,
where g ∈ A. Hence
T −1  ≤ CT inf{aA : a(T ) = T −1 }
= CT inf{a + mhA : h ∈ A} = CT aA/mA .

Since a = m(0)−m
zm(0) is a solution of the Bezout equation, we get the inequality. Two other
formulas also follow. 

Remark 3.3. Let Sa = za and S ∗ a = a−a(0) z be the shift operator and the backward
shift operator on A, respectively. Both S and S ∗ are bounded on A by the definition of
a function space on D. By using these operators, the quantities in Lemma 3.2 can be
bounded as follows:
1 − g 
1  
1 − gA ≤   ≤ S ∗  · gA .
S z A
s
We finish this subsection with a brief recalling on the (analytic) Besov spaces Bp,q in the
disk D, which will be used afterwards. Namely, let s ∈ R, 1 ≤ p, q ≤ ∞, and let
  1 1/q

s
Bp,q = f= fˆ(n)z n : ((1 − r)n−s−(1/q) fr(n) Lp (T) )q dr <∞ ,
n≥0 0

(n)
where fr (ζ) = f (n) (rζ), n being a nonnegative integer such that n > s. The space Bp,qs

equipped with the norm



n−1  1 1/q
f Bp,q
s = |f (k) (0)| + ((1 − r)n−s−(1/q) fr(n) Lp (T) )q dr
k=0 0

is a function space on D. We refer to [BL, P, T] for general properties of Besov spaces. In


s
particular, the space Bp,q allows yet another (harmonic analysis) definition (given first

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


654 N. K. NIKOLSKI

by Lizorkin [L] and Peetre [P]) involving an equivalent norm:


  1/q

s
Bp,q = f= fˆ(n)z n : f s,p,q = (2ns f ∗ Wn Lp (T) )q <∞ ,
n≥0 n≥0
c∗ f Bp,q
s ≤ f s,p,q ≤ c∗ f Bp,q
s ,

where c∗ > 0, c∗ > 0 are constants depending on s, p, q, and the Wn are the modified de
la Vallée–Poussin kernels determined by their Fourier coefficients as follows: W0 = 1 + z,
and for n ≥ 1 we have Ŵn (k) = 1 for k = 2n , Ŵn (k) = 0 for k ∈ (2n−1 , 2n+1 ), and
Ŵn (k) is affine on [2n−1 , 2n ] and [2n , 2n+1 ]; see [BL, P, T] for more details.
The duality of the spaces Bp,qs
is given by the relation (Bp,q s
)∗ = Bp−s
 ,q  and the Cauchy
 ˆ
k≥0 f (k)ĝ(k) (for q < ∞), where p + p = 1. By a duality
1 1
bilinear form (f, g) =
constant we mean the smallest k > 0 such that
1  
f Bp,q
s ≤ sup |(f, g)| : gB −s  
≤ 1 ≤ kf Bp,q
s ,
k p ,q

for all f ∈ Bp,q


s s
. In particular, for every operator L : Bp,q −→ Bp,qs
, we have L ≤
∗ ∗ −s −s ∗
k L , where L : Bp ,q −→ Bp ,q is defined by (Lf, g) = (f, L g).
2
s
The space Bp,q is an algebra with respect to pointwise multiplication if and only if
Bp,q ⊂ CA (D) = Hol(D) ∩ C(D), and if and only if either s > p1 , or s = p1 and q = 1; see
s

[T, 2.6.2]. In this case, there exists a constant K > 0 such that
f g ≤ Kf  · g
for every f, g ∈ Bp,q
s
. The corresponding multiplier norm,
f ∗ = sup{f g : g ≤ 1},
is equivalent to  · ,
1
f  ≤ f ∗ ≤ Kf ,
1
and satisfies the usual Banach algebra properties f g∗ ≤ f ∗ · g∗ , 1∗ = 1.
t
From Peetre–Lizorkin’s definition, it is obvious that Bp,q ⊂ Bp,q
s
for t ≥ s, Bp,q
s
⊂ Bp,r
s

for r ≥ q, and Br,q ⊂ Bp,q for r ≥ p. It is also known (see, for instance, [BL, Theorem
s s
s
6.5.1]) that Bp,q ⊂ BP,Q
t
if 1 ≤ p ≤ P ≤ ∞, 1 ≤ q ≤ Q ≤ ∞, and s − p1 = t − P1 . Finally,
s
it is known that Bp,q ⊂ Lip(α) for s − p1 > α > 0 (see [S.Ni, BL, T]).

3.2. The case of Banach space operators. Given a monic polynomial m and a
constant C ≥ 1, we denote by AC the set of Banach space operators T admitting a
calculus over a function algebra A with CT ≤ C, and set
Υ(m, AC ) = {T ∈ AC : m(T ) = 0}.
Theorem 3.4. Let m be a monic polynomial, A a function algebra, and C ≥ 1. Then
aA/mA ≤ |a|Υ(m,AC ) ≤ CaA/mA
for every a ∈ A.
Proof. The right-hand side inequality follows from Lemma 3.1. For the left inequality,
we set Sf = zf for every f ∈ A/mA. Since A/mA is a Banach algebra, it is clear that
S is an operator on A/mA and S ∈ Υ(m, A1 ). Moreover, since A is a unital algebra,
a(S) = aA/mA for every a ∈ A. 

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 655

Remark 3.5. Note that, in fact, there exist many “universally worst” operators T in
Υ(m, AC ), in the sense that the norms a(T ) and |a|Υ(m,AC ) are comparable (and even
equal, as in the second example below) simultaneously for all a ∈ A/mA. Here are two
of them.
In the previous proof, as a universal operator we chose the quotient S/mA of the shift
operator S on A. Clearly, the adjoint of S/mA also satisfies the same property. If the

duality between A and A∗ is realized by the Cauchy bilinear form, (f, g) = k≥0 fˆ(k)ĝ(k)
for f ∈ A, g ∈ A∗ , then (S/mA)∗ = S ∗ |(mA)⊥ , where S ∗ is the backward shift
g − g(0)  1 
S∗g = and (mA)⊥ = span :0≤j<n .
z 1 − λj z
The latter n-dimensional space is endowed with the A∗ -norm.
Yet another universally worst but less explicit construction is as follows. Consider the
direct sum (product) of all operators in Υ = Υ(m, AC ),

T = T : Y −→ Y,
T ∈Υ

defined coordinatewise on the direct sum Y = T ∈Υ Y (T ), Y (T ) being the space where
T acts. (The direct sum of any lp -type is convenient, 1 ≤ p ≤ ∞.) Clearly, T ∈ Υ(m, AC )
and a(T ) = |a|Υ(m,AC ) for every a ∈ A/mA.
By the way, if we everywhere restrict ourselves to Hilbert space operators only, and
take an l2 -type direct sum above, we obtain a “universally worst” Hilbert space operator.
Now, we can apply the above approach to some usual classes of operators.
Corollary 3.6 (Banach space power bounded operators). Given a number C ≥ 1
and a polynomial m, m = 0, let Υ be the set of all Banach space operators satisfying
supn≥0 T n  ≤ C and m(T ) = 0. Then
aW/mW ≤ |a|Υ ≤ CaW/mW
for every a ∈ W , where


W = f= fˆ(n)z n : f W = |fˆ(n)| < ∞


n≥0 n≥0

is the Wiener algebra on D.


Indeed, Υ obviously obeys a W -calculus with the constant C. Applying Theorem 3.4,
we get the result. 

Remark 3.7. For Hilbert space power bounded operators, a better estimate is known;
see Remark 3.16 below.
Corollary 3.8 (Banach space contractions). Given a polynomial m, m = 0, let Υ be the
set of all Banach space contractions satisfying m(T ) = 0. Then
|a|Υ = aW/mW
for every a ∈ A.
Indeed, it suffices to take C = 1 in the preceding corollary. 

For a = 1/z this corollary is known as the duality formula of Gluskin, Meyer, and Pajor
[GMP] (the proof of these authors is different and is adapted specifically for a = 1/z).
The next two corollaries are immediate consequences of the results of Vitse [Vi1, Vi3]
and Peller [Pe2].

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


656 N. K. NIKOLSKI

Corollary 3.9 (Banach space Kreiss operators). Given a number C ≥ 1 and a polyno-
mial m, m = 0, let Υ be the set of all Banach space operators satisfying m(T ) = 0 and
the Kreiss resolvent condition
C
R(λ, T ) ≤ , |λ| > 1.
|λ| − 1
Then
caB1,1
1 /mB 1
1,1
≤ |a|Υ ≤ CaB1,1
1 /mB 1
1,1

for every a ∈ 1
B1,1 ,
where c > 0 is an absolute constant and B1,1 1
stands for the (analytic)
Besov algebra (see Subsection 3.1) endowed with the equivalent norm

2
f ∗B 1 = |(z 2 f )

| dxdy.
1,1 π D
1
Indeed, it was shown in [Vi1] (see also [Pe2]) that Υ obeys a B1,1 -functional calculus with
1
the constant C. Moreover, since B1,1 is a Banach algebra with respect to an equivalent
1
norm and the multiplication operator T f = zf on B1,1 satisfies the Kreiss condition (see
[Pe2, Vi1]), again we can apply Theorem 3.4. The result follows (the constant c > 0
comes from the Banach algebra norming of B1,1 1
). 

Corollary 3.10 (Banach space Tadmor–Ritt operators). Given a number C ≥ 1 and


a monic polynomial m = mσ , let Υ be the set of all Banach space operators satisfying
m(T ) = 0 and the Tadmor–Ritt resolvent condition
sup R(λ, T ) · |λ − 1| = C < ∞;
|λ|>1

here σ ⊂ ΓC = conv(1, {z ∈ D : |z|2 ≤ 1 − C 2 }),


1
a Luzin type cone containing the
spectrum σ(T ) (see [Vi2]). Then
|a|Υ ≤ 300C 5 aB∞,1
0 0
/mB∞,1

for every a ∈ B∞,1


0 0
, where B∞,1 stands for the (analytic) Besov algebra endowed with the
norm  · 0,∞,1 (see Subsection 3.1 for the definition).
Indeed, it was shown in [Vi3] that f (T ) ≤ 300C 5 f 0,∞,1 for every Banach space
Tadmor–Ritt operator T . 
Remark 3.11. We do not know whether the norms | · |Υ and  · B∞,10 0
/mB∞,1 , m = mσ , are
equivalent or not (uniformly with respect to σ ⊂ ΓC ). Using the methods of [Vi2, Vi3]
we can only show that |a|Υ ≥ caB∞,1
0 0
(ΓC )/mB∞,1
0
(ΓC ) , where B∞,1 (ΓC ) is a Besov space
over ΓC .
In Subsection 3.6 below, we give some estimates of the inverses T −1  for Kreiss
and Tadmor–Ritt Banach space operators, as well as for Hilbert space power bounded
0
operators (one more class obeying a B∞,1 -calculus; see Subsection 3.4 below). But first,

we consider operators obeying an H -functional calculus (Subsection 3.3) and compare
the norms f (T ) of arbitrary functions of an algebraic Kreiss and/or Tadmor–Ritt
operator (Subsection 3.4).
3.3. The case of an H ∞ -calculus. Let Υ(m, (CA )C ) be the set of all operators
T : X −→ X obeying an H ∞ -calculus of norm C ≥ 1, that is, a(T ) ≤ CaH ∞
for every a ∈ CA (D), and such that m(T ) = 0. Here, as before, m means a monic poly-
nomial m = mσ , or the corresponding Blaschke product m = Bσ . In particular, every
algebraic Hilbert space contraction with σ(T ) ⊂ σ is in Υ(mσ , (CA )1 ) (von Neumann’s
inequality). Moreover, as is well known, for a completely nonunitary (c.n.u., for short)

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 657

Hilbert space contraction T , a(T ) has a meaning for an arbitrary a ∈ H ∞ (the Sz.-Nagy–
Foiaş calculus); see [SzNF] or [N3, N5] for the details. So, given an inner function Θ, we
may consider the set Υ(Θ, (H ∞ )C ) of all Hilbert space operators in (H ∞ )C such that
Θ(T ) = 0.
Theorem 3.12. Let Θ be an inner function. Then
|a|Υ(Θ,(H ∞ )1 ) = aH ∞ /ΘH ∞ = distL∞ (aΘ, H ∞ )
for every a ∈ H ∞ (or a ∈ H ∞ /ΘH ∞ ), and the worst operator is T = MΘ , i.e.,
|a|Υ(Θ,(CA )1 ) = a(MΘ ), where MΘ f = PKΘ zf , f ∈ KΘ = H 2  ΘH 2 , stands for the
so-called model operator with the characteristic function Θ (here PKΘ is the orthogonal
projection onto KΘ ; see [N3, N5] for the details). Moreover,
1
  1
  = ,
z Υ(Θ,(H )1 )
∞ |Θ(0)|
where 1/z in H ∞ /ΘH ∞ means any solution a of the Bezout equation za + Θg = 1
(a, g ∈ H ∞ ). In particular, in the case of Θ = mσ / (1 − λj z) we have
  1
sup T −1  : T ∈ Υ(mσ , (CA )1 ) = .
λ∈σ |λ|

For an arbitrary value of the resolvent R(λ, T ) = (λI − T )−1 , we have


|Θ(λ)|−1 − |λ|  1  |Θ(λ)|−1
≤  ≤
1 − |λ| 2 λ − z Υ(Θ,(H )1 )
∞ 1 − |λ|
for every λ ∈ D, Θ(λ) = 0.
Proof. By Theorem 3.4, we only need to calculate aH ∞ /ΘH ∞ for the corresponding
functions a. From Sarason’s lifting theorem we know that aH ∞ /ΘH ∞ = a(MΘ )
−1
for every a ∈ H ∞ . Now, for the inverse MΘ , we use the fact that the operator
MΘ is an isometry on the orthogonal complement D⊥ of the defect subspace D =

range(I − MΘ MΘ ) and the modulus of the restriction MΘ |D is equivalent to multi-
−1
plication by |Θ(0)|; see [SzNF, N3, N5] for the details. Hence, MΘ  = |Θ(0)|
1
.
For the resolvent bounds we use again | λ−z |Υ(Θ,(H ∞ )1 ) =  λ−z H ∞ /ΘH ∞ and refer to
1 1

an inequality in [N3, p. 122]. 

Remark 3.13. For the sets Υ(Θ, (H ∞ )C ) or Υ(Θ, (CA )C ) with C > 1 we must replace
all identities by inequalities:
aH ∞ /ΘH ∞ ≤ |a|Υ(Θ,(H ∞ )1 ) ≤ CaH ∞ /ΘH ∞ .
3.4. The norms | · |Υ and the Nevanlinna–Pick problem in Besov algebras.
Now, after reducing (in some cases) the seminorm |a|Υ to aA/mA (see Subsection 3.2),
we specify our problem as follows. As above, we denote by Υ a family of Banach space
operators, by A a function space on D, and by m = mσ a monic polynomial with simple
zeros σ ⊂ D. In the case where Υ = Υ(m, AC ), we want to compare the norms |a|Υ
and aA/mA with the “size” of the local data a(σ). As a “size” of a(σ) we choose the
weakest function algebra norm, i.e., aH ∞ /mH ∞ . (Note that H ∞ is the largest Banach
algebra of holomorphic functions in D.) Therefore, we consider the problem to bound or
calculate the following quantities.
(1) For m = mσ , a function a = 0 on a set σ ⊂ D, and a constant C ≥ 1, let
|a|Υ(m,AC )
k(a, m, AC ) = .
aH ∞ /mH ∞

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


658 N. K. NIKOLSKI

The case of inverses corresponds to m(0) = 0 and a = 1/z. Notice also that, by Theorem
a
3.4 above, in the case of a function algebra A we have k(a, m, A1 ) = aH ∞A/mA
/mH ∞
.
(2) For a function a defined on a set Σ ⊂ D and numbers n ≥ 1, C ≥ 1, let
 
kn (a, AC ) = sup k(a, mσ , AC ) : σ ⊂ Σ, card(σ) ≤ n .
The case of inverses corresponds to Σ = D\{0} and a = 1/z. Corollary 3.6 and the
definition of the function C1 (∆, Υ) (see Introduction) imply
C1 (∆, Bn ) ≤ ∆n kn (1/z, W1 ),
where Bn stands for the set of all linear operators on Banach spaces of dimension n. We
return to this quantity in Subsection 3.6 below.
(3) For a given finite set σ ⊂ D and m = mσ , let
 
k(m, AC ) = sup k(a, m, AC ) : a ∈ A .
(4) Finally,
   
kn (AC ) = sup k(m, AC ) : deg(m) ≤ n = sup kn (a, AC ) : a ∈ A .
1 0
Below we compare these quantities for the algebras B1,1 , W , B∞,1 that arise for partic-
ularly interesting functional calculi. It is known that the following continuous (strict)
embeddings hold:
1
B1,1 ⊂ W ⊂ B∞,10
⊂ H∞
0
(see, e.g., [BL, P] or [N2, Section B.8.7]). In fact, B∞,1 ⊂ CA (D), where CA (D) =
C(D) ∩ Hol(D) is the disk algebra.
Theorem 3.14. For every n ≥ 1 and C ≥ 1, we have
0
kn ((B∞,1 )C ) ≤ kn (WC ) ≤ kn ((B1,1
1
)3C/2 ) ≤ 9Cn,
1
where B1,1 0
and B∞,1 are equipped with the Peetre–Lizorkin norms. Moreover, kn (WC ) ≤
2Cn.
Conversely,
n
≤ kn ((B∞,1
0
)105 ).
8
Proof. We have

a0,∞,1 = a ∗ Wn ∞
n≥0

≤ a ∗ Wn W = |â(k)|Ŵn (k) = aW ,
n≥0 n≥0 k≥0

which means that (B∞,10


)C ⊂ WC , and the first inequality follows.
For the second inequality, we simply use the fact that |â(k)|Ŵn (k) ≤ a ∗ Wn L1 (T)
for every k, n ∈ Z+ , whence

aW = |â(k)| = |â(k)|Ŵn (k)
k≥0 n≥0 k≥0
3
≤ 3·2 n−1
a ∗ Wn L1 (T) = a1,1,1 .
2
n≥0

Therefore, WC ⊂ 1
(B1,1 )3C/2 .
For the last inequality, it suffices to estimate aB1,1
1 /mB 1
1,1
for every m = mσ with
card(σ) ≤ n and for every a ∈ B1,1 such that aH ∞ ≤ 1. By the Pick theorem
1
n−1 wj −z
(see, for example, [N5, p. 204]), there exists a Blaschke product B = j=0 1−w jz
and

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 659

λ ∈ C, |λ| ≤ 1, such that a = λB on σ, and hence a = λB in B1,1 1 1


/mB1,1 . But from
Peller’s
 theorem on the trace-class Hankel operators Γ B ∈ S 1 we know that B1,1,1 =
n≥0 2 n
B ∗ W n  1
L (T) ≤ 6Γ B  S1
≤ 6n (see the proof in [N2, pp. 357–359]). Therefore,
aB1,1
1 /mB 1
1,1
≤ 6na ∞
H /mH ∞ .
To get a better bound for kn (WC ) claimed in the statement, it suffices to show that
aW/mW ≤ 2naH ∞ /mH ∞ for every a ∈ W and every m, deg(m) ≤ n, which turns
into aW/mW ≤ 2n for every a ∈ W , aH ∞ ≤ 1. We employ a similar argument: by
λj −z
the Pick theorem there exists a Blaschke product B = n−1 j=0 1−λj z and λ ∈ C, |λ| ≤ 1,
such that a = λB in W/mW . Therefore, by a Vinogradov–Peller inequality (see [N2,
pp. 368, 375]), aW/mW ≤ BW ≤ 2n.
In order to prove a lower estimate of kn ((B∞,1 0
)C ), say kn (AC ) ≥ kn with a constant
k > 0, we use Corollary 3.10. Then, for every > 0, it suffices to find an operator
T ∈ Υ(m, AC ), deg(m) ≤ n, and a ∈ A, a = 0, such that a(T ) ≥ (k − )naH ∞ /mH ∞ .
j=0 stands for the standard basis in the space bvn = (C , ·bv )
Let T ej = λj ej , where (ej )n−1 n

endowed with the variation norm



xbv = |x0 | + |xj − xj−1 |,
1≤j<n

and let 0 < λ0 < · · · < λn−1 < 1, σ = (λj ). It was shown in [Vi2] that T is a so-called
Tadmor–Ritt operator, that is, R(λ, T ) ≤ |λ−1| c
for every |λ| > 1, where c ≤ π2 + 1.
From [Vi3] we know also that T ∈ (B∞,1 )C with C ≤ 300c5 < 105 , where B∞,1
0 0
is
endowed with the Peetre–Lizorkin norm.
Next, choosing λj = 1−q j with 0 < q < 1, we obtain a set σ with the Carleson constant
m
δ(σ) = inf j (1 − |λj |2 )|Bσ
(λj )| satisfying δ(σ) ≥ ( m≥1 1−q 2
1+q m ) (see, for example, [N5,
p. 160]). By the Jones–Vinogradov theorem ([N5, p. 189] or [N3, p. 179]), there exists
a function a (in fact, due to Pick’s theorem, a can be chosen to be a finite Blaschke
product times a constant) such that a(λj ) = (−1)j , 0 ≤ j < n, and a∞ ≤ 8/δ(σ)2 .
The operator a(T ) is a projection in bvn satisfying a(T ) ≥ n (see [Vi2]). Making q
sufficiently small, we get a(T ) ≥ (8 − )naH ∞ /mH ∞ . The result follows. 

Remark 3.15. Here we state explicitly the related estimates for the usual classes of
operators. Sometimes, such an estimate follows directly from Theorem 3.14, sometimes
the constants are better if we use other sources. Let C ≥ 1. For the set Υ1 of operators
satisfying the Kreiss condition R(λ, T ) ≤ |λ|−1
C
, |λ| > 1, we have (see [Vi1])

16Cn
a(T ) ≤ aH ∞ /mH ∞
π
for every T ∈ Υ1 satisfying m(T ) = 0, m = mσ , card(σ) ≤ n, and for every function a
on σ.
Let Υ2 be the set of all Banach space operators with supk≥0 T k  ≤ C. Then
a(T ) ≤ 2CnaH ∞ /mH ∞
for every T ∈ Υ2 satisfying m(T ) = 0, m = mσ , card(σ) ≤ n, and for every function a on
σ. It should be mentioned that a slightly worse inequality with the constant πn+1 instead
of 2n was already known to Katsnelson and Matsaev [KM]; see also [N3, C.2.5.4(d)].
For the set Υ3 of operators satisfying m(T ) = 0, deg(m) ≤ n, and the Tadmor–Ritt
condition sup|λ|>1 R(λ, T ) · |λ − 1| = C < ∞, we get supk≥0 T k  ≤ C 2 (see [ER]) and
hence
a(T ) ≤ 2C 2 naH ∞ /mH ∞

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


660 N. K. NIKOLSKI

for every T ∈ Υ3 satisfying m(T ) = 0, m = mσ , card(σ) ≤ n, and for every function a


on σ.
Moreover, from the proof of Theorem 3.14 it is clear that for every n ≥ 1 there
exists T satisfying m(T ) = 0, deg(m) ≤ n and the Tadmor–Ritt condition with the
constant 105 , and there exists a rational function a of degree deg(a) ≤ n such that
a(T ) ≥ n8 aH ∞ /mH ∞ .
Remark 3.16. Operators defined on a specific Banach space (in particular, on a Hilbert
space) and satisfying formally the same resolvent or power conditions may have better
functional calculi than operators on an arbitrary Banach space, and hence may admit
better estimates for inverses and for other functions of the operator. For instance, Peller
[Pe1] proved that
f (T ) ≤ CT2 Kf 0,∞,1
for every Hilbert space power bounded operator T such that supn≥0 T n  = CT < ∞,
where K is an absolute constant and  · 0,∞,1 stands for the B∞,1
0
-norm. (Compare with
an arbitrary Banach space operator of the same class, where we have only f (T ) ≤
Cf W .) Therefore, for the set Υ(m, C) of Hilbert space power bounded operators
satisfying CT ≤ C and m(T ) = 0, Corollary 3.6 can be improved up to the estimate from
Corollary 3.10, namely,
|a|Υ(m,C) ≤ C 2 KaB∞,10 0
/mB∞,1

for every a ∈ B∞,10


and T ∈ Υ(m, C). Just as in the latter corollary, the question of
the (uniform) sharpness of this bound can be raised, but here it has a negative answer
0
(in contrast to the case of all Banach space operators satisfying a B∞,1 -calculus; see
0
Theorem 3.4). Indeed, in [Pe1] it was shown that B∞,1 is not an operator algebra, that
is, there exists no Hilbert space operator T such that c1 f 0,∞,1 ≤ f (T ) ≤ c2 f 0,∞,1
for every polynomial f and some constants c1 , c2 > 0 independent of f . Now, if we
suppose that there exists k > 0 such that
|a|Υ(m,C) ≥ kaB∞,1
0 0
/mB∞,1

for every a ∈ B∞,1


0
and m, then, given a, we can find a polynomial m = mσ(a) such
that aB∞,1
0 ≤ 2aB∞,1
0 0
/mB∞,1 (the partial sums of the Taylor series of a indexed by 2n
converge to a; hence a polynomial m of degree 2n with zeros σ(a) close to 0 is convenient).
Then, we take an operator Ta ∈ Υ(m, C) such that a(Ta ) ≥ 2−1 |a|Υ(m,C) , and finally,
 
define T = a Ta acting coordinatewise on the l2 -sum H(Ta ) of spaces where the Ta
are defined. Then, obviously, T is power bounded and a(T ) ≥ (k/4)aB∞,1 0 for every
a ∈ B∞,1 , which contradicts Peller’s result.
0

For the classes of Hilbert space Kreiss and Tadmor–Ritt operators, estimates better
than those mentioned in Subsection 3.2 are also, probably, possible.
Remark 3.17. For C = 1, Theorem 3.14 gives a comparison of the norms aA/mA and
aH ∞ /mH ∞ for A = B1,11 0
, W , and B∞,1 . The maximum of the ratio of these norms,
bounded in Theorem 3.14, can be regarded as a distortion coefficient for the Nevanlinna–
1
Pick type interpolation problem for these algebras. In fact, for A = B1,1 , the result
is essentially contained in [AFP] (without evaluating the constants). In [VSh], among
other results, the authors found
two-sided estimates for a similar quantity sup{Bσ A :
card(σ) ≤ n}, where Bσ = λ∈σ bλ , bλ = 1−λz λ−z
, stands for a finite Blaschke product and
1/p
A = Bp,q , 1 ≤ p, q ≤ ∞ (in particular, for A = B∞,1
0
). The proofs in those papers are
different from ours.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 661

3.5. Condition numbers and analytic capacities. Here we return to the problem
of bounding the condition numbers of large matrices, and more generally, the quanti-
ties | z1 |Υ(mσ ,AC ) ,  z1 A/mσ A , and k( 1z , mσ , AC ) introduced in Subsections 3.1 and 3.4,
respectively. More precisely, we study the behavior of these quantities as functions of
the spectrum σ and of card(σ). In this subsection, we start with power bounded Ba-
nach space operators, supn≥0 T n  < ∞, and the corresponding algebra W (the analytic
Wiener algebra). The inverses and the resolvents of such operators are estimated. This
will lead to a general definition of the A-capacity capA for a given function space A on
the disk D. In forthcoming sections we study capA for the Besov classes Bp,q s
and the
weighted Beurling–Sobolev spaces Fl (Z+ , wn ).q

Inverses, capacities, and resolvents. The above program forces us to generalize our
previous approach to bounding CN(T ) in terms of SCN(T ), as follows. Recall that
in order to bound condition numbers in terms of the spectral condition numbers, we
introduced the quantities
 
C1 (∆, Υ) = sup CN(T ) : T ∈ Υ, SCN(T ) ≤ ∆
 
= sup T  · T −1  : T ∈ Υ, T r(T −1 ) ≤ ∆ .
It is obvious that for a positively homogeneous set Υ we have
 
C1 (∆, Υ) = sup T −1  : T ∈ Υ, T  ≤ 1, r(T −1 ) ≤ ∆ ,
and, on the other hand, the contractivity condition T  ≤ 1 can be written as a calculus
condition T ∈ W1 . Since an operator may have a better functional calculus, it seems of
interest to study the following functions generalizing C1 (∆, W1 ) and already mentioned
in the Introduction:
1
 
ϕ(mσ , AC ) =   = sup{T −1  : T ∈ AC , mσ (T ) = 0},
z Υ(mσ ,AC )
 
Φn (∆, AC ) = sup ϕ(mσ , AC ) : σ ⊂ σ1/∆ , card(σ) ≤ n
 
= sup T −1  : T ∈ AC , r(T −1 ) ≤ ∆, deg(T ) ≤ n ,
and  
Φn (∆, AC ) = sup ϕ(mσ , AC ) : σ ⊂ {z : |z| = 1/∆}, card(σ) ≤ n ,
where σδ = {z ∈ C : δ ≤ |z| ≤ 1}, A is a function space in D, and as before, Υ =
Υ(m, AC ) stands for the set of Banach space operators satisfying m(T ) = 0 and f (T ) ≤
Cf A for all polynomials f . In particular,
1
  1
ϕ(mσ , AC ) =   ∞ k(1/z, mσ , AC ) = n−1 k(1/z, mσ , AC ).
j=0 |λj |
z H /mσ H ∞
Note that the functions ϕ and Φn contain information on the norms of inverses and on
condition numbers for families of operators with separated constraints on their norms
(T ∈ AC ) and spectral data (r(T −1 ) ≤ ∆), whereas C1 (∆, Υ) is a homogeneous quantity
depending on the spectral condition numbers T r(T −1 ) ≤ ∆, T ∈ Υ, which combine
norm and spectral conditions. Moreover, for the quantity C1 (∆, Υ), the functional cal-
culus type restrictions (such as Υ ⊂ AC ) play almost no role, as the following lemma
shows.
Lemma 3.18. Let A be a function space on the disk D and C > 0 a constant such that
C > sup{|f (0)| : f A ≤ 1}. Let
 
Υ1n = T ∈ L(X) : X a Banach space, deg(T ) ≤ n ,
 
Υ2n = T ∈ L(X) : X a Banach space, dim(X) ≤ n .

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


662 N. K. NIKOLSKI

Then
C1 (∆, Υ1n ) = C1 (∆, Υ1n ∩ AC ) ≥ C1 (∆, Υ2n ) = C1 (∆, Υ2n ∩ AC )
for every ∆ ≥ 1.
Proof. Clearly,
C1 (∆, Υ1n ) ≥ C1 (∆, Υ2n ),
C1 (∆, Υ1n ) ≥ C1 (∆, Υ1n ∩ AC ),
C1 (∆, Υ2n ) ≥ C1 (∆, Υ2n ∩ AC ).
To prove that equality occurs in the last two inequalities, observe that, by the hypothesis,

there exists r > 0 such that f D(r) ≤ Cf A for every polynomial f = k≥0 fˆ(k)z k ,
where f D(r) = max|z|≤r |f (z)|. Furthermore, by a theorem of Bohr [Bo] (see also [N3,
p. 120]),
|fˆ(k)|r k
≤ f D(r) .
3k
k≥0

Therefore, for every operator T : X −→ X there exists > 0 such that T ∈ AC . Indeed,
if  T  ≤ r3 and f is a polynomial, then
|fˆ(n)|r k
f ( T ) ≤ ≤ f D(r) ≤ Cf A .
3k
k≥0

Since CN(T ) = CN( T ) and SCN(T ) = SCN( T ), we get


C1 (∆, Υ1n ) = C1 (∆, Υ1n ∩ AC ), C1 (∆, Υ2n ) = C1 (∆, Υ2n ∩ AC ). 

Now, we link the functions ϕ and Φn with condition numbers.


Lemma 3.19. In the previous notation, we have
(1) ϕ(mσ , AC ) ≤ C z1 A/mσ A ;
(2) sup{CN(T ) : T ∈ Υ(mσ , AC )} ≤ CzA/mσ A ϕ(mσ , AC );
(3) sup∆≥1 Φn (∆,A
∆n
C)
≤ kn ( z1 , AC ) (the last constant was defined at the beginning of
Subsection 3.4).
In the case of a function algebra A, we have in addition
(4)  z1 A/mσ A ≤ ϕ(mσ , AC ) ≤ C z1 A/mσ A ;
(5) C1 zA/mσ A ϕ(mσ , AC ) ≤ sup{CN(T ) : T ∈ Υ(mσ , AC )} ≤ CzA/mσ A ϕ(mσ , AC );
(6)
1
Φn (∆, AC ) ≤ sup{CN(T ) : T ∈ AC , r(T −1 ) ≤ ∆, deg(T ) ≤ n}
C
≤ CzA Φn (∆, AC ).
Proof. Items (1) and (2) are straightforward consequences of the definitions. Item (3)
follows from
1 
kn , AC = sup{|mσ (0)|ϕ(mσ , AC ) : card(σ) ≤ n}
z
= sup sup{|mσ (0)|ϕ(mσ , AC ) : σ ⊂ σ1/∆ , card(σ) ≤ n}
∆≥1
Φn (∆, AC )
≥ sup .
∆≥1 ∆n
For the left-hand side inequalities in (4) and (5), we use (1) and the quotient operator
T = z/mσ A on A/mσ A.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 663

For the left-hand side inequality in (6), note that every function Banach algebra is
contractively embedded in H ∞ , whence 1 = zH ∞ /mH ∞ ≤ zA/mA ≤ zA for every
m with m(0) = 0. Therefore, (6) follows from (5). 
Below we bound the functions Φn and ϕ in terms of a certain capacity related to the
space A. The capacities themselves are studied in the next section. But first we consider
a special case already mentioned. The facts equivalent to the following theorem are
contained in [GMP] and [VSh], but we give a new short proof using an idea of Nazarov
[Na]. Notice that the same trick of smoothing an interpolating function f{λk } (z) taking
given values at z = λk by passing to f{rλk } (rz) was also used in [Vi2], for different
purposes.
Theorem 3.20. Given a number C ≥ 1 and a monic polynomial m = mσ , σ =
{λ0 , . . . , λn−1 }, m(0) = 0, let Υ = Υ(m, WC ) be the set of all Banach space operators
satisfying supn≥0 T n  ≤ C and m(T ) = 0. Then
1 1
−1     C e(n + 1)
sup T  =   ≤ C   ≤ n−1 ,
j=0 |λj |
T ∈Υ z Υ z W/mW

or equivalently, Φn (∆, WC ) ≤ ∆n C e(n + 1), kn ( z1 , WC ) ≤ C e(n + 1). In particular,

CN(T ) ≤ C 2 e(n + 1)(r(T −1 ))n
for every T ∈ Υ(m, WC ) .
Proof. Given a function f ∈ H 2 and a number 0 < r < 1, we denote fr = f (rz) =
 ˆ k k
k≥0 f (k)r z and observe that
 1/2  1 1/2  1 1/2
fr W ≤ |fˆ(k)|2 ≤ f H ∞ .
1−r 2 1 − r2
k≥0
n−1 λj r−z 1
Now, let B = be a Blaschke product and f = B/B(0) = rn m(0)
j=0 1−λj rz B. Then
fr ∈ W , fr (λj ) = 0 for 0 ≤ j < n, and fr (0) = 1. Consequently (see also Lemma 3.2),
1 1 − f   1 1/2
   r 1
  ≤  = fr W − 1 ≤ n · − 1.
z W/mW z W r |m(0)| 1 − r2
Taking r 2 = 1 − n+1
1
n ) ≤ e, we get the first of the inequalities claimed.
and using ( n+1 n

The second inequality follows from the first. 


Remark 3.21. The norms  z1 A/mσ A , where A is a function space (and, in particular, the
norm  z1 W/mσ W ), can be viewed as a kind of “A-capacity” of a set σ ⊂ D\{0}.
Namely, let
cap∗A (σ) = inf{gA : g|σ = 1, g(0) = 0},
and let capA (σ) be the zero A-capacity, that is,
capA (σ) = inf{gA : g|σ = 0, g(0) = 1}.
If A is included in the space of continuous functions on D, A ⊂ C(D), then the above
capacity capA (σ) is still well defined for sets in the closed unit disk σ ⊂ D\{0}.
Next, let
 
κn (∆, A) = sup capA (σ) : σ ⊂ σ1/∆ , card(σ) ≤ n ,
 
κn (∆, A) = sup capA (σ) : σ ⊂ {z : |z| = 1/∆}, card(σ) ≤ n ,
where, as before, ∆ > 1, σδ = {z ∈ C : δ ≤ |z| ≤ 1}, and finally
 
κ∗n (A) = sup |mσ (0)| capA (σ) : card(σ) ≤ n .

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


664 N. K. NIKOLSKI

The following lemma shows how these capacities are related to the functions ϕ, Φn , kn
introduced previously. The first assertion of the lemma is contained in Remark 3.3 above,
and the second through fourth easily follow from the definitions and the same arguments
as in Lemma 3.19 above. All these properties are stated for sets σ in D\{0}, but if
A ⊂ C(D), then they extend easily to sets σ in D\{0}.
Lemma 3.22. (1) For every function space on D and every set σ ⊂ D\{0}, we have
1
1  
cap∗A (σ) ≤   ≤ S ∗  capA (σ),
S z A/mA
and if the shift S is an isometry on A, then
1
 
  = cap∗A (σ).
z A/mA
Moreover,
| capA (σ) − cap∗A (σ)| ≤ 1A ; capW (σ) = 1 + cap∗W (σ) for A = W.
∗ ∗
(2) ϕ(mσ , AC ) ≤ CS  capA (σ) and Φn (∆, AC ) ≤ CS κn (∆, A), and in the case
of a Banach algebra A we have
1
cap∗A (σ) ≤ ϕ(mσ , AC ) ≤ CS ∗  capA (σ),
S
1
(κn (∆, A) − 1) ≤ Φn (∆, AC ) ≤ CS ∗ κn (∆, A).
S
(3) Similarly,
1 
k , mσ , AC = |mσ (0)|ϕ(mσ , AC ) ≤ CS ∗  · |mσ (0)| capA (σ)
z
and 1 
kn , AC ≤ CS ∗ κ∗n (A),
z
and in the case of a Banach algebra A, we have
|mσ (0)| 1 
cap∗A (σ) ≤ k , mσ , AC ≤ CS ∗  · |mσ (0)| capA (σ),
S z
1 1 
(κ∗n (A) − 1) ≤ kn , AC ≤ CS ∗ κ∗n (A).
S z
(4) κn (∆, A) ≤ κn (∆, A) ≤ ∆n κ∗n (A) for every ∆ > 1. 
Notice that the capacity cap∗A is defined in the spirit of classical potential theory
(see, e.g., Wermer [W]), whereas the capacity capA is closely related to the problem of
uniqueness sets for A. Namely, assume that a function space A satisfies the following
Fatou property: if fn ∈ A, supn fn A < ∞ and limn fn (z) = f (z) for z ∈ D, then
f ∈ A. Then an infinite subset σ ⊂ D\{0} is a uniqueness set for A (i.e., f ∈ A,
f |σ = 0 =⇒ f = 0) if and only if
sup{capA (σ
) : σ
finite, σ
⊂ σ} = ∞.
In particular, this criterion applies to A = W , where the problem of uniqueness sets is
open. Finally, we explicitly indicate the bounds for capW obtained in Theorem 3.20 (see
the proof) and Theorem 3.12.
Corollary 3.23. For every σ = {λ0 , . . . , λn−1 } ⊂ D\{0}, we have

1 e(n + 1)
n−1 ≤ capW (σ) ≤ n−1 .
j=0 |λj | j=0 |λj |

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 665

Both bounds are attained (up to a constant) for subsets σ = {λ0 , . . . , λn−1 } of a circle
Cδ = {|λ| = δ}. Namely, the left-hand side inequality is sharp on Cδ for every 0 < δ < 1,
and the right-hand side inequality is sharp on Cδ (at least) for δ = 1 − nc , c > 0.
zn
Indeed, for the sharpness of the left-hand side inequality, we simply set g = 1 − δn and
σ = {δe2πik/n : 0 ≤ k < n}. Then
1 1
capW (σ) ≤ gW = 1 + n = 1 + n−1 .
j=0 |λj |
δ
The sharpness statement for the right-hand side inequality is a striking result of Queffelec
[Q]. 
n−1 1
Clearly, the left-hand side determinant of the last corollary, capH ∞ (σ) = j=0 |λj | ,
corresponds to the Blaschke uniqueness condition. One more point to notice about the re-
lationships between condition numbers and uniqueness theorems is a kind of discrepancy
between them. Namely, for the needs of the uniqueness theorems, the above capacities
are interesting in the case where limn (max0≤k<n |λk |) = 1, and in the framework of the
theory of condition numbers, in the case where limn (min0≤k<n |λk |) = 0. In particu-
lar, for a function algebra A, the asymptotics of κn (∆, A) as ∆ −→ ∞ describes the
worst case behavior of the norms of inverses and the condition numbers for operators
from AC as the lower bound of the spectrum tends to zero. Unfortunately, the last
corollary contains only
partial information about such behavior for A = W , giving only
∆n ≤ κn (∆, W ) ≤ e(n + 1)∆n . For Besov spaces A = Bp,q s
, we shall obtain some
better estimates.
We finish this section with an estimate of the resolvent of an algebraic power bounded
operator.
Theorem 3.24. In the notation of Theorem 3.20, suppose T ∈ Υ = Υ(m, WC ), λ ∈ D\σ,
and R(λ, T ) = (λI − T )−1 is the resolvent of T . Then

2Ce3/2 n 1
R(λ, T ) ≤ · ,
(1 − |λ|)3/2 |B(λ)|
n−1
where B(λ) = k=0 bλk (λ), bµ (z) = 1−µz µ−z
· |µ|
µ , is the corresponding Blaschke product.
For |λ| > 1, we obviously have R(λ, T ) ≤ |λ|−1
C
.

Proof. We follow the same method as in Theorem 3.20. Namely, R(λ, T ) ≤ | λ−z 1
|Υ ≤
C λ−z W/mW and
1

 1  

  1
  = inf f W : f (λj ) = ,0≤j<n
λ − z W/mW λ − λj
 g 

 
= inf   : g(λj ) = 1, 0 ≤ j < n, g(λ) = 0 .
λ−z W
It is known and easy to check that λ−z g
= S ∗ (I − λS ∗ )−1 g, where S ∗ is the backward
shift operator on W (see above). Since (I − λS ∗ )−1  = (1 − |λ|)−1 , we obtain
 1 
  1
  ≤ inf{gW : g(λj ) = 1, 0 ≤ j < n, g(λ) = 0}.
λ − z W/mW 1 − |λ|
Denoting  
capW,λ (σ) = inf gW : g(λj ) = 0, 0 ≤ j < n, g(λ) = 1 ,
we get
 1 
  1
  ≤ (1 + capW,λ (σ)).
λ − z W/mW 1 − |λ|

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


666 N. K. NIKOLSKI

n−1 λj r−z
Let B = j=0 1−λ be the same Blaschke product as in Theorem 3.20, and let h(z) =
j rz
B(rz). Then h ∈ W , h(λj ) = 0 for 0 ≤ j < n, and
1
hW ≤ .
(1 − r 2 )1/2
Setting g = h/B(rλ), we obtain
1
capW,λ (σ) ≤ gW ≤ .
(1 − r 2 )1/2 |B(rλ)|
Next,
1  1 − λj r 2 λ
n−1
1
= r −n = n 1,
B(rλ) j=0
λ j − λ r B(λ)

| 1|
capW,λ (σ) ≤ ,
(1 − r 2 )1/2 r n |B(λ)|
n−1 1−λj r2 λ n−1  
where
λj λ(1−r 2 )
1 = j=0 1−λ λ = j=0 1 + 1−λ λ
.
j j
1−r 2 n
Since | 1 | ≤ (1 + 1−|λ| ) , we can set 1 − r = (1 − |λ|)/n and get
2

e
capW,λ (σ) ≤ ,
((1 − |λ|)/n)1/2 r n |B(λ)|
where r n = (1 − 1−|λ| n/2
n ) ≥ exp(−(1 − |λ|)/2) ≥ e−1/2 . Finally,
 e3 n 1/2 1
capW,λ (σ) ≤ ,
1 − |λ| |B(λ)|
C   e3 n 1/2 1 
R(λ, T ) ≤ 1+
1 − |λ| 1 − |λ| |B(λ)|
2C  3
e n  1/2 1
≤ . 
1 − |λ| 1 − |λ| |B(λ)|
Remark 3.25. Recall that for an algebraic polynomially bounded operator T such that
f (T ) ≤ Cf ∞ for every polynomial f , there exists a better estimate R(λ, T ) ≤
C
(1−|λ|)|B(λ)| , see Theorem 3.12. Concerning the estimate for capW,λ in the last theorem,
it should be mentioned that it cannot be an automatic “conformal transfer” of an estimate
for capW = capW,0 , since the composition map f −→ f ◦ bλ is bounded on W only for
λ = 0, see [K, GrMcG].
s s
3.6. Bp,q -capacities and operators obeying a Bp,q -functional calculus. Here we
are looking for estimates of inverses and condition numbers for operators obeying a
calculus over a Besov space Bp,q s
with s ≥ 0, 1 ≤ p, q ≤ ∞. To this end, we establish
s
upper and lower bounds for capacities and functions κn corresponding to the spaces Bp,q .
Having in mind the behavior of condition numbers as the spectral minimum tends to 0
s
and/or the size of the matrices tends to infinity, we pay special attention to κn (∆, Bp,q )
as ∆ −→ ∞ and/or n −→ ∞.
s
A space Bp,q is not always an algebra with respect to pointwise multiplication; see the
references in Subsection 3.1 above. However, whatever s, p, q may be, if an operator T
satisfies f (T ) ≤ Cf Bp,q
s
s
for all polynomials f , we still speak about a Bp,q -calculus
for T . See also Remark 3.27 and Lemma 3.28 below for a discussion of generalized calculi
over spaces that are not function algebras.
s
The next theorem contains some upper bounds for the Bp,q capacities. For the case
−n
where s > 0, we show estimates for ∆ κn (∆, Bp,q ) and |mσ (0)| capBp,q
s
s (σ), and hence for

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 667

∆−n Φn (∆, Bp,q


s
) and kn ( z1 , (Bp,q
s
)C ), which depend mostly on s and asymptotically are
O(ns ). For s = 0, the same estimates depend on q and asymptotically are O((log n)1/q ).
0
The case of B∞,1 is especially interesting in view of the functional calculi (discussed
above) for Hilbert space power bounded operators and Banach space Tadmor–Ritt op-
erators. It also follows that for s = 0 and q = ∞ the quantities kn ( z1 , (Bp,q s
)C ) are

uniformly bounded for n ≥ 1, which is not surprising because H ⊂ Bp,∞ for every p,
0

1 ≤ p ≤ ∞; see also Lemma 3.28 below. A statement equivalent to the case of s > 0 in
this theorem (without evaluating the constants) can be found in [VSh], but our proof is
shorter. We state the result for subsets σ ⊂ D\{0}, but if Bp,q s
⊂ CA (D) (see Subsection
3.1 above), then the capacity is well defined for σ ⊂ D\{0} and the theorem is still true
in this case.
Theorem 3.26. Let A = (Bp,q s
,  · s,p,q ), where s ≥ 0, 1 ≤ p, q ≤ ∞, and σ =
{λ0 , . . . , λn−1 } ⊂ D\{0}. Then
(n + 1)s (n + 1)s
capA (σ) ≤ γ = γ n−1 ,
|mσ (0)| j=0 |λj |

where
3e2s   1   s s

· min (log n)1/q ,


γ≤ + c + 2
log 2 (sq)1/q e
and c > 0 is an absolute constant. In particular,
3e2s  1  s s

γ ≤ γ(s, q) = · + c + 2
log 2 (sq)1/q e
for s > 0, and
3e 9e
γ≤ · {(log n)1/q + 2} ≤ · (log(ne))1/q
log 2 log 2
for s = 0.
Proof. We use the same test function as in the proof of Theorem 3.20. Namely, let
λj r−z
B = n−1 1
j=0 1−λj rz , 0 < r < 1, be a Blaschke product, and let f = B/B(0) = r n m(0) B.
Then fr ∈ Bp,q
s
, fr (0) = 1, and fr (λj ) = 0 for 0 ≤ j < n. Hence, capA (σ) ≤ fr s,p,q .
Now, for r = 1 − n+1 1
,

fr qs,p,q = 2ksq fr ∗ Wk qLp (T) + 2ksq fr ∗ Wk qLp (T)
2k−1 ≤n 2k−1 >n
 3 q
≤ 2ksq
2r n |m(0)|
2k−1 ≤n

(z −2 f )r ∗ (z −2
k−1 k−1 k−1 k−1
+ 2ksq r 2 z2 Wk )qLp (T)
2k−1 >n
nsq 2sq − 1 
3e q
≤ 2sq sq ·
2 −1 2|m(0)|
 1 2 q  3e q
k−1

+ 2sq 2(k−1)sq 1 −
n+1 2|m(0)|
2k−1 ≤n
 3e2s q
≤ {(α + 2)nsq + S},
2|m(0)|
where 
1 2
α≤ · min log n,
log 2 sq

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


668 N. K. NIKOLSKI

 2j q
and S = 2j >n 2jsq e− n+1 . Since the function x −→ xs − n+1 2x
decreases for 2x ≥ n + 1
if s ≤ 1 and has precisely one extremum (maximum) at 2 = s(n + 1) if s > 1, we obtain
x
 s(n + 1) sq
2x q
S≤ 2xsq e− n+1 dx + (s(n + 1))sq e−sq = I +
2x ≥n+1 e
for s > 1, and S ≤ I for s ≤ 1. Moreover, setting y = 2x /(n + 1), we get

(n + 1)sq ∞ sq−1 −yq
I= y e dy.
log 2 1
Therefore, if sq ≤ 1, we have
(n + 1)sq
S≤I≤ = β1 (n + 1)sq ,
q · log 2
and finally
(n + 1)s
fr s,p,q ≤ γ1 ,
|m(0)|
where
1/q
γ1 ≤ 3e2s−1 {α + β1 + 2}1/q ≤ 3e2s−1 {α1/q + β1 + 21/q }
 1  21/q  1

≤ 3e2s−1 · min (log n)1/q , + + 21/q


(log 2) 1/q (sq) 1/q (q · log 2) 1/q

3e2s   1 

≤ · min (log n)1/q , +2 .


log 2 (sq)1/q
If sq > 1, we have

(n + 1)sq ∞ sq−1 −yq (n + 1)sq ∞ sq−1 −t
I≤ y e dy = sq t e dt
log 2 0 q log 2 0
(n + 1)sq Γ(sq)
= ,
q sq log 2
where Γ stands for the Euler Γ-function,
(n + 1)sq Γ(sq)  s(n + 1) sq
S≤ + = β2 (n + 1)sq ,
q sq log 2 e
and finally
(n + 1)s
fr s,p,q ≤ γ2 ,
|m(0)|
where
γ2 ≤ 3e2s−1 {α + β2 + 2}1/q
 1  21/q 
≤ 3e2s−1 · min (log n) 1/q
,
(log 2)1/q (sq)1/q
Γ(sq)1/q  s s

1/q
+ s + + 2 .
q (log 2)1/q e
Using the Stirling formula, we observe that
  sq sq 1/q
Γ(sq)1/q ≤ a 2πsq ≤ bq s (s/e)s
e
for all sq ≥ 1, where a > 0, b > 0 are absolute constants. Thus,
3e2s   1   s s

γ2 ≤ · min (log n)1/q , + c + 2 ,


log 2 (sq)1/q e
where c > 0. Taking γ = max(γ1 , γ2 ) = γ2 , we complete the proof. 

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 669

s
Remark 3.27. In the case where the space Bp,q is not an algebra with respect to pointwise
s
multiplication, quite a special situation occurs for an operator obeying a Bp,q -calculus.
Namely, if this is the case (see conditions on s, p, q above), then one can check that
lim|λ|−→+1 (|λ| − 1) λ−z
1
Bp,q
s = 0 and hence lim|λ|−→+1 (|λ| − 1) λ−z 1
s,p,q = 0. Now, if
T ∈ (Bp,q )C , then, using the inequalities
s

 1 
1  
≤ R(λ, T ) ≤ C   ,
dist(λ, σ(T )) λ − z s,p,q
we obtain the following numerical bound for the spectral radius r(T ):
 1

r(T ) ≤ ρ = 1 − sup − (|λ| − 1) < 1.


1
C λ−z s,p,q
s
This means that in the nonalgebra case, a Bp,q -calculus imposes some implicit constraints
on the spectral data, namely |λj | ≤ ρ, 0 ≤ j < n.
The above situation can be generalized as follows. Let X be a function space on the
disk D (see Subsection 3.1), let C > 0 be a constant, and let Υ(XC ) be the set of all
operators T obeying an X-calculus with constant C, i.e., such that f (T )X ≤ Cf X
for every polynomial f . Let 0 ≤ r < 1 and
MX (r) = sup{|f (z)| : |z| ≤ r, f X ≤ 1}.
The following lemma shows that the operators in Υ(XC ) also obey a functional calculus
defined on a Banach algebra which often is much larger than X.
Lemma 3.28. Let X be a Banach function space on D not included in H ∞ , and assume
that X is rotation invariant: f ∈ X =⇒ fζ ∈ X and fζ X = f X , where ζ ∈ T
and fζ (z) = f (zζ). Then MX is a continuous strictly increasing function on [0, 1) and
limr−→1 MX (r) = ∞.
−1
Moreover, if C > MX (0) and r = MX (C), then 0 < r < 1, and the seminorm |·|Υ(XC )
(see Subsection 3.1) is a Banach algebra norm defined on polynomials and such that
f (T ) ≤ |f |Υ(XC ) ≤ Cf X
for every T ∈ Υ(XC ) and every polynomial f , and
f H ∞ (Dr ) ≤ |f |Υ(XC ) ≤ c f H ∞ (Dr+ )
for every polynomial f and every > 0, where Dr = {z ∈ C : |z| ≤ r} and c is a
constant.
Proof. The claimed properties of MX follow from the maximum modulus principle and
the definition of a function space on D.
The estimate for f (T ) is obvious. Furthermore, if C > MX (0), then Dr ⊂ {λ ∈ C :
|f (λ)| ≤ Cf X for every polynomial f }. The reverse inclusion follows from the rota-
tional symmetry of X: if |f (λ)| ≤ Cf X for every polynomial f , then max|z|=|λ| |f (z)| ≤
Cf X and hence λ ∈ Dr . Therefore,
Dr = {λ ∈ C : |f (λ)| ≤ Cf X for every polynomial f }.
Consequently, T = λI ∈ Υ(XC ) for every λ ∈ Dr . This implies the left-hand side
inequality for |f |Υ(XC ) .
In order to prove the right-hand side inequality, observe first that by the spectral
mapping theorem |f (λ)| ≤ f (T ) ≤ Cf X for every T ∈ Υ(XC ), every λ ∈ σ(T ), and
every polynomial
 f . This and the previous formula for Dr mean that σ(T ) ⊂ Dr . Next,
let T = T ∈Υ(XC ) T be the direct sum of all operators in Υ(XC ) acting coordinatewise

on the l∞ -type direct sum l∞ Y , where Y = Y (T ) stands for a Banach space on which
the operator T ∈ Υ(XC ) is defined. Obviously, T ∈ Υ(XC ) and therefore σ(T ) ⊂ Dr .

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


670 N. K. NIKOLSKI

Now, the standard Riesz–Dunford calculus implies that for every > 0 there exists a
constant c > 0 such that
|f |Υ(XC ) = f (T ) ≤ c f H ∞ (Dr+ )
for every polynomial f . 

Example 3.29. Applying Lemma 3.28 to the Hardy space X = H p , we get MX (r) =
1
(1−r 2 )1/p
, whence r = (1 − C1p )1/2 ; see also [N4] for other similar estimates of spectral
radii.
Upper estimates for capacities similar to those of Theorem 3.26 exist for some other
q
spaces, e.g., for the Beurling–Sobolev spaces lA (wk ) = Flq (Z, wk ),
  1/q

q q q
lA (wk ) = f = fˆ(k)z k : f lA
q
(wk ) = |fˆ(k)| w k ,
k≥0 k≥0

1/k
where wk > 0. We assume that X is a function space in D, in particular, limk wk = 1.
q
For conditions for lA (wk ) to be an algebra with respect to pointwise multiplication, see
[N6] or [ENZ]. For instance, if the function k −→ wk is sufficiently “regular” (example:
q
k −→ log(ks wk ) is concave or convex for every s ∈ R), then lA (wk ) is an algebra if

q ∞
and only if lA (wk ) ⊂ H (D), and if and only if (1/wk ) ∈ l , q + q1 = 1, see [ENZ].
q 1
q
The lA (wk )-capacities are bounded in terms of the so-called Lagrange transforms of the
sequence w = (wk ):
 1/α
Lα (w, r) = r kα wkα , 0 < r < 1.
k≥0

q
Theorem 3.30. Let X = lA (wk ), where wk > 0, 1 ≤ q ≤ ∞, and let σ = {λ0 , . . . , λn−1 }
⊂ D\{0}. Then
γq (n) γq (n)
capX (σ) ≤ = n−1 ,
|mσ (0)| j=0 |λj |

where
γq (n) = inf r −n Lα (r),
0<r<1

and α = ∞ for q ≥ 2, α = 2q
2−q for 1 ≤ q < 2. In particular, for wk = kβ , k ≥ 1
(w0 = 1), we have γq (n) ≤ nβ for q ≥ 2 and γq (n) ≤ anβ+ q − 2 + b for 1 ≤ q < 2, where
1 1

a, b > 0 are constants depending on q and β.


n−1 λj r−z
Proof. We use the same test function as in Theorem 3.20. Namely, let B = j=0 1−λ rz j

be a Blaschke product, and let f = B/B(0) = 1


r n m(0) B. Then fr ∈ X, fr (λj ) = 0 for
0 ≤ j < n, and fr (0) = 1. Hence,
capA (σ) ≤ fr X .
Now, for q ≥ 2 we have
 1/2
fr X ≤ |fˆ(k)|2 r 2k wk2 ≤ sup(r k wk )f 2
k≥0
k≥0
1
= L∞ (w, r).
r n |mσ (0)|

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 671

For 1 ≤ q < 2, by Hölder,


 1/q
fr X = |fˆ(k)|q r kq wkq
k≥0
 1/α 1
≤ f 2 r kα wkα = Lα (w, r),
r n |mσ (0)|
k≥0
2q
where α = 2−q .
The result follows.
For wk = k and q ≥ 2, we have
β
 
L∞ (r) = sup r k wk ≤ max 1, sup e−t log(1/r) tβ
k≥0 t>0

and  1 β
sup e−t log(1/r) tβ = e−β β/ log
t>0 r
(and the right-hand side is equivalent to L∞ (r) as r −→ 1). Therefore, γq (n) ≤ nβ (and
limn−→∞ n−β γq (n) = 1).
For 1 ≤ q < 2, we have Lα (r) ≤ max(1, I(r)1/α ), where
∞ ∞
−αt log(1/r) αβ 1
I(r) = e t dt =  αβ+1 e−t tαβ dt
0 α log 1r 0

Γ(αβ + 1) cα
=  = ,
α log 1
αβ+1
log 1r )αβ+1
r
with c > 0 defined by the last equation. Hence,
cr −n
γq (n) ≤ inf  
0<r<1 1 β+(1/α)
log r
 n β+ α1
= ceβ+(1/α) 1 . 
β+ α
s
Now, we show a lower bound for the Bp,q - capacities (s > 0), having the same order as
the upper bound in Theorem 3.26 but only for σ = (λj ) with sufficiently small |λj |. Next,
we apply these estimates for bounding condition numbers and the norms of inverses.
Theorem 3.31. Let σ = {λ0 , . . . , λn−1 } ⊂ D\{0}, s > 0, 1 ≤ p, q ≤ ∞ and A =
s
(Bp,q ,  · s,p,q ). Then
(n + 1)s  c∗  
capA (σ) ≥ c 1+ ∗ 2 − (1 + |λj |) ,
0≤j<n |λj | c k
0≤j<n
∗ 2

c∗ , the constants c∗ , c come from the equivalence of the norms ·s,p,q and
c k
where c = 2s+1
∗ −s −s ∗
·Bp,q
s , and k > 0 is the duality constant for (B
p,q , ·Bp,q
s s ) = B   (or (B   ) = B
p ,q p ,q
s
p,q
if q = ∞); see Subsection 3.1.

Proof. Let g ∈ Bp,q s
, g(0) = 1, and let f = g 0≤j<n (z − λj ). Then, denoting f  =
f s,p,q , we obtain

n−1 
 
f  = z n g + zi g (−1)n−i λj1 · · · λjn−i .
i=0 jl =jm

First, observe that


z i g ≤ c∗ z i gBp,q
s = c∗ S ∗(n−i) (z n g)Bp,q
s .

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


672 N. K. NIKOLSKI

s
Then, using the duality (Bp,q )∗ = Bp−s −s ∗
 ,q  (or (Bp ,q  )
s
= Bp,q , if q = ∞) and the duality
constant k > 0 (see Subsection 3.1), we arrive at the inequality

S ∗(n−i) (z n g)Bp,q
s ≤ S ∗(n−i)  · z n gBp,q
s ≤ k2 S n−i  · z n gBp,q
s ,

where S n−i  stands for the norm of S n−i on the space (Bp−s  ,q  ,  · B −s ). With s > 0,
p ,q 
we have
 1 1/q
s− q1 q
f B −s
 
= ((1 − r) fr  p
L (T) ) dr ,
p ,q
0

whence S n−i  ≤ 1. Therefore,

c∗ k 2 n
z i g ≤ z g,
c∗
c∗ k 2
n−1
f  ≥ z n g − z n g |λj1 · · · λjn−i |
c∗
i=0 jl =jm
 c∗ k 2 c∗ k 2  
= z n g 1 + − (1 + |λj |) .
c∗ c∗
0≤j<n

Moreover,
z n g ≥ z n gs,1,∞ = sup 2ks Wk ∗ (z n g)L1 .
k≥0

If 2k < n + 1 ≤ 2k+1 , then Ŵk (n) + Ŵk+1 (n) = 1, and max(Ŵk (n), Ŵk+1 (n)) ≥ 1/2; let
Ŵk (n) ≥ 1/2. Then

(n + 1)s
z n g ≥ 2ks Wk ∗ (z n g)L1 ≥ 2ks Ŵk (n)ĝ(0) ≥ 2ks−1 ≥ .
2s+1
The result follows. 

The following capacity bounds are straightforward consequences of Theorems 3.26 and
3.31.
s
Corollary 3.32. Let A = (Bp,q ,  · s,p,q ). For s > 0, we have

k κn (∆, A) κn (∆, A)
(n + 1)s ≤ lim ≤ lim
2s+1 ∆−→∞ ∆ n
∆−→∞ ∆n
κn (∆, A)
≤ sup n
≤ κ∗n (A) ≤ γ · (n + 1)s ,
∆>1 ∆

where κn (∆, A) and κ∗n (A) are the quantities defined immediately before Lemma 3.22,
∗ −s −s ∗
s
k > 0 is the duality constant for (Bp,q ,  · Bp,q
s ) = B   (or (B   ) = B
p ,q p ,q p,q if q = ∞;
s

see Subsection 3.1),

3e2s  1  s s

γ ≤ γ(s, q) = · + c + 2 ,
log 2 (sq)1/q e

and c > 0 is an absolute constant.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 673

For s = 0 we have
κn (∆, A) 9e
sup ≤ κ∗n (A) ≤ · (log(ne))1/q . 
∆>1 ∆n log 2
Remark 3.33. Here are two comments on the lower estimate of Theorem 3.26.
First, the estimate obtained starts to matter for circular sets σ ⊂ {z : |z| = 1/∆}
when ∆ and n are related, say, by
n  c∗ 
≤ log 1 + ∗ 2 ,
∆ 2c k
where c∗ , c∗ , k depend on s, p, q. A lower estimate similar to those of Theorem 3.26 was
also claimed in [VSh, Theorem 3.2]. However, in [VSh], the limit case was only considered,
where σ is replaced by a degenerate family σ = {λj } with λ1 = · · · = λn = 0 (i.e., the
case of a zero of multiplicity n at the origin). (By the way, the proof in [VSh] contains
a snag, making use of an inclusion Bp,q s
⊂ B1,1
s
, which is not true for q > 1. However, as
the authors of [VSh] mentioned (private communication), the use of this inclusion is not
necessary and the proof goes well if we simply forget it. The fact itself claimed in [VSh]
is true and easy to check; namely, if g(0) = 1 and 2k < n + 1 ≤ 2k+1 , then, as in the
proof of Theorem 3.26 above, z n gs,p,q ≥ 2ks (z n g) ∗ Wk p ≥ 2ks−1 ≥ (n + 1)s /2s+1 .)
Second, we comment on the case of s = 0. In this case, when trying to show that the
upper bound in Theorem 3.26/Corollary3.32 is sharp, one must seek a more sophisticated
lower estimate for capBp,q
s than those of Theorem 3.31. For example, it is easily seen that
for uniformly distributed sets σ = {λ0 , . . . , λn−1 }, λj = δe2πij/n , 0 < δ < 1, the Bp,q
0
-
n

capacity behaves as the H -capacity. Indeed, setting F = 1 − δn , we get F (0) = 1 and
z

F 0,p,q = (1 + δ −nq z n q0,p,q )1/q , which gives


1 1
0 (σ) ≤ 1 +
capBp,q =1+ .
0≤j<n |λj |
δ n

It is quite clear that this (counter)example works for every function space X such that
supn≥0 z n X < ∞ (in particular, for X = W ). In this case, in order to get, nevertheless,
0
a nontrivial lower estimate of κn (∆, X) (for X = Bp,q the optimal lower bound would
be κn (∆, X) ≥ c(log(n)) ∆ ), we need specifically distributed λj , |λj | = 1/∆. For
1/q n

X = W , one of such distributions was exhibited by Queffelec [Q] when he showed that
κ (∆, W ) √ −1
sup n n ≥ e n;
∆>1 ∆
see also the next remark. One may expect that Queffelec type distributions of λj , |λj | = δ,
0 (σ) and capX (σ) for other spaces X
could give the required lower bound also for capBp,q
satisfying supn≥0 z X < ∞.
n

Remark 3.34. Returning to the case of the Wiener algebra W and power bounded oper-
ators T ∈ WC , we can restate Theorem 3.20 and Corollary 3.23 (see also Lemma 3.22)
as follows:
√ κ (∆, W ) κn (∆, W )
e−1 n ≤ sup n n ≤ sup n
≤ κ∗n (W ) ≤ e(n + 1),
∆>1 ∆ ∆>1 ∆

e n − 1 ≤ sup ∆ Φn (∆, WC ) ≤ sup ∆−n Φn (∆, WC ) ≤ C e(n + 1).
−1 −n
∆>1 ∆>1

It was also shown in [Q] (in an equivalent form) that


 1 κ (∆, W ) 
lim √ sup n n ≥ 1.
n−→∞ n ∆>1 ∆

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


674 N. K. NIKOLSKI

On the contrary, asymptotics for κn (∆,W


∆n
)
or κn (∆,W
∆n
)
as ∆ −→ ∞, or as n −→ ∞ (for a
fixed ∆ > 1) are not studied.
Corollary 3.32 and Lemmas 3.22 and 3.19 yield the following estimates of inverses and
s
condition numbers for operators obeying a Bp,q -functional calculus.
s
Corollary 3.35. Let A = (Bp,q ,  · s,p,q ), where s ≥ 0, 1 ≤ p, q ≤ ∞, and C ≥ 1.
I. Let s > 0. Then
(1) Φn (∆, AC ) = sup{T −1  : T ∈ AC , r(T −1 ) ≤ ∆, deg(T ) ≤ n} ≤ CγS ∗ ∆n (n + 1)s
and


sup CN(T ) : T ∈ AC , r(T −1 ) ≤ ∆, deg(T ) ≤ n ≤ C 2 γzA S ∗ ∆n (n + 1)s


for every ∆ > 1 and n ≥ 1, where γ is a constant occurring in Corollary 3.32.
(2) If A is an algebra with respect to pointwise multiplication (see Subsection 3.1), and
hence f gs,p,q ≤ Kf s,p,q gs,p,q for every f, g ∈ A, and if C ≥ K, then, moreover,
k Φn (∆, A) Φn (∆, A)
(n + 1)s ≤ lim ≤ lim ,
S2 s+1
∆−→∞ ∆ n
∆−→∞ ∆n
where k > 0 has the same meaning as in Theorem 3.31, and
k
(n + 1)s
CS2s+1
 
≤ lim ∆−n sup CN(T ) : T ∈ AC , σ(T ) ⊂ {z : |z| = 1/∆}, deg(T ) ≤ n .
∆−→∞
(3) Similarly, for
1 
kn , AC = sup{|mσ (0)| · T −1  : T ∈ AC , mσ (T ) = 0, card(σ) ≤ n},
z
we have 1 
kn , AC ≤ CγS ∗ (n + 1)s ,
z
and if A is an algebra, a lower bound is
k 1  1
(n + 1)s ≤ kn , AC + .
S2 s+1 z S
II. Let s = 0. Then
9e
Φn (∆, AC ) ≤ CS ∗  · ∆n (log(ne))1/q ,
log 2


sup CN(T ) : T ∈ AC , r(T −1 ) ≤ ∆, deg(T ) ≤ n


≤ C 2 γzA S ∗ ∆n (log(ne))1/q ,
1  9e
kn , AC ≤ CγS ∗  · (log(ne))1/q .
z log 2
Indeed, all upper estimates are immediate consequences of Lemma 3.19 and Theorems
3.26 and 3.31. For the lower estimates, assume that A is an algebra with f gs,p,q ≤
Kf s,p,q gs,p,q for every f, g ∈ A, and let  · ∗ be an equivalent Banach algebra
norm on A (see Subsection 3.1 above). Next, let σ ⊂ D\{0}, card(σ) ≤ n, and let
T : A∗ /mσ A∗ −→ A∗ /mσ A∗ be the quotient multiplication operator T (f + mσ A∗ ) =
zf + mσ A∗ , where A∗ = (A,  · ∗ ). Then
ϕ(T ) = ϕA∗ /mσ A∗ ≤ ϕ∗ ≤ Kϕ
for every polynomial ϕ, whence T ∈ AC (if C ≥ K). Hence, by Lemma 3.22,
1
  1
ϕn (σ, AC ) ≥   ≥ (capA∗ (σ) − 1).
z A∗ /mσ A∗ SA∗ −→A∗

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 675

Moreover, by the definition of cap and the inequality  · ∗ ≥  · A /1A , we have


capA∗ (σ) ≥ 11
A
capA (σ). Since 1s,p,q = 1 for every s, p, q, and SA∗ −→A∗ = zA∗ =
S, we obtain
1
ϕn (σ, AC ) ≥ (capA (σ) − 1).
S
Passing to the supremum over σ ⊂ σ1/∆ , or, respectively, over σ ⊂ {z : |z| = 1/∆}, we
get
1
Φn (∆, AC ) ≥ (κn (∆, A) − 1)
S
and
1
Φn (∆, AC ) ≥ (κ (∆, A) − 1).
S n
Now, the required lower estimates follow from Corollary 3.32, and similarly for the lower
bound for kn . 
3.7. The Beurling–Carleson capacity. In [C], Carleson described the uniqueness
(α)
sets for the spaces CA (D),
CA (D) = {f ∈ Hol(D) : |f ([α]) (z) − f ([α]) (z
)| ≤ Cf |z − z
|α−[α] },
(α)

where α > 0 and [α] stands for the integral part of α. Namely, a set σ ⊂ D is
(α)
NOT
 a uniqueness set for CA (D) if and only if σ ∩ D satisfies the Blaschke condition
λ∈σ (1 − |λ|) < ∞ and T log dist(t,σ) dm(t) < ∞, where m is the normalized Lebesgue
1

measure on T. Moreover, in [GrN] the following quantity Carl(σ) was introduced (in an
equivalent form):
 1   2 
Carl(σ) = exp log dm(t) ,
|λ| T dist(t, σ)
λ∈σ

and it was shown that there exist functions ϕα and ψα on [1, ∞) such that 1 ≤ ϕα (x) ≤
limx−→∞ ϕα (x) = ∞ (and similarly for ψα ) and
ϕα (Carl(σ)) ≤ capC (α) (σ) ≤ ψα (Carl(σ))
A

for every σ ⊂ {z : 1/2 ≤ |z| ≤ 1}. (General capacities capX (σ) were also introduced in
[GrN].) Presumably, the functions ϕα (x) and ψα (x) behave at ∞ as const · xα , but this
seems to be not completely clear (in [GrN] it was shown that ψα (x) ≤ const · xα ). The
same Beurling–Carleson condition characterizes the nonuniqueness sets for many other
s
spaces. For instance, for the Besov spaces Bp,q , s > p1 , this follows from the well-known
1/p
embedding theorems (see Subsection 3.1). For the spaces Bp,1 , 1 ≤ p < ∞ (which are
(α)
not included in any CA (D)), this was proved by Shirokov [Sh].
Although the case where σ ⊂ {z : 1/2 ≤ |z| ≤ 1} is not a priority setting for the theory
of condition numbers, it is of interest to know the asymptotics of the circular capacity
κn (∆, X) as n −→ ∞ and/or ∆ −→ 1. The following theorem and corollaries contain
some information on such asymptotics for general spaces of smooth functions as well as
s q
for the spaces Bp,q and lA (kβ ).
(α) (β)
Theorem 3.36. Let X be a function space in D such that CA (D) ⊂ X ⊂ CA (D) for
some α, β > 0.
(1) There exist two increasing functions ϕX , ψX on [1, ∞) such that 1 ≤ ϕα (x) ≤
limx−→∞ ϕα (x) = ∞ (and similarly for ψα ) and
ϕX (Carl(σ)) ≤ capX (σ) ≤ ψX (Carl(σ))
for every σ ⊂ {z : 1/2 ≤ |z| ≤ 1}.

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


676 N. K. NIKOLSKI

(2) Let σ be an n-point set sitting on the circle |λ| = 1/∆, and σ∗ = σ∗ (∆, n) an
n-point equidistributed set, σ∗ = {e2πij/n /∆ : 0 ≤ j < n}, where 1 < ∆ ≤ 2. Then
Carl(σ) ≤ Carl(σ∗ ),
n
∆ π2e ∆n
2 ≤ Carl(σ ∗ ) ≤ ,
((1 − 1/∆)2 + (π/n)2 )1/2 4 ((1 − 1/∆)2 + (π/n)2 )1/2
n∆n n∆n
a ≤ Carl(σ∗ ) ≤ b ,
1 + n(∆ − 1) 1 + n(∆ − 1)
where n ≥ 2 and a, b > 0 are numerical constants; therefore
2n Carl(σ∗ ) Carl(σ∗ ) πen
≤ sup n
= lim n
≤ .
π 1<∆≤2 ∆ ∆−→1 ∆ 4
(3) Consequently,
 2n   πen 
ϕX ≤ lim κn (∆, X) ≤ lim κn (∆, X) ≤ ψX ,
π ∆−→1 ∆−→1 4
 n∆n   n∆n 
ϕX a ≤ κn (∆, X) ≤ ψX b
1 + n(∆ − 1) 1 + n(∆ − 1)
for every ∆, 1 < ∆ ≤ 2,
 a 
ϕX eA n ≤ κn (∆, X) ≤ ψX (beB n)
(1 + A)(1 + B)
for 1 + A
n ≤∆≤1+ B
n, where A < B, and
 a∆n   b∆n 
ϕX ≤ κn (∆, X) ≤ ψX
(1 + c)
for 1
n ≤ ≤ ∆ − 1 ≤ c , where 0 < < 1.
(α) (β)
Proof. (1) Since the embeddings CA (D) ⊂ X ⊂ CA (D) are continuous, we can take
ϕX = c1 ϕβ and ψX = c2 ψα with constants coming from these embeddings, where ϕα ,
ψα are the functions defined immediately before the theorem.
(2) Let σ = {λj : 0 ≤ j < n} be an n-point subset of a circle |z| = 1/∆, 1 < ∆ ≤ 2.
Then  2 
Carl(σ) = ∆n exp log dm(t) ,
|t − λj |
0≤j<n I(j)

where the I(j) are pairwise disjoint arcs of the unit circle T such that j I(j) = T and
dist(t, σ) = |t − λj | for t ∈ I(j). Clearly, there is a strictly decreasing function f on [0, π]
that does not depend on σ and is such that 0 ≤ f (θ) ≤ log ∆−1 2∆
and
πm(I(j))
2 1
log dm(t) = f (θ) dθ
I(j) |t − λ j | π 0

for every j. The case of the equidistributed set σ∗ corresponds to arcs I(j) of the same
length, m(I(j)) = 1/n for every j. Setting
πm(I(j))
Σ(σ) = f (θ) dθ
0≤j<n 0

and assuming that there exist two adjacent arcs with a = πm(I(j)) < b = πm(I(j + 1)),
we get
a b (a+b)/2 (a+b)/2
f (θ) dθ + f (θ) dθ < f (θ) dθ + f (θ) dθ.
0 0 0 0

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 677

This shows that the only sets σ where the maximum maxσ Σ(σ) (over all n-point sets σ)
is attained are σ = σ∗ . Therefore, Carl(σ) ≤ Carl(σ∗ ).
Now, we prove the second inequality of (2). We have
 n π/n 2 
Carl(σ∗ ) = ∆n exp log iθ dθ
π 0 |e − (1/∆)|
and
π/n π/n
2 1 4
log dθ = log dθ,
0 |e − (1/∆)|
iθ 2 0 δ2 + 4 sin2 (θ/2)

where δ = 1 − Assuming n ≥ 2 (and hence π2 θ ≤ sin(θ/2) ≤ θ/2 for 0 ≤ θ ≤ π/n),
1
∆.
we obtain π2 (δ + θ 2 ) ≤ δ 2 + 4 sin2 (θ/2) ≤ δ 2 + θ 2 , and then
8 2

π2 n
∆n D(∆, n) ≤ Carl(σ∗ ) ≤ ∆ D(∆, n),
8
where
 n π/n 4 
D(∆, n) = exp log 2 dθ
2π 0 δ + θ2
 n π 1 2π π

= 2 exp log 2 + − 2δ arctan .
2π n δ + (π/n)2 n nδ
π arctan δn ≤ 1, we get (δ 2 +(π/n)2 )1/2 ≤ D(∆, n) ≤ (δ 2 +(π/n)2 )1/2 , whence
Since 0 ≤ 1 − δn π 2 2e

∆n π2e ∆n
2 ≤ Carl(σ ∗ ) ≤ .
(δ 2 + (π/n)2 )1/2 4 (δ 2 + (π/n)2 )1/2
In order to check the third inequality of (2), we simply replace the l2 -norm in the de-
nominator by the l1 -norm and use the inequalities 1 < ∆ ≤ 2.
The fourth estimate of (2) follows from the second and the obvious fact that
∆ −→ ∆−n Carl(σ∗ (∆, n))
is a decreasing function.
(3) The first estimate of (3) follows from the second estimate of (2) and the fact that
∆ −→ ∆−n Carl(σ∗ (∆, n)) is a decreasing function.
The second estimate of (3) follows from the third one of (2).
For the third estimate of (3), we have
ϕX (Carl(σ∗ )) ≤ capX (σ∗ ) ≤ κn (∆, X) ≤ ψX (Carl(σ∗ )) ≤ ψX (beB n),
n B
since Carl(σ∗ ) ≤ b 1+n(∆−1)
∆ n
≤ b 1+A
e n
≤ beB n. Similarly,
∆n n eA n
Carl(σ∗ ) ≥ a ≥a ,
1 + n(∆ − 1) (1 + B)(1 + A/n)
and the inequality follows.
The last estimate of (3) is similar to the previous one if we use the inequalities
∆n ∆n n ∆n n ∆n n
≤ ≤ ≤ . 
(1 + c) n + n(∆ − 1) 1 + n(∆ − 1) n
Corollary 3.37. The previous theorem applies to
(1) X = Bp,q s
with s > p1 and ϕX = c1 ϕα , where s − p1 ≥ α > 0; and ψX = c2 ψγ ,
where γ > s, and
q
(2) X = lA (kβ ) with β > 1 − 1q and ϕX = c1 ϕα , 0 < α < β − 1 + 1q and ψX = c2 ψγ ,
γ > β + 1q .
(The functions ϕα and ψα are defined immediately before Theorem 3.36.)

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


678 N. K. NIKOLSKI

(γ) (α)
Indeed, under the hypotheses of (1), we have CA (D) ⊂ Bp,q
s
⊂ CA (D) (see Subsection
q (γ) (α)
3.1), and under the hypotheses of (2), CA (D) ⊂ lA (kβ ) ⊂ lA
1
(kα ) ⊂ CA (D) (by Hölder’s
inequality and the fact that f ∈ CA (D) =⇒ fˆ(n) = O(|n|−γ )).
(γ)

3.8. Boundary spectrum and Helson’s constant. Here we briefly consider the sit-
uation where T ∈ XC , mσ (T ) = 0, and σ ⊂ T. In this case the linear manifold mσ X is
no longer closed in X for most of the usual function spaces X in D (for all such spaces?).
Assuming that X ⊂ CA (D), one can easily show that closX (mσ X) = {f ∈ X : f (λ) =
0 for λ ∈ σ}. Therefore, the quotient space X/mσ X should be replaced by the restriction
space
X(σ) = X|σ = X/ closX (mσ X)
endowed with the usual quotient norm: a function a ∈ C(σ) is in X(σ) if and only if
a = f |σ for a function f ∈ X, and aX(σ) = inf f X , where the infimum is taken
over all such extensions of a. For certain function spaces X these restriction spaces are
studied quite well; for example, see [K, GrMcG] for X = W , and [D, BD] for the Hölder
(α)
classes X = CA (D) and for some other spaces. By the way, an X-capacity of subsets
σ ⊂ T can be defined exactly in the same way as for σ ⊂ D:
capX (σ) = inf{f X : f (0) = 1, f |σ = 0}.
In the following theorem we use an observation from [GMP] in order to estimate the
inverses T −1 and the capacities capW (σ) for sets σ ⊂ T, card(σ) < ∞ (here σ is precisely
a subset, not a family of points).
Theorem 3.38. (1) Suppose T : Y −→ Y is an algebraic Banach space operator, and
mσ (T ) = 0, where σ ⊂ T, card(σ) < ∞. Then T is power bounded, supn≥0 T n  = C <
∞, invertible, and T −1  ≤ C.
(2) capW (σ) ≤ 2 for every finite subset σ ⊂ T.
Proof. (1) Since the family (Ker(T − λI) : λ ∈ σ) is a basis of Y (use the Lagrange
interpolating polynomials applied to T ), the operator T is power bounded. Next, the
classical Kronecker “solenoid theorem” (see, for example, [GrMcG]) implies that for
every finite independent set E ⊂ T (i.e., a set such that the conditions λj ∈ E and
λn1 1 · · · λnk k = 1, nj ∈ Z, imply nj = 0 for all j) there exists a sequence Nk ∈ Z+
tending to infinity and such that limk λNk = λ−1 for every λ ∈ E. Since for every
finite set σ ⊂ T there exists an independent basis E = {λ1 , . . . , λk } (i.e., such that
σ ⊂ {λn1 1 · · · λnk k : nj ∈ Z}), it follows that limk λNk = λ−1 for every λ ∈ σ. This entails
that limk T Nk x = λ−1 x for every eigenvector T x = λx, λ ∈ σ. Therefore, there exists a
limit Ax = limk T Nk x for every x ∈ Y , which obviously determines the inverse operator
AT x = T Ax = x. Clearly, T −1  ≤ limk T Nk  ≤ C.
(2) Let T (f + mσ W ) = zf + mσ W be the quotient multiplication operator on W (σ).
Then, clearly, T  = 1 and mσ (T ) = 0. By (1), T −1  = 1. This means that z + mσ W
is invertible in the Banach algebra W (σ) and (z + mσ W )−1 W (σ) = 1; hence, for every
> 0 there exists ϕ ∈ W such that zϕ = 1 on σ and ϕW < 1 + . Setting f = 1 − zϕ,
we obtain f |σ = 0, f (0) = 1, and f W ≤ 2 + . Therefore, capW (σ) ≤ 2. 
Remark 3.39. Here we comment on several curious points related to the last theorem.
(1) Comparing Theorem 3.20 (see also Remark 3.34) and Theorem 3.38, we can see that
the circular capacity function ∆ −→ κn (∆, W ) is not continuous at ∆ = 1. Moreover,
Theorem 3.38 and Queffelec’s theorem [Q] imply the following stronger result: for any
integer n ≥ 1, there exists a subset σ ⊂ T, card(σ) = n < ∞, such that
1  √
lim capW σ ≥ n,
∆−→1+ ∆

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 679

but capW (σ) ≤ 2. It seems plausible that for the spaces Bp,q s
embedded in a space
C (α) (D), α > 0 (i.e., for s > 1/p, see Subsection 3.1 above) such a phenomenon is not
possible because the function ∆ −→ Carl( ∆ 1
σ) is continuous on (0, 1] for every finite set
σ ⊂ T. √
(2) A similar discrepancy in n times can be observed between the behavior of the
quantity k(mσ , W1 ) in the disk σ ⊂ D and on the circle σ ⊂ T, card(σ) = n. To see this,
recall that for a finite set σ ⊂ D we have
 a

W/mσ W
k(mσ , W1 ) = sup : a ∈ C(σ)
aH ∞ /mσ H ∞
(see Subsection 3.4). In order to consider this function on the closed unit disk, σ ⊂ D,
we should rewrite this as
 a

W (σ)
k(mσ , W1 ) = sup : a ∈ C(σ) ,
aCA (σ)
where W (σ) is defined above and CA (σ) stands for the similar restriction space CA (D)|σ
with the quotient norm aCA (σ) = inf{f CA (D) : f |σ = a}. We also introduce the
following function kn (∆, W ) defined for ∆ ∈ [1, ∞) (a norm analog of κn (∆, A) appeared
in §3):
 
kn (∆, W ) = sup k(mσ , W1 ) : σ ⊂ {z : 1/∆ ≤ |z| ≤ 1}, card(σ) ≤ n .
Now, Theorem 3.14 implies that kn (∆, W ) ≥ an for every ∆ > 1, where a > 0 is a
numerical constant. √
For ∆ = 1, from known facts it follows that kn (1, W ) ≤ n. Indeed, on the one hand,
the Rudin–Carleson theorem (see, e.g., [N2, p. 156]) tells us that aCA (σ) = aC(σ) for
every a ∈ C(σ) and every finite set σ ⊂ T, and hence kn (1, W ) = Hn , where
 a

W (σ)
Hn = sup : a ∈ C(σ), σ ⊂ T, card(σ) ≤ n .
aC(σ)
On the other hand, the latter quantity, known as “Helson’s constant”, has the following
bounds (see [GrMcG, p. 34]).
Fact. √
n/2 ≤ Hn ≤ n.

A short proof (for the reader’s convenience). The right-hand side inequality. By a dual-
ity argument, the quantity Hn is the smallest constant k such that Var(µ) ≤ kµ̂l∞ (Z)
n
for every measure µ of the form µ = k=1 ak δζk , where ζk ∈ T and µ̂(k), k ∈ Z, stand
for the Fourier coefficients. Since
n  n 1/2

Var(µ) = |ak | ≤ n |ak |2

k=1 k=1

and

n 1/2 
n 1/2
1
|ak |2 = lim |µ̂(k)|2 ≤ µ̂l∞ (Z)
n 2n + 1
k=1 k=−n

by the Parseval identity for √ almost periodic functions (Wiener’s theorem; see, for example,
[GrMcG]), we get Hn ≤ n.
The left-hand side inequality. We invoke the so-called Rudin–Shapiro measures. Let
{λ1 , . . . , λn } be an independent set on T. Setting µ0 = ν0 = δ1 (the Dirac measure at 1),
we define by induction µj+1 = µj + νj ∗ δλj+1 and νj+1 = µj − νj ∗ δλj+1 . The measures

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


680 N. K. NIKOLSKI


µn and νn are of the form λ ±δλ , where λ runs over all points λ = λα 1 · · · λn with
1 αn
n
αj = 0 or 1. The parallelogram identity and |δ̂λj+1 (n)| = |λj+1 | = 1 imply that
|µ̂j+1 (k)|2 + |ν̂j+1 (k)|2 = 2(|µ̂j (k)|2 + |ν̂j (k)|2 ) = 2j+2
for every k ∈ Z and every j. Consequently, at least one of the measures µn , νn satisfies
µ̂l∞ (Z) ≤ µ̂l2 (Z) ≤ 2n/2 and Var(µ) = 2n . For an arbitrary m ≥ 1, we choose n such

that 2n < m ≤ 2n+1 and get Hm ≥ Var(µ)/µ̂l∞ (Z) ≥ m/2. 
We do not know whether discontinuities of this kind occur for function spaces on D
different from W .
(3) The invertibility of T in Theorem 3.38 is a consequence of power-boundedness.
1/n
Moreover, for a given log-concave sequence (wn )n≥0 , limn wn = 1, the following state-
ments are equivalent; see [N6, 3.3].
(a) Every Banach space operator T : X −→ X such that T n  ≤ Cwn , n ≥ 0, and
span(Ker(T − λI) : λ ∈ σ) = X, where σ ⊂ T, is invertible.
(b) Every Hilbert space operator T : H −→ H such that T n  ≤ Cwn , n ≥ 0, and
span(Ker(T − λI) : λ ∈ σ) = H, where σ ⊂ T, is invertible.
(c) supn≥0 wn < ∞.
In fact, σ(T ) = clos(σ) if (c) is fulfilled.

References
[AFP] J. Arazy, S. Fisher, and J. Peetre, Besov norms of rational functions, Function Spaces and
Applications (Lund, 1986), Lecture Notes in Math., vol. 1302, Springer-Verlag, Berlin, 1988,
pp. 125–129. MR0942262 (90a:46051)
[BL] J. Bergh and J. Löfström, Interpolation spaces, Springer-Verlag, Berlin, 1976. MR0482275
(58:2349)
[Bo] H. Bohr, A theorem concerning power series, Proc. London Math. Soc. (2) 13 (1914), 1–5.
[BD] I. A. Boricheva and E. M. Dynkin, A nonclassical free interpolation problem, Algebra i Analiz
4 (1992), no. 5, 45–90; English transl., St. Petersburg Math. J. 4 (1993), no. 5, 871–908.
MR1202724 (94a:30027)
[C] L. Carleson, Sets of uniqueness for functions regular in the unit circle, Acta Math. 87 (1952),
no. 3–4, 325–345. MR0050011 (14:261a)
[D] E. M. Dynkin, Free interpolation sets for Hölder classes, Mat. Sb. 109 (1979), no. 1, 107–128;
English transl., Math. USSR-Sb. 37 (1980), no. 1, 97–117. MR0538552 (82e:30043)
[ENZ] O. El-Fallah, N. Nikolskiı̆, and M. Zarrabi, Resolvent estimates in Beurling–Sobolev algebras,
Algebra i Analiz 10 (1998), no. 6, 1–92; English transl., St. Petersburg Math. J. 10 (1999),
no. 6, 901–964. MR1678988 (2000c:46101)
[ER] O. El-Fallah and T. Ransford, Extremal growth of powers of operators satisfying resolvent
conditions of Kreiss–Ritt type, J. Funct. Anal. 196 (2002), no. 1, 135–154. MR1941994
(2004c:47024)
[G] F. R. Gantmakher, The theory of matrices, 2nd ed., “Nauka,” Moscow, 1966; English transl.
of 1st ed., Chelsea Publ. Co., New York, 1959. MR0202725 (34:2585); MR0107649 (21:6372c)
[GMP] E. Gluskin, M. Meyer, and A. Pajor, Zeros of analytic functions and norms of inverse matrices,
Israel J. Math. 87 (1994), 225–242. MR1286828 (95i:46011)
[GVL] G. H. Golub and C. F. Van Loan, Matrix computations, 3rd ed., Johns Hopkins Univ. Press,
Baltimore, MD, 1996. MR1417720 (97g:65006)
[GrMcG] C. C. Graham and O. C. McGehee, Essays in commutative harmonic analysis, Grundlehren
Math. Wiss., vol. 238, Springer-Verlag, New York–Berlin, 1979. MR0550606 (81d:43001)
[GrN] M. B. Gribov and N. Nikolski, Invariant subspaces and rational approximation, Zap. Nauchn.
Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 92 (1979), 103–114. (Russian) MR0566744
(81f:47006)
[HRS] R. Hagen, S. Roch, and B. Silbermann, Spectral theory of approximation methods for convolu-
tion equations, Oper. Theory Adv. Appl., vol. 74, Birkhäuser Verlag, Basel, 1995. MR1320262
(96d:47001)
[Hor] A. Horn, On the eigenvalues of a matrix with prescribed singular values, Proc. Amer. Math.
Soc. 5 (1954), 4–7. MR0061573 (15:847d)

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


CONDITION NUMBERS OF LARGE MATRICES 681

[K] J. P. Kahane, Séries de Fourier absolument convergentes, Ergeb. Math. Grenzgeb., vol. 50,
Springer-Verlag, Berlin–New York, 1970. MR0275043 (43:801)
[KM] V. È. Katsnelson and V. I. Matsaev, Spectral sets for operators in a Banach space and
estimates of functions of finite-dimensional operators, Teor. Funktsiı̆ Funktsional. Anal. i
Prilozhen. (Kharkov) 3 (1966), 3–10. (Russian) MR0206715 (34:6532)
[L] P. I. Lizorkin, Multipliers of Fourier integrals in the space Lp,θ , Trudy Mat. Inst. Steklov. 89
(1967), 231–248; English transl. in Proc. Steklov Inst. Math. 1968. MR0217519 (36:608)
[MO] A. W. Marshall and I. Olkin, Inequalities: Theory of majorization and its applications, Math.
Sci. Engrg., vol. 143, Acad. Press, Inc., New York–London, 1979. MR0552278 (81b:00002)
[Na] F. L. Nazarov, Private communication, August 2004 (Russian); (fedja@math.msu.edu).
[N1] N. Nikolski, In search of the invisible spectrum, Ann. Inst. Fourier (Grenoble) 49 (1999),
1925–1998. MR1738071 (2001a:46053)
[N2] , Operators, functions, and systems: An easy reading. Vol. 1. Hardy, Hankel, and
Toeplitz, Math. Surveys Monogr., vol. 92, Amer. Math. Soc., Providence, RI, 2002. MR1864396
(2003i:47001a)
[N3] , Operators, functions, and systems: An easy reading. Vol. 2. Model operators and
systems, Math. Surveys Monogr., vol. 93, Amer. Math. Soc., Providence, RI, 2002. MR1892647
(2003i:47001b)
[N4] , Estimates of the spectral radius and the semigroup growth bound in terms of the
resolvent and weak asymptotics, Algebra i Analiz 14 (2002), no. 4, 141–157; English transl.,
St. Petersburg Math. J. 14 (2003), no. 4, 641–654. MR1935921 (2003j:47053)
[N5] , Treatise on the shift operator, Grundlehren Math. Wiss., vol. 273, Springer-Verlag,
Berlin, 1986. MR0827223 (87i:47042)
[N6] , Selected problems of weighted approximation and spectral analysis, Trudy Mat. Inst.
Steklov. 120 (1974), 270 pp.; English transl., Proc. Steklov Inst. Math. 1976, 276 pp.
MR0467269 (57:7133a)
[N7] , Invariant subspaces in operator theory and function theory, Itogi Nauki i Tekhniki
Ser. Mat. Anal., vol. 12, VINITI, Moscow, 1974, pp. 199–412; English transl. in J. Soviet
Math. 5 (1976), no. 2. MR0430821 (55:3826)
[S.Ni] S. M. Nikolskiı̆, Approximation of functions of several variables and imbedding theorems,
“Nauka”, Moscow, 1969; English transl., Grundlehren Math. Wiss., vol. 205, Springer-Verlag,
New York–Heidelberg, 1975. MR0310616 (46:9714); MR0374877 (51:11073)
[P] J. Peetre, New thoughts on Besov spaces, Duke Univ. Math. Ser., No. 1, Math. Dept., Duke
Univ., Durham, NC, 1976. MR0461123 (57:1108)
[Pe1] V. Peller, Estimates of functions of power bounded operators on Hilbert spaces, J. Operator
Theory 7 (1982), 341–372. MR0658618 (83i:47019)
[Pe2] , Estimates of functions of Hilbert space operators, similarity to a contraction and
related function algebras, Linear and Complex Analysis Problem Book, Lecture Notes in Math.,
vol. 1043, Springer-Verlag, Berlin, 1984, pp. 199–204.
[Q] H. Queffelec, Sur un théorème de Gluskin–Meyer–Pajor, C. R. Acad. Sci. Paris Sér. 1 Math.
317 (1993), 155–158. MR1231413 (94g:11059)
[Sch] J. J. Schäffer, Norms and determinants of linear mappings, Math. Z. 118 (1970), 331–339.
MR0281730 (43:7445)
1/p
[Sh] N. A. Shirokov, The zero sets of analytic functions from the space Bp,1 are Carleson sets,
Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 113 (1981), 253–257; English
transl., J. Soviet Math. 22 (1983), no. 6, 1867–1869. MR0629851 (83e:46029)
[SzNF] B. Sz.-Nagy and C. Foiaş, Analyse harmonique des opérateurs de l’espace de Hilbert, Akad.
Kiadó, Budapest; Masson, Paris, 1967; English transl., Harmonic analysis of operators on
Hilbert space, North-Holland Publ. Co., Inc., Amsterdam–London, 1970. MR0225183 (37:778);
MR0275190 (43:947)
[T] H. Triebel, Spaces of Besov–Hardy–Sobolev type, Teubner Verlag, Leipzig, 1978. MR0581907
(82g:46071)
[Va] N. Th. Varopoulos, Some remarks on Q-algebras, Ann. Inst. Fourier (Grenoble) 22 (1972),
1–11. MR0338780 (49:3544)
[VSh] I. V. Videnskiı̆ and N. A. Shirokov, An extremal problem in the Wiener algebra, Algebra i
Analiz 11 (1999), no. 6, 122–138; English transl., St. Petersburg Math. J. 11 (2000), no. 6,
1035–1049. MR1746071 (2001g:46052)
[Vi1] P. Vitse, Functional calculus under Kreiss type conditions, Math. Nachr. 278 (2005), no. 15,
1811–1822. MR2182092

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use


682 N. K. NIKOLSKI

[Vi2] , Functional calculus under the Tadmor–Ritt condition, and free interpolation by poly-
nomials of a given degree, J. Funct. Anal. 210 (2004), 43–72. MR2051632 (2005f:47046)
[Vi3] , A Besov algebra functional calculus for Tadmor–Ritt operators, AAA Preprint Series,
Univ. Ulm, 2004.
[W] J. Wermer, Potential theory, Lecture Notes in Math., vol. 408, Springer-Verlag, Berlin–New
York, 1974. MR0454033 (56:12284)

Département de Mathématiques, Université de Bordeaux 1, 351, cours de la Libération,


33405 Talence, France, and St. Petersburg Branch, Steklov Mathematical Institute, Russian
Academy of Sciences, Fontanka 27, St. Petersburg 191023, Russia
E-mail address: Nikolai.Nikolski@math.u-bordeaux1.fr

Received 15/APR/2005
Originally published in English

License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use

You might also like