This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Inequalities between s-numbers

Mario Ullrich Institut für Analysis, Johannes Kepler Universität Linz, Austria [email protected] In memory of Albrecht Pietsch
(Date: September 16, 2014)
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, Pietsch
1991 Mathematics Subject Classification:
Primary 47B06; Secondary 46B50, 47B01

We 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 XX, YY, ZZ and WW be real or complex Banach spaces. The (closed) unit ball of XX is denoted by BXB_{X}, the dual space of XX by XX^{\prime}, and the identity map on XX is denoted by IXI_{X}. For a closed subspace MXM\subset X, we write JMXJ_{M}^{X} for the embedding JMX:MXJ_{M}^{X}\colon M\to X with JMX(x)=xJ_{M}^{X}(x)=x, and QMXQ_{M}^{X} for the canonical map QMX:XX/MQ_{M}^{X}\colon X\to X/M with QMX(x)=x+MQ_{M}^{X}(x)=x+M onto the quotient space X/M:={x+M:xX}X/M:=\{x+M\colon x\in X\} with norm x+MX/M:=infmMx+mX\|x+M\|_{X/M}:=\inf_{m\in M}\|x+m\|_{X}. The dimension of a subspace MXM\subset X is denoted by dim(M)\dim(M), and by codim(M):=dim(X/M)\operatorname{codim}(M):=\dim(X/M) we denote its codimension.

The class of all bounded linear operators between Banach spaces is denoted by \mathcal{L}, and by (X,Y)\mathcal{L}(X,Y) we denote those operators from XX to YY, equipped with the operator norm. The rank of an operator S(X,Y)S\in\mathcal{L}(X,Y) is defined by rank(S):=dim(S(X))\operatorname{rank}(S):=\dim(S(X)).

A map S(sn(S))nS\to(s_{n}(S))_{n\in\mathbb{N}} assigning to every operator SS\in\mathcal{L} a non-negative scalar sequence (sn(S))n(s_{n}(S))_{n\in\mathbb{N}} is called an s-number sequence if, for all nn\in\mathbb{N}, the following conditions are satisfied

  1. (S1)

    S=s1(S)s2(S)0\|S\|=s_{1}(S)\geq s_{2}(S)\geq\dots\geq 0   for all   SS\in\mathcal{L},

  2. (S2)

    sn(S+T)sn(S)+Ts_{n}(S+T)\,\leq\,s_{n}(S)+\|T\|   for all   S,T(X,Y)S,T\in\mathcal{L}(X,Y),

  3. (S3)

    sn(BSA)Bsn(S)As_{n}(BSA)\,\leq\,\|B\|\,s_{n}(S)\,\|A\|   where  WAXSYBZW\stackrel{{\scriptstyle A}}{{\longrightarrow}}X\stackrel{{\scriptstyle S}}{{\longrightarrow}}Y\stackrel{{\scriptstyle B}}{{\longrightarrow}}Z,

  4. (S4)

    sn(I2n)=1s_{n}(I_{\ell_{2}^{n}})=1,

  5. (S5)

    sn(S)=0s_{n}(S)=0  whenever rank(S)<n\operatorname{rank}(S)<n.

We call sn(S)s_{n}(S) the nthn^{\rm th} s-number of the operator SS. To indicate the underlying Banach spaces, we sometimes write sn(S:XY)s_{n}(S\colon X\to Y).

