Let $A$ be a matrix of $n\times n$ with rank $1$. I need to prove that $A^2=\text{tr}(A)A$, without using eigenvalues.
2026-04-02 20:11:34.1775160694
On
Prove that $A^2=\text{tr}(A)A$ where $A$ is $n\times n$ matrix of rank $1$
959 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
1
On
Since $\text{rank}(A) = 1$, it has eigenvalue $0$ with multiplicity of $n-1$ and the other eigenvalue $\text{tr}A$ (because the sum of eigenvalues is equal to the trace).
Therefore, $$p(x) = (x-\text{tr}A)x^{n-1}$$ where $p(x)$ is the characteristic polynomial of $A$. Now, observe that the minimal polynomial of $A$ divides $(x-\text{tr}A)x$, and thus, $$(A - \text{tr}A)A = 0 \implies\boxed{A^2 = \text{tr}A \cdot A}$$
A matrix of rank $1$ $A$ can be written as $UV^T$ with $U,V\in \mathbb{K}^n$ two column vectors.
So $AA = UV^T\cdot UV^T = U(V^TU)V^T=U(\text{tr}A)V^T = (\text{tr} A) A$.