Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am reading a paper on Hilbert space operators, in which the authors used a surprising result

Every $X\in\mathcal{B}(\mathcal{H})$ is a finite linear combination of orthogonal projections.

The author referred to a 1967 paper by Fillmore, Sums of operators of square zero. However, this paper is not online.

I wonder whether someone has a hint on how this could be true since there are all kinds of operators while projections have such a regular and restricted form.

Thanks!

share|improve this question
1  
The mathscinet article says summary that "(...)every operator on a separable infinite-dimensional Hilbert space is (1) a sum of 64 operators with square zero and (2) a linear combination of 257 projections.". I think it's probably important that it is a separable space. Makes you wonder how did they exactly count the 257 projections. ;) –  tomasz Jun 24 '12 at 0:48
1  
@tomasz: You can generalize from the separable case to the infinite dimensional case by writing $\mathcal{H}$ as an orthogonal sum of separable $X$-invariant subspaces. For self-adjoint operators, this won't increase the number of projections needed. As every operator is a sum of self-adjoint ones, this allows the separability condition to be removed. –  George Lowther Jun 24 '12 at 1:58
2  
The number 257 was improved to 10 by Matsumoto 30 years ago. See this paper by Laurent Marcoux: math.uwaterloo.ca/~lwmarcou/Preprints/Mar2009Projections.pdf –  Martin Argerami Jun 24 '12 at 8:41
add comment

1 Answer

up vote 4 down vote accepted

I believe the answers you're looking for can be found in a paper by Pearcy and Topping, Sums of small numbers of idempotents., which is openly accessible.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.