Consider $M_n(\Bbb C)$, the vector space of matrices taking entries from $\Bbb C$, for $n \ge 2$. We know that the collection of upper triangular matrices in $M_n(\Bbb C)$ forms a subspace of $M_n(\Bbb C)$. Additionally, if we start with two upper triangular matrices $A,B \in M_n(\Bbb C)$, then the commutator $AB-BA$ is strictly upper triangular.
I believe the converse is true, i.e., given a strictly upper triangular matrix $T \in M_n(\Bbb C)$, we can find two upper triangular matrices $A,B \in M_n(\Bbb C)$ such that $T = AB - BA$.
I have thought of some examples (as follows) where this can be done, but I have not yet written a proof that takes care of all cases.
If $T = 0$, then any two commuting matrices $A,B \in M_n(\Bbb C)$ will do. In fact, we can just pick $A,B$ to be any two diagonal matrices. This already tells us that the choice of $A,B$ need not be unique.
One of the simpler cases to consider is $n = 2$. If $A_1 = \left(\begin{matrix} p_1 & q_1\\ 0 & r_1 \end{matrix}\right)$ and $A_2 = \left(\begin{matrix} p_2 & q_2\\ 0 & r_2 \end{matrix}\right)$, then $$A_1A_2 - A_2A_1 = \left(\begin{matrix} 0 & p_1q_2 + q_1r_2-p_2q_1-q_2r_1\\ 0 & 0 \end{matrix}\right)$$ Given a strictly upper triangular matrix $T = \left(\begin{matrix} 0 & \lambda \\ 0 & 0 \end{matrix}\right)$, we need to solve $$p_1q_2 + q_1r_2-p_2q_1-q_2r_1 = \lambda,$$ i.e., one equation in eight variables. This system is overdetermined, so we can pick values of $p_1, p_2, \ldots$, etc. that solve the equation. There are infinitely many solutions!
To repeat the same process for $M_n(\Bbb C)$ is cumbersome, and I'm hoping a proof by induction of some sort might do the trick. Thank you!