| |
| | [No title] (Site not responding. Last check: 2007-10-13) |
 | | A Lie (super)algebra can admit more than one grading, for example, the free Lie (super)algebra on $n$ generators admits a {\bf Z}$_2$-grading, but also admits the length of ``words'' as a grading, or a multigrading where the degree of $x_i$ is the $n$-tuple $(0,\dots,1,\dots,0)$ (1 on the $i$-th place). |
 | | If $\lie$ is a liebracket, these commutators are $\lie(i,i)=0$ for all $i>0$ (this follows directly from the (graded) skew-symmetry and the fact that $x(i)$ is even for $i>0$), $\lie(i,0)$ for $i=-n,\dots,-1$ and $\lie(0,i)$ for $i=0,\dots,m$ (this has been explained in one of the previous sections). |
 | | The most convenient way to implement this is by making a Lie (super)algebra generator a rtype of itself, algebra_generator, and assigning a set-element-function and a clear function to it, which take care of all the necessary actions. |
| www.math.utah.edu:8080 /ftp/pub/mirrors/ctan.tug.org/tex-archive/web/reduce/rweb/appl/liesuper.web (17015 words) |
|