Debian Codegraph @

doc/chap5.html

raw
1 <?xml version="1.0" encoding="UTF-8"?>
2
3 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
4 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
5
6 <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
7 <head>
8 <title>GAP (polycyclic) - Chapter 5: Basic methods and functions for pcp-groups</title>
9 <meta http-equiv="content-type" content="text/html; charset=UTF-8" />
10 <meta name="generator" content="GAPDoc2HTML" />
11 <link rel="stylesheet" type="text/css" href="manual.css" />
12 <script src="manual.js" type="text/javascript"></script>
13 <script type="text/javascript">overwriteStyle();</script>
14 </head>
15 <body class="chap5" onload="jscontent()">
16
17
18 <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="chapA.html">A</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>
19
20 <div class="chlinkprevnexttop">&nbsp;<a href="chap0.html">[Top of Book]</a>&nbsp; <a href="chap0.html#contents">[Contents]</a>&nbsp; &nbsp;<a href="chap4.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap6.html">[Next Chapter]</a>&nbsp; </div>
21
22 <p id="mathjaxlink" class="pcenter"><a href="chap5_mj.html">[MathJax on]</a></p>
23 <p><a id="X7B9B85AE7C9B13EE" name="X7B9B85AE7C9B13EE"></a></p>
24 <div class="ChapSects"><a href="chap5.html#X7B9B85AE7C9B13EE">5 <span class="Heading">Basic methods and functions for pcp-groups</span></a>
25 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X821360107E355B88">5.1 <span class="Heading">Elementary methods for pcp-groups</span></a>
26 </span>
27 <div class="ContSSBlock">
28 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X806A4814806A4814"><code>5.1-1 \=</code></a></span>
29 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X858ADA3B7A684421">5.1-2 Size</a></span>
30 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X79730D657AB219DB">5.1-3 Random</a></span>
31 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X83A0356F839C696F">5.1-4 Index</a></span>
32 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X87BDB89B7AAFE8AD"><code>5.1-5 \in</code></a></span>
33 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X79B130FC7906FB4C">5.1-6 Elements</a></span>
34 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7D13FC1F8576FFD8">5.1-7 ClosureGroup</a></span>
35 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7BDEA0A98720D1BB">5.1-8 NormalClosure</a></span>
36 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X839B42AE7A1DD544">5.1-9 HirschLength</a></span>
37 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7A9A3D5578CE33A0">5.1-10 CommutatorSubgroup</a></span>
38 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X796DA805853FAC90">5.1-11 PRump</a></span>
39 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X814DBABC878D5232">5.1-12 SmallGeneratingSet</a></span>
40 </div></div>
41 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X80E88168866D54F3">5.2 <span class="Heading">Elementary properties of pcp-groups</span></a>
42 </span>
43 <div class="ContSSBlock">
44 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7839D8927E778334">5.2-1 IsSubgroup</a></span>
45 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X838186F9836F678C">5.2-2 IsNormal</a></span>
46 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X87D062608719F2CD">5.2-3 IsNilpotentGroup</a></span>
47 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7C12AA7479A6C103">5.2-4 IsAbelian</a></span>
48 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X813C952F80E775D4">5.2-5 IsElementaryAbelian</a></span>
49 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X84FFC668832F9ED6">5.2-6 IsFreeAbelian</a></span>
50 </div></div>
51 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X85A7E26C7E14AFBA">5.3 <span class="Heading">Subgroups of pcp-groups</span></a>
52 </span>
53 <div class="ContSSBlock">
54 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X815F756286701BE0">5.3-1 Igs</a></span>
55 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7F4D95C47F9652BA">5.3-2 Ngs</a></span>
56 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X8077293A787D4571">5.3-3 Cgs</a></span>
57 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X83B92A2679EAB1EB">5.3-4 SubgroupByIgs</a></span>
58 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X78107DE78728B26B">5.3-5 AddToIgs</a></span>
59 </div></div>
60 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X803D62BC86EF07D0">5.4 <span class="Heading">Polycyclic presentation sequences for subfactors</span></a>
61 </span>
62 <div class="ContSSBlock">
63 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7DD931697DD93169">5.4-1 Pcp</a></span>
64 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X821FF77086E38B3A">5.4-2 GeneratorsOfPcp</a></span>
65 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X8297BBCD79642BE6"><code>5.4-3 <span>\</span>[<span>\</span>]</code></a></span>
66 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X780769238600AFD1">5.4-4 Length</a></span>
67 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7ABCA7F2790E1673">5.4-5 RelativeOrdersOfPcp</a></span>
68 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7D16C299825887AA">5.4-6 DenominatorOfPcp</a></span>
69 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X803AED1A84FCBEE8">5.4-7 NumeratorOfPcp</a></span>
70 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X80BCCF0B81344933">5.4-8 GroupOfPcp</a></span>
71 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X87F0BA5F7BA0F4B4">5.4-9 OneOfPcp</a></span>
72 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7A8C8BBC81581E09">5.4-10 ExponentsByPcp</a></span>
73 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X87D75F7F86FEF203">5.4-11 PcpGroupByPcp</a></span>
74 </div></div>
75 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X845D29B478CA7656">5.5 <span class="Heading">Factor groups of pcp-groups</span></a>
76 </span>
77 <div class="ContSSBlock">
78 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X80FC390C7F38A13F">5.5-1 NaturalHomomorphismByNormalSubgroup</a></span>
79 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7F51DF007F51DF00"><code>5.5-2 \/</code></a></span>
80 </div></div>
81 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X82E643F178E765EA">5.6 <span class="Heading">Homomorphisms for pcp-groups</span></a>
82 </span>
83 <div class="ContSSBlock">
84 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7F348F497C813BE0">5.6-1 GroupHomomorphismByImages</a></span>
85 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7DCD99628504B810">5.6-2 Kernel</a></span>
86 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X847322667E6166C8">5.6-3 Image</a></span>
87 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X836FAEAC78B55BF4">5.6-4 PreImage</a></span>
88 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7AE24A1586B7DE79">5.6-5 PreImagesRepresentative</a></span>
89 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7F065FD7822C0A12">5.6-6 IsInjective</a></span>
90 </div></div>
91 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X7C873F807D4F3A3C">5.7 <span class="Heading">Changing the defining pc-presentation</span></a>
92 </span>
93 <div class="ContSSBlock">
94 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X80E9B60E853B2E05">5.7-1 RefinedPcpGroup</a></span>
95 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7F88F5548329E279">5.7-2 PcpGroupBySeries</a></span>
96 </div></div>
97 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X85E681027AF19B1E">5.8 <span class="Heading">Printing a pc-presentation</span></a>
98 </span>
99 <div class="ContSSBlock">
100 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X79D247127FD57FC8">5.8-1 PrintPcpPresentation</a></span>
101 </div></div>
102 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5.html#X826ACBBB7A977206">5.9 <span class="Heading">Converting to and from a presentation</span></a>
103 </span>
104 <div class="ContSSBlock">
105 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X8771540F7A235763">5.9-1 IsomorphismPcpGroup</a></span>
106 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7F5EBF1C831B4BA9">5.9-2 IsomorphismPcpGroupFromFpGroupWithPcPres</a></span>
107 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X873CEB137BA1CD6E">5.9-3 IsomorphismPcGroup</a></span>
108 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5.html#X7F28268F850F454E">5.9-4 IsomorphismFpGroup</a></span>
109 </div></div>
110 </div>
111
112 <h3>5 <span class="Heading">Basic methods and functions for pcp-groups</span></h3>
113
114 <p>Pcp-groups are groups in the <strong class="pkg">GAP</strong> sense and hence all generic <strong class="pkg">GAP</strong> methods for groups can be applied for pcp-groups. However, for a number of group theoretic questions <strong class="pkg">GAP</strong> does not provide generic methods that can be applied to pcp-groups. For some of these questions there are functions provided in <strong class="pkg">Polycyclic</strong>.</p>
115
116 <p><a id="X821360107E355B88" name="X821360107E355B88"></a></p>
117
118 <h4>5.1 <span class="Heading">Elementary methods for pcp-groups</span></h4>
119
120 <p>In this chapter we describe some important basic functions which are available for pcp-groups. A number of higher level functions are outlined in later sections and chapters.</p>
121
122 <p>Let <span class="SimpleMath">U, V</span> and <span class="SimpleMath">N</span> be subgroups of a pcp-group.</p>
123
124 <p><a id="X806A4814806A4814" name="X806A4814806A4814"></a></p>
125
126 <h5><code>5.1-1 \=</code></h5>
127
128 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; \=</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
129 <p>decides if <var class="Arg">U</var> and <var class="Arg">V</var> are equal as sets.</p>
130
131 <p><a id="X858ADA3B7A684421" name="X858ADA3B7A684421"></a></p>
132
133 <h5>5.1-2 Size</h5>
134
135 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Size</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
136 <p>returns the size of <var class="Arg">U</var>.</p>
137
138 <p><a id="X79730D657AB219DB" name="X79730D657AB219DB"></a></p>
139
140 <h5>5.1-3 Random</h5>
141
142 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Random</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
143 <p>returns a random element of <var class="Arg">U</var>.</p>
144
145 <p><a id="X83A0356F839C696F" name="X83A0356F839C696F"></a></p>
146
147 <h5>5.1-4 Index</h5>
148
149 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Index</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
150 <p>returns the index of <var class="Arg">V</var> in <var class="Arg">U</var> if <var class="Arg">V</var> is a subgroup of <var class="Arg">U</var>. The function does not check if <var class="Arg">V</var> is a subgroup of <var class="Arg">U</var> and if it is not, the result is not meaningful.</p>
151
152 <p><a id="X87BDB89B7AAFE8AD" name="X87BDB89B7AAFE8AD"></a></p>
153
154 <h5><code>5.1-5 \in</code></h5>
155
156 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; \in</code>( <var class="Arg">g</var>, <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
157 <p>checks if <var class="Arg">g</var> is an element of <var class="Arg">U</var>.</p>
158
159 <p><a id="X79B130FC7906FB4C" name="X79B130FC7906FB4C"></a></p>
160
161 <h5>5.1-6 Elements</h5>
162
163 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Elements</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
164 <p>returns a list containing all elements of <var class="Arg">U</var> if <var class="Arg">U</var> is finite and it returns the list [fail] otherwise.</p>
165
166 <p><a id="X7D13FC1F8576FFD8" name="X7D13FC1F8576FFD8"></a></p>
167
168 <h5>5.1-7 ClosureGroup</h5>
169
170 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ClosureGroup</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
171 <p>returns the group generated by <var class="Arg">U</var> and <var class="Arg">V</var>.</p>
172
173 <p><a id="X7BDEA0A98720D1BB" name="X7BDEA0A98720D1BB"></a></p>
174
175 <h5>5.1-8 NormalClosure</h5>
176
177 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NormalClosure</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
178 <p>returns the normal closure of <var class="Arg">V</var> under action of <var class="Arg">U</var>.</p>
179
180 <p><a id="X839B42AE7A1DD544" name="X839B42AE7A1DD544"></a></p>
181
182 <h5>5.1-9 HirschLength</h5>
183
184 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; HirschLength</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
185 <p>returns the Hirsch length of <var class="Arg">U</var>.</p>
186
187 <p><a id="X7A9A3D5578CE33A0" name="X7A9A3D5578CE33A0"></a></p>
188
189 <h5>5.1-10 CommutatorSubgroup</h5>
190
191 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; CommutatorSubgroup</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
192 <p>returns the group generated by all commutators <span class="SimpleMath">[u,v]</span> with <span class="SimpleMath">u</span> in <var class="Arg">U</var> and <span class="SimpleMath">v</span> in <var class="Arg">V</var>.</p>
193
194 <p><a id="X796DA805853FAC90" name="X796DA805853FAC90"></a></p>
195
196 <h5>5.1-11 PRump</h5>
197
198 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PRump</code>( <var class="Arg">U</var>, <var class="Arg">p</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
199 <p>returns the subgroup <span class="SimpleMath">U'U^p</span> of <var class="Arg">U</var> where <var class="Arg">p</var> is a prime number.</p>
200
201 <p><a id="X814DBABC878D5232" name="X814DBABC878D5232"></a></p>
202
203 <h5>5.1-12 SmallGeneratingSet</h5>
204
205 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SmallGeneratingSet</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
206 <p>returns a small generating set for <var class="Arg">U</var>.</p>
207
208 <p><a id="X80E88168866D54F3" name="X80E88168866D54F3"></a></p>
209
210 <h4>5.2 <span class="Heading">Elementary properties of pcp-groups</span></h4>
211
212 <p><a id="X7839D8927E778334" name="X7839D8927E778334"></a></p>
213
214 <h5>5.2-1 IsSubgroup</h5>
215
216 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsSubgroup</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
217 <p>tests if <var class="Arg">V</var> is a subgroup of <var class="Arg">U</var>.</p>
218
219 <p><a id="X838186F9836F678C" name="X838186F9836F678C"></a></p>
220
221 <h5>5.2-2 IsNormal</h5>
222
223 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsNormal</code>( <var class="Arg">U</var>, <var class="Arg">V</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
224 <p>tests if <var class="Arg">V</var> is normal in <var class="Arg">U</var>.</p>
225
226 <p><a id="X87D062608719F2CD" name="X87D062608719F2CD"></a></p>
227
228 <h5>5.2-3 IsNilpotentGroup</h5>
229
230 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsNilpotentGroup</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
231 <p>checks whether <var class="Arg">U</var> is nilpotent.</p>
232
233 <p><a id="X7C12AA7479A6C103" name="X7C12AA7479A6C103"></a></p>
234
235 <h5>5.2-4 IsAbelian</h5>
236
237 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsAbelian</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
238 <p>checks whether <var class="Arg">U</var> is abelian.</p>
239
240 <p><a id="X813C952F80E775D4" name="X813C952F80E775D4"></a></p>
241
242 <h5>5.2-5 IsElementaryAbelian</h5>
243
244 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsElementaryAbelian</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
245 <p>checks whether <var class="Arg">U</var> is elementary abelian.</p>
246
247 <p><a id="X84FFC668832F9ED6" name="X84FFC668832F9ED6"></a></p>
248
249 <h5>5.2-6 IsFreeAbelian</h5>
250
251 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsFreeAbelian</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;property&nbsp;)</td></tr></table></div>
252 <p>checks whether <var class="Arg">U</var> is free abelian.</p>
253
254 <p><a id="X85A7E26C7E14AFBA" name="X85A7E26C7E14AFBA"></a></p>
255
256 <h4>5.3 <span class="Heading">Subgroups of pcp-groups</span></h4>
257
258 <p>A subgroup of a pcp-group <span class="SimpleMath">G</span> can be defined by a set of generators as described in Section <a href="chap4.html#X7A4EF7C68151905A"><span class="RefLink">4.3</span></a>. However, many computations with a subgroup <span class="SimpleMath">U</span> need an <em>induced generating sequence</em> or <em>igs</em> of <span class="SimpleMath">U</span>. An igs is a sequence of generators of <span class="SimpleMath">U</span> whose list of exponent vectors form a matrix in upper triangular form. Note that there may exist many igs of <span class="SimpleMath">U</span>. The first one calculated for <span class="SimpleMath">U</span> is stored as an attribute.</p>
259
260 <p>An induced generating sequence of a subgroup of a pcp-group <span class="SimpleMath">G</span> is a list of elements of <span class="SimpleMath">G</span>. An igs is called <em>normed</em>, if each element in the list is normed. Moreover, it is <em>canonical</em>, if the exponent vector matrix is in Hermite Normal Form. The following functions can be used to compute induced generating sequence for a given subgroup <var class="Arg">U</var> of <var class="Arg">G</var>.</p>
261
262 <p><a id="X815F756286701BE0" name="X815F756286701BE0"></a></p>
263
264 <h5>5.3-1 Igs</h5>
265
266 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Igs</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
267 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Igs</code>( <var class="Arg">gens</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
268 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IgsParallel</code>( <var class="Arg">gens</var>, <var class="Arg">gens2</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
269 <p>returns an induced generating sequence of the subgroup <var class="Arg">U</var> of a pcp-group. In the second form the subgroup is given via a generating set <var class="Arg">gens</var>. The third form computes an igs for the subgroup generated by <var class="Arg">gens</var> carrying <var class="Arg">gens2</var> through as shadows. This means that each operation that is applied to the first list is also applied to the second list.</p>
270
271 <p><a id="X7F4D95C47F9652BA" name="X7F4D95C47F9652BA"></a></p>
272
273 <h5>5.3-2 Ngs</h5>
274
275 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Ngs</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
276 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Ngs</code>( <var class="Arg">igs</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
277 <p>returns a normed induced generating sequence of the subgroup <var class="Arg">U</var> of a pcp-group. The second form takes an igs as input and norms it.</p>
278
279 <p><a id="X8077293A787D4571" name="X8077293A787D4571"></a></p>
280
281 <h5>5.3-3 Cgs</h5>
282
283 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Cgs</code>( <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
284 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Cgs</code>( <var class="Arg">igs</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
285 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; CgsParallel</code>( <var class="Arg">gens</var>, <var class="Arg">gens2</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
286 <p>returns a canonical generating sequence of the subgroup <var class="Arg">U</var> of a pcp-group. In the second form the function takes an igs as input and returns a canonical generating sequence. The third version takes a generating set and computes a canonical generating sequence carrying <var class="Arg">gens2</var> through as shadows. This means that each operation that is applied to the first list is also applied to the second list.</p>
287
288 <p>For a large number of methods for pcp-groups <var class="Arg">U</var> we will first of all determine an <var class="Arg">igs</var> for <var class="Arg">U</var>. Hence it might speed up computations, if a known <var class="Arg">igs</var> for a group <var class="Arg">U</var> is set <em>a priori</em>. The following functions can be used for this purpose.</p>
289
290 <p><a id="X83B92A2679EAB1EB" name="X83B92A2679EAB1EB"></a></p>
291
292 <h5>5.3-4 SubgroupByIgs</h5>
293
294 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SubgroupByIgs</code>( <var class="Arg">G</var>, <var class="Arg">igs</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
295 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SubgroupByIgs</code>( <var class="Arg">G</var>, <var class="Arg">igs</var>, <var class="Arg">gens</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
296 <p>returns the subgroup of the pcp-group <var class="Arg">G</var> generated by the elements of the induced generating sequence <var class="Arg">igs</var>. Note that <var class="Arg">igs</var> must be an induced generating sequence of the subgroup generated by the elements of the <var class="Arg">igs</var>. In the second form <var class="Arg">igs</var> is a igs for a subgroup and <var class="Arg">gens</var> are some generators. The function returns the subgroup generated by <var class="Arg">igs</var> and <var class="Arg">gens</var>.</p>
297
298 <p><a id="X78107DE78728B26B" name="X78107DE78728B26B"></a></p>
299
300 <h5>5.3-5 AddToIgs</h5>
301
302 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; AddToIgs</code>( <var class="Arg">igs</var>, <var class="Arg">gens</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
303 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; AddToIgsParallel</code>( <var class="Arg">igs</var>, <var class="Arg">gens</var>, <var class="Arg">igs2</var>, <var class="Arg">gens2</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
304 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; AddIgsToIgs</code>( <var class="Arg">igs</var>, <var class="Arg">igs2</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
305 <p>sifts the elements in the list <span class="SimpleMath">gens</span> into <span class="SimpleMath">igs</span>. The second version has the same functionality and carries shadows. This means that each operation that is applied to the first list and the element <var class="Arg">gens</var> is also applied to the second list and the element <var class="Arg">gens2</var>. The third version is available for efficiency reasons and assumes that the second list <var class="Arg">igs2</var> is not only a generating set, but an igs.</p>
306
307 <p><a id="X803D62BC86EF07D0" name="X803D62BC86EF07D0"></a></p>
308
309 <h4>5.4 <span class="Heading">Polycyclic presentation sequences for subfactors</span></h4>
310
311 <p>A subfactor of a pcp-group <span class="SimpleMath">G</span> is again a polycyclic group for which a polycyclic presentation can be computed. However, to compute a polycyclic presentation for a given subfactor can be time-consuming. Hence we introduce <em>polycyclic presentation sequences</em> or <em>Pcp</em> to compute more efficiently with subfactors. (Note that a subgroup is also a subfactor and thus can be handled by a pcp)</p>
312
313 <p>A pcp for a pcp-group <span class="SimpleMath">U</span> or a subfactor <span class="SimpleMath">U / N</span> can be created with one of the following functions.</p>
314
315 <p><a id="X7DD931697DD93169" name="X7DD931697DD93169"></a></p>
316
317 <h5>5.4-1 Pcp</h5>
318
319 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Pcp</code>( <var class="Arg">U</var>[, <var class="Arg">flag</var>] )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
320 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Pcp</code>( <var class="Arg">U</var>, <var class="Arg">N</var>[, <var class="Arg">flag</var>] )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
321 <p>returns a polycyclic presentation sequence for the subgroup <var class="Arg">U</var> or the quotient group <var class="Arg">U</var> modulo <var class="Arg">N</var>. If the parameter <var class="Arg">flag</var> is present and equals the string <q>snf</q>, the function can only be applied to an abelian subgroup <var class="Arg">U</var> or abelian subfactor <var class="Arg">U</var>/<var class="Arg">N</var>. The pcp returned will correspond to a decomposition of the abelian group into a direct product of cyclic groups.</p>
322
323 <p>A pcp is a component object which behaves similar to a list representing an igs of the subfactor in question. The basic functions to obtain the stored values of this component object are as follows. Let <span class="SimpleMath">pcp</span> be a pcp for a subfactor <span class="SimpleMath">U/N</span> of the defining pcp-group <span class="SimpleMath">G</span>.</p>
324
325 <p><a id="X821FF77086E38B3A" name="X821FF77086E38B3A"></a></p>
326
327 <h5>5.4-2 GeneratorsOfPcp</h5>
328
329 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; GeneratorsOfPcp</code>( <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
330 <p>this returns a list of elements of <span class="SimpleMath">U</span> corresponding to an igs of <span class="SimpleMath">U/N</span>.</p>
331
332 <p><a id="X8297BBCD79642BE6" name="X8297BBCD79642BE6"></a></p>
333
334 <h5><code>5.4-3 <span>\</span>[<span>\</span>]</code></h5>
335
336 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; <span>\</span>[<span>\</span>]</code>( <var class="Arg">pcp</var>, <var class="Arg">i</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
337 <p>returns the <var class="Arg">i</var>-th element of <var class="Arg">pcp</var>.</p>
338
339 <p><a id="X780769238600AFD1" name="X780769238600AFD1"></a></p>
340
341 <h5>5.4-4 Length</h5>
342
343 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Length</code>( <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
344 <p>returns the number of generators in <var class="Arg">pcp</var>.</p>
345
346 <p><a id="X7ABCA7F2790E1673" name="X7ABCA7F2790E1673"></a></p>
347
348 <h5>5.4-5 RelativeOrdersOfPcp</h5>
349
350 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; RelativeOrdersOfPcp</code>( <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
351 <p>the relative orders of the igs in <var class="Arg">U/N</var>.</p>
352
353 <p><a id="X7D16C299825887AA" name="X7D16C299825887AA"></a></p>
354
355 <h5>5.4-6 DenominatorOfPcp</h5>
356
357 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; DenominatorOfPcp</code>( <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
358 <p>returns an igs of <var class="Arg">N</var>.</p>
359
360 <p><a id="X803AED1A84FCBEE8" name="X803AED1A84FCBEE8"></a></p>
361
362 <h5>5.4-7 NumeratorOfPcp</h5>
363
364 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NumeratorOfPcp</code>( <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
365 <p>returns an igs of <var class="Arg">U</var>.</p>
366
367 <p><a id="X80BCCF0B81344933" name="X80BCCF0B81344933"></a></p>
368
369 <h5>5.4-8 GroupOfPcp</h5>
370
371 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; GroupOfPcp</code>( <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
372 <p>returns <var class="Arg">U</var>.</p>
373
374 <p><a id="X87F0BA5F7BA0F4B4" name="X87F0BA5F7BA0F4B4"></a></p>
375
376 <h5>5.4-9 OneOfPcp</h5>
377
378 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OneOfPcp</code>( <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
379 <p>returns the identity element of <var class="Arg">G</var>.</p>
380
381 <p>The main feature of a pcp are the possibility to compute exponent vectors without having to determine an explicit pcp-group corresponding to the subfactor that is represented by the pcp. Nonetheless, it is possible to determine this subfactor.</p>
382
383 <p><a id="X7A8C8BBC81581E09" name="X7A8C8BBC81581E09"></a></p>
384
385 <h5>5.4-10 ExponentsByPcp</h5>
386
387 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ExponentsByPcp</code>( <var class="Arg">pcp</var>, <var class="Arg">g</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
388 <p>returns the exponent vector of <var class="Arg">g</var> with respect to the generators of <var class="Arg">pcp</var>. This is the exponent vector of <var class="Arg">g</var><span class="SimpleMath">N</span> with respect to the igs of <var class="Arg">U/N</var>.</p>
389
390 <p><a id="X87D75F7F86FEF203" name="X87D75F7F86FEF203"></a></p>
391
392 <h5>5.4-11 PcpGroupByPcp</h5>
393
394 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PcpGroupByPcp</code>( <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
395 <p>let <var class="Arg">pcp</var> be a Pcp of a subgroup or a factor group of a pcp-group. This function computes a new pcp-group whose defining generators correspond to the generators in <var class="Arg">pcp</var>.</p>
396
397
398 <div class="example"><pre>
399 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> G := DihedralPcpGroup(0);</span>
400 Pcp-group with orders [ 2, 0 ]
401 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> pcp := Pcp(G);</span>
402 Pcp [ g1, g2 ] with orders [ 2, 0 ]
403 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> pcp[1];</span>
404 g1
405 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> Length(pcp);</span>
406 2
407 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> RelativeOrdersOfPcp(pcp);</span>
408 [ 2, 0 ]
409 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> DenominatorOfPcp(pcp);</span>
410 [ ]
411 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> NumeratorOfPcp(pcp);</span>
412 [ g1, g2 ]
413 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> GroupOfPcp(pcp);</span>
414 Pcp-group with orders [ 2, 0 ]
415 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">OneOfPcp(pcp);</span>
416 identity
417 </pre></div>
418
419
420 <div class="example"><pre>
421 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups(5);</span>
422 Pcp-group with orders [ 2, 0, 0, 0 ]
423 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">D := DerivedSubgroup( G );</span>
424 Pcp-group with orders [ 0, 0, 0 ]
425 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> GeneratorsOfGroup( G );</span>
426 [ g1, g2, g3, g4 ]
427 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> GeneratorsOfGroup( D );</span>
428 [ g2^-2, g3^-2, g4^2 ]
429
430 # an ordinary pcp for G / D
431 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">pcp1 := Pcp( G, D );</span>
432 Pcp [ g1, g2, g3, g4 ] with orders [ 2, 2, 2, 2 ]
433
434 # a pcp for G/D in independent generators
435 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> pcp2 := Pcp( G, D, "snf" );</span>
436 Pcp [ g2, g3, g1 ] with orders [ 2, 2, 4 ]
437
438 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> g := Random( G );</span>
439 g1*g2^-4*g3*g4^2
440
441 # compute the exponent vector of g in G/D with respect to pcp1
442 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ExponentsByPcp( pcp1, g );</span>
443 [ 1, 0, 1, 0 ]
444
445 # compute the exponent vector of g in G/D with respect to pcp2
446 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> ExponentsByPcp( pcp2, g );</span>
447 [ 0, 1, 1 ]
448 </pre></div>
449
450 <p><a id="X845D29B478CA7656" name="X845D29B478CA7656"></a></p>
451
452 <h4>5.5 <span class="Heading">Factor groups of pcp-groups</span></h4>
453
454 <p>Pcp's for subfactors of pcp-groups have already been described above. These are usually used within algorithms to compute with pcp-groups. However, it is also possible to explicitly construct factor groups and their corresponding natural homomorphisms.</p>
455
456 <p><a id="X80FC390C7F38A13F" name="X80FC390C7F38A13F"></a></p>
457
458 <h5>5.5-1 NaturalHomomorphismByNormalSubgroup</h5>
459
460 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; NaturalHomomorphismByNormalSubgroup</code>( <var class="Arg">G</var>, <var class="Arg">N</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
461 <p>returns the natural homomorphism <span class="SimpleMath">G -&gt; G/N</span>. Its image is the factor group <span class="SimpleMath">G/N</span>.</p>
462
463 <p><a id="X7F51DF007F51DF00" name="X7F51DF007F51DF00"></a></p>
464
465 <h5><code>5.5-2 \/</code></h5>
466
467 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; \/</code>( <var class="Arg">G</var>, <var class="Arg">N</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
468 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; FactorGroup</code>( <var class="Arg">G</var>, <var class="Arg">N</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
469 <p>returns the desired factor as pcp-group without giving the explicit homomorphism. This function is just a wrapper for <code class="code">PcpGroupByPcp( Pcp( G, N ) )</code>.</p>
470
471 <p><a id="X82E643F178E765EA" name="X82E643F178E765EA"></a></p>
472
473 <h4>5.6 <span class="Heading">Homomorphisms for pcp-groups</span></h4>
474
475 <p><strong class="pkg">Polycyclic</strong> provides code for defining group homomorphisms by generators and images where either the source or the range or both are pcp groups. All methods provided by GAP for such group homomorphisms are supported, in particular the following:</p>
476
477 <p><a id="X7F348F497C813BE0" name="X7F348F497C813BE0"></a></p>
478
479 <h5>5.6-1 GroupHomomorphismByImages</h5>
480
481 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; GroupHomomorphismByImages</code>( <var class="Arg">G</var>, <var class="Arg">H</var>, <var class="Arg">gens</var>, <var class="Arg">imgs</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
482 <p>returns the homomorphism from the (pcp-) group <var class="Arg">G</var> to the pcp-group <var class="Arg">H</var> mapping the generators of <var class="Arg">G</var> in the list <var class="Arg">gens</var> to the corresponding images in the list <var class="Arg">imgs</var> of elements of <var class="Arg">H</var>.</p>
483
484 <p><a id="X7DCD99628504B810" name="X7DCD99628504B810"></a></p>
485
486 <h5>5.6-2 Kernel</h5>
487
488 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Kernel</code>( <var class="Arg">hom</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
489 <p>returns the kernel of the homomorphism <var class="Arg">hom</var> from a pcp-group to a pcp-group.</p>
490
491 <p><a id="X847322667E6166C8" name="X847322667E6166C8"></a></p>
492
493 <h5>5.6-3 Image</h5>
494
495 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Image</code>( <var class="Arg">hom</var> )</td><td class="tdright">(&nbsp;operation&nbsp;)</td></tr></table></div>
496 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Image</code>( <var class="Arg">hom</var>, <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
497 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; Image</code>( <var class="Arg">hom</var>, <var class="Arg">g</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
498 <p>returns the image of the whole group, of <var class="Arg">U</var> and of <var class="Arg">g</var>, respectively, under the homomorphism <var class="Arg">hom</var>.</p>
499
500 <p><a id="X836FAEAC78B55BF4" name="X836FAEAC78B55BF4"></a></p>
501
502 <h5>5.6-4 PreImage</h5>
503
504 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PreImage</code>( <var class="Arg">hom</var>, <var class="Arg">U</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
505 <p>returns the complete preimage of the subgroup <var class="Arg">U</var> under the homomorphism <var class="Arg">hom</var>. If the domain of <var class="Arg">hom</var> is not a pcp-group, then this function only works properly if <var class="Arg">hom</var> is injective.</p>
506
507 <p><a id="X7AE24A1586B7DE79" name="X7AE24A1586B7DE79"></a></p>
508
509 <h5>5.6-5 PreImagesRepresentative</h5>
510
511 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PreImagesRepresentative</code>( <var class="Arg">hom</var>, <var class="Arg">g</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
512 <p>returns a preimage of the element <var class="Arg">g</var> under the homomorphism <var class="Arg">hom</var>.</p>
513
514 <p><a id="X7F065FD7822C0A12" name="X7F065FD7822C0A12"></a></p>
515
516 <h5>5.6-6 IsInjective</h5>
517
518 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsInjective</code>( <var class="Arg">hom</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
519 <p>checks if the homomorphism <var class="Arg">hom</var> is injective.</p>
520
521 <p><a id="X7C873F807D4F3A3C" name="X7C873F807D4F3A3C"></a></p>
522
523 <h4>5.7 <span class="Heading">Changing the defining pc-presentation</span></h4>
524
525 <p><a id="X80E9B60E853B2E05" name="X80E9B60E853B2E05"></a></p>
526
527 <h5>5.7-1 RefinedPcpGroup</h5>
528
529 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; RefinedPcpGroup</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
530 <p>returns a new pcp-group isomorphic to <var class="Arg">G</var> whose defining polycyclic presentation is refined; that is, the corresponding polycyclic series has prime or infinite factors only. If <span class="SimpleMath">H</span> is the new group, then <span class="SimpleMath">H!.bijection</span> is the isomorphism <span class="SimpleMath">G -&gt; H</span>.</p>
531
532 <p><a id="X7F88F5548329E279" name="X7F88F5548329E279"></a></p>
533
534 <h5>5.7-2 PcpGroupBySeries</h5>
535
536 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PcpGroupBySeries</code>( <var class="Arg">ser</var>[, <var class="Arg">flag</var>] )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
537 <p>returns a new pcp-group isomorphic to the first subgroup <span class="SimpleMath">G</span> of the given series <var class="Arg">ser</var> such that its defining pcp refines the given series. The series must be subnormal and <span class="SimpleMath">H!.bijection</span> is the isomorphism <span class="SimpleMath">G -&gt; H</span>. If the parameter <var class="Arg">flag</var> is present and equals the string <q>snf</q>, the series must have abelian factors. The pcp of the group returned corresponds to a decomposition of each abelian factor into a direct product of cyclic groups.</p>
538
539
540 <div class="example"><pre>
541 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup(0);</span>
542 Pcp-group with orders [ 2, 0 ]
543 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> U := Subgroup( G, [Pcp(G)[2]^1440]);</span>
544 Pcp-group with orders [ 0 ]
545 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> F := G/U;</span>
546 Pcp-group with orders [ 2, 1440 ]
547 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">RefinedPcpGroup(F);</span>
548 Pcp-group with orders [ 2, 2, 2, 2, 2, 2, 3, 3, 5 ]
549
550 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ser := [G, U, TrivialSubgroup(G)];</span>
551 [ Pcp-group with orders [ 2, 0 ],
552 Pcp-group with orders [ 0 ],
553 Pcp-group with orders [ ] ]
554 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> PcpGroupBySeries(ser);</span>
555 Pcp-group with orders [ 2, 1440, 0 ]
556 </pre></div>
557
558 <p><a id="X85E681027AF19B1E" name="X85E681027AF19B1E"></a></p>
559
560 <h4>5.8 <span class="Heading">Printing a pc-presentation</span></h4>
561
562 <p>By default, a pcp-group is printed using its relative orders only. The following methods can be used to view the pcp presentation of the group.</p>
563
564 <p><a id="X79D247127FD57FC8" name="X79D247127FD57FC8"></a></p>
565
566 <h5>5.8-1 PrintPcpPresentation</h5>
567
568 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PrintPcpPresentation</code>( <var class="Arg">G</var>[, <var class="Arg">flag</var>] )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
569 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; PrintPcpPresentation</code>( <var class="Arg">pcp</var>[, <var class="Arg">flag</var>] )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
570 <p>prints the pcp presentation defined by the igs of <var class="Arg">G</var> or the pcp <var class="Arg">pcp</var>. By default, the trivial conjugator relations are omitted from this presentation to shorten notation. Also, the relations obtained from conjugating with inverse generators are included only if the conjugating generator has infinite order. If this generator has finite order, then the conjugation relation is a consequence of the remaining relations. If the parameter <var class="Arg">flag</var> is present and equals the string <q>all</q>, all conjugate relations are printed, including the trivial conjugate relations as well as those involving conjugation with inverses.</p>
571
572 <p><a id="X826ACBBB7A977206" name="X826ACBBB7A977206"></a></p>
573
574 <h4>5.9 <span class="Heading">Converting to and from a presentation</span></h4>
575
576 <p><a id="X8771540F7A235763" name="X8771540F7A235763"></a></p>
577
578 <h5>5.9-1 IsomorphismPcpGroup</h5>
579
580 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsomorphismPcpGroup</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;attribute&nbsp;)</td></tr></table></div>
581 <p>returns an isomorphism from <var class="Arg">G</var> onto a pcp-group <var class="Arg">H</var>. There are various methods installed for this operation and some of these methods are part of the <strong class="pkg">Polycyclic</strong> package, while others may be part of other packages.</p>
582
583 <p>For example, <strong class="pkg">Polycyclic</strong> contains methods for this function in the case that <var class="Arg">G</var> is a finite pc-group or a finite solvable permutation group.</p>
584
585 <p>Other examples for methods for IsomorphismPcpGroup are the methods for the case that <var class="Arg">G</var> is a crystallographic group (see <strong class="pkg">Cryst</strong>) or the case that <var class="Arg">G</var> is an almost crystallographic group (see <strong class="pkg">AClib</strong>). A method for the case that <var class="Arg">G</var> is a rational polycyclic matrix group is included in the <strong class="pkg">Polenta</strong> package.</p>
586
587 <p><a id="X7F5EBF1C831B4BA9" name="X7F5EBF1C831B4BA9"></a></p>
588
589 <h5>5.9-2 IsomorphismPcpGroupFromFpGroupWithPcPres</h5>
590
591 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsomorphismPcpGroupFromFpGroupWithPcPres</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
592 <p>This function can convert a finitely presented group with a polycyclic presentation into a pcp group.</p>
593
594 <p><a id="X873CEB137BA1CD6E" name="X873CEB137BA1CD6E"></a></p>
595
596 <h5>5.9-3 IsomorphismPcGroup</h5>
597
598 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsomorphismPcGroup</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
599 <p>pc-groups are a representation for finite polycyclic groups. This function can convert finite pcp-groups to pc-groups.</p>
600
601 <p><a id="X7F28268F850F454E" name="X7F28268F850F454E"></a></p>
602
603 <h5>5.9-4 IsomorphismFpGroup</h5>
604
605 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; IsomorphismFpGroup</code>( <var class="Arg">G</var> )</td><td class="tdright">(&nbsp;method&nbsp;)</td></tr></table></div>
606 <p>This function can convert pcp-groups to a finitely presented group.</p>
607
608
609 <div class="chlinkprevnextbot">&nbsp;<a href="chap0.html">[Top of Book]</a>&nbsp; <a href="chap0.html#contents">[Contents]</a>&nbsp; &nbsp;<a href="chap4.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap6.html">[Next Chapter]</a>&nbsp; </div>
610
611
612 <div class="chlinkbot"><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="chapA.html">A</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>
613
614 <hr />
615 <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
616 </body>
617 </html>