Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/GAP/pkg/qpa/doc/   (Algebra von RWTH Aachen Version 4.15.1©)  Datei vom 4.0.2024 mit Größe 160 kB image not shown  

SSL chap4.html   Sprache: HTML

 
 products/Sources/formale Sprachen/GAP/pkg/qpa/doc/chap4.html


<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (QPA) - Chapter 4: Path Algebras</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chap4"  onload="jscontent()">


<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chap8.html">8</a>  <a href="chap9.html">9</a>  <a href="chap10.html">10</a>  <a href="chap11.html">11</a>  <a href="chap12.html">12</a>  <a href="chap13.html">13</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap3.html">[Previous Chapter]</a>    <a href="chap5.html">[Next Chapter]</a>   </div>

<p id="mathjaxlink" class="pcenter"><a href="chap4_mj.html">[MathJax on]</a></p>
<p><a id="X7E8A43A484CE0BA8" name="X7E8A43A484CE0BA8"></a></p>
<div class="ChapSects"><a href="chap4.html#X7E8A43A484CE0BA8">4 <span class="Heading">Path Algebras</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7DFB63A97E67C0A1">4.1 <span class="Heading">Introduction</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X848A225A84A15B1E">4.2 <span class="Heading">Constructing Path Algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7CA1C87B8202C2E9">4.2-1 PathAlgebra</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X85A3A8767E7C11AD">4.3 <span class="Heading">Categories and Properties of Path Algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8255FDF78315E1B3">4.3-1 IsPathAlgebra</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7DE2F2A48492041A">4.4 <span class="Heading">Attributes and Operations for Path Algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7DF51D297E0E6A8B">4.4-1 AssociatedMonomialAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X83FBA499856580B0">4.4-2 QuiverOfPathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8279084B828E5FD7">4.4-3 OrderingOfAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X86CDD46F7F05ADE9">4.4-4 .</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7CEF60107CE4616B">4.5 <span class="Heading">Operations on Path Algebra Elements</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X841C00E87E19528E">4.5-1 ElementOfPathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7E3FAB1F803E26FF">4.5-2 <</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X853C8B0B8665BFBB">4.5-3 IsLeftUniform</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7C06BE7483992634">4.5-4 IsRightUniform</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8735FBE180797557">4.5-5 IsUniform</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X84C98E687A3A84D8">4.5-6 LeadingTerm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X80710E9B7D8340BD">4.5-7 LeadingCoefficient</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7B3EAE41795598A5">4.5-8 LeadingMonomial</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8172B40181E1B7D2">4.5-9 MakeUniformOnRight</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X796249A682818750">4.5-10 MappedExpression</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7D6DDDF178B0F2D9">4.5-11 SupportOfQuiverAlgebraElement</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X849AC0F67A131929">4.5-12 VertexPosition</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X86795D8E7ED73048">4.5-13 RelationsOfAlgebra</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7F0D555379C97A6E">4.6 <span class="Heading">Constructing Quotients of Path Algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X814203E281F3272E">4.6-1 AssignGeneratorVariables</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X812C0F8D7E4B1134">4.7 <span class="Heading">Ideals and operations
    on ideals</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X82ACACDD7D8E9B25">4.7-1 Ideal</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7EACC0D285D18E19">4.7-2 IdealOfQuotient</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X859C987B7C5F0D8D">4.7-3 PathsOfLengthTwo</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X830187497E0BD4F0">4.7-4 NthPowerOfArrowIdeal</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X824D550E8371098C">4.7-5 AddNthPowerToRelations</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X83E8D45B82356D8E"><code>4.7-6 \in</code></a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X82A1683E7A402E73">4.8 <span class="Heading">Categories and properties of ideals</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7F40193B877D76BC">4.8-1 IsAdmissibleIdeal</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X818EE2B9789BB175">4.8-2 IsIdealInPathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7C40D53785D67A9E">4.8-3 IsMonomialIdeal</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X841058F8850FA9D3">4.8-4 IsQuadraticIdeal</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7C45A01B7A587D9E">4.9 <span class="Heading">Operations on ideals</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7C1D2A2481599348">4.9-1 ProductOfIdeals</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7B0035AF7B030BDF">4.9-2 QuadraticPerpOfPathAlgebraIdeal</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X85D4E72B787B1C49">4.10 <span class="Heading">Attributes of ideals</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7D2896F27C976231">4.10-1 GroebnerBasisOfIdeal</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7A3CA333873389AD">4.11 <span class="Heading">Categories and Properties of Quotients of Path Algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7ACDD33087F98B88">4.11-1 IsAdmissibleQuotientOfPathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X790DB9BF831B577D">4.11-2 IsQuotientOfPathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X802DB9FB824B0167">4.11-3 IsFiniteDimensional</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8523C98A870CF7B5">4.11-4 IsCanonicalAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X78C9AA2085058DFA">4.11-5 IsDistributiveAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7EF4868B84CC749E">4.11-6 IsFiniteGlobalDimensionAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X796625487F5F92A7">4.11-7 IsGentleAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7E6BE2187B48691D">4.11-8 IsGorensteinAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X859FF8F2865D0A3A">4.11-9 IsHereditaryAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7809E044817388D1">4.11-10 IsKroneckerAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7952044F8303A688">4.11-11 IsMonomialAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7CB110A7873F7942">4.11-12 IsNakayamaAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8798B8BA7A145A2D">4.11-13 IsQuiverAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7A8D13FE8379776E">4.11-14 IsRadicalSquareZeroAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X82F25BFD7D43AB10">4.11-15 IsSchurianAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8555FC6B85FE9C6D">4.11-16 IsSelfinjectiveAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8558D44A79AA16CD">4.11-17 IsSemicommutativeAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X85A8EC2287F35DC1">4.11-18 IsSemisimpleAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7D7AC1D07A9607DF">4.11-19 IsSpecialBiserialAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X86F0E4AF7C9916CB">4.11-20 IsStringAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X79DA912C82D01EE8">4.11-21 IsSymmetricAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X87EC06D18021AD76">4.11-22 IsTriangularReduced</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7EF281F980319375">4.11-23 IsWeaklySymmetricAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X81C569797E900AE9">4.11-24 BongartzTest</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8140D2557A23CDAC">4.11-25 IsFiniteTypeAlgebra</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X861E6670814290D0">4.12 <span class="Heading"> Operations on String Algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X85F2FFFD78355788">4.12-1 IsValidString</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X85B82A4086AA53D6">4.12-2 StringsLessThan</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7F5B0A1A7AAF2C18">4.12-3 IsABand</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X85FFA183800621EA">4.12-4 BandsLessThan</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X870DB8577F0ABF0E">4.12-5 BandRepresentativesLessThan</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7C42DD687CE572DF">4.12-6 IsDomesticStringAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X85D0616C82375B5C">4.12-7 BridgeQuiver</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X82DBBB737885C73B">4.12-8 LocalARQuiver</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X86647D317A961513">4.13 <span class="Heading">Attributes and Operations (for Quotients) of Path
    Algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X84E3FEF587CB66C3">4.13-1 CartanMatrix</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7F8084A67A3BE874">4.13-2 Centre/Center</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X835A161E8524797A">4.13-3 ComplexityOfAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X815CB1D47CB174ED">4.13-4 CoxeterMatrix</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7F6F526C86052150">4.13-5 CoxeterPolynomial</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7E6926C6850E7C4E">4.13-6 Dimension</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7A3EACE782DC2198">4.13-7 FrobeniusForm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X789D1DB97C1B9A0D">4.13-8 FrobeniusLinearFunctional</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7D511B3E7A50AB2A">4.13-9 GlobalDimension</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7BEA44FB819910B6">4.13-10 LoewyLength</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X818AF5A979F8E539">4.13-11 NakayamaAutomorphism</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7C068FE379FBCE18">4.13-12 NakayamaPermutation</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X78E378EB83BA3D8A">4.13-13 OrderOfNakayamaAutomorphism</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X782EFE477EC0C1C6">4.13-14 RadicalSeriesOfAlgebra</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7BD7DB497917893C">4.14 <span class="Heading">Attributes and Operations on Elements
 of Quotients of Path Algebra</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X87495684791B5742">4.14-1 IsElementOfQuotientOfPathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X80B32F667BF6AFD8">4.14-2 Coefficients</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8271E6F27C2C826E">4.14-3 IsNormalForm</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X837DD99B7A233FB5">4.14-4 <</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7F2527747A3D0D6D">4.14-5 ElementOfQuotientOfPathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8088721187BA8D82">4.14-6 OriginalPathAlgebra</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7B209E0A7DD93C08">4.15 <span class="Heading">Predefined classes and classes 
  of (quotients of) path algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X820AE0208636B9AA">4.15-1 BrauerConfigurationAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7E63A4F37856A075">4.15-2 CanonicalAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X83498D3D856CC08A">4.15-3 KroneckerAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7C678A08836F77CC">4.15-4 NakayamaAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8369BB398212101C">4.15-5 AdmissibleSequenceGenerator</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X78C675F2836D1B18">4.15-6 PosetAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7F877C5F839A3AA9">4.15-7 PosetOfPosetAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7EF1AE62790D7486">4.15-8 TruncatedPathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X87E17E137E2B0FC4">4.15-9 IsSpecialBiserialQuiver</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X840BAB827C62AA4C">4.16 <span class="Heading">Opposite algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X85794BE082B632B9">4.16-1 OppositePath</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X87A86AFB782211D6">4.16-2 OppositePathAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X82C303CE808D54C1">4.16-3 OppositePathAlgebraElement</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X86B3EDE679B2493E">4.16-4 OppositeAlgebraHomomorphism</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X842527EC7F90C8C5">4.17 <span class="Heading">Tensor products of path algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X835BBBE18104654A">4.17-1 QuiverProduct</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X858517C18242C2F1">4.17-2 QuiverProductDecomposition</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X80E3731882B80106">4.17-3 IsQuiverProductDecomposition</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X856E8B5B7F550647">4.17-4 IncludeInProductQuiver</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8455692C7E282C6C">4.17-5 ProjectFromProductQuiver</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7A9026937BDDFA6C">4.17-6 TensorProductOfAlgebras</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7EE8921D787C8377">4.17-7 TensorAlgebrasInclusion</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7B31F4F680135E72">4.17-8 SimpleTensor</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7F0EBF88866A537D">4.17-9 TensorProductDecomposition</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X820195C47E2BE7E0">4.17-10 EnvelopingAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8210F6627AB95229">4.17-11 EnvelopingAlgebraHomomorphism</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7AE13B567B5F72FC">4.17-12 IsEnvelopingAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X80D827747ACD76FA">4.17-13 AlgebraAsModuleOverEnvelopingAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7A4C262287D74AB0">4.17-14 DualOfAlgebraAsModuleOverEnvelopingAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8101415F7FFB34CF">4.17-15 TrivialExtensionOfQuiverAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X81D98182822E8911">4.17-16 TrivialExtensionOfQuiverAlgebraProjection</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X79B8B91F8097BB80">4.18 <span class="Heading">Operations on quiver algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7EE5A11883B86971">4.18-1 QuiverAlgebraOfAmodAeA</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7B2D7385829F5EC6">4.18-2 QuiverAlgebraOfeAe</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X8561BCB6835D561F">4.19 <span class="Heading">Finite dimensional algebras over finite fields</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X810A29FB7E6EA24D">4.19-1 AlgebraAsQuiverAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7E9078077EE8B51B">4.19-2 BlocksOfAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X84B423137F933795">4.19-3 IsBasicAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7D30E9C878221B42">4.19-4 IsElementaryAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7B35109B8176FE56">4.19-5 PreprojectiveAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X80C0C6C37C4A2ABD">4.19-6 PrimitiveIdempotents</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7DDBF6F47A2E021C">4.20 <span class="Heading">Algebras</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X821B7B047871B42D">4.20-1 LiftingCompleteSetOfOrthogonalIdempotents</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X83041BDF78BF3CCA">4.20-2 LiftingIdempotent</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X850B9F12806FF76B">4.21 <span class="Heading">Saving and reading quotients of path algebras to and from a
  file</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X82A638C77FA75549">4.21-1 ReadAlgebra</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7E60DDCE848CB739">4.21-2 SaveAlgebra</a></span>
