a + b + c + d + e | = -1 | |
a2 + b2 + c2 + d2 + e2 | = 15 | |
1/a + 1/b + 1/c + 1/d + 1/e | = -1 | |
1/a2 +1/b2 +1/c2 +1/d2 +1/e2 | = 15 | |
abcde | = -1 |
tr( | ( |
|
) | ) = a + d) |
Suppose {A1, A2, A3} is closed under matrix multiplication (i.e. given i, j, there exists k such that AiAj = Ak), and tr(A1 + A2 + A3)≠3. Prove that there exists i such that AiAj = AjAi for all j (here i, j are 1, 2 or 3).