Macaulay2 » Documentation
Packages » LieAlgebraRepresentations :: deGraafRepresentation
next | previous | forward | backward | up | index | toc

deGraafRepresentation -- compute the representation with the specified highest weight using de Graaf's algorithm

Description

Let $V$ be an irreducible $\mathfrak{g}$-module with highest weight $\lamdba$. Then $V$ may be constructed as follows. Let $U(\mathfrak{g})$ be the universal enveloping algebra of $\mathfrak{g}$ (see universalEnvelopingAlgebra. Let $A(\lambda)$ be the (infinite-dimensional) Verma module $U(\mathfrak{g})/J$, where $J$ is the left ideal $\{ x_1,\ldots,x_l,h_1-\lambda(H_1),\ldots,h_n-\lambda(H_n)\rangle$. Then $V \cong A(\lambda)/I$, and the action of $X \in \mathfrak{g}$ on elements of the basis of $U(N^{-})/I$ is left multiplication.

We cannot implement the algorithm outlined above in a naive way because the AssociativeAlgebras package does not currently support quotients of quotients of free algebras. Instead, following de Graaf, we exploit the isomorphism $A(\lambda) \cong U(N^{-})$, and proceed as follows.

$\quad$ 1. We create $U(\mathfrak{g})$ and $U(N^{-})$ (see universalEnvelopingAlgebra and uNminus)

$\quad$ 2. We compute the Gröbner basis $G$ of $I$, and a basis of the quotient $U(N^{-})/I$ (see deGraafBases)

$\quad$ 3. For each $X$ in a basis of $\mathfrak{g}$, and each $B_i$ in de Graaf's basis of $V$:

$\quad$$\quad$ a. Multiply $X.B_i$ in $U(\mathfrak{g})$

$\quad$$\quad$ b. Map this to $U(N^{-})$ under the map sending $x_i \mapsto 0$ and $h_i \mapsto h_i-\lambda(h_i)$

$\quad$$\quad$ c. At top level, we reduce by $I$ in $U(N^{-})$.

$\quad$ This gives the action of $X$ on de Graaf's basis of $V$. We extract the coefficients to build the matrix.

i1 : g = simpleLieAlgebra("A",2);
i2 : lambda = {1,1}

o2 = {1, 1}

o2 : List
i3 : deGraafRepresentation(lambda,g)
Warning:  F4 Algorithm not available over current coefficient ring or inhomogeneous ideal.
Converting to Naive algorithm.
Warning:  F4 Algorithm not available over current coefficient ring or inhomogeneous ideal.
Converting to Naive algorithm.
max-lev=6
Finished level 1. {#G,#B}={0, 3}
Finished level 2. {#G,#B}={2, 5}
Finished level 3. {#G,#B}={2, 7}
Finished level 4. {#G,#B}={3, 8}
Finished level 5. {#G,#B}={5, 8}
Finished level 6. {#G,#B}={6, 8}
Compute rho(B_0)
Compute rho(B_1)
Compute rho(B_2)
Compute rho(B_3)
Compute rho(B_4)
Compute rho(B_5)
Compute rho(B_6)
Compute rho(B_7)

o3 = LieAlgebraRepresentation{"Basis" => Enhanced basis of g                                                                                                                                                                                         }
                              "Module" => LL   (g)
                                            1,1
                              "RepresentationMatrices" => {| 1 0  0 0 0 0  0 0  |, | 1 0 0  0 0 0 0  0  |, | 0 1 0 0  0 0  0 0  |, | 0 0 1 0 0 0 0 0 |, | 0 0 0 2 -1 0 0 0 |, | 0 0 0 0 0  0 0    0 |, | 0 0 0 0 0 0   0 0 |, | 0 0 0 0 0    0 0 0 |}
                                                           | 0 -1 0 0 0 0  0 0  |  | 0 2 0  0 0 0 0  0  |  | 0 0 0 0  0 0  0 0  |  | 0 0 0 1 1 0 0 0 |  | 0 0 0 0 0  1 0 0 |  | 1 0 0 0 0  0 0    0 |  | 0 0 0 0 0 0   0 0 |  | 0 0 0 0 0    0 0 0 |
                                                           | 0 0  2 0 0 0  0 0  |  | 0 0 -1 0 0 0 0  0  |  | 0 0 0 -1 2 0  0 0  |  | 0 0 0 0 0 0 0 0 |  | 0 0 0 0 0  0 1 0 |  | 0 0 0 0 0  0 0    0 |  | 1 0 0 0 0 0   0 0 |  | 0 0 0 0 0    0 0 0 |
                                                           | 0 0  0 0 0 0  0 0  |  | 0 0 0  0 0 0 0  0  |  | 0 0 0 0  0 0  0 0  |  | 0 0 0 0 0 0 1 0 |  | 0 0 0 0 0  0 0 2 |  | 0 0 0 0 0  0 0    0 |  | 0 1 0 0 0 0   0 0 |  | 1 0 0 0 0    0 0 0 |
                                                           | 0 0  0 0 0 0  0 0  |  | 0 0 0  0 0 0 0  0  |  | 0 0 0 0  0 -1 0 0  |  | 0 0 0 0 0 0 1 0 |  | 0 0 0 0 0  0 0 0 |  | 0 0 1 0 0  0 0    0 |  | 0 1 0 0 0 0   0 0 |  | 0 0 0 0 0    0 0 0 |
                                                           | 0 0  0 0 0 -2 0 0  |  | 0 0 0  0 0 1 0  0  |  | 0 0 0 0  0 0  0 0  |  | 0 0 0 0 0 0 0 2 |  | 0 0 0 0 0  0 0 0 |  | 0 0 0 1 -2 0 0    0 |  | 0 0 0 0 0 0   0 0 |  | 0 1 0 0 0    0 0 0 |
                                                           | 0 0  0 0 0 0  1 0  |  | 0 0 0  0 0 0 -2 0  |  | 0 0 0 0  0 0  0 -2 |  | 0 0 0 0 0 0 0 0 |  | 0 0 0 0 0  0 0 0 |  | 0 0 0 0 0  0 0    0 |  | 0 0 0 1 1 0   0 0 |  | 0 0 1 0 0    0 0 0 |
                                                           | 0 0  0 0 0 0  0 -1 |  | 0 0 0  0 0 0 0  -1 |  | 0 0 0 0  0 0  0 0  |  | 0 0 0 0 0 0 0 0 |  | 0 0 0 0 0  0 0 0 |  | 0 0 0 0 0  0 -1/2 0 |  | 0 0 0 0 0 1/2 0 0 |  | 0 0 0 1 -1/2 0 0 0 |

o3 : LieAlgebraRepresentation

Ways to use deGraafRepresentation:

  • deGraafRepresentation(List,LieAlgebra)

For the programmer

The object deGraafRepresentation is a method function.


The source of this document is in LieAlgebraRepresentations/documentation.m2:2124:0.