</div></div>
</div>

<h3>4 <span class="Heading">Path Algebras</span></h3>

<p><a id="X7DFB63A97E67C0A1" name="X7DFB63A97E67C0A1"></a></p>

<h4>4.1 <span class="Heading">Introduction</span></h4>

<p>A path algebra is an algebra constructed from a field <span class="Math">F</span> (see Chapter 56 and 57 in the <strong class="pkg">GAP</strong> manual for information about fields) and a quiver <span class="Math">Q</span>. The path algebra <span class="Math">FQ</span> contains all finite linear combinations of paths of <span class="Math">Q</span>. This chapter describes the functions in <strong class="pkg">QPA</strong> that deal with path algebras and quotients of path algebras. Path algebras are algebras, so see Chapter 60: Algebras in the <strong class="pkg">GAP</strong> manual for functionality such as generators, basis functions, and mappings.</p>

<p>The only supported ordering of elements in a path algebra is length left lexicographic ordering. See <a href="chap3.html#X78BBB63B828EB9FB"><span class="RefLink">3.4</span></a> for more information.</p>

<p><a id="X848A225A84A15B1E" name="X848A225A84A15B1E"></a></p>

<h4>4.2 <span class="Heading">Constructing Path Algebras</span></h4>

<p><a id="X7CA1C87B8202C2E9" name="X7CA1C87B8202C2E9"></a></p>

