I am looking for an algorithmic way to find 2-dimensional sub-algebras of an algebra with commutator relations \begin{align} [X_1, X_2]=-X_3 \end{align} \begin{align} [X_1, X_3] = -X_2 \end{align} \begin{align} [X_2, X_3]= X_1 \end{align}
2026-04-06 08:02:24.1775462544
Algorithmic way to find 2 dimensional sub algebras
27 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
Here is one way to think about it. Let $Y_1, Y_2$ be a basis of such a subalgebra. We can write $Y_1 = aX_1 + bX_2 + cX_3$. Our goal is to find $a, b, c$. One thing we know is that we can write down the matrix $ad(Y_1)$ w.r.t the standard basis $X_1, X_2, X_3$: it some 3-times-3-matrix with some appearances of $a, b$ and $c$ and a lot of $0$s.
Now $ad(Y_1)$ maps the vector $Y_2$ to some linear combination $pY_1 + qY_2$. We may assume that $q = 1$: it would be 1 when we had been lucky and had picked $(1/q)Y_1$ instead of $Y_1$, but since $Y_1$ is still an 'abstract' basis vector we may in fact assume that we have picked that vector as our $Y_1$.
So in short: $Y_2$ is an element of the kernel of the matrix $ad(Y_1) - I$ where $I$ is the $3\times3$-identity matrix. So an algorihm would be:
Step 5 is a bit vague, admittedly. Here is a better way:
3' Pick one choice of $a, b, c$ satisfying the conditions found in 2 and compute all subalgebras containing the resulting vector $Y_1$ as in 3 above
4' express the condition 'Y_1' does not lie in any of the subalgebras generated in the previous step as a further condition on a, b, c
5' Repeat steps 3 and 4 with the ever increasing list of conditions on $a, b, c$ until no new subalgebras can be found. No guarantee that this loop will ever stop, though!