Kolmogorov Numbers in Operator Approximation
- Kolmogorov numbers are a sequence of s-numbers that quantify the worst-case error of approximating an operator’s image via low-dimensional subspaces.
- They satisfy Pietsch’s axioms, ensuring monotonicity, multiplicativity, and normalization, and coincide with singular values in Hilbert spaces.
- They provide operational thresholds in communication channels, marking noise levels at which the channel’s effective dimensionality drops.
Searching arXiv for recent and foundational papers on Kolmogorov numbers to ground the article in published work. Kolmogorov numbers are an -number sequence associated with a bounded linear operator . They quantify the smallest worst-case error obtained by approximating the image of the unit ball by subspaces of of dimension . For compact operators they form a nonincreasing sequence tending to zero; in the Hilbert-space case they coincide with the singular values; and, in a communication-theoretic formulation, they are exactly the jump points of the degrees-of-freedom function of a linear channel (Somaraju et al., 2011).
1. Definition and geometric content
Let and be Banach spaces and let be bounded. If denotes the quotient map onto the quotient by a closed subspace 0, then the 1th Kolmogorov number is
2
Equivalently, 3 is the worst-case distance of 4 to an 5-dimensional subspace of 6. This makes explicit that Kolmogorov numbers are codomain-side approximation quantities: one fixes a low-dimensional subspace of 7 and measures how well the whole image 8 can be represented inside it (Somaraju et al., 2011).
A closely related finite-dimensional approximation formula is
9
This version makes clear that the problem can be read as selecting 0 trial vectors in the target space and minimizing the maximal residual over the unit ball of the domain (Somaraju et al., 2011).
The same basic definition extends to quasi-Banach spaces: 1 In that setting, too, the quantity measures approximation of 2 by finite-dimensional subspaces of the target (Gerhold, 5 Aug 2025).
2. Position within the theory of 3-numbers
Kolmogorov numbers are one of the classical 4-numbers in the sense of Pietsch. In the Banach-space setting they satisfy Pietsch’s axioms SN1–SN5 and therefore define a valid 5-number sequence. In particular,
6
they obey the ideal property
7
they are normalized by 8 on any Banach space, and they vanish once the rank drops below the index: 9 These properties place them in the same structural framework as approximation, Gelfand, Bernstein, and Hilbert numbers [(Somaraju et al., 2011); (Ullrich, 2024)].
In quasi-Banach spaces, the structural picture persists with the expected modifications. One has monotonicity,
0
quasi-additivity,
1
multiplicativity,
2
the rank property, normalization for identities, and the ideal property
3
A central characterization is
4
which makes Kolmogorov numbers a compactness scale as well as an approximation scale (Gerhold, 5 Aug 2025).
A recent comparison theorem gives a sharp product-type bound between small and large 5-numbers: 6 Here 7 are Gelfand numbers and 8 are Hilbert numbers. This shows that Kolmogorov numbers cannot decay, on average, much faster than the Hilbert numbers up to the optimal factor 9 (Ullrich, 2024).
3. Hilbert-space specialization and relations to neighboring quantities
When 0 and 1 are Hilbert spaces and 2 is compact, the 3-number theory collapses to the singular-value theory. In that case,
4
the 5th singular value of 6. This is one of the main reasons Kolmogorov numbers are viewed as the Banach-space analogue of singular values (Somaraju et al., 2011).
Several neighboring quantities recur throughout the literature.
| Quantity | Notation | Relation stated in the sources |
|---|---|---|
| Approximation numbers | 7 | 8 |
| Gelfand numbers of the adjoint | 9 | 0 |
| Hilbert numbers | 1 | 2 |
| Entropy numbers | 3 | For compact Hilbert-to-Banach maps, decay of 4 and 5 is equivalent in several regimes |
| Interpolation widths | 6 | 7 |
These comparisons clarify a common source of confusion: Kolmogorov numbers are not, in general, the same as approximation numbers, entropy numbers, or interpolation widths, even though they are often comparable (Steinwart, 2016, Ullrich, 2024).
For compact operators 8 from a Hilbert space into a Banach space, Steinwart proves that for 9,
0
and, if 1 has the metric-extension property, analogous equivalences hold for 2 as well (Steinwart, 2016). In the setting of RKHS embeddings into 3, the same paper also exhibits a genuine half-power separation between Kolmogorov widths and interpolation widths: if 4 with 5, then
6
The same 7 gap is attained for multidimensional Sobolev embeddings 8 (Steinwart, 2016).
A separate terminological issue appears in a recent Lie-group paper, where the covering number 9 is described as an “entropy Kolmogorov number,” while the standard Kolmogorov numbers remain the quantities 0. In that setting the paper states
1
so the distinction between covering, entropy, and Kolmogorov numbers is preserved even when the terminology is broadened (Avetisyan et al., 2 Feb 2026).
4. Communication channels and the degrees-of-freedom function
A linear communication channel may be modeled by a compact linear operator 2, where 3 is a transmitter power constraint and 4 is a receiver noise threshold below which signals cannot be distinguished. In that setting the number of degrees of freedom at level 5 is defined by
6
Operationally, 7 is the number of linearly independent signals that may be communicated through the channel at noise level 8 (Somaraju et al., 2011).
The function 9 has the basic properties expected of a degrees-of-freedom count. One has 0 for all 1, the map is nonincreasing, and it has only finitely many jumps in any finite 2-interval. Unless 3, 4 as 5 (Somaraju et al., 2011).
If 6 denotes the 7th jump point of 8, characterized by
9
then the central theorem is
0
Thus Kolmogorov numbers are exactly the discontinuity thresholds of the degrees-of-freedom function. This gives an operator-theoretic quantity an immediate communication-theoretic interpretation: the 1th Kolmogorov number is the noise level at which the effective dimensionality of the channel drops from at least 2 to at most 3 (Somaraju et al., 2011).
5. Asymptotic theories for embeddings and finite-dimensional models
A major part of the literature studies asymptotics of 4 for concrete embeddings. For weighted Sobolev-type embeddings of Besov and Triebel–Lizorkin spaces with polynomial weights,
5
and analogous 6-space variants, the non-limiting case is governed by
7
The sharp asymptotics are of the form
8
with six parameter regimes determined by 9, and the same rates remain valid for the corresponding Besov/Triebel–Lizorkin combinations under the stated quasi-normability restrictions [(Zhang et al., 2011); (Zhang et al., 2011)].
The proofs in these weighted function-space problems proceed by wavelet discretization, reduction to sequence-space embeddings, and use of sharp finite-dimensional 00 estimates. One representative finite-dimensional identity is
01
while other parameter ranges exhibit piecewise asymptotics involving logarithmic factors, 02-decay, or interpolation between two regimes (Gerhold, 5 Aug 2025). These finite-dimensional estimates are also used explicitly in the weighted Sobolev papers through dyadic decomposition and operator-ideal arguments (Zhang et al., 2011).
For Schatten-class embeddings
03
Prochno and Strzelecki obtain asymptotically sharp two-sided bounds, up to constants depending only on 04, across several parameter regions. For example, in the “upper-triangle” regime 05,
06
In the quasi-Banach range 07, the same paper states
08
The analysis relies on duality with Gelfand numbers, volume/Dvoretzky arguments, interpolation, and explicit construction of quotients of 09 of controlled norm (Prochno et al., 2021).
Another strand concerns embeddings of Besov spaces of dominating mixed smoothness into 10. The abstract of "Kolmogorov Numbers of Embeddings of Besov Spaces of Dominating Mixed Smoothness into 11" announces two-sided sharp estimates for
12
placing mixed-smoothness problems within the same general width-theoretic framework (Nguyen, 2014).
6. Numerical computation and further analytic settings
For computation, a practical scheme is available when the domain 13 has a Schauder basis 14. If
15
and 16, then for each fixed 17,
18
once 19 is large enough that the 20th Kolmogorov number of the truncation exists. This leads to a finite-dimensional approximation procedure: choose 21, assemble the matrix of 22, compute 23, and increase 24 until the values stabilize. In the Hilbert-space case this reduces to extracting the 25th singular value of the finite matrix, or equivalently diagonalizing the associated Gram matrix (Somaraju et al., 2011).
The same approximation-theoretic viewpoint now appears in newer geometric settings. For a compact Lie group 26, a left-invariant positive symmetric trace-class integral kernel 27 induces an RKHS 28, and one studies the embedding
29
In that context, the paper on compact Lie groups defines covering numbers 30, entropy numbers 31, and Kolmogorov numbers 32, and proves two-sided asymptotic estimates for 33 from spectral assumptions on the group Fourier symbol of the kernel operator. Under a trace-decay hypothesis 34 with 35, the paper derives power-law decay of 36 up to logarithmic factors; under a determinant-decay hypothesis, it derives logarithmic asymptotics of the form 37 in the respective regime (Avetisyan et al., 2 Feb 2026).
Taken together, these results show that Kolmogorov numbers serve simultaneously as abstract 38-numbers, as singular-value analogues on Banach and quasi-Banach spaces, as operational thresholds in communication channels, and as sharp asymptotic invariants for embeddings in function spaces, matrix ideals, RKHS theory, and harmonic analysis on compact groups [(Somaraju et al., 2011); (Steinwart, 2016); (Prochno et al., 2021); (Avetisyan et al., 2 Feb 2026)].