<h5>4.2-1 PathAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PathAlgebra</code>( <var class="Arg">F</var>, <var class="Arg">Q</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Arguments: <var class="Arg">F</var> -- a field, <var class="Arg">Q</var> -- a quiver.<br /></p>

<p>Returns: the path algebra <var class="Arg">FQ</var> of <var class="Arg">Q</var> over the field <var class="Arg">F</var>.</p>

<p>For construction of fields, see the <strong class="pkg">GAP</strong> documentation. The elements of the path algebra <var class="Arg">FQ</var> will be ordered by left length-lexicographic ordering.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">Q := Quiver( ["u","v"] , [ ["u","u","a"], ["u","v","b"], </span>
<span class="GAPprompt">></span> <span class="GAPinput">["v","u","c"], ["v","v","d"] ] );</span>
<quiver with 2 vertices and 4 arrows>
<span class="GAPprompt">gap></span> <span class="GAPinput">F := Rationals;</span>
Rationals
<span class="GAPprompt">gap></span> <span class="GAPinput">FQ := PathAlgebra(F,Q);</span>
<Rationals[<quiver with 2 vertices and 4 arrows>]>
</pre></div>

<p><a id="X85A3A8767E7C11AD" name="X85A3A8767E7C11AD"></a></p>

<h4>4.3 <span class="Heading">Categories and Properties of Path Algebras</span></h4>

<p><a id="X8255FDF78315E1B3" name="X8255FDF78315E1B3"></a></p>

<h5>4.3-1 IsPathAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsPathAlgebra</code>( <var class="Arg">object</var> )</td><td class="tdright">( property )</td></tr></table></div>
<p>Arguments: <var class="Arg">object</var> -- any object in <strong class="pkg">GAP</strong>. <br /></p>

<p>Returns: true whenever <var class="Arg">object</var> is a path algebra.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">IsPathAlgebra(FQ);</span>
true
</pre></div>

<p><a id="X7DE2F2A48492041A" name="X7DE2F2A48492041A"></a></p>

<h4>4.4 <span class="Heading">Attributes and Operations for Path Algebras</span></h4>

<p><a id="X7DF51D297E0E6A8B" name="X7DF51D297E0E6A8B"></a></p>

<h5>4.4-1 AssociatedMonomialAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AssociatedMonomialAlgebra</code>( <var class="Arg">A</var> )</td><td class="tdright">( attribute )</td></tr></table></div>
<p>Arguments: <var class="Arg">A</var> -- a quiver algebra.<br /></p>

<p>Returns: the associated monomial algebra of <var class="Arg">A</var> with respect to the Groebner basis the path algebra is endoved with.</p>

<p><a id="X83FBA499856580B0" name="X83FBA499856580B0"></a></p>

<h5>4.4-2 QuiverOfPathAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ QuiverOfPathAlgebra</code>( <var class="Arg">FQ</var> )</td><td class="tdright">( attribute )</td></tr></table></div>
<p>Arguments: <var class="Arg">FQ</var> -- a path algebra. <br /></p>

<p>Returns: the quiver from which <var class="Arg">FQ</var> was constructed.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">QuiverOfPathAlgebra(FQ);</span>
<quiver with 2 vertices and 4 arrows> 
</pre></div>

<p><a id="X8279084B828E5FD7" name="X8279084B828E5FD7"></a></p>

<h5>4.4-3 OrderingOfAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ OrderingOfAlgebra</code>( <var class="Arg">FQ</var> )</td><td class="tdright">( attribute )</td></tr></table></div>
<p>Arguments: <var class="Arg">FQ</var> -- a path algebra.<br /></p>

<p>Returns: the ordering of the quiver of the path algebra.</p>

<p><em>Note:</em> As of the current version of <strong class="pkg">QPA</strong>, only left length lexicographic ordering is supported.</p>

<p><a id="X86CDD46F7F05ADE9" name="X86CDD46F7F05ADE9"></a></p>

