I know that this has a proof at Relation between $T=0$ and $(Tx,x)=0$ (and some other questions) but my question is specifically about how to prove this by contradiction rather than directly. (I thought it would be easier this way, but I'm really struggling to come up with a proof).
The exact statement I'm trying to prove is this: let $V$ be a vector space, and $T : V \to V$ a linear transformation. Assume that thist vector space is over the field $\mathbb{C}$, then prove that if $\forall x\Big(\langle x, T(x)\rangle = 0 \Big)$, then $T = 0$.
I started like this
- Assume that the statement is false, then it must be that $\langle x, T(x) \rangle = 0$ and $T \ne T_0$.
- Therefore, there exists $a, b \in V$ such that $b = T(a)$ and $a \ne 0$ and $b \ne 0$. By assumption we have that $\langle a, b \rangle = 0$. From here I think I should try to show that $b=0$, and the fact that this is over a complex field must be important (as the statement is false if we are working over a real field). Unfortunately I got really stuck here. I thought about trying to express $a$ in terms of something like $x + iy$ (for some vectors $x, y$ both with real coordinates) and then to write $b = T(x + iy)$, so that we have
$$ \begin{align} \langle x + iy, T(x + iy) \rangle &= \langle x, T(x) \rangle + \overline{i} \langle x, T(y) \rangle + i \langle y, T(x) \rangle + i \overline{i} \langle y, T(y) \rangle \\ &= 0 + \overline{i} \langle x, T(y) \rangle + i \langle y, T(x) \rangle + 0 \\ &= i\left(- \langle x, T(y) \rangle + \langle y, T(x) \rangle \right) \end{align} $$
- And this must be equal to zero, therefore $- \langle x, T(y) \rangle + \langle y, T(x) \rangle = 0$, that is $\langle x, T(y) \rangle = \langle y, T(x) \rangle$ but I have no idea what to do with this.
Any help would be much appreciated (sorry for the mess).