Showing a mapping between lie algebras is bijective

Click For Summary

Homework Help Overview

The discussion revolves around demonstrating the bijectiveness of a mapping between two Lie algebras, specifically from the Lie algebra \(\mathfrak{g}\) with basis vectors \(E, F, G\) to the Lie algebra \(\mathfrak{h}\) consisting of specific \(3 \times 3\) matrices. Participants are tasked with showing that the defined map \(\varphi\) is both injective and surjective.

Discussion Character

  • Conceptual clarification, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants explore the injectiveness of the mapping by examining the kernel of \(\varphi\) and questioning whether proving it leads to the conclusion of being one-to-one. There is also a discussion on how to explicitly show that the mapping is onto, with suggestions regarding the linear independence of images of basis vectors.

Discussion Status

The discussion is active, with participants providing insights into the injectiveness of the mapping and questioning the sufficiency of their arguments for surjectiveness. There is no explicit consensus yet, but productive lines of reasoning are being explored.

Contextual Notes

Participants are working under the constraints of homework guidelines, which may limit the depth of exploration or the use of external resources. The definitions and properties of Lie algebras and their mappings are central to the discussion.

Ted123
Messages
428
Reaction score
0

Homework Statement



Show the map \varphi : \mathfrak{g} \to \mathfrak{h} defined by

\varphi (aE + bF + cG) = \begin{bmatrix} 0 & a & c \\ 0 & 0 & b \\ 0 & 0 & 0 \end{bmatrix}

is bijective.

\mathfrak{g} is the Lie algebra with basis vectors E,F,G such that the following relations for Lie brackets are satisfied:

[E,F]=G,\;\;[E,G]=0,\;\;[F,G]=0.

\mathfrak{h} is the Lie algebra consisting of 3x3 matrices of the form

\begin{bmatrix} 0 & a & c \\ 0 & 0 & b \\ 0 & 0 & 0 \end{bmatrix} where a,b,c are any complex numbers. The vector addition and scalar multiplication on \mathfrak{h} are the usual operations on matrices.

The Lie bracket on \mathfrak{h} is defined as the matrix commutator: [X,Y] = XY - YX for any X,Y \in \mathfrak{h}.

The Attempt at a Solution



For showing \varphi is 1-1 (injective) is this proof OK:

Letting x = aE+bF+cG \in \mathfrak{g} and y = a'E+b'F+c'G \in \mathfrak{g},

\varphi (x) = \varphi (y) \Rightarrow \begin{bmatrix} 0 & a & c \\ 0 & 0 & b \\ 0 & 0 & 0 \end{bmatrix} = \begin{bmatrix} 0 & a' & c' \\ 0 & 0 & b' \\ 0 & 0 & 0 \end{bmatrix}

\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\, \Rightarrow aE +bF+cG = a'E + b'F + c'G [i.e. x=y]

And \varphi is onto (surjective) since \text{Im}(\varphi) = \mathfrak{h} - how do you explictly show this?
 
Last edited:
Physics news on Phys.org
It is sufficient to show that the kernel of \phi is just the 0 vector. That is, if
\phi(x)= \begin{bmatrix}0 & a & c \\ 0 & 0 & b \\ 0 & 0 & 0\end{bmatrix}= \begin{bmatrix}0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0\end{bmatrix}
then a= b= c= 0.
 
HallsofIvy said:
It is sufficient to show that the kernel of \phi is just the 0 vector. That is, if
\phi(x)= \begin{bmatrix}0 & a & c \\ 0 & 0 & b \\ 0 & 0 & 0\end{bmatrix}= \begin{bmatrix}0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0\end{bmatrix}
then a= b= c= 0.

Is that for 1-1 or onto?

Doesn't \begin{bmatrix}0 & a & c \\ 0 & 0 & b \\ 0 & 0 & 0\end{bmatrix}= \begin{bmatrix}0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0\end{bmatrix} \Rightarrow a= b= c= 0\;? (just from looking at it)

From linear algebra that proves phi is 1-1. How about onto?
 
To give a reason why \varphi is surjective, can I just say that the images of any 2 of the basis vectors in \mathfrak{g} are clearly linearly independent, hence the image of \mathfrak{g} is all of \mathfrak{h} ?
 

Similar threads

  • · Replies 45 ·
2
Replies
45
Views
6K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
2K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K