Entropy Numbers in Banach Spaces

• Entropy numbers are covering-based invariants that quantify compactness in Banach and quasi-Banach spaces by measuring the minimal radius needed to cover the image of the unit ball.
• They exhibit decay behaviors—power law, logarithmic corrections, or exponential regimes—that are critical for understanding finite-dimensional embeddings and spectral estimates.
• Adaptive finite-rank approximations and combinatorial methods underpin sharp entropy estimates, linking covering behavior to eigenvalue decay and approximation accuracy.

Entropy numbers are covering-based invariants of bounded sets and operators that quantify compactness in Banach and quasi-Banach geometry. In the operator form, they measure the smallest radius of balls needed to cover the image of the unit ball by a prescribed number of centers; in the set form, they encode the metric entropy of compact classes. Across the literature they serve as a common language for finite-dimensional embeddings, diagonal and multiplier operators, function classes, spectral estimates, and discretization theory. Their decay governs compactness, and in many settings it can be described sharply by power laws, logarithmic corrections, or exponential regimes (Kossaczká et al., 2018, Gerhold, 5 Aug 2025).

1. Definition and foundational properties

Let $X$ and $Y$ be Banach spaces, $B_X$ the closed unit ball of $X$, and let

$N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$

be the smallest number of translates of $\varepsilon B_Y$ needed to cover $T(B_X)$. A standard dyadic definition of the $n$-th entropy number of a compact operator $T:X\to Y$ is

$$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$

For a bounded subset $Y$0, one analogously sets

$Y$1

This formulation appears throughout the modern theory and is equivalent to asking for a covering by $Y$2 balls of radius $Y$3 (Lifshits, 2010, Kossaczká et al., 2018).

Several structural facts recur across Banach and quasi-Banach settings. Entropy numbers are monotone,

$Y$4

subadditive in the form

$Y$5

or, in a $Y$6-normed target, $Y$7, and submultiplicative,

$Y$8

They also satisfy the compactness criterion

$Y$9

In quasi-Banach spaces, entropy numbers are compared to approximation and Kolmogorov numbers by

$B_X$0

and Carl’s inequality yields

$B_X$1

linking covering behavior to eigenvalue decay (Gerhold, 5 Aug 2025).

When the target is a $B_X$2-Banach space, $B_X$3, the first entropy number no longer coincides exactly with the operator norm. Instead one has the sharp estimate

$B_X$4

and the constant $B_X$5 is best possible. There are even examples with $B_X$6 for every $B_X$7 (Kaewtem, 2017).

2. Canonical finite-dimensional models

The basic model problem is the identity embedding

$B_X$8

Its entropy numbers exhibit the standard regime structure used throughout the subject. For $B_X$9,

$X$0

whereas for $X$1,

$X$2

Thus $X$3 yields a constant regime, then a polynomial regime, and finally an exponential tail; $X$4 yields a single exponential regime in $X$5. The proofs combine volume comparison, combinatorial packing by Hamming-type or constant-weight codes, interpolation, and in the quasi-Banach range Maurey’s empirical method (Kossaczká et al., 2018).

This picture extends to finer scales. For finite-dimensional Lorentz spaces $X$6, the asymptotics are sharp in all regimes. When $X$7, they coincide with the classical $X$8 behavior, but extra logarithmic factors appear when one or both of $X$9 are infinite or when $N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$0 and the secondary indices differ. In the intermediate range $N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$1, the correct scale is expressed through

$N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$2

and a key reduction identifies $N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$3 with the worst-case best $N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$4-term approximation error for $N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$5 (Prochno et al., 2024).

The noncommutative analogue is the Schatten embedding

$N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$6

Here the ambient dimension is $N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$7, and the entropy profile is correspondingly different. For $N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$8,

$N\bigl(T(B_X),\;\varepsilon\,B_Y\bigr)$9

For $\varepsilon B_Y$0 one sees an exponential tail of the form $\varepsilon B_Y$1. In contrast to the classical $\varepsilon B_Y$2 setting, the matrix case has no logarithmic middle regime on $\varepsilon B_Y$3 (Hinrichs et al., 2016).

3. Critical operators and adaptive finite-rank approximation

A central development in the theory concerns “critical” operators, where standard truncation arguments leave a logarithmic gap. Two model classes are the summation operators on the infinite full binary tree and Volterra-type integral operators. For the tree model, with weight