<h5>4.4-4 .</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ .</code>( <var class="Arg">FQ</var>, <var class="Arg">generator</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">FQ</var> -- a path algebra, <var class="Arg">generator</var> -- a vertex or an arrow in the quiver <var class="Arg">Q</var>. <br /></p>

<p>Returns: the <var class="Arg">generator</var> as an element of the path algebra.</p>

<p>Other elements of the path algebra can be constructed as linear combinations of the generators. For further operations on elements, see below.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">FQ.a;</span>
(1)*a
<span class="GAPprompt">gap></span> <span class="GAPinput">FQ.v;</span>
(1)*v
<span class="GAPprompt">gap></span> <span class="GAPinput">elem := 2*FQ.a - 3*FQ.v;</span>
(-3)*v+(2)*a
</pre></div>

<p><a id="X7CEF60107CE4616B" name="X7CEF60107CE4616B"></a></p>

<h4>4.5 <span class="Heading">Operations on Path Algebra Elements</span></h4>

<p><a id="X841C00E87E19528E" name="X841C00E87E19528E"></a></p>

<h5>4.5-1 ElementOfPathAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ElementOfPathAlgebra</code>( <var class="Arg">PA</var>, <var class="Arg">path</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">PA</var> -- a path algebra, <var class="Arg">path</var> -- a path in the quiver from which <var class="Arg">PA</var> was constructed.<br /></p>

<p>Returns: The embedding of <var class="Arg">path</var> into the path algebra <var class="Arg">PA</var>, or it returns false if <var class="Arg">path</var> is not an element of the quiver from which <var class="Arg">PA</var> was constructed.</p>

<p><a id="X7E3FAB1F803E26FF" name="X7E3FAB1F803E26FF"></a></p>

<h5>4.5-2 <</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ <</code>( <var class="Arg">a</var>, <var class="Arg">b</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">a</var> and <var class="Arg">b</var> -- two elements of the same path algebra.<br /></p>

<p>Returns: True whenever <var class="Arg">a</var> is smaller than <var class="Arg">b</var>, according to the ordering of the path algebra.</p>

<p><a id="X853C8B0B8665BFBB" name="X853C8B0B8665BFBB"></a></p>

<h5>4.5-3 IsLeftUniform</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsLeftUniform</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">element</var> -- an element of the path algebra.<br /></p>

<p>Returns: true if each monomial in <var class="Arg">element</var> has the same source vertex, false otherwise.</p>

<p><a id="X7C06BE7483992634" name="X7C06BE7483992634"></a></p>

<h5>4.5-4 IsRightUniform</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsRightUniform</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">element</var> -- an element of the path algebra.<br /></p>

<p>Returns: true if each monomial in <var class="Arg">element</var> has the same target vertex, false otherwise.</p>

<p><a id="X8735FBE180797557" name="X8735FBE180797557"></a></p>

<h5>4.5-5 IsUniform</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsUniform</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">element</var> -- an element of the path algebra. <br /></p>

<p>Returns: true whenever <var class="Arg">element</var> is both left and right uniform.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">IsLeftUniform(elem);</span>
false
<span class="GAPprompt">gap></span> <span class="GAPinput">IsRightUniform(elem);</span>
false
<span class="GAPprompt">gap></span> <span class="GAPinput">IsUniform(elem);</span>
false
<span class="GAPprompt">gap></span> <span class="GAPinput">another := FQ.a*FQ.b + FQ.b*FQ.d*FQ.c*FQ.b*FQ.d;</span>
(1)*a*b+(1)*b*d*c*b*d
<span class="GAPprompt">gap></span> <span class="GAPinput">IsLeftUniform(another);</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">IsRightUniform(another);</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">IsUniform(another);</span>
true 
</pre></div>

<p><a id="X84C98E687A3A84D8" name="X84C98E687A3A84D8"></a></p>

<h5>4.5-6 LeadingTerm</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LeadingTerm</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Tip</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">element</var> -- an element of the path algebra. <br /></p>

<p>Returns: the term in <var class="Arg">element</var> whose monomial is largest among those monomials that have nonzero coefficients (known as the "tip" of <var class="Arg">element</var>).</p>

<p><em>Note: </em> The two operations are equivalent.</p>

<p><a id="X80710E9B7D8340BD" name="X80710E9B7D8340BD"></a></p>

<h5>4.5-7 LeadingCoefficient</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LeadingCoefficient</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ TipCoefficient</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">element</var> -- an element of the path algebra. <br /></p>

<p>Returns: the coefficient of the tip of <var class="Arg">element</var> (which is an element of the field).</p>

<p><em>Note: </em> The two operations are equivalent.</p>

<p><a id="X7B3EAE41795598A5" name="X7B3EAE41795598A5"></a></p>

<h5>4.5-8 LeadingMonomial</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LeadingMonomial</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ TipMonomial</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">element</var> -- an element of the path algebra. <br /></p>

<p>Returns: the monomial of the tip of <var class="Arg">element</var> (which is an element of the underlying quiver, not of the path algebra).</p>

<p><em>Note: </em> The two operations are equivalent.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">elem := FQ.a*FQ.b*FQ.c + FQ.b*FQ.d*FQ.c+FQ.d*FQ.d;</span>
(1)*d^2+(1)*a*b*c+(1)*b*d*c
<span class="GAPprompt">gap></span> <span class="GAPinput">LeadingTerm(elem);</span>
(1)*b*d*c
<span class="GAPprompt">gap></span> <span class="GAPinput">LeadingCoefficient(elem);</span>
1
<span class="GAPprompt">gap></span> <span class="GAPinput">mon := LeadingMonomial(elem);</span>
b*d*c
<span class="GAPprompt">gap></span> <span class="GAPinput">mon in FQ;</span>
false
<span class="GAPprompt">gap></span> <span class="GAPinput">mon in Q;</span>
true 
</pre></div>

<p><a id="X8172B40181E1B7D2" name="X8172B40181E1B7D2"></a></p>

<h5>4.5-9 MakeUniformOnRight</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ MakeUniformOnRight</code>( <var class="Arg">elems</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">elems</var> -- a list of elements in a path algebra.<br /></p>

<p>Returns: a list of right uniform elements generated by each element of <var class="Arg">elems</var>.</p>

<p><a id="X796249A682818750" name="X796249A682818750"></a></p>

<h5>4.5-10 MappedExpression</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ MappedExpression</code>( <var class="Arg">expr</var>, <var class="Arg">gens1</var>, <var class="Arg">gens2</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">expr</var> -- element of a path algebra, <var class="Arg">gens1</var> and <var class="Arg">gens2</var> -- equal-length lists of generators for subalgebras.<br /></p>

<p>Returns: <var class="Arg">expr</var> as an element of the subalgebra generated by <var class="Arg">gens2</var>.</p>

<p>The element <var class="Arg">expr</var> must be in the subalgebra generated by <var class="Arg">gens1</var>. The lists define a mapping of each generator in <var class="Arg">gens1</var> to the corresponding generator in <var class="Arg">gens2</var>. The value returned is the evaluation of the mapping at <var class="Arg">expr</var>.</p>

<p><a id="X7D6DDDF178B0F2D9" name="X7D6DDDF178B0F2D9"></a></p>

<h5>4.5-11 SupportOfQuiverAlgebraElement</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SupportOfQuiverAlgebraElement</code>( <var class="Arg">algebra</var>, <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LeftSupportOfQuiverAlgebraElement</code>( <var class="Arg">algebra</var>, <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RIghtSupportOfQuiverAlgebraElement</code>( <var class="Arg">algebra</var>, <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">algebra</var> -- a QuiverAlgebra, <var class="Arg">element</var> -- an element of the QuiverAlgebra<br /></p>

<p>Returns: the second version returns a list of the index of the vertices such that the product from the left is non-zero, the third version returns a list of the index of the vertices such that the product from the right is non-zero, and the first version returns the both of the previous lists of indices of vertices.</p>

<p><a id="X849AC0F67A131929" name="X849AC0F67A131929"></a></p>

<h5>4.5-12 VertexPosition</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ VertexPosition</code>( <var class="Arg">element</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">element</var> -- an element of the path algebra on the form <span class="Math">k*v</span>, where <span class="Math">v</span> is a vertex of the underlying quiver and <span class="Math">k</span> is an element of the field.<br /></p>

<p>Returns: the position of the vertex <var class="Arg">v</var> in the list of vertices of the quiver.</p>

<p><a id="X86795D8E7ED73048" name="X86795D8E7ED73048"></a></p>

<h5>4.5-13 RelationsOfAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RelationsOfAlgebra</code>( <var class="Arg">A</var> )</td><td class="tdright">( attribute )</td></tr></table></div>
<p>Arguments: <var class="Arg">A</var> -- a quiver algebra. <br /></p>

<p>Returns: a set of generators for the ideal in the path algebra <span class="SimpleMath">kQ</span> from which the algebra <var class="Arg">FQ</var> was constructed. If <var class="Arg">A</var> is a path algebra, then an empty list is returned.</p>

<p><a id="X7F0D555379C97A6E" name="X7F0D555379C97A6E"></a></p>

<h4>4.6 <span class="Heading">Constructing Quotients of Path Algebras</span></h4>

<p>In the introduction we saw already one way of constructing a quotient of a path algebra. In addition to this there are at least two other ways of constructing a quotient of a path algebra; one with factoring out an ideal and one where a Groebner basis is attached to the quotient. We discuss these two next.</p>

<p>For several functions in <strong class="pkg">QPA</strong> to function properly one needs to have a Groebner basis attached to the quotient one wants to construct, or equivalently a Groebner basis for the ideal one is factoring out. For this to work the ideal must admit a finite Groebner basis. However, to our knowledge there is no algorithm for determining if an ideal has a finite Groebner basis. On the other hand, it is known that if the factor algebra is finite dimensional, then the ideal has a finite Groebner basis (independent of the ordering of the elements, see <a href="chapBib.html#biBGreen">[Gre00]</a> ). In addition to having a finite Groebner basis, several functions also need that the factoring ideal is admissible. A quotient of a path algebra by an admissible ideal belongs to the category <code class="func">IsAdmissibleQuotientOfPathAlgebra</code> (<a href="chap4.html#X7ACDD33087F98B88"><span class="RefLink">4.11-1</span></a>). The method used in the introduction constructs a quotient in this category. However, there are situations where it is interesting to analyze quotients of path algebras by a non-admissible ideal, so we provide also additional methods.</p>

<p>In the example below, we construct a factor of a path algebra purely with commands in <strong class="pkg">GAP</strong> (cf. also Chapter 60: Algebras in the <strong class="pkg">GAP</strong> manual on how to construct an ideal and a quotient of an algebra). Functions which use Groebner bases like <code class="func">IsFiniteDimensional</code> (<a href="chap4.html#X802DB9FB824B0167"><span class="RefLink">4.11-3</span></a>), <code class="func">Dimension</code> (<a href="chap4.html#X7E6926C6850E7C4E"><span class="RefLink">4.13-6</span></a>), <code class="func">IsSpecialBiserialAlgebra</code> (<a href="chap4.html#X7D7AC1D07A9607DF"><span class="RefLink">4.11-19</span></a>) or a membership test <code class="func">\in</code> (<a href="chap4.html#X83E8D45B82356D8E"><span class="RefLink">4.7-6</span></a>) will work properly (they simply compute the Groebner basis if it is necessary). But some "older" functions (like <code class="func">IndecProjectiveModules</code> (<a href="chap6.html#X85EDCFE27F66093F"><span class="RefLink">6.5-5</span></a>)) can fail or give an incorrect answer! This way of constructing a quotient of a path algebra can be useful e.g. if we know that computing a Groebner basis will take a long time and we do not need this because we want to deal only with modules.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">Q := Quiver( 1, [ [1,1,"a"], [1,1,"b"] ] );</span>
<quiver with 1 vertices and 2 arrows>
<span class="GAPprompt">gap></span> <span class="GAPinput">kQ := PathAlgebra(Rationals, Q);</span>
<Rationals[<quiver with 1 vertices and 2 arrows>]>
<span class="GAPprompt">gap></span> <span class="GAPinput">gens := GeneratorsOfAlgebra(kQ);</span>
[ (1)*v1, (1)*a, (1)*b ]
<span class="GAPprompt">gap></span> <span class="GAPinput">a := gens[2];</span>
(1)*a
<span class="GAPprompt">gap></span> <span class="GAPinput">b := gens[3];</span>
(1)*b
<span class="GAPprompt">gap></span> <span class="GAPinput">relations := [a^2,a*b-b*a, b*b];</span>
[ (1)*a^2, (1)*a*b+(-1)*b*a, (1)*b^2 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">I := Ideal(kQ,relations);</span>
<two-sided ideal in <Rationals[<quiver with 1 vertices and 2 arrows>]>
    , (3 generators)>
<span class="GAPprompt">gap></span> <span class="GAPinput">A := kQ/I;</span>
<Rationals[<quiver with 1 vertices and 2 arrows>]/
<two-sided ideal in <Rationals[<quiver with 1 vertices and 2 arrows>]>
    , (3 generators)>>
<span class="GAPprompt">gap></span> <span class="GAPinput">IndecProjectiveModules(A);</span>
Compute a Groebner basis of the ideal you are factoring out with before \
you form the quotient algebra, or you have entered an algebra which \
is not finite dimensional.
fail
</pre></div>

<p>To resolve this matter, we need to compute the Gröbner basis of the ideal generated by the relations in <span class="Math">kQ</span> (yes, it seems like we are going in circles here. Remember, then, that an ideal in the "mathematical sense" may exist independently of the a corresponding <code class="code">Ideal</code> object in <strong class="pkg">GAP</strong>. Also, Gröbner bases in <strong class="pkg">QPA</strong> are handled by the <strong class="pkg">GBNP</strong> package, with constructor methods not dependent on <code class="code">Ideal</code> objects. After creating the ideal <span class="Math">I</span>, we need to perform yet another Gröbner basis operation which just set a respective attribute for <span class="Math">I</span>, see <code class="func">GroebnerBasis</code> (<a href="chap5.html#X7A43611E876B7560"><span class="RefLink">5.1-2</span></a>).</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">gb := GBNPGroebnerBasis(relations,kQ);</span>
[ (1)*a^2, (-1)*a*b+(1)*b*a, (1)*b^2 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">I := Ideal(kQ,gb);                    </span>
<two-sided ideal in <Rationals[<quiver with 1 vertices and 2 arrows>]>, 
  (3 generators)>
<span class="GAPprompt">gap></span> <span class="GAPinput">GroebnerBasis(I,gb);                  </span>
<complete two-sided Groebner basis containing 3 elements>
<span class="GAPprompt">gap></span> <span class="GAPinput">IndecProjectiveModules(A);                                                </span>
fail
<span class="GAPprompt">gap></span> <span class="GAPinput">A := kQ/I;                                                                </span>
<Rationals[<quiver with 1 vertices and 2 arrows>]/
<two-sided ideal in <Rationals[<quiver with 1 vertices and 2 arrows>]>, 
  (3 generators)>>
<span class="GAPprompt">gap></span> <span class="GAPinput">IndecProjectiveModules(A);</span>
[ <[ 4 ]> ]
</pre></div>

<p>Note that the instruction <code class="code">A := kQ/relations;</code> used in Introduction is exactly an abbreviation for a sequence of instructions with Groebner basis as in above example.</p>

<p>Most <strong class="pkg">QPA</strong> operations working on algebras handle path algebras and quotients of path algebras in the same way (when this makes sense). However, there are still a few operations which does not work properly when given a quotient of a path algebra. When constructing a quotient of a path algebra one needs define the ideal one is factoring out. Above this has been done with the commands</p>


<div class="example"><pre> 
<span class="GAPprompt">gap></span> <span class="GAPinput">gens := GeneratorsOfAlgebra(kQ);</span>
[ (1)*v1, (1)*a, (1)*b ]
<span class="GAPprompt">gap></span> <span class="GAPinput">a := gens[2];</span>
(1)*a
<span class="GAPprompt">gap></span> <span class="GAPinput">b := gens[3];</span>
(1)*b
</pre></div>

<p>The following command makes this process easier.</p>

<p><a id="X814203E281F3272E" name="X814203E281F3272E"></a></p>

<h5>4.6-1 AssignGeneratorVariables</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AssignGeneratorVariables</code>( <var class="Arg">A</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">A</var> -- a quiver algebra.<br /></p>

<p>Returns: Takes a quiver algebra <var class="Arg">A</var> as an argument and creates variables, say <span class="SimpleMath">v_1,...,v_n</span> for the vertices, and <span class="SimpleMath">a_1,...,a_t</span> for the arrows for the corresponding elements in <var class="Arg">A</var>, whenever the quiver for the quiver algebra <var class="Arg">A</var> is was constructed with the vertices being named <span class="SimpleMath">v_1,...,v_n</span> and the arrows being named <span class="SimpleMath">a_1,...,a_t</span>.</p>

<p>Here is an example of its use.</p>


<div class="example"><pre> 
<span class="GAPprompt">gap></span> <span class="GAPinput">AssignGeneratorVariables(kQ);</span>
#I  Assigned the global variables [ v1, a, b ]
<span class="GAPprompt">gap></span> <span class="GAPinput">v1; a; b;</span>
(1)*v1
(1)*a
(1)*b
</pre></div>

<p><a id="X812C0F8D7E4B1134" name="X812C0F8D7E4B1134"></a></p>

<h4>4.7 <span class="Heading">Ideals and operations
    on ideals</span></h4>

<p><a id="X82ACACDD7D8E9B25" name="X82ACACDD7D8E9B25"></a></p>

<h5>4.7-1 Ideal</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Ideal</code>( <var class="Arg">FQ</var>, <var class="Arg">elems</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Arguments: <var class="Arg">FQ</var> -- a path algebra, <var class="Arg">elems</var> -- a list of elements in <var class="Arg">FQ</var>.<br /></p>

<p>Returns: the ideal of <var class="Arg">FQ</var> generated by <var class="Arg">elems</var> with the property <code class="func">IsIdealInPathAlgebra</code> (<a href="chap4.html#X818EE2B9789BB175"><span class="RefLink">4.8-2</span></a>).</p>

<p>For more on ideals, see the <strong class="pkg">GAP</strong> reference manual (Chapter 60.6). <br /> <em>Technical info:</em> Ideal is a synonym for a global GAP function TwoSidedIdeal which calls an operation TwoSidedIdealByGenerators (synonym IdealByGenerators) for an algebra (FLMLOR).</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">gb := GBNPGroebnerBasis(relations,kQ);</span>
[ (1)*a^2, (-1)*a*b+(1)*b*a, (1)*b^2 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">I := Ideal(kQ,gb);</span>
<two-sided ideal in <Rationals[<quiver with 1 vertices and 2 arrows>]>
    , (3 generators)>
<span class="GAPprompt">gap></span> <span class="GAPinput">GroebnerBasis(I,gb);</span>
<complete two-sided Groebner basis containing 3 elements>
<span class="GAPprompt">gap></span> <span class="GAPinput">IndecProjectiveModules(A);</span>
[ <[ 4 ]> ]
<span class="GAPprompt">gap></span> <span class="GAPinput">A := kQ/I;</span>
<Rationals[<quiver with 1 vertices and 2 arrows>]/
<two-sided ideal in <Rationals[<quiver with 1 vertices and 2 arrows>]>
    , (3 generators)>>
<span class="GAPprompt">gap></span> <span class="GAPinput">IndecProjectiveModules(A);</span>
[ <[ 4 ]> ]
true
</pre></div>

<p><a id="X7EACC0D285D18E19" name="X7EACC0D285D18E19"></a></p>

<h5>4.7-2 IdealOfQuotient</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IdealOfQuotient</code>( <var class="Arg">A</var> )</td><td class="tdright">( attribute )</td></tr></table></div>
<p>Arguments: <var class="Arg">A</var> -- a quiver algebra. <br /></p>

<p>Returns: the ideal in the path algebra <span class="SimpleMath">kQ</span> from which <var class="Arg">A</var> was constructed.</p>

<p><a id="X859C987B7C5F0D8D" name="X859C987B7C5F0D8D"></a></p>

<h5>4.7-3 PathsOfLengthTwo</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PathsOfLengthTwo</code>( <var class="Arg">Q</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">Q</var> -- a quiver.<br /></p>

<p>Returns: a list of all paths of length two in <var class="Arg">Q</var>, sorted by <code class="code"><</code>. Fails with error message if <var class="Arg">Q</var> is not a Quiver object.</p>

<p><a id="X830187497E0BD4F0" name="X830187497E0BD4F0"></a></p>

<h5>4.7-4 NthPowerOfArrowIdeal</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ NthPowerOfArrowIdeal</code>( <var class="Arg">FQ</var>, <var class="Arg">n</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">FQ</var> -- a path algebra, <var class="Arg">n</var> -- a positive integer.<br /></p>

<p>Returns: the ideal generated all the paths of length <var class="Arg">n</var> in <var class="Arg">FQ</var>.</p>

<p><a id="X824D550E8371098C" name="X824D550E8371098C"></a></p>

<h5>4.7-5 AddNthPowerToRelations</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AddNthPowerToRelations</code>( <var class="Arg">FQ</var>, <var class="Arg">rels</var>, <var class="Arg">n</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">FQ</var> -- a path algebra, <var class="Arg">rels</var> -- a (possibly empty) list of elements in <var class="Arg">FQ</var>, <var class="Arg">n</var> -- a positive integer.<br /></p>

<p>Returns: the list <var class="Arg">rels</var> with the paths of length <var class="Arg">n</var> of <var class="Arg">FQ</var> appended (will change the list <var class="Arg">rels</var>).</p>

<p><a id="X83E8D45B82356D8E" name="X83E8D45B82356D8E"></a></p>

<h5><code>4.7-6 \in</code></h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ \in</code>( <var class="Arg">elt</var>, <var class="Arg">I</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">elt</var> - an element in a path algebra, <var class="Arg">I</var> - an ideal in the same path algebra (i.e. with <code class="func">IsIdealInPathAlgebra</code> (<a href="chap4.html#X818EE2B9789BB175"><span class="RefLink">4.8-2</span></a>) property).<br /></p>

<p>Returns: true, if <var class="Arg">elt</var> belongs to <var class="Arg">I</var>.</p>

<p>It performs the membership test for an ideal in path algebra using completely reduced Groebner bases machinery. <br /> <em>Technical info:</em> For the efficiency reasons, it computes Groebner basis for <var class="Arg">I</var> only if it has not been computed yet. Similarly, it performs CompletelyReduceGroebnerBasis only if it has not been reduced yet. The method can change the existing Groebner basis.<br /> <em>Remark:</em> It works only in case <var class="Arg">I</var> is in the arrow ideal.</p>

<p><a id="X82A1683E7A402E73" name="X82A1683E7A402E73"></a></p>

<h4>4.8 <span class="Heading">Categories and properties of ideals</span></h4>

<p><a id="X7F40193B877D76BC" name="X7F40193B877D76BC"></a></p>

<h5>4.8-1 IsAdmissibleIdeal</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsAdmissibleIdeal</code>( <var class="Arg">I</var> )</td><td class="tdright">( property )</td></tr></table></div>
<p>Arguments: <var class="Arg">I</var> -- an IsIdealInPathAlgebra object. <br /></p>

<p>Returns: true whenever <var class="Arg">I</var> is an <em>admissible</em> ideal in a path algebra, i.e. <var class="Arg">I</var> is a subset of <span class="SimpleMath">J^2</span> and <var class="Arg">I</var> contains <span class="SimpleMath">J^n</span> for some <span class="SimpleMath">n</span>, where <span class="SimpleMath">J</span> is the arrow ideal.</p>

<p><em>Technical note:</em> The second condition is checked by the nilpotency index of the radical and checking if the ideal generated by the arrows to one plus this index is in the ideal of the relations (this uses Groebner bases machinery).</p>

<p><a id="X818EE2B9789BB175" name="X818EE2B9789BB175"></a></p>

<h5>4.8-2 IsIdealInPathAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsIdealInPathAlgebra</code>( <var class="Arg">I</var> )</td><td class="tdright">( property )</td></tr></table></div>
<p>Arguments: <var class="Arg">I</var> -- an IsFLMLOR object. <br /></p>

<p>Returns: true whenever <var class="Arg">I</var> is an ideal in a path algebra.</p>

<p><a id="X7C40D53785D67A9E" name="X7C40D53785D67A9E"></a></p>

<h5>4.8-3 IsMonomialIdeal</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsMonomialIdeal</code>( <var class="Arg">I</var> )</td><td class="tdright">( property )</td></tr></table></div>
<p>Arguments: <var class="Arg">I</var> -- an IsIdealInPathAlgebra object. <br /></p>

<p>Returns: true whenever <var class="Arg">I</var> is a <em>monomial</em> ideal in a path algebra, i.e. <var class="Arg">I</var> is generated by a set of monomials (= "zero-relations").</p>

<p><em>Technical note:</em> It uses the observation: <var class="Arg">I</var> is a monomial ideal iff Groebner basis of <var class="Arg">I</var> is a set of monomials. It computes Groebner basis for <var class="Arg">I</var> only in case it has not been computed yet and a usual set of generators (GeneratorsOfIdeal) is not a set of monomials.</p>

<p><a id="X841058F8850FA9D3" name="X841058F8850FA9D3"></a></p>

<h5>4.8-4 IsQuadraticIdeal</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsQuadraticIdeal</code>( <var class="Arg">rels</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">rels</var> -- a list of elements in a path algebra.<br /></p>

<p>Returns: true whenever <var class="Arg">rels</var> is a list of elements in the linear span of degree two elements of a path algebra. It returns false whenever <var class="Arg">rels</var> is a list of elements in a path algebra, but not in the linear span of degree two of a path algebra. Otherwise it returns fail.</p>

<p><a id="X7C45A01B7A587D9E" name="X7C45A01B7A587D9E"></a></p>

<h4>4.9 <span class="Heading">Operations on ideals</span></h4>

<p><a id="X7C1D2A2481599348" name="X7C1D2A2481599348"></a></p>

<h5>4.9-1 ProductOfIdeals</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ProductOfIdeals</code>( <var class="Arg">I</var>, <var class="Arg">J</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">I, J</var> -- two ideals in a path algebra <var class="Arg">KQ</var>.<br /></p>

<p>Returns: the ideal formed by the product of the ideals <var class="Arg">I</var> and <var class="Arg">J</var>, whenever the ideal <var class="Arg">J</var> admits finitely many nontips in <var class="Arg">KQ</var>.</p>

<p>The function checks if the two ideals are ideals in the same path algebra and that <var class="Arg">J</var> admits finitely many nontips in <var class="Arg">KQ</var>.</p>

<p><a id="X7B0035AF7B030BDF" name="X7B0035AF7B030BDF"></a></p>

<h5>4.9-2 QuadraticPerpOfPathAlgebraIdeal</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ QuadraticPerpOfPathAlgebraIdeal</code>( <var class="Arg">rels</var> )</td><td class="tdright">( operation )</td></tr></table></div>
<p>Arguments: <var class="Arg">rels</var> -- a list of elements in a path algebra.<br /></p>

<p>Returns: fail if <var class="Arg">rels</var> is not a list of elements in the linear span of degree two elements of a path algebra <var class="Arg">KQ</var>. Otherwise it returns a list of length two, where the first element is a set of generators for the ideal <span class="Math"><var class="Arg">rels</var>^\perp</span> in opposite algebra of <var class="Arg">KQ</var> and the second element is the opposite algebra of <var class="Arg">KQ</var>.</p>

<p><a id="X85D4E72B787B1C49" name="X85D4E72B787B1C49"></a></p>

<h4>4.10 <span class="Heading">Attributes of ideals</span></h4>

<p>For many of the functions related to quotients, you will need to compute a Groebner basis of the ideal. This is done with the GBNP package. The following example shows how to set a Groebner basis for an ideal (note that this must be done before the quotient is constructed). See the next two chapters for more on Groebner bases.</p>


<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">rels := [FQ.a - FQ.b*FQ.c, FQ.d*FQ.d];</span>
[ (1)*a+(-1)*b*c, (1)*d^2 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">gb := GBNPGroebnerBasis(rels, FQ); </span>
[ (-1)*a+(1)*b*c, (1)*d^2 ]
<span class="GAPprompt">gap></span> <span class="GAPinput">I := Ideal(FQ, gb);</span>
<two-sided ideal in <Rationals[<quiver with 2 vertices and 4 arrows>]>
    , (2 generators)>
<span class="GAPprompt">gap></span> <span class="GAPinput">GroebnerBasis(I, gb);</span>
<complete two-sided Groebner basis containing 2 elements>
<span class="GAPprompt">gap></span> <span class="GAPinput">quot := FQ/I;</span>
<Rationals[<quiver with 2 vertices and 4 arrows>]/
<two-sided ideal in <Rationals[<quiver with 2 vertices and 4 arrows>]>
    , (2 generators)>>
</pre></div>

<p><a id="X7D2896F27C976231" name="X7D2896F27C976231"></a></p>

<h5>4.10-1 GroebnerBasisOfIdeal</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ GroebnerBasisOfIdeal</code>( <var class="Arg">I</var> )</td><td class="tdright">( attribute )</td></tr></table></div>
<p>Arguments: <var class="Arg">I</var> -- an ideal in path algebra.<br /></p>

<p>Returns: a Groebner basis of ideal <var class="Arg">I</var> (if it has been already computed!).</p>

<p>This attribute is set only by an operation <code class="func">GroebnerBasis</code> (<a href="chap5.html#X7A43611E876B7560"><span class="RefLink">5.1-2</span></a>).</p>

<p><a id="X7A3CA333873389AD" name="X7A3CA333873389AD"></a></p>

<h4>4.11 <span class="Heading">Categories and Properties of Quotients of Path Algebras</span></h4>

<p><a id="X7ACDD33087F98B88" name="X7ACDD33087F98B88"></a></p>

<h5>4.11-1 IsAdmissibleQuotientOfPathAlgebra</h5>

<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsAdmissibleQuotientOfPathAlgebra</code>( <var class="Arg">A</var> )</td><td class="tdright">( filter )</td></tr></table></div>
<p>Arguments: <var class="Arg">A</var> -- any object.<br /></p>

--> --------------------

--> maximum size reached

--> --------------------

100%


¤ 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.0.48Bemerkung:  ¤

*© Formatika GbR, Deutschland




Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

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.