The depth of Tsirelson's norm
Abstract
Tsirelson's norm \|· \|T on c00 is defined as the supremum over a certain collection of iteratively defined, monotone increasing norms \|· \|k. For each positive integer n, the value j(n) is the least integer k such that for all x ∈ Rn (here Rn is considered as a subspace of c00), \|x\|T = \|x\|k. In 1989 Casazza and Shura asked what is the order of magnitude of j(n). It is known that j(n) ∈ O(n). We show that this bound is tight, that is, j(n) ∈ (n). Moreover, we compute the tight order of magnitude for some norms being modifications of the original Tsirelson's norm.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.