$\varepsilon B_Y$4

one considers

$\varepsilon B_Y$5

and its adjoint

$\varepsilon B_Y$6

For the Volterra model, with

$\varepsilon B_Y$7

one studies

$\varepsilon B_Y$8

together with its adjoint $\varepsilon B_Y$9. The cases $T(B_X)$0 for tree summation and $T(B_X)$1 for the Volterra kernel are critical in the precise sense that previously known methods produced an extra logarithmic factor (Lifshits, 2010).

For the tree operator, the regular-case asymptotics are

$T(B_X)$2

$T(B_X)$3

$T(B_X)$4

The critical theorem improves the upper bound at $T(B_X)$5 to

$T(B_X)$6

For the Volterra operator with

$T(B_X)$7

one likewise has

$T(B_X)$8

These results close the logarithmic gap left by the classical truncation procedure (Lifshits, 2010).

The method is an adaptive family approximation rather than a single fixed truncation. If $T(B_X)$9 is a family of operators, then

$n$0

For tree summation, each $n$1 determines an $n$2-essential subtree $n$3 by a stopping rule based on accumulated variation. Every such subtree satisfies

$n$4

and the number of possible essential trees is at most $n$5. Truncating to $n$6 yields a finite-rank operator $n$7 with

$n$8

For Volterra operators, essential dyadic partitions of $n$9 play the same role: they have at most $T:X\to Y$0 intervals, at most $T:X\to Y$1 possibilities, and support finite-rank kernel approximations with error $T:X\to Y$2 (Lifshits, 2010).

The failure of classical truncation is explicit. Truncation at level $T:X\to Y$3 gives rank $T:X\to Y$4 and error $T:X\to Y$5; balancing $T:X\to Y$6 yields

$T:X\to Y$7

so a logarithmic gap remains. Adaptive truncation removes precisely this $T:X\to Y$8 loss by tailoring the finite-rank approximation to each input (Lifshits, 2010).

4. Diagonal, multiplier, and adjoint phenomena

Diagonal operators on sequence spaces provide another major testing ground. Given a nonincreasing sequence $T:X\to Y$9 with $$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$0, define

$$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$1

For $$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$2, if $$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$3, then one has an upper product bound

$$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$4

Under the exponential decay condition

$$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$5

this becomes sharp, and

$$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$6

For $$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$7, with $$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$8 and tail sequence

$$e_n(T):=\inf\bigl\{\varepsilon>0:\,N(T(B_X),\,\varepsilon B_Y)\le 2^{\,n-1}\bigr\}.$$9

two regimes appear. Under the “at least polynomial” hypothesis $Y$00, one gets

$Y$01

whereas under the “at most polynomial” hypothesis $Y$02,

$Y$03

The proof mechanism is decomposition into a finite-dimensional truncation plus tail, followed by volume estimates in dimension $Y$04 and optimization in $Y$05 (Fischer, 2019).

A complementary line of work concerns approximation by finite-dimensional compressions. If

$Y$06

and $Y$07 in norm for each $Y$08, then for each fixed $Y$09,

$Y$10

when the target is reflexive, and also in certain dual settings. In separable Hilbert spaces this leads to the exact adjoint symmetry

$Y$11

which gives a complete affirmative answer to Carl’s question in that setting (Deepesh et al., 2017).

For Fourier multiplier operators,

$Y$12

defined with respect to a bounded orthonormal system $Y$13, the entropy problem is transferred to finite-dimensional diagonal blocks. If $Y$14 with $Y$15 nonincreasing and $Y$16, then

$Y$17

while the upper bounds are controlled by a factor $Y$18. In concrete Sobolev-type cases,

$Y$19

and if $Y$20 with $Y$21, then

$Y$22

For Gevrey-type multipliers $Y$23, $Y$24,

$Y$25

These rates are order-sharp in the main exponents of $Y$26 and $Y$27 (Pareja et al., 2021).

5. Function classes and metric entropy

Entropy numbers of function classes often reveal an intrinsic dimension that is not visible from the ambient domain. For ridge functions

$Y$28

measured in $Y$29, the univariate reference class

$Y$30

satisfies

$Y$31

For $Y$32, one has the regime picture: $Y$33 for $Y$34; an intermediate decay controlled by the direction-net term up to a logarithmic-in-$Y$35 threshold; and

$Y$36

