No. LetHere's a quick test which might disprove your hopes very quickly:
Take $y$$n$ to be small: Try $2$ first, and $5$ is probably near the limit of a computer algebra system. Choose $x$ to be a random $n \times n$ diagonal matrix with entriesdeterminant $d_i$$1$, for example, $\mathrm{diag}(17, 1/17)$. Then $$[x,y,y]_{ij} = (d_i-d_j)^2 x_{ij}.$$ In particularWrite out your relation, letleaving all the elements of $y = \mathrm{diag}(1,2,3,4,\ldots,n)$$y$ as variables. ChooseAfter clearing denominators, you have $x_{ij}$ to be zero if$n^2$ simultaneuous homogenous equations in $|i-j| \neq 1$, and to be arbitrary otherwise$n^2$ variables. Then $[x,y,y]=x$(If I haven't made any dumb errors, they have degree $3n$. For generic values) Ask your favorite computer algebra system to solve them for you. If any of the $x_{i \ i \pm 1}$,roots are not on the matrixhypersurface $x$ is invertible but not unipotent.$\det y=0$, then you have a counterexample!