2
$\begingroup$

Proof that there exists non-zero elements $x, y$ in a solvable Lie algebra $g$ such that $[y,x]=x$. I have seen an answer from a lecture notes on google, but I can't find it now. Anyway, can someone give a more insight proof? Note that you can't use Lie's theorem for solvable Lie algebra $g$ over complex numbers which says a representation of $g$ contains a common eigenvector because our solvable Lie algebra is a general one(over any field say real numbers).

remark: YOU can use the fact that $g$ is solvable if only if it's derived algebra $[g,g]$ is nolptent. (this is ture for real Lie algebras!)

  • 0
    You are wright,consider the non-abelian one.2011-12-26

1 Answers 1

6

$\newcommand\ad{\operatorname{ad}}\newcommand\g{\mathfrak g}$Notice that this cannot happen in a nilpotent Lie algebra, so you need to exclude all of them, not just the abelian ones. So let's show that

a non-nilpotent Lie algebra $\g$ contains elements $x$, $y$ such that $[x,y]=y$.

Now, if $\g$ is not nilpotent, Engel's theorem tells us that there is an $x\in\g$ such that the map $\ad(x):y\in\g\mapsto[x,y]\in\g$ is not nilpotent. In particular, there exists an $x\in\g$ such that $0$ is not the only eigenvalue of $\ad(x)$. Fix that $x$, and let $\lambda\in\mathbb C$ be a non-zero eigenvalue of $\ad(x)$ and let $y\in g$ be an eigenvector of $\ad(x)$ for the eigenvalue $\lambda$. The pair of elements x'=\lambda^{-1}x, $y$ are then such that [x',y]=y.

I did not need to assume the algebra is solvable, by the way.

  • 0
    That's the way we $d$o it in $p$roving Lie's theorem, but it is not true for re$a$l Lie $a$lgebras.2011-12-26