Computational proof showing $sl(n,\mathbb{C})$ is simple?

Question

Showing that $sl(n,\mathbb{C})$ is simple has been asked a few times here, and people are saying that there are some computational ways of proving this and some that are a bit more conceptual. People have provided links to certain proofs by Po-Lam Yung Crystal Hoyt that are more conceptual, but I can't find any references for a more direct computational approach. I would like to see such.

Can somebody give me a free reference? I'm poor$$

score 0 · Accepted Answer · answered Sep 23 '20 at 19:05

See the computational proof by Po-Lam Yung here, or at these MSE posts:

How to prove that $\mathfrak{sl}(n,\Bbb C)$ is a simple Lie algebra for $n\ge 2$?

How to show that $\mathfrak{sl}_n(\mathbb{R})$ and $\mathfrak{sl}_n(\mathbb{C})$ are simple?

Both is for $0$ USD.

Computational proof showing $sl(n,\mathbb{C})$ is simple?

1 Answers1