Debian Codegraph @

doc/chap5_mj.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 <script type="text/javascript"
9 src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
10 </script>
11 <title>GAP (polycyclic) - Chapter 5: Basic methods and functions for pcp-groups</title>
12 <meta http-equiv="content-type" content="text/html; charset=UTF-8" />
13 <meta name="generator" content="GAPDoc2HTML" />
14 <link rel="stylesheet" type="text/css" href="manual.css" />
15 <script src="manual.js" type="text/javascript"></script>
16 <script type="text/javascript">overwriteStyle();</script>
17 </head>
18 <body class="chap5" onload="jscontent()">
19
20
21 <div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chapA_mj.html">A</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>
22
23 <div class="chlinkprevnexttop">&nbsp;<a href="chap0_mj.html">[Top of Book]</a>&nbsp; <a href="chap0_mj.html#contents">[Contents]</a>&nbsp; &nbsp;<a href="chap4_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap6_mj.html">[Next Chapter]</a>&nbsp; </div>
24
25 <p id="mathjaxlink" class="pcenter"><a href="chap5.html">[MathJax off]</a></p>
26 <p><a id="X7B9B85AE7C9B13EE" name="X7B9B85AE7C9B13EE"></a></p>
27 <div class="ChapSects"><a href="chap5_mj.html#X7B9B85AE7C9B13EE">5 <span class="Heading">Basic methods and functions for pcp-groups</span></a>
28 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X821360107E355B88">5.1 <span class="Heading">Elementary methods for pcp-groups</span></a>
29 </span>
30 <div class="ContSSBlock">
31 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X806A4814806A4814"><code>5.1-1 \=</code></a></span>
32 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X858ADA3B7A684421">5.1-2 Size</a></span>
33 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X79730D657AB219DB">5.1-3 Random</a></span>
34 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X83A0356F839C696F">5.1-4 Index</a></span>
35 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X87BDB89B7AAFE8AD"><code>5.1-5 \in</code></a></span>
36 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X79B130FC7906FB4C">5.1-6 Elements</a></span>
37 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7D13FC1F8576FFD8">5.1-7 ClosureGroup</a></span>
38 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7BDEA0A98720D1BB">5.1-8 NormalClosure</a></span>
39 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X839B42AE7A1DD544">5.1-9 HirschLength</a></span>
40 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7A9A3D5578CE33A0">5.1-10 CommutatorSubgroup</a></span>
41 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X796DA805853FAC90">5.1-11 PRump</a></span>
42 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X814DBABC878D5232">5.1-12 SmallGeneratingSet</a></span>
43 </div></div>
44 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X80E88168866D54F3">5.2 <span class="Heading">Elementary properties of pcp-groups</span></a>
45 </span>
46 <div class="ContSSBlock">
47 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7839D8927E778334">5.2-1 IsSubgroup</a></span>
48 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X838186F9836F678C">5.2-2 IsNormal</a></span>
49 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X87D062608719F2CD">5.2-3 IsNilpotentGroup</a></span>
50 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7C12AA7479A6C103">5.2-4 IsAbelian</a></span>
51 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X813C952F80E775D4">5.2-5 IsElementaryAbelian</a></span>
52 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X84FFC668832F9ED6">5.2-6 IsFreeAbelian</a></span>
53 </div></div>
54 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X85A7E26C7E14AFBA">5.3 <span class="Heading">Subgroups of pcp-groups</span></a>
55 </span>
56 <div class="ContSSBlock">
57 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X815F756286701BE0">5.3-1 Igs</a></span>
58 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7F4D95C47F9652BA">5.3-2 Ngs</a></span>
59 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X8077293A787D4571">5.3-3 Cgs</a></span>
60 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X83B92A2679EAB1EB">5.3-4 SubgroupByIgs</a></span>
61 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X78107DE78728B26B">5.3-5 AddToIgs</a></span>
62 </div></div>
63 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X803D62BC86EF07D0">5.4 <span class="Heading">Polycyclic presentation sequences for subfactors</span></a>
64 </span>
65 <div class="ContSSBlock">
66 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7DD931697DD93169">5.4-1 Pcp</a></span>
67 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X821FF77086E38B3A">5.4-2 GeneratorsOfPcp</a></span>
68 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X8297BBCD79642BE6"><code>5.4-3 <span>\</span>[<span>\</span>]</code></a></span>
69 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X780769238600AFD1">5.4-4 Length</a></span>
70 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7ABCA7F2790E1673">5.4-5 RelativeOrdersOfPcp</a></span>
71 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7D16C299825887AA">5.4-6 DenominatorOfPcp</a></span>
72 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X803AED1A84FCBEE8">5.4-7 NumeratorOfPcp</a></span>
73 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X80BCCF0B81344933">5.4-8 GroupOfPcp</a></span>
74 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X87F0BA5F7BA0F4B4">5.4-9 OneOfPcp</a></span>
75 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7A8C8BBC81581E09">5.4-10 ExponentsByPcp</a></span>
76 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X87D75F7F86FEF203">5.4-11 PcpGroupByPcp</a></span>
77 </div></div>
78 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X845D29B478CA7656">5.5 <span class="Heading">Factor groups of pcp-groups</span></a>
79 </span>
80 <div class="ContSSBlock">
81 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X80FC390C7F38A13F">5.5-1 NaturalHomomorphismByNormalSubgroup</a></span>
82 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7F51DF007F51DF00"><code>5.5-2 \/</code></a></span>
83 </div></div>
84 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X82E643F178E765EA">5.6 <span class="Heading">Homomorphisms for pcp-groups</span></a>
85 </span>
86 <div class="ContSSBlock">
87 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7F348F497C813BE0">5.6-1 GroupHomomorphismByImages</a></span>
88 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7DCD99628504B810">5.6-2 Kernel</a></span>
89 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X847322667E6166C8">5.6-3 Image</a></span>
90 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X836FAEAC78B55BF4">5.6-4 PreImage</a></span>
91 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7AE24A1586B7DE79">5.6-5 PreImagesRepresentative</a></span>
92 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7F065FD7822C0A12">5.6-6 IsInjective</a></span>
93 </div></div>
94 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X7C873F807D4F3A3C">5.7 <span class="Heading">Changing the defining pc-presentation</span></a>
95 </span>
96 <div class="ContSSBlock">
97 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X80E9B60E853B2E05">5.7-1 RefinedPcpGroup</a></span>
98 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7F88F5548329E279">5.7-2 PcpGroupBySeries</a></span>
99 </div></div>
100 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X85E681027AF19B1E">5.8 <span class="Heading">Printing a pc-presentation</span></a>
101 </span>
102 <div class="ContSSBlock">
103 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X79D247127FD57FC8">5.8-1 PrintPcpPresentation</a></span>
104 </div></div>
105 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap5_mj.html#X826ACBBB7A977206">5.9 <span class="Heading">Converting to and from a presentation</span></a>
106 </span>
107 <div class="ContSSBlock">
108 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X8771540F7A235763">5.9-1 IsomorphismPcpGroup</a></span>
109 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7F5EBF1C831B4BA9">5.9-2 IsomorphismPcpGroupFromFpGroupWithPcPres</a></span>
110 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X873CEB137BA1CD6E">5.9-3 IsomorphismPcGroup</a></span>
111 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap5_mj.html#X7F28268F850F454E">5.9-4 IsomorphismFpGroup</a></span>
112 </div></div>
113 </div>
114
115 <h3>5 <span class="Heading">Basic methods and functions for pcp-groups</span></h3>
116
117 <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>
118
119 <p><a id="X821360107E355B88" name="X821360107E355B88"></a></p>
120
121 <h4>5.1 <span class="Heading">Elementary methods for pcp-groups</span></h4>
122
123 <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>
124
125 <p>Let <span class="SimpleMath">\(U, V\)</span> and <span class="SimpleMath">\(N\)</span> be subgroups of a pcp-group.</p>
126
127 <p><a id="X806A4814806A4814" name="X806A4814806A4814"></a></p>
128
129 <h5><code>5.1-1 \=</code></h5>
130
131 <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>
132 <p>decides if <var class="Arg">U</var> and <var class="Arg">V</var> are equal as sets.</p>
133
134 <p><a id="X858ADA3B7A684421" name="X858ADA3B7A684421"></a></p>
135
136 <h5>5.1-2 Size</h5>
137
138 <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>
139 <p>returns the size of <var class="Arg">U</var>.</p>
140
141 <p><a id="X79730D657AB219DB" name="X79730D657AB219DB"></a></p>
142
143 <h5>5.1-3 Random</h5>
144
145 <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>
146 <p>returns a random element of <var class="Arg">U</var>.</p>
147
148 <p><a id="X83A0356F839C696F" name="X83A0356F839C696F"></a></p>
149
150 <h5>5.1-4 Index</h5>
151
152 <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>
153 <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>
154
155 <p><a id="X87BDB89B7AAFE8AD" name="X87BDB89B7AAFE8AD"></a></p>
156
157 <h5><code>5.1-5 \in</code></h5>
158
159 <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>
160 <p>checks if <var class="Arg">g</var> is an element of <var class="Arg">U</var>.</p>
161
162 <p><a id="X79B130FC7906FB4C" name="X79B130FC7906FB4C"></a></p>
163
164 <h5>5.1-6 Elements</h5>
165
166 <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>
167 <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>
168
169 <p><a id="X7D13FC1F8576FFD8" name="X7D13FC1F8576FFD8"></a></p>
170
171 <h5>5.1-7 ClosureGroup</h5>
172
173 <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>
174 <p>returns the group generated by <var class="Arg">U</var> and <var class="Arg">V</var>.</p>
175
176 <p><a id="X7BDEA0A98720D1BB" name="X7BDEA0A98720D1BB"></a></p>
177
178 <h5>5.1-8 NormalClosure</h5>
179
180 <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>
181 <p>returns the normal closure of <var class="Arg">V</var> under action of <var class="Arg">U</var>.</p>
182
183 <p><a id="X839B42AE7A1DD544" name="X839B42AE7A1DD544"></a></p>
184
185 <h5>5.1-9 HirschLength</h5>
186
187 <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>
188 <p>returns the Hirsch length of <var class="Arg">U</var>.</p>
189
190 <p><a id="X7A9A3D5578CE33A0" name="X7A9A3D5578CE33A0"></a></p>
191
192 <h5>5.1-10 CommutatorSubgroup</h5>
193
194 <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>
195 <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>
196
197 <p><a id="X796DA805853FAC90" name="X796DA805853FAC90"></a></p>
198
199 <h5>5.1-11 PRump</h5>
200
201 <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>
202 <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>
203
204 <p><a id="X814DBABC878D5232" name="X814DBABC878D5232"></a></p>
205
206 <h5>5.1-12 SmallGeneratingSet</h5>
207
208 <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>
209 <p>returns a small generating set for <var class="Arg">U</var>.</p>
210
211 <p><a id="X80E88168866D54F3" name="X80E88168866D54F3"></a></p>
212
213 <h4>5.2 <span class="Heading">Elementary properties of pcp-groups</span></h4>
214
215 <p><a id="X7839D8927E778334" name="X7839D8927E778334"></a></p>
216
217 <h5>5.2-1 IsSubgroup</h5>
218
219 <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>
220 <p>tests if <var class="Arg">V</var> is a subgroup of <var class="Arg">U</var>.</p>
221
222 <p><a id="X838186F9836F678C" name="X838186F9836F678C"></a></p>
223
224 <h5>5.2-2 IsNormal</h5>
225
226 <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>
227 <p>tests if <var class="Arg">V</var> is normal in <var class="Arg">U</var>.</p>
228
229 <p><a id="X87D062608719F2CD" name="X87D062608719F2CD"></a></p>
230
231 <h5>5.2-3 IsNilpotentGroup</h5>
232
233 <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>
234 <p>checks whether <var class="Arg">U</var> is nilpotent.</p>
235
236 <p><a id="X7C12AA7479A6C103" name="X7C12AA7479A6C103"></a></p>
237
238 <h5>5.2-4 IsAbelian</h5>
239
240 <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>
241 <p>checks whether <var class="Arg">U</var> is abelian.</p>
242
243 <p><a id="X813C952F80E775D4" name="X813C952F80E775D4"></a></p>
244
245 <h5>5.2-5 IsElementaryAbelian</h5>
246
247 <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>
248 <p>checks whether <var class="Arg">U</var> is elementary abelian.</p>
249
250 <p><a id="X84FFC668832F9ED6" name="X84FFC668832F9ED6"></a></p>
251
252 <h5>5.2-6 IsFreeAbelian</h5>
253
254 <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>
255 <p>checks whether <var class="Arg">U</var> is free abelian.</p>
256
257 <p><a id="X85A7E26C7E14AFBA" name="X85A7E26C7E14AFBA"></a></p>
258
259 <h4>5.3 <span class="Heading">Subgroups of pcp-groups</span></h4>
260
261 <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_mj.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>
262
263 <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>
264
265 <p><a id="X815F756286701BE0" name="X815F756286701BE0"></a></p>
266
267 <h5>5.3-1 Igs</h5>
268
269 <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>
270 <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>
271 <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>
272 <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>
273
274 <p><a id="X7F4D95C47F9652BA" name="X7F4D95C47F9652BA"></a></p>
275
276 <h5>5.3-2 Ngs</h5>
277
278 <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>
279 <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>
280 <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>
281
282 <p><a id="X8077293A787D4571" name="X8077293A787D4571"></a></p>
283
284 <h5>5.3-3 Cgs</h5>
285
286 <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>
287 <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>
288 <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>
289 <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>
290
291 <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>
292
293 <p><a id="X83B92A2679EAB1EB" name="X83B92A2679EAB1EB"></a></p>
294
295 <h5>5.3-4 SubgroupByIgs</h5>
296
297 <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>
298 <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>
299 <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>
300
301 <p><a id="X78107DE78728B26B" name="X78107DE78728B26B"></a></p>
302
303 <h5>5.3-5 AddToIgs</h5>
304
305 <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>
306 <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>
307 <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>
308 <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>
309
310 <p><a id="X803D62BC86EF07D0" name="X803D62BC86EF07D0"></a></p>
311
312 <h4>5.4 <span class="Heading">Polycyclic presentation sequences for subfactors</span></h4>
313
314 <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>
315
316 <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>
317
318 <p><a id="X7DD931697DD93169" name="X7DD931697DD93169"></a></p>
319
320 <h5>5.4-1 Pcp</h5>
321
322 <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>
323 <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>
324 <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>
325
326 <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>
327
328 <p><a id="X821FF77086E38B3A" name="X821FF77086E38B3A"></a></p>
329
330 <h5>5.4-2 GeneratorsOfPcp</h5>
331
332 <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>
333 <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>
334
335 <p><a id="X8297BBCD79642BE6" name="X8297BBCD79642BE6"></a></p>
336
337 <h5><code>5.4-3 <span>\</span>[<span>\</span>]</code></h5>
338
339 <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>
340 <p>returns the <var class="Arg">i</var>-th element of <var class="Arg">pcp</var>.</p>
341
342 <p><a id="X780769238600AFD1" name="X780769238600AFD1"></a></p>
343
344 <h5>5.4-4 Length</h5>
345
346 <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>
347 <p>returns the number of generators in <var class="Arg">pcp</var>.</p>
348
349 <p><a id="X7ABCA7F2790E1673" name="X7ABCA7F2790E1673"></a></p>
350
351 <h5>5.4-5 RelativeOrdersOfPcp</h5>
352
353 <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>
354 <p>the relative orders of the igs in <var class="Arg">U/N</var>.</p>
355
356 <p><a id="X7D16C299825887AA" name="X7D16C299825887AA"></a></p>
357
358 <h5>5.4-6 DenominatorOfPcp</h5>
359
360 <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>
361 <p>returns an igs of <var class="Arg">N</var>.</p>
362
363 <p><a id="X803AED1A84FCBEE8" name="X803AED1A84FCBEE8"></a></p>
364
365 <h5>5.4-7 NumeratorOfPcp</h5>
366
367 <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>
368 <p>returns an igs of <var class="Arg">U</var>.</p>
369
370 <p><a id="X80BCCF0B81344933" name="X80BCCF0B81344933"></a></p>
371
372 <h5>5.4-8 GroupOfPcp</h5>
373
374 <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>
375 <p>returns <var class="Arg">U</var>.</p>
376
377 <p><a id="X87F0BA5F7BA0F4B4" name="X87F0BA5F7BA0F4B4"></a></p>
378
379 <h5>5.4-9 OneOfPcp</h5>
380
381 <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>
382 <p>returns the identity element of <var class="Arg">G</var>.</p>
383
384 <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>
385
386 <p><a id="X7A8C8BBC81581E09" name="X7A8C8BBC81581E09"></a></p>
387
388 <h5>5.4-10 ExponentsByPcp</h5>
389
390 <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>
391 <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>
392
393 <p><a id="X87D75F7F86FEF203" name="X87D75F7F86FEF203"></a></p>
394
395 <h5>5.4-11 PcpGroupByPcp</h5>
396
397 <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>
398 <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>
399
400
401 <div class="example"><pre>
402 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> G := DihedralPcpGroup(0);</span>
403 Pcp-group with orders [ 2, 0 ]
404 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> pcp := Pcp(G);</span>
405 Pcp [ g1, g2 ] with orders [ 2, 0 ]
406 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> pcp[1];</span>
407 g1
408 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> Length(pcp);</span>
409 2
410 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> RelativeOrdersOfPcp(pcp);</span>
411 [ 2, 0 ]
412 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> DenominatorOfPcp(pcp);</span>
413 [ ]
414 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> NumeratorOfPcp(pcp);</span>
415 [ g1, g2 ]
416 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> GroupOfPcp(pcp);</span>
417 Pcp-group with orders [ 2, 0 ]
418 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">OneOfPcp(pcp);</span>
419 identity
420 </pre></div>
421
422
423 <div class="example"><pre>
424 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := ExamplesOfSomePcpGroups(5);</span>
425 Pcp-group with orders [ 2, 0, 0, 0 ]
426 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">D := DerivedSubgroup( G );</span>
427 Pcp-group with orders [ 0, 0, 0 ]
428 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> GeneratorsOfGroup( G );</span>
429 [ g1, g2, g3, g4 ]
430 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> GeneratorsOfGroup( D );</span>
431 [ g2^-2, g3^-2, g4^2 ]
432
433 # an ordinary pcp for G / D
434 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">pcp1 := Pcp( G, D );</span>
435 Pcp [ g1, g2, g3, g4 ] with orders [ 2, 2, 2, 2 ]
436
437 # a pcp for G/D in independent generators
438 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> pcp2 := Pcp( G, D, "snf" );</span>
439 Pcp [ g2, g3, g1 ] with orders [ 2, 2, 4 ]
440
441 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> g := Random( G );</span>
442 g1*g2^-4*g3*g4^2
443
444 # compute the exponent vector of g in G/D with respect to pcp1
445 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ExponentsByPcp( pcp1, g );</span>
446 [ 1, 0, 1, 0 ]
447
448 # compute the exponent vector of g in G/D with respect to pcp2
449 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> ExponentsByPcp( pcp2, g );</span>
450 [ 0, 1, 1 ]
451 </pre></div>
452
453 <p><a id="X845D29B478CA7656" name="X845D29B478CA7656"></a></p>
454
455 <h4>5.5 <span class="Heading">Factor groups of pcp-groups</span></h4>
456
457 <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>
458
459 <p><a id="X80FC390C7F38A13F" name="X80FC390C7F38A13F"></a></p>
460
461 <h5>5.5-1 NaturalHomomorphismByNormalSubgroup</h5>
462
463 <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>
464 <p>returns the natural homomorphism <span class="SimpleMath">\(G \to G/N\)</span>. Its image is the factor group <span class="SimpleMath">\(G/N\)</span>.</p>
465
466 <p><a id="X7F51DF007F51DF00" name="X7F51DF007F51DF00"></a></p>
467
468 <h5><code>5.5-2 \/</code></h5>
469
470 <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>
471 <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>
472 <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>
473
474 <p><a id="X82E643F178E765EA" name="X82E643F178E765EA"></a></p>
475
476 <h4>5.6 <span class="Heading">Homomorphisms for pcp-groups</span></h4>
477
478 <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>
479
480 <p><a id="X7F348F497C813BE0" name="X7F348F497C813BE0"></a></p>
481
482 <h5>5.6-1 GroupHomomorphismByImages</h5>
483
484 <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>
485 <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>
486
487 <p><a id="X7DCD99628504B810" name="X7DCD99628504B810"></a></p>
488
489 <h5>5.6-2 Kernel</h5>
490
491 <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>
492 <p>returns the kernel of the homomorphism <var class="Arg">hom</var> from a pcp-group to a pcp-group.</p>
493
494 <p><a id="X847322667E6166C8" name="X847322667E6166C8"></a></p>
495
496 <h5>5.6-3 Image</h5>
497
498 <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>
499 <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>
500 <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>
501 <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>
502
503 <p><a id="X836FAEAC78B55BF4" name="X836FAEAC78B55BF4"></a></p>
504
505 <h5>5.6-4 PreImage</h5>
506
507 <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>
508 <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>
509
510 <p><a id="X7AE24A1586B7DE79" name="X7AE24A1586B7DE79"></a></p>
511
512 <h5>5.6-5 PreImagesRepresentative</h5>
513
514 <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>
515 <p>returns a preimage of the element <var class="Arg">g</var> under the homomorphism <var class="Arg">hom</var>.</p>
516
517 <p><a id="X7F065FD7822C0A12" name="X7F065FD7822C0A12"></a></p>
518
519 <h5>5.6-6 IsInjective</h5>
520
521 <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>
522 <p>checks if the homomorphism <var class="Arg">hom</var> is injective.</p>
523
524 <p><a id="X7C873F807D4F3A3C" name="X7C873F807D4F3A3C"></a></p>
525
526 <h4>5.7 <span class="Heading">Changing the defining pc-presentation</span></h4>
527
528 <p><a id="X80E9B60E853B2E05" name="X80E9B60E853B2E05"></a></p>
529
530 <h5>5.7-1 RefinedPcpGroup</h5>
531
532 <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>
533 <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 \to H\)</span>.</p>
534
535 <p><a id="X7F88F5548329E279" name="X7F88F5548329E279"></a></p>
536
537 <h5>5.7-2 PcpGroupBySeries</h5>
538
539 <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>
540 <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 \to 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>
541
542
543 <div class="example"><pre>
544 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := DihedralPcpGroup(0);</span>
545 Pcp-group with orders [ 2, 0 ]
546 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> U := Subgroup( G, [Pcp(G)[2]^1440]);</span>
547 Pcp-group with orders [ 0 ]
548 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> F := G/U;</span>
549 Pcp-group with orders [ 2, 1440 ]
550 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">RefinedPcpGroup(F);</span>
551 Pcp-group with orders [ 2, 2, 2, 2, 2, 2, 3, 3, 5 ]
552
553 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ser := [G, U, TrivialSubgroup(G)];</span>
554 [ Pcp-group with orders [ 2, 0 ],
555 Pcp-group with orders [ 0 ],
556 Pcp-group with orders [ ] ]
557 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"> PcpGroupBySeries(ser);</span>
558 Pcp-group with orders [ 2, 1440, 0 ]
559 </pre></div>
560
561 <p><a id="X85E681027AF19B1E" name="X85E681027AF19B1E"></a></p>
562
563 <h4>5.8 <span class="Heading">Printing a pc-presentation</span></h4>
564
565 <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>
566
567 <p><a id="X79D247127FD57FC8" name="X79D247127FD57FC8"></a></p>
568
569 <h5>5.8-1 PrintPcpPresentation</h5>
570
571 <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>
572 <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>
573 <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>
574
575 <p><a id="X826ACBBB7A977206" name="X826ACBBB7A977206"></a></p>
576
577 <h4>5.9 <span class="Heading">Converting to and from a presentation</span></h4>
578
579 <p><a id="X8771540F7A235763" name="X8771540F7A235763"></a></p>
580
581 <h5>5.9-1 IsomorphismPcpGroup</h5>
582
583 <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>
584 <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>
585
586 <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>
587
588 <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>
589
590 <p><a id="X7F5EBF1C831B4BA9" name="X7F5EBF1C831B4BA9"></a></p>
591
592 <h5>5.9-2 IsomorphismPcpGroupFromFpGroupWithPcPres</h5>
593
594 <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>
595 <p>This function can convert a finitely presented group with a polycyclic presentation into a pcp group.</p>
596
597 <p><a id="X873CEB137BA1CD6E" name="X873CEB137BA1CD6E"></a></p>
598
599 <h5>5.9-3 IsomorphismPcGroup</h5>
600
601 <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>
602 <p>pc-groups are a representation for finite polycyclic groups. This function can convert finite pcp-groups to pc-groups.</p>
603
604 <p><a id="X7F28268F850F454E" name="X7F28268F850F454E"></a></p>
605
606 <h5>5.9-4 IsomorphismFpGroup</h5>
607
608 <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>
609 <p>This function can convert pcp-groups to a finitely presented group.</p>
610
611
612 <div class="chlinkprevnextbot">&nbsp;<a href="chap0_mj.html">[Top of Book]</a>&nbsp; <a href="chap0_mj.html#contents">[Contents]</a>&nbsp; &nbsp;<a href="chap4_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap6_mj.html">[Next Chapter]</a>&nbsp; </div>
613
614
615 <div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chapA_mj.html">A</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>
616
617 <hr />
618 <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
619 </body>
620 </html>