The Setting
Take a C-algebra of real rank zero and a projection of . Does the corner again have real rank zero? And given finitely many elements of and a tolerance , can be cut into finitely many orthogonal pieces so that each , compressed to each piece, is a scalar multiple of up to ? The elements need not commute with one another or with .
Real Rank Zero, Corners and Partitions
A C-algebra has real rank zero, written , when for every self-adjoint element of and every there is a self-adjoint element of with (1)✦
For a projection of , the corner of at is the set (2)✦ The corner algebra of at is the C-algebra whose underlying set is (2), with the operations and the norm of and with unit .✦
A projection partition of a projection of is a finite family of projections of with (3)✦
The Claim
Theorem 1. Let be a C-algebra of real rank zero and a projection of .
(i) The corner algebra has real rank zero: (4)✦
(ii) Let be a finite subset of and . There is a projection partition of such that for every and every there is a scalar with within in norm of the multiple of : (5)✦
(iii) Let be a finite set of self-adjoint elements of and . There is a projection partition of such that for every and every there is a scalar with within in norm of the multiple of : (6)✦
In the paper, the result reads: for of real rank zero, every corner at a projection has real rank zero, and given a projection , a finite set and , there are nonzero orthogonal projections with sum , the family being empty when , such that for every and every .
What Is Checked
The claim is stated over a C-algebra of real rank zero as in (1), a projection of with its corner algebra on the set (2), and projection partitions of as in (3), for a finite subset of in (5) and a finite set of self-adjoint elements in (6).
Of the corner, the library proves that the set of (2) contains and is closed under sums, products, complex scalar multiples and adjoints: it is a -subalgebra of , the corner subalgebra.✦