2000 character limit reached
Some New Bounds on the Entropy Numbers of Diagonal Operators
Published 1 Mar 2019 in math.FA | (1903.00541v3)
Abstract: Entropy numbers are an important tool for quantifying the compactness of operators. Besides establishing new upper bounds on the entropy numbers of diagonal operators $D_\sigma$ from $\ell_p$ to $\ell_q$, where $p\not=q$, we investigate the optimality of these bounds. In case of $p<q$ optimality is proven for fast decaying diagonal sequences, which include exponentially decreasing sequences. In case of $p>q$ we show optimality under weaker assumption than previously used in the literature. In addition, we illustrate the benefit of our results with examples not covered in the literature so far.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.