once $Y$37. By contrast,

$Y$38

so the ridge class has one-dimensional entropy asymptotics for large $Y$39, despite living on a high-dimensional domain (Mayer et al., 2013).

Mixed-smoothness classes on the torus display a different but equally structured behavior. For

$Y$40

sharp estimates include

$Y$41

$Y$42

$Y$43

and for general $Y$44,

$Y$45

Here the upper bounds are obtained by a two-step strategy: first derive best $Y$46-term approximation estimates with respect to a suitable dictionary, then convert them into entropy estimates through a general inequality of the form

$Y$47

This is one of the clearest examples of nonlinear approximation feeding directly into entropy asymptotics (Temlyakov, 2016).

For finite-dimensional subspaces $Y$48, the entropy of the $Y$49-unit ball

$Y$50

controls sampling discretization. Under the Nikol’skii-type assumptions

$Y$51

one has

$Y$52

Combined with a conditional discretization theorem, this yields equal-weight Marcinkiewicz discretization with

$Y$53

under the growth condition $Y$54, and a weighted version for arbitrary $Y$55 with

$Y$56

The Rademacher example shows that the endpoint condition involving $Y$57 is genuinely needed for the sharp first-block rate when $Y$58 (Dai et al., 2020).

Entropy numbers also interact with Minkowski dimension. For a connected totally bounded set $Y$59,

$Y$60

If $Y$61 is an $Y$62-homogeneous polynomial, then

$Y$63

This fails for holomorphic maps: there are holomorphic $Y$64 with $Y$65 of finite box dimension but infinite-dimensional linear span. Moreover, if $Y$66 is holomorphic near $Y$67 and $Y$68 are the homogeneous Taylor coefficients, finite box dimension of $Y$69 implies

$Y$70

The relation is mediated by explicit inequalities comparing the entropy of $Y$71 with that of its Taylor polynomials (Carando et al., 2024).

6. Methods, recurring themes, and significance

A small number of proof mechanisms recur across the subject. Volume comparison yields lower bounds by comparing $Y$72 with $Y$73; this is decisive for $Y$74-embeddings, diagonal operators, Lorentz embeddings, and Schatten classes. Combinatorial constructions—Hamming codes, constant-weight codes, sparse support packings, and separated sets—produce the sharp intermediate regimes. Interpolation and duality pass between endpoint cases and general parameters. Nonlinear approximation provides another route: greedy and $Y$75-term methods convert approximation rates into entropy rates, and Temlyakov’s refinement of Talagrand’s theorem replaces $Y$76 by $Y$77 in entropy bounds for octahedra in uniformly smooth spaces (Kossaczká et al., 2018, Temlyakov, 2020).

Two distinctions are especially important. First, the entropy profile need not reflect ambient dimension in a naive way. Ridge-function classes can have asymptotic rate $Y$78 independently of $Y$79, while full multivariate Lipschitz classes have $Y$80 decay (Mayer et al., 2013). Second, fixed truncation is not always structurally adequate. In critical tree and Volterra problems, the optimal $Y$81 upper bound becomes visible only after replacing one truncation by a family of input-dependent finite-rank approximants indexed by essential trees or partitions (Lifshits, 2010).

These results feed directly into neighboring theories. Entropy numbers provide upper and lower bounds for Kolmogorov widths and Gelfand widths, control covering numbers used in Johnson–Lindenstrauss lower bounds, enter statistical learning through uniform convergence estimates for hypothesis classes, and appear in compressed sensing via the same net arguments used for sparse recovery (Kossaczká et al., 2018). Through Carl’s and Weyl’s inequalities they connect covering geometry to spectral theory: small entropy numbers force rapid eigenvalue decay, while good finite-rank approximation controls products and $Y$82-sums of eigenvalues (Gerhold, 5 Aug 2025). In the noncommutative setting they yield lower bounds for low-rank matrix recovery through their relation to Gelfand numbers (Hinrichs et al., 2016).

Taken together, the modern theory presents entropy numbers as a unifying invariant across geometric functional analysis, approximation theory, operator theory, and information-based complexity. Their most characteristic features are the coexistence of universal formal properties with highly problem-specific asymptotics, and the fact that apparently small structural changes—critical exponents, infinite secondary indices, quasi-Banach targets, or nonlinear model classes—can change the entropy scale from a pure power law to a logarithmically corrected or exponential regime.