There are some especially important examples of s-numbers:

  • approximation numbers:

    an(S):=inf{SL:L(X,Y),rank(L)<n}a_{n}(S)\,:=\,\inf\Bigl{\{}\|S-L\|\colon L\in\mathcal{L}(X,Y),\;\operatorname{rank}(L)<n\Bigr{\}}
  • Bernstein numbers:

    bn(S):=sup{infxM{0}Sxx:MX,dim(M)=n}b_{n}(S)\,:=\,\sup\Bigl{\{}\inf_{x\in M\setminus\{0\}}\frac{\|Sx\|}{\|x\|}\colon M\subset X,\;\dim(M)=n\Bigr{\}}
  • Gelfand numbers:

    cn(S):=inf{SJMX:MX,codim(M)<n}c_{n}(S)\,:=\,\inf\Bigl{\{}\|SJ_{M}^{X}\|\colon M\subset X,\;\operatorname{codim}(M)<n\Bigr{\}}
  • Kolmogorov numbers:

    dn(S):=inf{QNYS:NY,dim(N)<n}d_{n}(S)\,:=\,\inf\Bigl{\{}\|Q_{N}^{Y}S\|\colon N\subset Y,\;\dim(N)<n\Bigr{\}}
  • Weyl numbers:

    xn(S):=sup{an(SA)A:A(2,X),A0}x_{n}(S)\,:=\,\sup\Biggl{\{}\frac{a_{n}(SA)}{\|A\|}\colon A\in\mathcal{L}(\ell_{2},X),\;A\neq 0\Biggr{\}}
  • Hilbert numbers:

    hn(S):=sup{an(BSA)BA:A(2,X),B(Y,2),A,B0}.\begin{split}h_{n}(S)\,:&=\,\sup\Biggl{\{}\frac{a_{n}(BSA)}{\|B\|\|A\|}\colon A\in\mathcal{L}(\ell_{2},X),\;B\in\mathcal{L}(Y,\ell_{2}),\;A,B\neq 0\Biggr{\}}.\\ \end{split}

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 (S4):sn(IX)=1(S4^{\prime})\colon s_{n}(I_{X})=1 for all XX with dim(X)n\dim(X)\geq n. This did not allow for xnx_{n} and hnh_{n}, 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., (S2):sm+n1(S+T)sm(S)+sn(T)(S2^{\prime})\colon s_{m+n-1}(S+T)\leq s_{m}(S)+s_{n}(T), or multiplicative, i.e., (S3):sm+n1(ST)sm(S)sn(T)(S3^{\prime})\colon s_{m+n-1}(ST)\leq s_{m}(S)s_{n}(T). Both properties hold for an,cn,dn,xna_{n},c_{n},d_{n},x_{n}, while hnh_{n} is only additive, and bnb_{n} 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 (sn)(s_{n}), SS\in\mathcal{L} and nn\in\mathbb{N}, we have

hn(S)sn(S)an(S).h_{n}(S)\,\leq\,s_{n}(S)\,\leq\,a_{n}(S).

Equalities hold if S(H,K)S\in\mathcal{L}(H,K) for Hilbert spaces HH and KK.

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 xn(S)x_{n}(S), see [13, 2.10.7] or [14, 6.2.3.14], or Remark 6 in [6].

Theorem 3.

For all SS\in\mathcal{L} and nn\in\mathbb{N}, we have

max{cn(S),dn(S)}n(k=1nhk(S))1/n.\max\Bigl{\{}c_{n}(S),\,d_{n}(S)\Bigr{\}}\;\leq\;n\,\left(\prod_{k=1}^{n}h_{k}(S)\right)^{1/n}.

Since cn(I:1)1c_{n}(I\colon\ell_{1}\to\ell_{\infty})\asymp 1 and hn(I:1)n1h_{n}(I\colon\ell_{1}\to\ell_{\infty})\asymp n^{-1}, see [14, 6.2.3.14] and [3], this result is best possible up to constants.


We cannot obtain bounds for individual nn from Theorem 3, see also Remark 5, but combining it with the inequality nαeα(n!)α/nn^{\alpha}\leq e^{\alpha}\,(n!)^{\alpha/n} for α0\alpha\geq 0, we obtain a more handy form. Moreover, the known fact that an(S)(1+n)cn(S)a_{n}(S)\leq(1+\sqrt{n})\,c_{n}(S), see  [13, 2.10.2], leads to a bound between ana_{n} and hnh_{n}, and hence between all s-numbers.

Corollary 4.

For all SS\in\mathcal{L}, α>0\alpha>0 and nn\in\mathbb{N}, we have

cn(S)eαnα+1supknkαhk(S),c_{n}(S)\,\leq\,e^{\alpha}\,n^{-\alpha+1}\cdot\sup_{k\leq n}\,k^{\alpha}\,h_{k}(S),

and

an(S) 2eαnα+3/2supknkαhk(S).a_{n}(S)\,\leq\,2\,e^{\alpha}\,n^{-\alpha+3/2}\cdot\sup_{k\leq n}\,k^{\alpha}\,h_{k}(S).

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 S(H,K)S\in\mathcal{L}(H,K) between complex Hilbert spaces H,KH,K, the singular numbers are defined by sk(S):=λk(SS)s_{k}(S):=\sqrt{\lambda_{k}(SS^{*})}, where the eigenvalues λk(T)\lambda_{k}(T) of T(X,X)T\in\mathcal{L}(X,X) are characterized by Tek=λk(T)ekTe_{k}=\lambda_{k}(T)\cdot e_{k} for some ekX{0}e_{k}\in X\setminus\{0\}, 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, ana_{n}, bnb_{n}, cnc_{n} and dnd_{n} 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 dn(S)n2bn(S)d_{n}(S)\leq n^{2}b_{n}(S), which was proven by Mityagin and Henkin [9] in 1963. They also conjectured that n2n^{2} can be replaced by nn, see also [17, p. 24]. This bound with bnb_{n} replaced by hnh_{n}, 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 Cα>0C_{\alpha}>0 such that supk1kαdk(S)Cαsupk1kα+1hk(S)\sup_{k\geq 1}k^{\alpha}d_{k}(S)\leq C_{\alpha}\,\sup_{k\geq 1}k^{\alpha+1}h_{k}(S), 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 xnx_{n}, which lie somehow between hnh_{n} and cnc_{n}. Despite interesting consequences, this approach requires the multiplicativity of xnx_{n}, 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.

