Noncommutative Analysis

Category: Research

The complex matrix cube problem – new results from summer projects

In this post I will summarize the results obtained by my group in the “Summer Projects Week” that took place two weeks ago at the Technion. As in last time (see here for a summary of last year’s project) the title of the project I suggested was “Numerical Explorations of Open Problems from Operator Theory”. This time, I was lucky to have Malte Gerhold and Satish Pandey, my postdocs, volunteer to help me with the mentoring. The students who chose our project were Matan Gibson and Ofer Israelov, and they did fantastic work.

Read the rest of this entry »

The never ending paper

My paper On operator algebras associated with monomial ideals, written jointly with Evgenios Kakariadis, has recently appeared in Journal of Mathematical Analysis and Applications. They gave me a link to share (the link will work for the next several weeks): click here for an official version of the paper.

The paper is a very long paper, so it has a very long introduction too. To help to get into the heart of editors and referees, we wrote, at some point, a shorter cover letter which attempts to briefly explain what the main achievements are. See below the fold for that.

But first, a rant!

Read the rest of this entry »

New paper “Compressions of compact tuples”, and announcement of mistake (and correction) in old paper “Dilations, inclusions of matrix convex sets, and completely positive maps”

Ben Passer and I have recently uploaded our preprint “Compressions of compact tuples” to the arxiv. In this paper we continue to study matrix ranges, and in particular matrix ranges of compact tuples. Recall that the matrix range of a tuple A = (A_1, \ldots, A_d) \in B(H)^d is the the free set \mathcal{W}(A) = \sqcup_{n=1}^\infty \mathcal{W}_n(A), where

\mathcal{W}_n(A) = \{(\phi(A_1), \ldots, \phi(A_d)) : \phi : B(H) \to M_n is UCP \}.

A tuple A is said to be minimal if there is no proper reducing subspace G \subset H such that \mathcal{W}(P_G A\big|_G) = \mathcal{W}(A). It is said to be fully compressed if there is no proper subspace whatsoever G \subset H such that \mathcal{W}(P_G A\big|_G) = \mathcal{W}(A).

In an earlier paper (“Dilations, inclusions of matrix convex sets, and completely positive maps”) I wrote with other co-authors, we claimed that if two compact tuples A and B are minimal and have the same matrix range, then A is unitarily equivalent to B; see Section 6 there (the printed version corresponds to version 2 of the paper on arxiv). This is false, as subsequent examples by Ben Passer showed (see this paper). A couple of other statements in that section are also incorrect, most obviously the claim that every compact tuple can be compressed to a minimal compact tuple with the same matrix range. All the problems with Section 6 of that earlier paper “Dilations,…” can be quickly  fixed by throwing in a “non-singularity” assumption, and we posted a corrected version on the arxiv. (The results of Section 6 there do not affect the rest of the results in the paper, and are somewhat not in the direction of the main parts of that paper).

In the current paper, Ben and I take a closer look at the non-singularity assumption that was introduced in the corrected version of “Dilations,…”, and we give a complete characterization of non-singular tuples of compacts. This characterization involves the various kinds of extreme points of the matrix range \mathcal{W}(A). We also make a serious invetigation into fully compressed tuples defined above. We find that a matrix tuple is fully compressed if and only if it is non-singular and minimal. Consequently, we get a clean statement of the classification theorem for compacts: if two tuples A and B of compacts are fully compressed, then they are unitarily equivalent if and only if \mathcal{W}(A) = \mathcal{W}(B).

 

The complex matrix cube problem summer project – summary of results

In the previous post I announced the project that I was going to supervise in the Summer Projects in Mathematics week at the Technion. In this post I wish to share what we did and what we found in that week.

I had the privilege to work with two very bright students who have recently finished their undergraduate studies: Mattya Ben-Efraim (from Bar-Ilan University) and Yuval Yifrach (from the Technion). It is remarkable the amount of stuff they learned for this one week project (the basics of C*-algebras and operator spaces), and that they actually helped settle the question that I raised to them.

I learned a lot of things in this project. First, I learned that my conjecture was false! I also learned and re-learned some programming abilities, and I learned something about the subtleties and limitations of numerical experimentation (I also learned something about how to supervise an undergraduate research project, but that’s besides the point right now).

Statement of the problem

Read the rest of this entry »

Minimal and maximal matrix convex sets

The final version of the paper Minimal and maximal matrix convex sets, written by Ben Passer, Baruch Solel and myself, has recently appeared online. The publisher (Elsevier) sent us a link through which the official final version is downloadable, for anyone who clicks on the following link before May 26, 2018. Here is the link for the use of the public:

Click here to download the journal version of the paper

Of course, if you don’t click by May 26 – don’t panic! We always put our papers on the arXiv, and here is the link to that. Here is the abstract:

Abstract. For every convex body K \subseteq \mathbb{R}^d, there is a minimal matrix convex set \mathcal{W}^{min}(K), and a maximal matrix convex set \mathcal{W}^{max}(K), which have K as their ground level. We aim to find the optimal constant \theta(K) such that \mathcal{W}^{max}(K) \subseteq \theta(K) \cdot \mathcal{W}^{min}(K). For example, if \overline{\mathbb{B}}_{p,d} is the unit ball in \mathbb{R}^d with the p-norm, then we find that 

\theta(\overline{\mathbb{B}}_{p,d}) = d^{1-|1/p-1/2|} .

This constant is sharp, and it is new for all p \neq 2. Moreover, for some sets K we find a minimal set L for which \mathcal{W}^{max}(K) \subseteq \mathcal{W}^{min}(L). In particular, we obtain that a convex body K satisfies \mathcal{W}^{max}(K) = \mathcal{W}^{min}(K) only if K is a simplex.

These problems relate to dilation theory, convex geometry, operator systems, and completely positive maps. For example, our results show that every d-tuple of self-adjoint contractions, can be dilated to a commuting family of self-adjoints, each of norm at most \sqrt{d}. We also introduce new explicit constructions of these (and other) dilations.