I have just uploaded to the arXiv my paper “Commutators close to the identity“, submitted to the Journal of Operator Theory. This paper resulted from some progress I made on the problem discussed in this previous post. Recall in that post the following result of Popa: if are bounded operators on a Hilbert space
whose commutator
is close to the identity in the sense that
for some , then one has the lower bound
In the other direction, for any , there are examples of operators
obeying (1) such that
In this paper we improve the upper bound to come closer to the lower bound:
Theorem 1 For any
, and any infinite-dimensional
, there exist operators
obeying (1) such that
One can probably improve the exponent somewhat by a modification of the methods, though it does not seem likely that one can lower it all the way to
without a substantially new idea. Nevertheless I believe it plausible that the lower bound (2) is close to optimal.
We now sketch the methods of proof. The construction giving (3) proceeded by first identifying with the algebra
of
matrices that have entries in
. It is then possible to find two matrices
whose commutator takes the form
for some bounded operator (for instance one can take
to be an isometry). If one then conjugates
by the diagonal operator
, one can eusure that (1) and (3) both hold.
It is natural to adapt this strategy to matrices
rather than
matrices, where
is a parameter at one’s disposal. If one can find matrices
that are almost upper triangular (in that only the entries on or above the lower diagonal are non-zero), whose commutator
only differs from the identity in the top right corner, thus
for some , then by conjugating by a diagonal matrix such as
for some
and optimising in
, one can improve the bound
in (3) to
; if the bounds in the implied constant in the
are polynomial in
, one can then optimise in
to obtain a bound of the form (4) (perhaps with the exponent
replaced by a different constant).
The task is then to find almost upper triangular matrices whose commutator takes the required form. The lower diagonals of
must then commute; it took me a while to realise then that one could (usually) conjugate one of the matrices, say
by a suitable diagonal matrix, so that the lower diagonal consisted entirely of the identity operator, which would make the other lower diagonal consist of a single operator, say
. After a lot of further lengthy experimentation, I eventually realised that one could conjugate
further by unipotent upper triangular matrices so that all remaining entries other than those on the far right column vanished. Thus, without too much loss of generality, one can assume that
takes the normal form
for some , solving the system of equations
It turns out to be possible to solve this system of equations by a contraction mapping argument if one takes to be a “Hilbert’s hotel” pair of isometries as in the previous post, though the contraction is very slight, leading to polynomial losses in
in the implied constant.
There is a further question raised in Popa’s paper which I was unable to resolve. As a special case of one of the main theorems (Theorem 2.1) of that paper, the following result was shown: if obeys the bounds
(where denotes the space of all operators of the form
with
and
compact), then there exist operators
with
such that
. (In fact, Popa’s result covers a more general situation in which one is working in a properly infinite
algebra with non-trivial centre.) We sketch a proof of this result as follows. Suppose that
and
for some
. A standard greedy algorithm argument (see this paper of Brown and Pearcy) allows one to find orthonormal vectors
for
such that for each
, one has
for some
comparable to
, and some
orthogonal to all of the
. After some conjugation (and a suitable identification of
with
, one can thus place
in a normal form
where is a isometry with infinite deficiency, and
have norm
. Setting
, it then suffices to solve the commutator equation
with ; note the similarity with (3).
By the usual Hilbert’s hotel construction, one can complement with another isometry
obeying the “Hilbert’s hotel” identity
and also ,
. Proceeding as in the previous post, we can try the ansatz
for some operators , leading to the system of equations
Using the first equation to solve for , the second to then solve for
, and the third to then solve for
, one can obtain matrices
with the required properties.
Thus far, my attempts to extend this construction to larger matrices with good bounds on have been unsuccessful. A model problem would be to express
as a commutator with
significantly smaller than
. The construction in my paper achieves something like this, but with
replaced by a more complicated operator. One would also need variants of this result in which one is allowed to perturb the above operator by an arbitrary finite rank operator of bounded operator norm.
5 comments
Comments feed for this article
30 May, 2018 at 9:08 am
Anonymous
Can the implied constant in (4) be made explicit ?
30 May, 2018 at 12:05 pm
Terence Tao
Yes, it is something like
or so if one works through all the computations, though I did not attempt to optimise it.
30 May, 2018 at 1:22 pm
Peter Tobler
“Nevertheless I believe it plausible that the lower bound (2) is close to” seems like an unfinished sentence. Just wondering what should follow ‘to’.
[Corrected, thanks – T.]
1 June, 2018 at 7:58 am
Andriy
1). “exponent {16} replaced by a different constant”.
I offer to replace it by “17”.
2). Tao, if you can’t find the solution of this problem, don’t ask other people to find it, because nobody is smarter (nowadays) than you. This task may led some mathematician to the mental hospital.
3). For shure, if I ask about those matrix my former college math teacher, I will take a revenge for sheering me in front of a class.
5 June, 2018 at 9:16 am
Sergei Ofitserov
Dear Terence Tao! SLE- this knot of all problems. Here evident show two roads.1.We agree with given situation,and get back at previous positon.2.Vice versa,we find methods of motion ahead. What you larger prefer? I am consider, what hexagonal percolation and loop-erased-this no going out from position. Be in existence some”weaving machine”,which have”mechanism”of retrieval and loop-reconstruction. Barely essentially to make choice: Schramm SLE, Smirnov,or”weaver”? Thanks. Sergei.