ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is paving true for ℓpn\ell_p^n? Specifically:

Suppose 1≤p<∞1\le p<\infty.

PavpPav_p: Does there exist for every ϵ>0\epsilon > 0 a constant k=k(ϵ,p)k=k(\epsilon, p) s.t. for every nn and every nn by nn zero diagonal matrix AA for which ∥A∥p=1\|A\|_p = 1, there is a partition σ(1),…,σ(k)of\sigma(1), \dots, \sigma(k) of {1,\dots,n}$ s.t.

∥∑j=1kPσ(j)APσ(j)∥p=max⁡j∥Pσ(j)APσ(j)∥p≤ϵ.\|\sum_{j=1}^k P_{\sigma(j)} A P_{\sigma(j)} \|_p = \max_j \| P_{\sigma(j)} A P_{\sigma(j)} \|_p \le \epsilon .

Here \|\dot \|_ is the operator norm for operators on ℓpn\ell_p^n, NOT the Schatten pp-class norm.

Pav1Pav_1, due IIRC to Bourgain has been known for a long time and is relatively easy. It is more-or-less equivalent to Pav2Pav_2 for matrices that have non-negative entries, a result that is contained in

Berman, Kenneth; Halpern, Herbert; Kaftal, Victor; Weiss, Gary; Matrix norm inequalities and the relative Dixmier property. Integral Equations Operator Theory 11 (1988), no. 1, 28-48.

In their original paper, Bourgain and Tzafriri proved restricted invertibility for ℓpn\ell_p^n, but they got optimal estimates only for p=2p=2.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.