Debian Codegraph @

doc/chap8_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 8: Cohomology 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="chap8" 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="chap7_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap9_mj.html">[Next Chapter]</a>&nbsp; </div>
24
25 <p id="mathjaxlink" class="pcenter"><a href="chap8.html">[MathJax off]</a></p>
26 <p><a id="X796AB9787E2A752C" name="X796AB9787E2A752C"></a></p>
27 <div class="ChapSects"><a href="chap8_mj.html#X796AB9787E2A752C">8 <span class="Heading">Cohomology for pcp-groups</span></a>
28 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8_mj.html#X875758FA7C6F5CE1">8.1 <span class="Heading">Cohomology records</span></a>
29 </span>
30 <div class="ContSSBlock">
31 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X7C97442C7B78806C">8.1-1 CRRecordByMats</a></span>
32 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X8646DFA1804D2A11">8.1-2 CRRecordBySubgroup</a></span>
33 </div></div>
34 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8_mj.html#X874759D582393441">8.2 <span class="Heading">Cohomology groups</span></a>
35 </span>
36 <div class="ContSSBlock">
37 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X85EF170387D39D4A">8.2-1 OneCoboundariesCR</a></span>
38 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X79B48D697A8A84C8">8.2-2 TwoCohomologyModCR</a></span>
39 </div></div>
40 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8_mj.html#X79610E9178BD0C54">8.3 <span class="Heading">Extended 1-cohomology</span></a>
41 </span>
42 <div class="ContSSBlock">
43 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X7E87E3EA81C84621">8.3-1 OneCoboundariesEX</a></span>
44 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X8111D2087C16CC0C">8.3-2 OneCocyclesEX</a></span>
45 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X84718DDE792FB212">8.3-3 OneCohomologyEX</a></span>
46 </div></div>
47 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8_mj.html#X853E51787A24AE00">8.4 <span class="Heading">Extensions and Complements</span></a>
48 </span>
49 <div class="ContSSBlock">
50 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X7DA9162085058006">8.4-1 ComplementCR</a></span>
51 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X7F8984D386A813D6">8.4-2 ComplementsCR</a></span>
52 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X7FAB3EB0803197FA">8.4-3 ComplementClassesCR</a></span>
53 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X8759DC59799DD508">8.4-4 ComplementClassesEfaPcps</a></span>
54 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X7B0EC76D81A056AB">8.4-5 ComplementClasses</a></span>
55 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X85F3B55C78CF840B">8.4-6 ExtensionCR</a></span>
56 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X81DC85907E0948FD">8.4-7 ExtensionsCR</a></span>
57 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X7AE16E3687E14B24">8.4-8 ExtensionClassesCR</a></span>
58 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap8_mj.html#X7986997B78AD3292">8.4-9 SplitExtensionPcpGroup</a></span>
59 </div></div>
60 <div class="ContSect"><span class="tocline"><span class="nocss">&nbsp;</span><a href="chap8_mj.html#X823771527DBD857D">8.5 <span class="Heading">Constructing pcp groups as extensions</span></a>
61 </span>
62 </div>
63 </div>
64
65 <h3>8 <span class="Heading">Cohomology for pcp-groups</span></h3>
66
67 <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_mj.html#biBEic00">[Eic00]</a>.</p>
68
69 <p>As a preparation for the cohomology computation, we introduce the cohomology records. These records provide the technical setup for our cohomology computations.</p>
70
71 <p><a id="X875758FA7C6F5CE1" name="X875758FA7C6F5CE1"></a></p>
72
73 <h4>8.1 <span class="Heading">Cohomology records</span></h4>
74
75 <p>Cohomology records provide the necessary technical setup for the cohomology computations for polycyclic groups.</p>
76
77 <p><a id="X7C97442C7B78806C" name="X7C97442C7B78806C"></a></p>
78
79 <h5>8.1-1 CRRecordByMats</h5>
80
81 <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>
82 <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">\(\mathbb{F}_p^n\)</span>. Then this function creates a record which can be used as input for the cohomology computations.</p>
83
84 <p><a id="X8646DFA1804D2A11" name="X8646DFA1804D2A11"></a></p>
85
86 <h5>8.1-2 CRRecordBySubgroup</h5>
87
88 <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>
89 <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>
90 <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>
91
92 <p>The returned cohomology record <var class="Arg">C</var> contains the following entries:</p>
93
94
95 <dl>
96 <dt><strong class="Mark"><var class="Arg">factor</var></strong></dt>
97 <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>
98
99 </dd>
100 <dt><strong class="Mark"><var class="Arg">mats</var>, <var class="Arg">invs</var> and <var class="Arg">one</var></strong></dt>
101 <dd><p>the matrix action of <var class="Arg">factor</var> with acting matrices, their inverses and the identity matrix.</p>
102
103 </dd>
104 <dt><strong class="Mark"><var class="Arg">dim</var> and <var class="Arg">char</var></strong></dt>
105 <dd><p>the dimension and characteristic of the matrices.</p>
106
107 </dd>
108 <dt><strong class="Mark"><var class="Arg">relators</var> and <var class="Arg">enumrels</var></strong></dt>
109 <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>
110
111 </dd>
112 <dt><strong class="Mark"><var class="Arg">central</var></strong></dt>
113 <dd><p>is true, if the matrices <var class="Arg">mats</var> are all trivial. This is used locally for efficiency reasons.</p>
114
115 </dd>
116 </dl>
117 <p>And additionally, if <span class="SimpleMath">\(C\)</span> defines an internal module, then it contains:</p>
118
119
120 <dl>
121 <dt><strong class="Mark"><var class="Arg">group</var></strong></dt>
122 <dd><p>the original group <var class="Arg">U</var>.</p>
123
124 </dd>
125 <dt><strong class="Mark"><var class="Arg">normal</var></strong></dt>
126 <dd><p>this is either <var class="Arg">Pcp(A)</var> or the input <var class="Arg">pcp</var>.</p>
127
128 </dd>
129 <dt><strong class="Mark"><var class="Arg">extension</var></strong></dt>
130 <dd><p>information on the extension of <var class="Arg">A</var> by <var class="Arg">U/A</var>.</p>
131
132 </dd>
133 </dl>
134 <p><a id="X874759D582393441" name="X874759D582393441"></a></p>
135
136 <h4>8.2 <span class="Heading">Cohomology groups</span></h4>
137
138 <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>
139
140 <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>
141
142 <p>Let <span class="SimpleMath">\(f_1, \ldots, 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) \to A^n : \delta \mapsto (\delta(f_1), \ldots, \delta(f_n))\)</span></p>
143
144 <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>
145
146 <p>The following functions are available to compute explicitly the first and second cohomology group as described above.</p>
147
148 <p><a id="X85EF170387D39D4A" name="X85EF170387D39D4A"></a></p>
149
150 <h5>8.2-1 OneCoboundariesCR</h5>
151
152 <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>
153 <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>
154 <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>
155 <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>
156 <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>
157 <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>
158 <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>
159
160
161 <dl>
162 <dt><strong class="Mark"><var class="Arg">gcc</var></strong></dt>
163 <dd><p>the basis of the cocycles of <var class="Arg">C</var>.</p>
164
165 </dd>
166 <dt><strong class="Mark"><var class="Arg">gcb</var></strong></dt>
167 <dd><p>the basis of the coboundaries of <var class="Arg">C</var>.</p>
168
169 </dd>
170 <dt><strong class="Mark"><var class="Arg">factor</var></strong></dt>
171 <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>
172
173
174 <dl>
175 <dt><strong class="Mark"><var class="Arg">gens</var></strong></dt>
176 <dd><p>a base for the image.</p>
177
178 </dd>
179 <dt><strong class="Mark"><var class="Arg">rels</var></strong></dt>
180 <dd><p>relative orders for the image.</p>
181
182 </dd>
183 <dt><strong class="Mark"><var class="Arg">imgs</var></strong></dt>
184 <dd><p>the images for the elements in <var class="Arg">gcc</var>.</p>
185
186 </dd>
187 <dt><strong class="Mark"><var class="Arg">prei</var></strong></dt>
188 <dd><p>preimages for the elements in <var class="Arg">gens</var>.</p>
189
190 </dd>
191 <dt><strong class="Mark"><var class="Arg">denom</var></strong></dt>
192 <dd><p>the kernel of the map; that is, another basis for <var class="Arg">gcb</var>.</p>
193
194 </dd>
195 </dl>
196 </dd>
197 </dl>
198 <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>
199
200 <p><a id="X79B48D697A8A84C8" name="X79B48D697A8A84C8"></a></p>
201
202 <h5>8.2-2 TwoCohomologyModCR</h5>
203
204 <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>
205 <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>
206
207 <p><a id="X79610E9178BD0C54" name="X79610E9178BD0C54"></a></p>
208
209 <h4>8.3 <span class="Heading">Extended 1-cohomology</span></h4>
210
211 <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>
212
213 <p><a id="X7E87E3EA81C84621" name="X7E87E3EA81C84621"></a></p>
214
215 <h5>8.3-1 OneCoboundariesEX</h5>
216
217 <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>
218 <p>returns a record consisting of the entries</p>
219
220
221 <dl>
222 <dt><strong class="Mark"><var class="Arg">basis</var></strong></dt>
223 <dd><p>a basis for <span class="SimpleMath">\(B^1(U, A) \leq A^n\)</span>.</p>
224
225 </dd>
226 <dt><strong class="Mark"><var class="Arg">transf</var></strong></dt>
227 <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>
228
229 </dd>
230 <dt><strong class="Mark"><var class="Arg">fixpts</var></strong></dt>
231 <dd><p>the fixpoints of <span class="SimpleMath">\(A\)</span>. This is also the kernel of the derivation mapping.</p>
232
233 </dd>
234 </dl>
235 <p><a id="X8111D2087C16CC0C" name="X8111D2087C16CC0C"></a></p>
236
237 <h5>8.3-2 OneCocyclesEX</h5>
238
239 <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>
240 <p>returns a record consisting of the entries</p>
241
242
243 <dl>
244 <dt><strong class="Mark"><var class="Arg">basis</var></strong></dt>
245 <dd><p>a basis for <span class="SimpleMath">\(Z^1(U, A) \leq A^n\)</span>.</p>
246
247 </dd>
248 <dt><strong class="Mark"><var class="Arg">transl</var></strong></dt>
249 <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>
250
251 </dd>
252 </dl>
253 <p><a id="X84718DDE792FB212" name="X84718DDE792FB212"></a></p>
254
255 <h5>8.3-3 OneCohomologyEX</h5>
256
257 <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>
258 <p>returns the combined information on the first cohomology group.</p>
259
260 <p><a id="X853E51787A24AE00" name="X853E51787A24AE00"></a></p>
261
262 <h4>8.4 <span class="Heading">Extensions and Complements</span></h4>
263
264 <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>
265
266 <p><a id="X7DA9162085058006" name="X7DA9162085058006"></a></p>
267
268 <h5>8.4-1 ComplementCR</h5>
269
270 <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>
271 <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>
272
273 <p><a id="X7F8984D386A813D6" name="X7F8984D386A813D6"></a></p>
274
275 <h5>8.4-2 ComplementsCR</h5>
276
277 <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>
278 <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>
279
280 <p><a id="X7FAB3EB0803197FA" name="X7FAB3EB0803197FA"></a></p>
281
282 <h5>8.4-3 ComplementClassesCR</h5>
283
284 <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>
285 <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>
286
287 <p><a id="X8759DC59799DD508" name="X8759DC59799DD508"></a></p>
288
289 <h5>8.4-4 ComplementClassesEfaPcps</h5>
290
291 <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>
292 <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>
293
294 <p><a id="X7B0EC76D81A056AB" name="X7B0EC76D81A056AB"></a></p>
295
296 <h5>8.4-5 ComplementClasses</h5>
297
298 <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>
299 <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 \leq U \leq 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>
300
301 <p><a id="X85F3B55C78CF840B" name="X85F3B55C78CF840B"></a></p>
302
303 <h5>8.4-6 ExtensionCR</h5>
304
305 <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>
306 <p>returns the extension corresponding to the 2-cocycle <span class="SimpleMath">\(c\)</span>.</p>
307
308 <p><a id="X81DC85907E0948FD" name="X81DC85907E0948FD"></a></p>
309
310 <h5>8.4-7 ExtensionsCR</h5>
311
312 <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>
313 <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>
314
315 <p><a id="X7AE16E3687E14B24" name="X7AE16E3687E14B24"></a></p>
316
317 <h5>8.4-8 ExtensionClassesCR</h5>
318
319 <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>
320 <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>
321
322 <p><a id="X7986997B78AD3292" name="X7986997B78AD3292"></a></p>
323
324 <h5>8.4-9 SplitExtensionPcpGroup</h5>
325
326 <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>
327 <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>
328
329 <p><a id="X823771527DBD857D" name="X823771527DBD857D"></a></p>
330
331 <h4>8.5 <span class="Heading">Constructing pcp groups as extensions</span></h4>
332
333 <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>
334
335
336 <div class="example"><pre>
337 # get the group and its matrix action
338 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">G := UnitriangularPcpGroup(3,0);</span>
339 Pcp-group with orders [ 0, 0, 0 ]
340 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">mats := G!.mats;</span>
341 [ [ [ 1, 1, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ],
342 [ [ 1, 0, 0 ], [ 0, 1, 1 ], [ 0, 0, 1 ] ],
343 [ [ 1, 0, 1 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ] ]
344
345 # set up the cohomology record
346 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">C := CRRecordByMats(G,mats);;</span>
347
348 # compute the second cohomology group
349 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">cc := TwoCohomologyCR(C);;</span>
350
351 # the abelian invariants of H^2(G,M)
352 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">cc.factor.rels;</span>
353 [ 2, 0, 0 ]
354
355 # construct an extension which corresponds to a cocycle that has
356 # infinite image in H^2(G,M)
357 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">c := cc.factor.prei[2];</span>
358 [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1, 1 ]
359
360 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">H := ExtensionCR( C, c);</span>
361 Pcp-group with orders [ 0, 0, 0, 0, 0, 0 ]
362
363 # check that the extension does not split - get the normal subgroup
364 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">N := H!.module;</span>
365 Pcp-group with orders [ 0, 0, 0 ]
366
367 # create the interal module
368 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">C := CRRecordBySubgroup(H,N);;</span>
369
370 # use the complements routine
371 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput">ComplementClassesCR(C);</span>
372 [ ]
373 </pre></div>
374
375
376 <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="chap7_mj.html">[Previous Chapter]</a>&nbsp; &nbsp;<a href="chap9_mj.html">[Next Chapter]</a>&nbsp; </div>
377
378
379 <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>
380
381 <hr />
382 <p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
383 </body>
384 </html>