Papers
Topics
Authors
Recent
Search
2000 character limit reached

Approximation Numbers in Operator and Number Theory

Updated 8 July 2026
  • Approximation numbers are quantitative invariants that measure how closely operators or numbers can be approximated by simpler, low-complexity entities.
  • In operator theory, they generalize singular values by quantifying the distance to finite-rank operators, vital for spectral analysis and embedding estimates.
  • In Diophantine settings, these numbers gauge the quality of rational and algebraic approximations, linking approximation constants, exact orders, and Hausdorff dimensions.

Approximation numbers are quantitative invariants of approximability. In operator theory, the kk-th approximation number of a bounded linear operator measures the distance to the class of operators of rank <k<k; in metric Diophantine approximation, the same expression is also used for approximation functions, constants, and exponents that quantify how well real numbers can be approximated by rationals, algebraic numbers, or partial sums arising from symbolic expansions. The common theme is the measurement of finite or discrete approximation, but the ambient structures, invariants, and theorems are different (P, 2024, Granville, 2023, Cheng et al., 29 Jun 2026).

1. Terminological scope

In the cited literature, “approximation numbers” is not a single invariant but a family of related notions. In functional analysis it belongs to the theory of ss-numbers and quantifies approximation by finite-rank operators. In Diophantine approximation it refers to approximation functions such as ψ(n)\psi(n), to exponents such as ωn(ξ)\omega_n^*(\xi), and to simultaneous approximation constants such as λk,j\lambda_{k,j} and λ^k,j\widehat{\lambda}_{k,j}. In Cantor series expansions it is tied to the exact approximation order of the partial sums ωn(x)\omega_n(x) (P, 2024, Poëls, 2024, Schleischitz, 2014, Cheng et al., 29 Jun 2026).

Setting Object called approximation numbers Representative expression
Operator theory Distance to rank <k<k operators ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}
Rational approximation Approximation function <k<k0
Algebraic approximation Exponent of approximation by algebraic numbers of degree <k<k1 <k<k2
Cantor series Exact <k<k3-approximability by partial sums <k<k4

A persistent source of confusion is that these quantities are not interchangeable. Operator-theoretic approximation numbers are <k<k5-numbers attached to linear maps, whereas Diophantine approximation numbers are attached to the approximation of scalars or tuples by arithmetic objects. The shared terminology reflects a common quantitative idea rather than a common formal definition.

2. Operator-theoretic definition and basic properties

For a bounded linear operator <k<k6 between normed linear spaces, the <k<k7-th approximation number is

<k<k8

where <k<k9 denotes the bounded linear operators of rank less than ss0. In Banach spaces this definition generalizes singular values, and on Hilbert spaces the approximation numbers coincide with the singular values for compact operators (P, 2024, Lechner et al., 2016).

The quasi-Banach extension uses the same formula: ss1 The cited axioms include monotonicity and normalization,

ss2

quasi-additivity,

ss3

and submultiplicativity,

ss4

They also satisfy the rank property ss5, and if ss6, then ss7 (Gerhold, 5 Aug 2025).

These formulas identify approximation numbers as a multiplicative ss8-number sequence. In this role they quantify how well an operator can be approximated by low-complexity surrogates and provide a scale finer than mere boundedness, yet more flexible than spectral data.

A central structural result is a generalized convergence theorem for truncations. If ψ(n)\psi(n)0 is a dual space of ψ(n)\psi(n)1, ψ(n)\psi(n)2, and

ψ(n)\psi(n)3

in the weakψ(n)\psi(n)4 topology on ψ(n)\psi(n)5, with ψ(n)\psi(n)6, then for each ψ(n)\psi(n)7,

ψ(n)\psi(n)8

The cited formulation removes the separability assumptions present in earlier results and uses nets, subnets, and weakψ(n)\psi(n)9 compactness (P, 2024).

The same paper gives a convergence statement for adjoints: ωn(ξ)\omega_n^*(\xi)0 when ωn(ξ)\omega_n^*(\xi)1 in the weak operator topology. It also formulates the complete symmetry problem through the identity ωn(ξ)\omega_n^*(\xi)2, and proves that, in the dual-codomain setting, approximation numbers are attained: for every ωn(ξ)\omega_n^*(\xi)3 there exists ωn(ξ)\omega_n^*(\xi)4 such that ωn(ξ)\omega_n^*(\xi)5 (P, 2024).

