Conjectured Gelfand and approximation number bound for Schatten embeddings

About 5 years old · traced to

Let SpNS_p^N denote the Schatten class of N×NN\times N matrices, and let ana_n and cnc_n denote the nnth approximation and Gelfand numbers, respectively. For 2≤p≤q≤∞2\leq p\leq q\leq\infty and n,N∈Nn,N\in\mathbb N satisfying

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

The Gelfand–approximation conjecture. One has

cn(SpN↪SqN)≤an(SpN↪SqN)≲p,q(N2−n+1N2)1/p−1/q1/2−1/q.c_n\big(\mathcal{S}_p^N\hookrightarrow\mathcal{S}_q^N\big)\leq a_n\big(\mathcal{S}_p^N\hookrightarrow\mathcal{S}_q^N\big)\lesssim_{p,q}\left(\sqrt{\frac{N^2-n+1}{N^2}}\right)^{\frac{1/p-1/q}{1/2-1/q}}.

The conjecture concerns the lower-left triangular region for Gelfand and approximation numbers; by duality and the cited lemma, it is equivalently related to corresponding Kolmogorov-number regions. The source presents this as unsettled.

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.