Inequalities between s-numbers
Abstract.
Singular numbers of linear operators between Hilbert spaces were generalized to Banach spaces by s-numbers (in the sense of Pietsch). This allows for different choices, including approximation, Gelfand, Kolmogorov and Bernstein numbers. Here, we present an elementary proof of a bound between the smallest and the largest s-number.
Key words and phrases:
s-numbers, Hilbert numbers, Pietsch1991 Mathematics Subject Classification:
Primary 47B06; Secondary 46B50, 47B01We start with introducing the terminology and a presentation of the results. In Section 2 we will discuss them and some history. Proofs are given in Section 3.
1. s-numbers
In what follows, let , , and be real or complex Banach spaces. The (closed) unit ball of is denoted by , the dual space of by , and the identity map on is denoted by . For a closed subspace , we write for the embedding with , and for the canonical map with onto the quotient space with norm . The dimension of a subspace is denoted by , and by we denote its codimension.
The class of all bounded linear operators between Banach spaces is denoted by , and by we denote those operators from to , equipped with the operator norm. The rank of an operator is defined by .
A map assigning to every operator a non-negative scalar sequence is called an s-number sequence if, for all , the following conditions are satisfied
-
(S1)
for all ,
-
(S2)
for all ,
-
(S3)
where ,
-
(S4)
,
-
(S5)
whenever .
We call the s-number of the operator . To indicate the underlying Banach spaces, we sometimes write .
There are some especially important examples of s-numbers:
-
•
approximation numbers:
-
•
Bernstein numbers:
-
•
Gelfand numbers:
-
•
Kolmogorov numbers:
-
•
Weyl numbers:
-
•
Hilbert numbers:
We refer to [13, 14] for a detailed treatment of the above, and a few other, s-numbers and their specific properties.
Remark 1.
The original definition of s-numbers in [11] used the stronger norming property for all with . This did not allow for and , and has been weakened in [1, 12] for defining them, leading to the least restrictive axioms that still imply uniqueness for Hilbert spaces, see Proposition 2. It is sometimes assumed that the s-number sequence is additive, i.e., , or multiplicative, i.e., . Both properties hold for , while is only additive, and is neither of the two, see [14, 15].
The following proposition is well-known, see [13, 2.3.4 & 2.6.3 & 2.11.9].
Proposition 2.
For every s-number sequence , and , we have
Equalities hold if for Hilbert spaces and .
For convenience, we present a sketch of the proof of the inequalities in Section 3. Using only elementary arguments, we prove the following reverse inequality, which is known in a more involved form based on an intermediate comparison with , see [13, 2.10.7] or [14, 6.2.3.14], or Remark 6 in [6].
Theorem 3.
For all and , we have
We cannot obtain bounds for individual from Theorem 3, see also Remark 5, but combining it with the inequality for , we obtain a more handy form. Moreover, the known fact that , see [13, 2.10.2], leads to a bound between and , and hence between all s-numbers.
Corollary 4.
For all , and , we have
and
2. A bit of history
We provide a brief description of the relevant facts from (the highly recommended) “History of Banach Spaces and Linear Operators” of Pietsch [14], and give some further references.
Singular numbers of operators on Hilbert spaces have become fundamental tools in (applied) mathematics since their introduction in 1907 by Schmidt [18]. For compact between complex Hilbert spaces , the singular numbers are defined by , where the eigenvalues of are characterized by for some , and ordered decreasingly. Applications range from the study of eigenvalue distributions of operators, see [5] or [14, 6.4], to the classification of operator ideals [14, 6.3], to the singular value decomposition, aka Schmidt representation, with its many applications.
s-numbers are a generalization to linear operators between Banach spaces. However, there is no unique substitute for singular numbers but, depending on the context, different s-numbers may be used to quantify compactness, while others may be easier to compute. As Pietsch wrote in [14, 6.2.2.1], “we have a large variety of s-numbers that make our life more interesting.”
Most notably, , , and were already known in the 1960s, sometimes in a related form as “width” of a set, see [4, 20] or [14, 6.2.6], and are by now part of the foundation of approximation theory [17] and information-based complexity [8, 10]. More recent treatments of the subject and extensions can be found, e.g., in [2, 7, 19]. Let us also highlight [6], where we discuss the relation of s-numbers to minimal approximation errors in detail, and use variants of Theorem 3 to bound the maximal gain of randomized/adaptive algorithms over deterministic/non-adaptive ones.
An axiomatic theory of s-numbers has been developed by Pietsch [11, 13, 14] in the 1970s. This, in particular, allowed for a characterization of the smallest/largest s-number (with certain properties), see also Remark 1.
Inequalities and several relations between s-numbers have already been collected in [11], see also [13, 2.10] and [14, 6.2.3.14]. A particularly interesting bound is , which was proven by Mityagin and Henkin [9] in 1963. They also conjectured that can be replaced by , see also [17, p. 24]. This bound with replaced by , and the corresponding conjecture, have been given in [1], and apparently, the bound has not been improved since then. However, in the weaker form as in Theorem 3, this problem has been solved by Pietsch [12] in 1980, see the final remarks there. In particular, it is shown that there is some such that , see also [13, 2.10.7] or [14, 6.2.3.14].
The proof of this result is the blueprint for the proof of Theorem 3. However, those proofs employ an intermediate comparison with the Weyl numbers , which lie somehow between and . Despite interesting consequences, this approach requires the multiplicativity of , the notion of 2-summing norm, and some technical difficulties. The proof presented here is elementary: It only uses definitions and known properties of the determinant.
3. The proofs
Proof of Proposition 2.
We refer to [13, 2.11.9] for the proof that for any s-number sequence , and any for Hilbert spaces and . Just note that, for compact , this follows quite directly from the singular value decomposition. From this and (S3), we obtain
for any . In addition, by (S2) and (S5), we obtain for any with that . By taking the infimum over all such , we see that . ∎
Proof of Theorem 3.
We first present the proof from [13, 2.10.3] of the following statement: For fixed , we can find and such that for and for .
For this, we inductively assume that for are already found, and define
Since , we can choose with
By the Hahn-Banach theorem, we choose with .
We now define the operators
and
which satisfy , and observe that is generated by the triangular matrix with determinant .
To obtain a bound with s-numbers, note that they all coincide for , esp. with , and are equal to the singular numbers , i.e., the roots of the eigenvalues of , see [14, 6.2.1.2]. As the determinant is multiplicative and equals the product of the eigenvalues, we see that . From the definition of , we obtain , and hence
With and we obtain the result for .
The proof for could be done via duality, at least for compact , see e.g. [14, 6.2.3.9 & 6.2.3.12]. However, one can also prove it directly by inductively choosing , with , and with and for . The remaining proof is as above. ∎
Remark 5.
The proof of Theorem 3 uses the determinant to relate the eigenvalues of (which are the diagonal entries) with its singular numbers. Sometimes, the more general Weyl’s inequality [21] from 1949 is used, which states that for any compact , see also [14, 3.5.1]. This crucial step appears in all the proofs I am aware of that lead to the optimal factor in the comparisons. Unfortunately, all these approaches use a whole collection of s-numbers, which does not allow for bounds for individual .
Let us present an example from [5, 2.d.5] that shows that
such product bounds
between eigenvalues and s-numbers
are to some extent best possible:
For , consider the matrix
which represents a mapping on .
It is easy to verify that for and .
(Recall that are the singular numbers in this case.)
Moreover, since ,
we see that for .
This shows that Weyl’s inequality,
as well as the easy corollary
,
are in general best possible.
Acknowledgement:
I thank Albrecht Pietsch for comments on an earlier version, and for encouraging me to make this note
as self-contained as it is now.
The last comments I received from him were on March 8, 2024, where he added that he was busy with his own article.
My reply, however, was answered by his granddaughter, who informed me that Professor Pietsch had passed away on March 10.
I also thank S. Heinrich, A. Hinrichs, D. Krieg, T. Kühn, E. Novak and the anonymous referees for helpful comments.
References
- [1] W. Bauhardt, Hilbert-Zahlen von Operatoren in Banachräumen, Math. Nachr. 79, 181–187, 1977.
- [2] D. L. Fernandez, M. Mastyło, and E. B. Silva. Pietsch’s variants of s -numbers for multilinear operators, Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM 115(4):Paper No. 189, 24, 2021.
- [3] S. Heinrich, R. Linde, On the asymptotic behaviour of Hilbert numbers, Math. Nachr. 119, 117–120, 1984.
- [4] R. S. Ismagilov, Diameters of sets in normed linear spaces and approximation of functions by trigonometric polynomials, Russian Math. Surveys 29(3), 169–186, 1974.
- [5] H. König, Eigenvalue distribution of compact operators, Operator Theory: Advances and Applications 16, Birkhäuser, Basel, 1986.
- [6] D. Krieg, E. Novak, M. Ullrich, On the power of adaption and randomization, arXiv:2406.07108.
- [7] J. Lang and D.E. Edmunds. Eigenvalues, embeddings and generalised trigonometric functions, volume 2016 of Lecture Notes in Mathematics, Springer, Heidelberg, 2011.
- [8] P. Mathé, s-Numbers in Information-Based Complexity, J. Complexity 6, 41–66, 1990.
- [9] B. S. Mityagin, G. M. Henkin, Inequalities between n-diameters, in Proc. of the Seminar on Functional Analysis 7, Voronezh, 97–103, 1963.
- [10] E. Novak, Deterministic and stochastic error bounds in numerical analysis, Lecture Notes in Mathematics 1349, Springer-Verlag, 1988.
- [11] A. Pietsch, s-Numbers of operators in Banach spaces, Studia Math. 51, 201–223, 1974.
- [12] A. Pietsch, Weyl Numbers and Eigenvalues of Operators in Banach Spaces, Math. Ann. 247, I49–168, 1980.
- [13] A. Pietsch. Eigenvalues and s-numbers, Cambridge studies in advanced mathematics 13, Cambridge University Press, 1987.
- [14] A. Pietsch, History of Banach spaces and linear operators, Birkhäuser Boston, MA, 2007.
- [15] A. Pietsch, Bad properties of the Bernstein numbers, Studia Math. 184 (3), 263–269, 2008.
- [16] A. Pietsch, Long-standing open problems of Banach space theory: My personal top ten, Quaestiones Mathematicae 32:3, 321–337, 2009.
- [17] A. Pinkus, n-width in approximation theory, Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics, Springer Berlin, Heidelberg, 1985.
- [18] E. Schmidt, Entwicklung willkürlicher Funktionen nach Systemen vorgeschriebener, Math. Ann. 63, 433-476, 1907.
- [19] J.W. Siegel and J. Xu. Sharp bounds on the approximation rates, metric entropy, and n-widths of shallow neural networks, Found. Comput. Math. 24(2):481–537, 2024.
- [20] V. M. Tikhomirov, Diameters of sets in function spaces and the theory of best approximations, Russ. Math. Survey 15(3), 75–111, 1960.
- [21] H. Weyl, Inequalities between the two kinds of eigenvalues of a linear transformation, Proc. Nat. Acad. Sci. USA 35, 408–411, 1949.