Approximation numbers serve as a reference point for other classical ωn(ξ)\omega_n^*(\xi)6-numbers. The cited relations are

ωn(ξ)\omega_n^*(\xi)7

ωn(ξ)\omega_n^*(\xi)8

together with Carl-type representations of Kolmogorov and Gelfand numbers by approximation numbers. In Hilbert spaces, all ωn(ξ)\omega_n^*(\xi)9-numbers coincide with approximation numbers, so convergence statements for truncations transfer directly to Chang, Weyl, Kolmogorov, and Gelfand numbers (P, 2024).

This suggests a broad principle: approximation numbers are often the most convenient “base” λk,j\lambda_{k,j}0-number, from which parallel results for neighboring width-type quantities can be derived.

4. Entropy numbers, spectral connections, and Sobolev embeddings

The approximation method for entropy numbers is closely parallel to the finite-section method for approximation numbers. For operators λk,j\lambda_{k,j}1 with λk,j\lambda_{k,j}2, strong or weak convergence can imply

λk,j\lambda_{k,j}3

and, for bounded operators between Hilbert spaces,

λk,j\lambda_{k,j}4

The cited work presents this as a complete answer to a question of B. Carl in the separable Hilbert setting and notes an extension beyond separability through operator-theoretic arguments (Deepesh et al., 2017).

Approximation numbers and entropy numbers are linked explicitly for periodic Sobolev-type embeddings. For spaces λk,j\lambda_{k,j}5 with weights λk,j\lambda_{k,j}6, the embedding into λk,j\lambda_{k,j}7 satisfies

λk,j\lambda_{k,j}8

where λk,j\lambda_{k,j}9. This reduces approximation-number estimates to covering-number estimates in finite-dimensional geometry and yields preasymptotic bounds for isotropic Sobolev, analytic, and Gevrey-type spaces (Kühn et al., 2015).

For anisotropic Sobolev embeddings λ^k,j\widehat{\lambda}_{k,j}0, the cited preasymptotic and asymptotic regimes are

λ^k,j\widehat{\lambda}_{k,j}1

with

λ^k,j\widehat{\lambda}_{k,j}2

The same source states that these embedding problems are intractable and do not suffer from the curse of dimensionality (Chen et al., 2016).

For non-periodic Sobolev embeddings on a bounded domain λ^k,j\widehat{\lambda}_{k,j}3, approximation numbers are tied directly to elliptic eigenvalue problems through

λ^k,j\widehat{\lambda}_{k,j}4

where λ^k,j\widehat{\lambda}_{k,j}5 is the λ^k,j\widehat{\lambda}_{k,j}6-th eigenvalue of the corresponding Dirichlet or Neumann operator. The resulting bounds are asymptotically sharp and have explicit dependence on λ^k,j\widehat{\lambda}_{k,j}7, λ^k,j\widehat{\lambda}_{k,j}8, λ^k,j\widehat{\lambda}_{k,j}9, and ωn(x)\omega_n(x)0 (Mieth, 2018).

Spectral theory supplies an additional interpretation. On Hilbert spaces,

ωn(x)\omega_n(x)1

and for self-adjoint compact operators,

ωn(x)\omega_n(x)2

These identities and inequalities show that approximation numbers control eigenvalue decay and can coincide with it in the self-adjoint setting (Gerhold, 5 Aug 2025).

5. Composition operators and boundary geometry

For composition operators on analytic function spaces, approximation numbers encode the geometry of boundary contact. On weighted Bergman spaces ωn(x)\omega_n(x)3, any compact composition operator satisfies

ωn(x)\omega_n(x)4

for suitable ωn(x)\omega_n(x)5 and ωn(x)\omega_n(x)6. A sharper invariant is

ωn(x)\omega_n(x)7

with

ωn(x)\omega_n(x)8

Exponential decay is attained only when ωn(x)\omega_n(x)9, while arbitrarily slow decay is also possible through explicit compact symbols (Li et al., 2011).

On the Dirichlet space, a parallel phenomenon holds. There exist compact composition operators with

<k<k0

for any sequence <k<k1, so the decay can be arbitrarily close to sub-exponential. At the same time, the cited lower bounds exclude decay faster than exponential, and the geometry of boundary approach is captured by

<k<k2

where <k<k3 and <k<k4. The set of contact points with the unit circle can be any compact set of logarithmic capacity zero, including a singleton (Lefèvre et al., 2012).

