GKS logarithm-removal conjecture for approximation numbers of Schatten embeddings

About 5 years old · traced to

Let SpNS_p^N denote the Schatten class of N×NN\times N matrices with exponent pp, and let ana_n be the nnth approximation number of the embedding. For 1<p≤q<∞1<p\leq q<\infty and n,N∈Nn,N\in\mathbb N satisfying

(1−c)N2≤n≤N2−cNαp,q+1,(1-c)N^2\leq n\leq N^2-cN^{\alpha_{p,q}}+1,

GKS's conjecture. The approximation numbers satisfy

an(SpN↪SqN)≲p,qNαp,q/2−2N2−n+1.a_n\big(\mathcal{S}_p^N\hookrightarrow\mathcal{S}_q^N\big)\lesssim_{p,q}N^{\alpha_{p,q}/2-2}\sqrt{N^2-n+1}.

This conjecture concerns the logarithmic factors in the upper bound for approximation numbers in the indicated region and is attributed in the paper to GKS (1987).

References

Primary source

Joscha Prochno and Michał Strzelecki, “Approximation, Gelfand, and Kolmogorov numbers of Schatten class embeddings”, arXiv:2103.13050 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.