A+ CATEGORY SCIENTIFIC UNIT

The depth of Tsirelson’s norm

Kevin Beanland, Jędrzej Hodor Studia Mathematica MSC: Primary 46B20 DOI: 10.4064/sm230707-24-9 Published online: 9 December 2024

Abstract

Tsirelson’s norm $\|\cdot \|_T$ on $c_{00}$ is defined as the supremum over a certain collection of iteratively defined, increasing norms $\|\cdot \|_k$. For each positive integer $n$, the value $j(n)$ is the least integer $k$ such that for all $x \in \mathbb R^n$ (here $\mathbb R^n$ is considered as a subspace of $c_{00}$), $\|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) \in \mathcal O(\sqrt n)$. We show that this bound is tight, that is, $j(n) \in \Omega (\sqrt {n})$. Moreover, we compute the tight order of magnitude for some modifications of Tsirelson’s original norm.

Authors

  • Kevin BeanlandDepartment of Mathematics
    Washington and Lee University
    Lexington, VA 24450, USA
    e-mail
  • Jędrzej HodorTheoretical Computer Science Department
    Jagiellonian University
    Kraków, Poland
    e-mail

Search for IMPAN publications

Query phrase too short. Type at least 4 characters.

Rewrite code from the image

Reload image

Reload image