For composition operators on <k<k5, finite-dimensional model subspaces provide a general method. When the image domain touches the unit circle at one point, the cited results distinguish several regimes. Smooth tangency permits arbitrarily slow decay and even explicit construction of operators with prescribed slow decay; cusp-type contact yields

<k<k6

while corner-type behavior gives intermediate exponential bounds for lens maps (Queffélec et al., 2013).

Weighted composition operators <k<k7 interpolate between symbol geometry and weight vanishing. The cited lower bounds state that no non-zero weighted composition operator has superexponential decay, and if <k<k8, then for any weight <k<k9,

ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}0

The precise exponential rate is expressed through Green capacity: ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}1 For weighted lens maps, the upper and lower bounds match in type and yield ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}2 for some ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}3 (Lechner et al., 2016).

Recent work extends the subject to differences of composition operators ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}4 on ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}5 and on ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}6. Lower bounds are obtained from interpolating sequences and Carleson measures; upper bounds are obtained from Blaschke products and pseudohyperbolic control. For smooth perturbations of the form ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}7, the cited bounds take the form

ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}8

while corner-type examples give

ak(T)=inf{TF:FFk(X,Y)}a_k(T) = \inf\left\{ \|T - F\| : F \in \mathcal{F}_k(X,Y) \right\}9

Tensor-product reductions then transfer one-variable decay information to bidisc examples (Bayart et al., 24 Sep 2025).

6. Diophantine approximation, approximation constants, and exact order

In metric Diophantine approximation, approximation numbers are attached to arithmetic approximation rather than to operators. A basic rational-approximation model studies the set of <k<k00 for which

<k<k01

for infinitely many pairs <k<k02, and its reduced-fraction analogue <k<k03. Khinchin’s theorem gives the measure criterion for decreasing <k<k04, while the Duffin–Schaeffer conjecture, proved by Koukoulopoulos and Maynard, replaces <k<k05 by the weighted sum

<k<k06

and yields the exact zero-one law for reduced fractions (Granville, 2023).

A closely related irrationality criterion is the existence of “nice rational approximations”: <k<k07 The cited survey states that a real number <k<k08 is irrational if and only if there exists a sequence of coprime integers <k<k09 with <k<k10 satisfying that condition. It also records explicit constructions for <k<k11, <k<k12, <k<k13, <k<k14, and trigonometric values such as <k<k15 and <k<k16 (Bhattacharyya et al., 2022).

Approximation by algebraic numbers of bounded degree is encoded by the exponent

<k<k17

For transcendental <k<k18, Wirsing proved <k<k19; the cited paper improves this to

<k<k20

for each <k<k21, using an approach partly inspired by parametric geometry of numbers (Poëls, 2024).

For simultaneous approximation of power tuples <k<k22, Liouville numbers occupy an extreme position. For any Liouville number <k<k23,

<k<k24

and

<k<k25

For a specific explicit class including <k<k26 and Liouville numbers in the Cantor set, all these values are realized simultaneously for every <k<k27 (Schleischitz, 2014).

The digital-structure viewpoint leads further. For a class of special Liouville numbers constructed from <k<k28-adic expansions or from rapidly increasing divisibility chains <k<k29, the cited work gives explicit formulas for <k<k30 and <k<k31 and shows that one can construct tuples <k<k32 with prescribed simultaneous approximation properties. This ties approximation constants directly to gaps in digit positions in <k<k33-adic expansions (Schleischitz, 2013).

Cantor series expansions provide a symbolic analogue of exact approximation order. For

<k<k34

the limsup set

<k<k35

and the exact set

<k<k36

mirror classical exact approximation by rationals. Under the condition

<k<k37

with <k<k38 non-increasing and <k<k39, the Hausdorff dimensions satisfy

<k<k40

This is presented as a Cantor-series analogue of exact metric Diophantine approximation (Cheng et al., 29 Jun 2026).

Across these settings, the phrase “approximation numbers” names a collection of precise numerical gauges rather than a single invariant. In operator theory it quantifies finite-rank approximability and interfaces with entropy, widths, and spectral decay; in Diophantine approximation it quantifies rational, algebraic, and symbolic approximation, often through zero-one laws, exact-order sets, and Hausdorff dimension formulas. The unifying content is quantitative approximation, but the objects being approximated, the admissible approximants, and the governing theorems are specific to each domain.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Approximation Numbers.