Free Lie algebra

From formulasearchengine
Jump to navigation Jump to search

In mathematics, a free Lie algebra, over a given field K, is a Lie algebra generated by a set X, without any imposed relations.

Definition

Free lie.png
Let X be a set and i: XL a morphism of sets from X into a Lie algebra L. The Lie algebra L is called free on X if for any Lie algebra A with a morphism of sets f: XA, there is a unique Lie algebra morphism g: LA such that f = g o i.

Given a set X, one can show that there exists a unique free Lie algebra L(X) generated by X.

In the language of category theory, the functor sending a set X to the Lie algebra generated by X is the free functor from the category of sets to the category of Lie algebras. That is, it is left adjoint to the forgetful functor.

The free Lie algebra on a set X is naturally graded. The 0-graded component of the free Lie algebra is just the free vector space on that set.

One can alternatively define a free Lie algebra on a vector space V as left adjoint to the forgetful functor from Lie algebras over a field K to vector spaces over the field K – forgetting the Lie algebra structure, but remembering the vector space structure.

Universal enveloping algebra

The universal enveloping algebra of a free Lie algebra on a set X is the free associative algebra generated by X. By the Poincaré–Birkhoff–Witt theorem it is the "same size" as the symmetric algebra of the free Lie algebra (meaning that if both sides are graded by giving elements of X degree 1 then they are isomorphic as graded vector spaces). This can be used to describe the dimension of the piece of the free Lie algebra of any given degree.

Witt showed that the number of basic commutators of degree k in the free Lie algebra on an m-element set is given by the necklace polynomial:

where is the Möbius function.

The graded dual of the universal enveloping algebra of a free Lie algebra on a finite set is the shuffle algebra.

Hall sets

An explicit basis of the free Lie algebra can be given in terms of a Hall set, which is a particular kind of subset inside the free magma on X. Elements of the free magma are binary trees, with their leaves labelled by elements of X. Hall sets were introduced by Template:Harvs based on work of Philip Hall on groups. Subsequently Wilhelm Magnus showed that they arise as the graded Lie algebra associated with the filtration on a free group given by the lower central series. This correspondence was motivated by commutator identities in group theory due to Philip Hall and Ernst Witt.

Lyndon basis

In particular there is a basis of the free Lie algebra corresponding to Lyndon words, called the Lyndon basis. (This is also called the Chen–Fox–Lyndon basis or the Lyndon–Shirshov basis, and is essentially the same as the Shirshov basis.) There is a bijection γ from the Lyndon words in an ordered alphabet to a basis of the free Lie algebra on this alphabet defined as follows.

  • If a word w has length 1 then γ(w)=w (considered as a generator of the free Lie algebra).
  • If w has length at least 2, then write w=uv for Lyndon words u, v with v as long as possible (the "standard factorisation"[1]). Then γ(w) = [γ(u),γ(v)]

Shirshov–Witt theorem

Template:Harvs and Template:Harvs showed that any Lie subalgebra of a free Lie algebra is itself a free Lie algebra.

Applications

The Milnor invariants of the link group are related to the free Lie algebra, as discussed in that article.

See also

References

  1. {{#invoke:citation/CS1|citation |CitationClass=citation }}
  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • N. Bourbaki, "Lie Groups and Lie Algebras", Chapter II: Free Lie Algebras, Springer, 1989. ISBN 0-387-50218-1
  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • W. Magnus, A. Karrass, D. Solitar, "Combinatorial group theory". Reprint of the 1976 second edition, Dover, 2004. ISBN 0-486-43830-9
  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

|CitationClass=citation }}

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}