Bounds for individual nn cannot be deduced from this approach, see also Remark 5, and it remains a long-standing open problem if dbn(S)cnbn(S)d_{bn}(S)\leq c\,n\,b_{n}(S), or even abn(S)cnhn(S)a_{bn}(S)\leq c\,n\,h_{n}(S), for some b,c1b,c\geq 1, see [16, Prob. 5] or [13, 2.10.7].

3. The proofs

Proof of Proposition 2.

We refer to [13, 2.11.9] for the proof that sn(S)=an(S)s_{n}(S)=a_{n}(S) for any s-number sequence (sn)(s_{n}), and any S(H,K)S\in\mathcal{L}(H,K) for Hilbert spaces HH and KK. Just note that, for compact SS, this follows quite directly from the singular value decomposition. From this and (S3), we obtain

hn(S)=sup{sn(BSA)BA:A(2,X),B(Y,2),A,B0}sn(S)h_{n}(S)\,=\,\sup\Biggl{\{}\frac{s_{n}(BSA)}{\|B\|\|A\|}\colon A\in\mathcal{L}(\ell_{2},X),\;B\in\mathcal{L}(Y,\ell_{2}),\;A,B\neq 0\Biggr{\}}\,\leq\,s_{n}(S)

for any (sn)(s_{n}). In addition, by (S2) and (S5), we obtain for any LL with rank(L)<n\operatorname{rank}(L)<n that sn(S)sn(L)+SL=SLs_{n}(S)\,\leq\,s_{n}(L)+\|S-L\|\,=\,\|S-L\|. By taking the infimum over all such LL, we see that sn(S)an(S)s_{n}(S)\leq a_{n}(S). ∎

Proof of Theorem 3.

We first present the proof from [13, 2.10.3] of the following statement: For fixed ε>0\varepsilon>0, we can find x1,,xnBXx_{1},\dots,x_{n}\in B_{X} and b1,,bnBYb_{1},\dots,b_{n}\in B_{Y^{\prime}} such that Sxk,bj=0\left\langle Sx_{k},b_{j}\right\rangle=0 for j<kj<k and (1+ε)|Sxk,bk|>ck(S)(1+\varepsilon)|\left\langle Sx_{k},b_{k}\right\rangle|>c_{k}(S) for k=1,,nk=1,\ldots,n.

For this, we inductively assume that xk,bkx_{k},b_{k} for k<nk<n are already found, and define

Mn:={xX:Sx,bk=0 for k<n}.M_{n}\,:=\,\Bigl{\{}x\in X\colon\left\langle Sx,b_{k}\right\rangle=0\text{ for }k<n\Bigr{\}}.

Since codimMn<n\operatorname{codim}{M_{n}}<n, we can choose xnMnBXx_{n}\in M_{n}\cap B_{X} with

(1+ε)SxnSJMnXcn(S).(1+\varepsilon)\|Sx_{n}\|\,\geq\,\|SJ_{M_{n}}^{X}\|\,\geq\,c_{n}(S).

By the Hahn-Banach theorem, we choose bnBYb_{n}\in B_{Y^{\prime}} with Sxn,bn=Sxnck(S)1+ε\left\langle Sx_{n},b_{n}\right\rangle=\|Sx_{n}\|\geq\frac{c_{k}(S)}{1+\varepsilon}.

We now define the operators

A(ξ):=i=1nξixiX,ξ=(ξi)2n,A(\xi)\,:=\,\sum_{i=1}^{n}\xi_{i}x_{i}\in X,\quad\xi=(\xi_{i})\in\ell_{2}^{n},

and

B(y):=(y,bi)i=1n2n,yY,B(y)\,:=\,\bigl{(}\left\langle y,b_{i}\right\rangle\bigr{)}_{i=1}^{n}\in\ell_{2}^{n},\qquad y\in Y,\vskip 6.0pt plus 2.0pt minus 2.0pt

