If $e_1,\cdots,e_n \in M_{4\times 4}(\mathbb{C})$ are $n$ distinct, nonzero, $4\times 4$ matrices with complex entries that satisfy $e_ie_j = e_je_i = 0$ and $e_i^2 = e_i$ for all $1\leq i \leq n$, then I want to show that $n \leq 4$.
My initial instinct was to look at the Jordan Canonical forms of the matrices $e_i$, and note that the minimal polynomial of $e_i$ must divide $x^2-x$, and hence must be $x,(x-1)$ or $x(x-1)$. The minimal polynomial can't be $x$ (since the $e_i$'s were assumed nonzero) and it can't be $x-1$, since then $e_i$ is the identity matrix which is only orthogonal to the zero matrix. Thus, then minimal polynomial of $e_i$ is $x(x-1)$, and the invariant factor decomposition of $e_i$ must be one of \begin{align*} &(x,x,x(x-1)) &(x-1,x-1,x(x-1))& &(x(x-1),x(x-1)). \end{align*} However, at this point I realized that this method does not seem to be on the right track, since there is no reason why the $e_i$'s shouldn't be similar, so knowing their JCF doesn't seem to help me reason why the total number of such matrices should be less than $4$.
Any thoughts or hints would be greatly appreciated.
By this minimal polynomial condition we see that $e_1$ is diagonalizable, so there's a basis in which $$e_1=\begin{bmatrix}I_d & 0 \\ 0 & 0\end{bmatrix}$$ for some $1\leq d\leq 4$. Now we want to use trivial product relations and this basis to analyse the remaining matrices.
Continue for spoiler: