<p>A Lie ring <span class="SimpleMath">L</span> is a <span class="SimpleMath">Z</span>-module equipped with a multiplication, denoted by a bracket <span class="SimpleMath">[~,~]</span> with</p>
<ul>
<li><p><span class="SimpleMath">[x,x]=0</span> for all <span class="SimpleMath">x</span> in <span class="SimpleMath">L</span>,</p>
</li>
<li><p><span class="SimpleMath">[x,[y,z]]+[z,[x,y]]+[y,[z,x]]=0</span> for all <span class="SimpleMath">x,y,z</span> in <span class="SimpleMath">L</span>.</p>
</li>
</ul>
<p>Contrary to Lie algebras (which are defined over a field), Lie rings may have torsion elements, i.e., elements <span class="SimpleMath">x ≠ 0</span> such that <span class="SimpleMath">mx=0</span> for some <span class="SimpleMath">m∈ Z</span>.</p>
<p>We say that a Lie ring is finite-dimensional if it is finitely-generated as abelian group. All functions of this package deal with finite-dimensional Lie rings.</p>
<p>Here is an example of a Lie ring <span class="SimpleMath">L</span> of order <span class="SimpleMath">5^6</span>. As abelian group <span class="SimpleMath">L</span> is generated by <span class="SimpleMath">x_1,x_2,x_3,x_4,x_5</span>. We have <span class="SimpleMath">5x_i=0</span> for <span class="SimpleMath">i=1,...,4</span>, and <span class="SimpleMath">25x_5=0</span>. Furthermore,</p>
<p>One of the main functions of this package constructs a Lie ring given by a multiplication table(as above) from a finite presentation. The Lie ring above can be obtained as follows.</p>
<h4>1.2 <span class="Heading">The free Lie ring </span></h4>
<p>Let <span class="SimpleMath">X</span> be a set of letters, which we denote by <span class="SimpleMath">x_1,...,x_n</span>. Then the free magma <span class="SimpleMath">M(X)</span> on <span class="SimpleMath">X</span> is defined to be the set of all bracketed expressions in the elements of <spanclass="SimpleMath">X</span>. More precisely, we have that <span class="SimpleMath">X</span> is a subset of <span class="SimpleMath">M(X)</span> and if <span class="SimpleMath">a,b∈ M(X)</span>, then also <span class="SimpleMath">(a,b)∈ M(X)</span>. The free magma has a natural binary operation <span class="SimpleMath">m</span> with <span class="SimpleMath">m(a,b) = (a,b)</span>.</p>
<p>The elements of the free magma have a degree which is defined as <span class="SimpleMath">deg(a,b) = deg(a)+deg(b)</span>. The degree of the elements of <span class="SimpleMath">X</span> can be set to be any positive integer. (Usually this is 1, but it is possible to use different degrees for the elements of <span class="SimpleMath">X</span>.)</p>
<p>Let <span class="SimpleMath">R</span> be a ring; then the free algebra <span class="SimpleMath">A_R(X)</span> on <span class="SimpleMath">X</span> over <span class="SimpleMath">R</span> is the <span class="SimpleMath">R</span>-span of <span class="SimpleMath">M(X)</span>. The product on <span class="SimpleMath">A_R(X)</span> is obtained by bilinearly extending the map <span class="SimpleMath">m</span>.</p>
<p>The elements of <span class="SimpleMath">M(X)</span> are called monomials of <span class="SimpleMath">A_R(X)</span>. We use the following ordering on them. The elements of <span class="SimpleMath">X</span> are ordered arbitrarily. Then <span class="SimpleMath">(a,b) < (c,d)</span> if <span class="SimpleMath">deg(a,b) < deg(c,d)</span>. If these two numbers are equal, then <span class="SimpleMath">(a,b) < (c,d)</span> if <span class="SimpleMath">a < c</span>, and in case <span class="SimpleMath">a=c</span>, if <span class="SimpleMath">b < d</span>. Using this ordering we can speak of leading monomial, and leading coefficient of an element of <span class="SimpleMath">A_R(X)</span>. Using these notions one can develop a Groebner basis theory for ideals in <span class="SimpleMath">A_R(X)</span> (see <a href="chapBib.html#biBcicgra1">[CdG07]</a> and <a href="chapBib.html#biBcicgra2">[CdG09]</a>).</p>
<p>Let <span class="SimpleMath">J</span> be the ideal of <span class="SimpleMath">A_R(X)</span> generated by all elements</p>
</li>
</ul>
<p>for <span class="SimpleMath">a,b,c∈ M(X)</span>. Set <span class="SimpleMath">L_R(X) = A_R(X)/J</span>, which is called the free Lie ring over <span class="SimpleMath">R</span> generated by <spanclass="SimpleMath">X</span>.</p>
<p>The free Lie ring is one of the central objects of this package. It can be defined over the integers, or over a field. The free Lie rings that can be constructed using this package rewrite their elements using anticommutativity. The Jacobi identity is not used for rewriting; this is because that would lead to expression swell, and sometimes tedious rewriting of elements to a form in which that can no longer be recognised. So, strictly speaking, we work with the free anticommutative algebra.</p>
<p>Using the Baker-Campbell-Hausdorff (or BCH) formula one can define an associative multiplication on a nilpotent Lie ring of order <span class="SimpleMath">p^n</span> and nilpotency class <span class="SimpleMath">< p</span>. This makes the Lie ring into a <span class="SimpleMath">p</span>-group of the same order and nilpotency class. The BCH-formula also has inverses, which can be used to define an addition and a Lie bracket on a <span class="SimpleMath">p</span>-group of class <spanclass="SimpleMath">< p</span>. These make the group into a Lie ring of the same order and nilpotency class.</p>
<p>These two operations are mutually inverse, and so define an equivalence of the categories of <span class="SimpleMath">p</span>-groups of class <span class="SimpleMath">< p</span> and nilpotent Lie rings of the same order and nilpotency class. This equivalence is known as the <em>Lazard correspondence</em> (see <a href="chapBib.html#biBkhukhro98">[Khu98]</a>). This package has functions for performing this correspondence, i.e., to make a <span class="SimpleMath">p</span>-group into a Lie ring and vice versa. For the algorithms used we refer to <a href="chapBib.html#biBcicgravl">[CdGVL11]</a>.</p>
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.