Debian Codegraph @

doc/chap8.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 8: Cohomology 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="chap8" 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="chap7.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap9.html">[Next Chapter]</a>&nbsp; </div>
21
22 <p id="mathjaxlink" class="pcenter"><a href="chap8_mj.html">[MathJax on]</a></p>
23 <p><a id="X796AB9787E2A752C" name="X796AB9787E2A752C"></a></p>
24 <div class="ChapSects"><a href="chap8.html#X796AB9787E2A752C">8 <span class="Heading">Cohomology for pcp-groups</span></a>
25 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8.html#X875758FA7C6F5CE1">8.1 <span class="Heading">Cohomology records</span></a>
26 </span>
27 <div class="ContSSBlock">
28 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X7C97442C7B78806C">8.1-1 CRRecordByMats</a></span>
29 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X8646DFA1804D2A11">8.1-2 CRRecordBySubgroup</a></span>
30 </div></div>
31 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8.html#X874759D582393441">8.2 <span class="Heading">Cohomology groups</span></a>
32 </span>
33 <div class="ContSSBlock">
34 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X85EF170387D39D4A">8.2-1 OneCoboundariesCR</a></span>
35 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X79B48D697A8A84C8">8.2-2 TwoCohomologyModCR</a></span>
36 </div></div>
37 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8.html#X79610E9178BD0C54">8.3 <span class="Heading">Extended 1-cohomology</span></a>
38 </span>
39 <div class="ContSSBlock">
40 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X7E87E3EA81C84621">8.3-1 OneCoboundariesEX</a></span>
41 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X8111D2087C16CC0C">8.3-2 OneCocyclesEX</a></span>
42 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X84718DDE792FB212">8.3-3 OneCohomologyEX</a></span>
43 </div></div>
44 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8.html#X853E51787A24AE00">8.4 <span class="Heading">Extensions and Complements</span></a>
45 </span>
46 <div class="ContSSBlock">
47 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X7DA9162085058006">8.4-1 ComplementCR</a></span>
48 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X7F8984D386A813D6">8.4-2 ComplementsCR</a></span>
49 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X7FAB3EB0803197FA">8.4-3 ComplementClassesCR</a></span>
50 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X8759DC59799DD508">8.4-4 ComplementClassesEfaPcps</a></span>
51 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X7B0EC76D81A056AB">8.4-5 ComplementClasses</a></span>
52 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X85F3B55C78CF840B">8.4-6 ExtensionCR</a></span>
53 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X81DC85907E0948FD">8.4-7 ExtensionsCR</a></span>
54 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X7AE16E3687E14B24">8.4-8 ExtensionClassesCR</a></span>
55 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8.html#X7986997B78AD3292">8.4-9 SplitExtensionPcpGroup</a></span>
56 </div></div>
57 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8.html#X823771527DBD857D">8.5 <span class="Heading">Constructing pcp groups as extensions</span></a>
58 </span>
59 </div>
60 </div>
61
62 <h3>8 <span class="Heading">Cohomology for pcp-groups</span></h3>
63
64 <p>The <strong class="pkg">GAP</strong> 4 package <strong class="pkg">Polycyclic</strong> provides methods to compute the first and second cohomology group for a pcp-group <span class="SimpleMath">U</span> and a finite dimensional <span class="SimpleMath">ℤ U</span> or <span class="SimpleMath">FU</span> module <span class="SimpleMath">A</span> where <span class="SimpleMath">F</span> is a finite field. The algorithm for determining the first cohomology group is outlined in <a href="chapBib.html#biBEic00">[Eic00]</a>.</p>
65
66 <p>As a preparation for the cohomology computation, we introduce the cohomology records. These records provide the technical setup for our cohomology computations.</p>
67
68 <p><a id="X875758FA7C6F5CE1" name="X875758FA7C6F5CE1"></a></p>
69
70 <h4>8.1 <span class="Heading">Cohomology records</span></h4>
71
72 <p>Cohomology records provide the necessary technical setup for the cohomology computations for polycyclic groups.</p>
73
74 <p><a id="X7C97442C7B78806C" name="X7C97442C7B78806C"></a></p>
75
76 <h5>8.1-1 CRRecordByMats</h5>
77
78 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; CRRecordByMats</code>( <var class="Arg">U</var>, <var class="Arg">mats</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
79 <p>creates an external module. Let <var class="Arg">U</var> be a pcp group which acts via the list of matrices <var class="Arg">mats</var> on a vector space of the form <span class="SimpleMath">ℤ^n</span> or <span class="SimpleMath">F_p^n</span>. Then this function creates a record which can be used as input for the cohomology computations.</p>
80
81 <p><a id="X8646DFA1804D2A11" name="X8646DFA1804D2A11"></a></p>
82
83 <h5>8.1-2 CRRecordBySubgroup</h5>
84
85 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; CRRecordBySubgroup</code>( <var class="Arg">U</var>, <var class="Arg">A</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
86 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; CRRecordByPcp</code>( <var class="Arg">U</var>, <var class="Arg">pcp</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
87 <p>creates an internal module. Let <var class="Arg">U</var> be a pcp group and let <var class="Arg">A</var> be a normal elementary or free abelian normal subgroup of <var class="Arg">U</var> or let <var class="Arg">pcp</var> be a pcp of a normal elementary of free abelian subfactor of <var class="Arg">U</var>. Then this function creates a record which can be used as input for the cohomology computations.</p>
88
89 <p>The returned cohomology record <var class="Arg">C</var> contains the following entries:</p>
90
91
92 <dl>
93 <dt><strong class="Mark"><var class="Arg">factor</var></strong></dt>
94 <dd><p>a pcp of the acting group. If the module is external, then this is <var class="Arg">Pcp(U)</var>. If the module is internal, then this is <var class="Arg">Pcp(U, A)</var> or <var class="Arg">Pcp(U, GroupOfPcp(pcp))</var>.</p>
95
96 </dd>
97 <dt><strong class="Mark"><var class="Arg">mats</var>, <var class="Arg">invs</var> and <var class="Arg">one</var></strong></dt>
98 <dd><p>the matrix action of <var class="Arg">factor</var> with acting matrices, their inverses and the identity matrix.</p>
99
100 </dd>
101 <dt><strong class="Mark"><var class="Arg">dim</var> and <var class="Arg">char</var></strong></dt>
102 <dd><p>the dimension and characteristic of the matrices.</p>
103
104 </dd>
105 <dt><strong class="Mark"><var class="Arg">relators</var> and <var class="Arg">enumrels</var></strong></dt>
106 <dd><p>the right hand sides of the polycyclic relators of <var class="Arg">factor</var> as generator exponents lists and a description for the corresponding left hand sides.</p>
107
108 </dd>
109 <dt><strong class="Mark"><var class="Arg">central</var></strong></dt>
110 <dd><p>is true, if the matrices <var class="Arg">mats</var> are all trivial. This is used locally for efficiency reasons.</p>
111
112 </dd>
113 </dl>
114 <p>And additionally, if <span class="SimpleMath">C</span> defines an internal module, then it contains:</p>
115
116
117 <dl>
118 <dt><strong class="Mark"><var class="Arg">group</var></strong></dt>
119 <dd><p>the original group <var class="Arg">U</var>.</p>
120
121 </dd>
122 <dt><strong class="Mark"><var class="Arg">normal</var></strong></dt>
123 <dd><p>this is either <var class="Arg">Pcp(A)</var> or the input <var class="Arg">pcp</var>.</p>
124
125 </dd>
126 <dt><strong class="Mark"><var class="Arg">extension</var></strong></dt>
127 <dd><p>information on the extension of <var class="Arg">A</var> by <var class="Arg">U/A</var>.</p>
128
129 </dd>
130 </dl>
131 <p><a id="X874759D582393441" name="X874759D582393441"></a></p>
132
133 <h4>8.2 <span class="Heading">Cohomology groups</span></h4>
134
135 <p>Let <span class="SimpleMath">U</span> be a pcp-group and <span class="SimpleMath">A</span> a free or elementary abelian pcp-group and a <span class="SimpleMath">U</span>-module. By <span class="SimpleMath">Z^i(U, A)</span> be denote the group of <span class="SimpleMath">i</span>-th cocycles and by <span class="SimpleMath">B^i(U, A)</span> the <span class="SimpleMath">i</span>-th coboundaries. The factor <span class="SimpleMath">Z^i(U,A) / B^i(U,A)</span> is the <span class="SimpleMath">i</span>-th cohomology group. Since <span class="SimpleMath">A</span> is elementary or free abelian, the groups <span class="SimpleMath">Z^i(U, A)</span> and <span class="SimpleMath">B^i(U, A)</span> are elementary or free abelian groups as well.</p>
136
137 <p>The <strong class="pkg">Polycyclic</strong> package provides methods to compute first and second cohomology group for a polycyclic group <var class="Arg">U</var>. We write all involved groups additively and we use an explicit description by bases for them. Let <span class="SimpleMath">C</span> be the cohomology record corresponding to <span class="SimpleMath">U</span> and <span class="SimpleMath">A</span>.</p>
138
139 <p>Let <span class="SimpleMath">f_1, ..., f_n</span> be the elements in the entry <span class="SimpleMath">factor</span> of the cohomology record <span class="SimpleMath">C</span>. Then we use the following embedding of the first cocycle group to describe 1-cocycles and 1-coboundaries: <span class="SimpleMath">Z^1(U, A) -&gt; A^n : δ ↦ (δ(f_1), ..., δ(f_n))</span></p>
140
141 <p>For the second cohomology group we recall that each element of <span class="SimpleMath">Z^2(U, A)</span> defines an extension <span class="SimpleMath">H</span> of <span class="SimpleMath">A</span> by <span class="SimpleMath">U</span>. Thus there is a pc-presentation of <span class="SimpleMath">H</span> extending the pc-presentation of <span class="SimpleMath">U</span> given by the record <span class="SimpleMath">C</span>. The extended presentation is defined by tails in <span class="SimpleMath">A</span>; that is, each relator in the record entry <span class="SimpleMath">relators</span> is extended by an element of <span class="SimpleMath">A</span>. The concatenation of these tails yields a vector in <span class="SimpleMath">A^l</span> where <span class="SimpleMath">l</span> is the length of the record entry <span class="SimpleMath">relators</span> of <span class="SimpleMath">C</span>. We use these tail vectors to describe <span class="SimpleMath">Z^2(U, A)</span> and <span class="SimpleMath">B^2(U, A)</span>. Note that this description is dependent on the chosen presentation in <span class="SimpleMath">C</span>. However, the factor <span class="SimpleMath">Z^2(U, A)/ B^2(U, A)</span> is independent of the chosen presentation.</p>
142
143 <p>The following functions are available to compute explicitly the first and second cohomology group as described above.</p>
144
145 <p><a id="X85EF170387D39D4A" name="X85EF170387D39D4A"></a></p>
146
147 <h5>8.2-1 OneCoboundariesCR</h5>
148
149 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OneCoboundariesCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
150 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OneCocyclesCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
151 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; TwoCoboundariesCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
152 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; TwoCocyclesCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
153 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OneCohomologyCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
154 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; TwoCohomologyCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
155 <p>The first four functions return bases of the corresponding group. The last two functions need to describe a factor of additive abelian groups. They return the following descriptions for these factors.</p>
156
157
158 <dl>
159 <dt><strong class="Mark"><var class="Arg">gcc</var></strong></dt>
160 <dd><p>the basis of the cocycles of <var class="Arg">C</var>.</p>
161
162 </dd>
163 <dt><strong class="Mark"><var class="Arg">gcb</var></strong></dt>
164 <dd><p>the basis of the coboundaries of <var class="Arg">C</var>.</p>
165
166 </dd>
167 <dt><strong class="Mark"><var class="Arg">factor</var></strong></dt>
168 <dd><p>a description of the factor of cocycles by coboundaries. Usually, it would be most convenient to use additive mappings here. However, these are not available in case that <var class="Arg">A</var> is free abelian and thus we use a description of this additive map as record. This record contains</p>
169
170
171 <dl>
172 <dt><strong class="Mark"><var class="Arg">gens</var></strong></dt>
173 <dd><p>a base for the image.</p>
174
175 </dd>
176 <dt><strong class="Mark"><var class="Arg">rels</var></strong></dt>
177 <dd><p>relative orders for the image.</p>
178
179 </dd>
180 <dt><strong class="Mark"><var class="Arg">imgs</var></strong></dt>
181 <dd><p>the images for the elements in <var class="Arg">gcc</var>.</p>
182
183 </dd>
184 <dt><strong class="Mark"><var class="Arg">prei</var></strong></dt>
185 <dd><p>preimages for the elements in <var class="Arg">gens</var>.</p>
186
187 </dd>
188 <dt><strong class="Mark"><var class="Arg">denom</var></strong></dt>
189 <dd><p>the kernel of the map; that is, another basis for <var class="Arg">gcb</var>.</p>
190
191 </dd>
192 </dl>
193 </dd>
194 </dl>
195 <p>There is an additional function which can be used to compute the second cohomology group over an arbitrary finitely generated abelian group. The finitely generated abelian group should be realized as a factor of a free abelian group modulo a lattice. The function is called as</p>
196
197 <p><a id="X79B48D697A8A84C8" name="X79B48D697A8A84C8"></a></p>
198
199 <h5>8.2-2 TwoCohomologyModCR</h5>
200
201 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; TwoCohomologyModCR</code>( <var class="Arg">C</var>, <var class="Arg">lat</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
202 <p>where <var class="Arg">C</var> is a cohomology record and <var class="Arg">lat</var> is a basis for a sublattice of a free abelian module. The output format is the same as for <code class="code">TwoCohomologyCR</code>.</p>
203
204 <p><a id="X79610E9178BD0C54" name="X79610E9178BD0C54"></a></p>
205
206 <h4>8.3 <span class="Heading">Extended 1-cohomology</span></h4>
207
208 <p>In some cases more information on the first cohomology group is of interest. In particular, if we have an internal module given and we want to compute the complements using the first cohomology group, then we need additional information. This extended version of first cohomology is obtained by the following functions.</p>
209
210 <p><a id="X7E87E3EA81C84621" name="X7E87E3EA81C84621"></a></p>
211
212 <h5>8.3-1 OneCoboundariesEX</h5>
213
214 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OneCoboundariesEX</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
215 <p>returns a record consisting of the entries</p>
216
217
218 <dl>
219 <dt><strong class="Mark"><var class="Arg">basis</var></strong></dt>
220 <dd><p>a basis for <span class="SimpleMath">B^1(U, A) ≤ A^n</span>.</p>
221
222 </dd>
223 <dt><strong class="Mark"><var class="Arg">transf</var></strong></dt>
224 <dd><p>There is a derivation mapping from <span class="SimpleMath">A</span> to <span class="SimpleMath">B^1(U,A)</span>. This mapping is described here as transformation from <span class="SimpleMath">A</span> to <var class="Arg">basis</var>.</p>
225
226 </dd>
227 <dt><strong class="Mark"><var class="Arg">fixpts</var></strong></dt>
228 <dd><p>the fixpoints of <span class="SimpleMath">A</span>. This is also the kernel of the derivation mapping.</p>
229
230 </dd>
231 </dl>
232 <p><a id="X8111D2087C16CC0C" name="X8111D2087C16CC0C"></a></p>
233
234 <h5>8.3-2 OneCocyclesEX</h5>
235
236 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OneCocyclesEX</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
237 <p>returns a record consisting of the entries</p>
238
239
240 <dl>
241 <dt><strong class="Mark"><var class="Arg">basis</var></strong></dt>
242 <dd><p>a basis for <span class="SimpleMath">Z^1(U, A) ≤ A^n</span>.</p>
243
244 </dd>
245 <dt><strong class="Mark"><var class="Arg">transl</var></strong></dt>
246 <dd><p>a special solution. This is only of interest in case that <span class="SimpleMath">C</span> is an internal module and in this case it gives the translation vector in <span class="SimpleMath">A^n</span> used to obtain complements corresponding to the elements in <span class="SimpleMath">basis</span>. If <span class="SimpleMath">C</span> is not an internal module, then this vector is always the zero vector.</p>
247
248 </dd>
249 </dl>
250 <p><a id="X84718DDE792FB212" name="X84718DDE792FB212"></a></p>
251
252 <h5>8.3-3 OneCohomologyEX</h5>
253
254 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; OneCohomologyEX</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
255 <p>returns the combined information on the first cohomology group.</p>
256
257 <p><a id="X853E51787A24AE00" name="X853E51787A24AE00"></a></p>
258
259 <h4>8.4 <span class="Heading">Extensions and Complements</span></h4>
260
261 <p>The natural applications of first and second cohomology group is the determination of extensions and complements. Let <span class="SimpleMath">C</span> be a cohomology record.</p>
262
263 <p><a id="X7DA9162085058006" name="X7DA9162085058006"></a></p>
264
265 <h5>8.4-1 ComplementCR</h5>
266
267 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ComplementCR</code>( <var class="Arg">C</var>, <var class="Arg">c</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
268 <p>returns the complement corresponding to the 1-cocycle <var class="Arg">c</var>. In the case that <var class="Arg">C</var> is an external module, we construct the split extension of <span class="SimpleMath">U</span> with <span class="SimpleMath">A</span> first and then determine the complement. In the case that <var class="Arg">C</var> is an internal module, the vector <var class="Arg">c</var> must be an element of the affine space corresponding to the complements as described by <code class="code">OneCocyclesEX</code>.</p>
269
270 <p><a id="X7F8984D386A813D6" name="X7F8984D386A813D6"></a></p>
271
272 <h5>8.4-2 ComplementsCR</h5>
273
274 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ComplementsCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
275 <p>returns all complements using the correspondence to <span class="SimpleMath">Z^1(U,A)</span>. Further, this function returns fail, if <span class="SimpleMath">Z^1(U,A)</span> is infinite.</p>
276
277 <p><a id="X7FAB3EB0803197FA" name="X7FAB3EB0803197FA"></a></p>
278
279 <h5>8.4-3 ComplementClassesCR</h5>
280
281 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ComplementClassesCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
282 <p>returns complement classes using the correspondence to <span class="SimpleMath">H^1(U,A)</span>. Further, this function returns fail, if <span class="SimpleMath">H^1(U,A)</span> is infinite.</p>
283
284 <p><a id="X8759DC59799DD508" name="X8759DC59799DD508"></a></p>
285
286 <h5>8.4-4 ComplementClassesEfaPcps</h5>
287
288 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ComplementClassesEfaPcps</code>( <var class="Arg">U</var>, <var class="Arg">N</var>, <var class="Arg">pcps</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
289 <p>Let <span class="SimpleMath">N</span> be a normal subgroup of <span class="SimpleMath">U</span>. This function returns the complement classes to <span class="SimpleMath">N</span> in <span class="SimpleMath">U</span>. The classes are computed by iteration over the <span class="SimpleMath">U</span>-invariant efa series of <span class="SimpleMath">N</span> described by <var class="Arg">pcps</var>. If at some stage in this iteration infinitely many complements are discovered, then the function returns fail. (Even though there might be only finitely many conjugacy classes of complements to <span class="SimpleMath">N</span> in <span class="SimpleMath">U</span>.)</p>
290
291 <p><a id="X7B0EC76D81A056AB" name="X7B0EC76D81A056AB"></a></p>
292
293 <h5>8.4-5 ComplementClasses</h5>
294
295 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ComplementClasses</code>( [<var class="Arg">V</var>, ]<var class="Arg">U</var>, <var class="Arg">N</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
296 <p>Let <span class="SimpleMath">N</span> and <span class="SimpleMath">U</span> be normal subgroups of <span class="SimpleMath">V</span> with <span class="SimpleMath">N ≤ U ≤ V</span>. This function attempts to compute the <span class="SimpleMath">V</span>-conjugacy classes of complements to <span class="SimpleMath">N</span> in <span class="SimpleMath">U</span>. The algorithm proceeds by iteration over a <span class="SimpleMath">V</span>-invariant efa series of <span class="SimpleMath">N</span>. If at some stage in this iteration infinitely many complements are discovered, then the algorithm returns fail.</p>
297
298 <p><a id="X85F3B55C78CF840B" name="X85F3B55C78CF840B"></a></p>
299
300 <h5>8.4-6 ExtensionCR</h5>
301
302 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ExtensionCR</code>( <var class="Arg">C</var>, <var class="Arg">c</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
303 <p>returns the extension corresponding to the 2-cocycle <span class="SimpleMath">c</span>.</p>
304
305 <p><a id="X81DC85907E0948FD" name="X81DC85907E0948FD"></a></p>
306
307 <h5>8.4-7 ExtensionsCR</h5>
308
309 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ExtensionsCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
310 <p>returns all extensions using the correspondence to <span class="SimpleMath">Z^2(U,A)</span>. Further, this function returns fail, if <span class="SimpleMath">Z^2(U,A)</span> is infinite.</p>
311
312 <p><a id="X7AE16E3687E14B24" name="X7AE16E3687E14B24"></a></p>
313
314 <h5>8.4-8 ExtensionClassesCR</h5>
315
316 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; ExtensionClassesCR</code>( <var class="Arg">C</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
317 <p>returns extension classes using the correspondence to <span class="SimpleMath">H^2(U,A)</span>. Further, this function returns fail, if <span class="SimpleMath">H^2(U,A)</span> is infinite.</p>
318
319 <p><a id="X7986997B78AD3292" name="X7986997B78AD3292"></a></p>
320
321 <h5>8.4-9 SplitExtensionPcpGroup</h5>
322
323 <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">&#8227; SplitExtensionPcpGroup</code>( <var class="Arg">U</var>, <var class="Arg">mats</var> )</td><td class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
324 <p>returns the split extension of <var class="Arg">U</var> by the <span class="SimpleMath">U</span>-module described by <var class="Arg">mats</var>.</p>
325
326 <p><a id="X823771527DBD857D" name="X823771527DBD857D"></a></p>
327
328 <h4>8.5 <span class="Heading">Constructing pcp groups as extensions</span></h4>
329
330 <p>This section contains an example application of the second cohomology group to the construction of pcp groups as extensions. The following constructs extensions of the group of upper unitriangular matrices with its natural lattice.</p>
331
332
333 <div class="example"><pre>
334 # get the group and its matrix action
335 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := UnitriangularPcpGroup(3,0);</span>
336 Pcp-group with orders [ 0, 0, 0 ]
337 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">mats := G!.mats;</span>
338 [ [ [ 1, 1, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ],
339 [ [ 1, 0, 0 ], [ 0, 1, 1 ], [ 0, 0, 1 ] ],
340 [ [ 1, 0, 1 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ] ]
341
342 # set up the cohomology record
343 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">C := CRRecordByMats(G,mats);;</span>
344
345 # compute the second cohomology group
346 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">cc := TwoCohomologyCR(C);;</span>
347
348 # the abelian invariants of H^2(G,M)
349 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">cc.factor.rels;</span>
350 [ 2, 0, 0 ]
351
352 # construct an extension which corresponds to a cocycle that has
353 # infinite image in H^2(G,M)
354 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">c := cc.factor.prei[2];</span>
355 [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1, 1 ]
356
357 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">H := ExtensionCR( C, c);</span>
358 Pcp-group with orders [ 0, 0, 0, 0, 0, 0 ]
359
360 # check that the extension does not split - get the normal subgroup
361 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">N := H!.module;</span>
362 Pcp-group with orders [ 0, 0, 0 ]
363
364 # create the interal module
365 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">C := CRRecordBySubgroup(H,N);;</span>
366
367 # use the complements routine
368 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ComplementClassesCR(C);</span>
369 [ ]
370 </pre></div>
371
372
373 <div class="chlinkprevnextbot">&nbsp;<a href="chap0.html">[Top of Book]</a>&nbsp; <a href="chap0.html#contents">[Contents]</a>&nbsp; &nbsp;<a href="chap7.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap9.html">[Next Chapter]</a>&nbsp; </div>
374
375
376 <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>
377
378 <hr />
379 <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
380 </body>
381 </html>