which satisfy A,Bn\|A\|,\|B\|\leq\sqrt{n}, and observe that Sn:=BSA:2n2nS_{n}:=BSA\colon\ell_{2}^{n}\to\ell_{2}^{n} is generated by the triangular matrix (Sxi,bj)i,j=1n(\left\langle Sx_{i},b_{j}\right\rangle)_{i,j=1}^{n} with determinant det(Sn)k=1nck(S)1+ε\det(S_{n})\geq\prod_{k=1}^{n}\frac{c_{k}(S)}{1+\varepsilon}.

To obtain a bound with s-numbers, note that they all coincide for SnS_{n}, esp. with ak(Sn)a_{k}(S_{n}), and are equal to the singular numbers sk(Sn)s_{k}(S_{n}), i.e., the roots of the eigenvalues of SnSnS_{n}S_{n}^{*}, see [14, 6.2.1.2]. As the determinant is multiplicative and equals the product of the eigenvalues, we see that det(Sn)=det(SnSn)=k=1nak(Sn)\det(S_{n})=\sqrt{\det(S_{n}S_{n}^{*})}=\prod_{k=1}^{n}a_{k}(S_{n}). From the definition of hnh_{n}, we obtain ak(Sn)ABhk(S)nhk(S)a_{k}(S_{n})\leq\|A\|\|B\|\,h_{k}(S)\leq n\cdot h_{k}(S), and hence

(1+ε)nk=1nck(S)det(Sn)=k=1nak(Sn)nnk=1nhk(S).\begin{split}(1+\varepsilon)^{-n}\prod_{k=1}^{n}c_{k}(S)\;&\leq\;\det(S_{n})\;=\;\prod_{k=1}^{n}a_{k}(S_{n})\;\leq\;n^{n}\prod_{k=1}^{n}h_{k}(S).\end{split}

With ε0\varepsilon\to 0 and cn(S)(k=1nck(S))1/nc_{n}(S)\leq\bigl{(}\prod_{k=1}^{n}c_{k}(S)\bigr{)}^{1/n} we obtain the result for cn(S)c_{n}(S).

The proof for dn(S)d_{n}(S) could be done via duality, at least for compact SS, see e.g. [14, 6.2.3.9 & 6.2.3.12]. However, one can also prove it directly by inductively choosing Mn:=span{Sxk:k<n}M_{n}:=\operatorname{span}\{Sx_{k}\colon k<n\}, xnBXx_{n}\in B_{X} with (1+ε)QMnYSxnQMnYSdn(S)(1+\varepsilon)\|Q^{Y}_{M_{n}}Sx_{n}\|\,\geq\,\|Q^{Y}_{M_{n}}S\|\,\geq\,d_{n}(S), and bnBYb_{n}\in B_{Y^{\prime}} with Sxn,bn=QMnYSxn\left\langle Sx_{n},b_{n}\right\rangle=\|Q^{Y}_{M_{n}}Sx_{n}\| and Sxk,bn=0\left\langle Sx_{k},b_{n}\right\rangle=0 for k<nk<n. The remaining proof is as above. ∎

Remark 5.

The proof of Theorem 3 uses the determinant to relate the eigenvalues λk(Sn)\lambda_{k}(S_{n}) of SnS_{n} (which are the diagonal entries) with its singular numbers. Sometimes, the more general Weyl’s inequality [21] from 1949 is used, which states that k=1n|λk(S)|k=1nak(S)\prod_{k=1}^{n}|\lambda_{k}(S)|\;\leq\;\prod_{k=1}^{n}a_{k}(S) for any compact S(H,H)S\in\mathcal{L}(H,H), see also [14, 3.5.1]. This crucial step appears in all the proofs I am aware of that lead to the optimal factor nn in the comparisons. Unfortunately, all these approaches use a whole collection of s-numbers, which does not allow for bounds for individual nn.

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 0<σ<10<\sigma<1, consider the matrix Tn=(δj,i+1+σδi,nδj,1)i,j=1nT_{n}=(\delta_{j,i+1}+\sigma\cdot\delta_{i,n}\delta_{j,1})_{i,j=1}^{n} which represents a mapping on 2n\ell_{2}^{n}. It is easy to verify that ak(Tn)=1a_{k}(T_{n})=1 for k<nk<n and an(Tn)=σa_{n}(T_{n})=\sigma. (Recall that aka_{k} are the singular numbers in this case.) Moreover, since Tnn=σI2nT_{n}^{n}=\sigma\cdot I_{\ell_{2}^{n}}, we see that |λk(Tn)|=σ1/n|\lambda_{k}(T_{n})|=\sigma^{1/n} for k=1,,nk=1,\dots,n. This shows that Weyl’s inequality, as well as the easy corollary |λn(S)|S11nan(S)1/n|\lambda_{n}(S)|\leq\|S\|^{1-\frac{1}{n}}a_{n}(S)^{1/n}, 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.