Processing math: 100%
Skip to main content
\expandafter\mathchardef\expandafterφ\number\expandafterϕ\expandafter\relax\expandafter\mathchardef\expandafterϕ\numberφ

Section3The Kadison theorem and some applications

We begin by using the tools developed in Section §2 to identify the integer ab in Kadison's theorem, that is, to prove Theorem 1.3.

As a first consequence of Kadison's theorem and of the work in Section §2, we observe that if the diagonal of a projection p clusters sufficiently fast around 0 and 1 (that is, if a+b<, or, equivalently, if pqL2), then one can “read” from the diagonal the essential codimension [p:q]. But what if a+b=?

If a= and b<, from q(pq)qL1 we can deduce that pq is finite and sL2, and hence from q(pq)qL1 it follows that pq is infinite. Similarly, if a< and b= then pq is infinite. In either case (p,q) is not a Fredholm pair and in particular, pqK.

Less trivial is the case when a=b= and pqKL2, as we see from the following proposition. We first need to introduce some notation. Next, given two sequences ξ and η of non-negative numbers converging to 0, with ξ and η their monotone non-increasing rearrangements, we say that ξ is majorized by η (ξη) if nj=1ξjnj=1ηj for all n.

As a second application of Theorem 1.3 and of the techniques used to prove it, we will consider a recent work by Bownik and Jasper [6]. Based on Kadison's characterization of diagonals of projections, Bownik and Jasper characterized the diagonals of selfadjoint operators with finite spectrum and in a key part of their analysis they too encountered an index obstruction similar to the one in Theorem 1.1 (ii). Following their notations, if zB(H) is a selfadjoint operator with finite spectrum we let σ(z)={aj}n+rj=m and pj=χ{aj}(z) be the spectral projection corresponding to the eigenvalue aj, so that

z=n+rj=majpj.

For ease of notations perform if necessary a transformation so to have

Tr(pj)< for j<0 and j>n+1,a0=0, and an+1=1.

Let {en} be an orthonormal basis, {dn} be the diagonal of z with respect to that basis and let as in Theorem 1.1,

a=dn1/2dnandb=dn>1/2(1dn),

Then their Theorem 4.1, which is a key component of the necessity part of their characterization, states that

Here of course we use the convention that 0=0 and so a0Tr(p0)=0 whether Tr(p0) is finite or not.

We will present an independent proof of this result and at the same time identify the integer in (ii) proving that if we set q as in Theorem 1.1 to be the projection on ¯span{ej dj>1/2}, then

abjn+1ajTr(pj)=[pn+1:q].

First we need an extension to positive elements of the equivalence of (i) and (ii) in Proposition 2.8.

Notice that if J is not idempotent and kJ1/2+J is a positive contraction, then x:=1k and q:=1 satisfy both hypotheses of Lemma 3.3 (ii) but k=qqxqJ.

Now we can proceed with the proof of Theorem 3.2 and ((3.1)).