CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutSign UpSign In

Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.

| Download

GAP 4.8.9 installation with standard packages -- copy to your CoCalc project to get it

Path: gap4r8 / pkg / aclib / doc / examp.tex
Views: 418346
1
\Chapter{Example computations with almost crystallographic groups}
2
3
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
4
\Section{Example computations I}
5
6
Using the functions available for pcp groups in the share package
7
{\sf polycyclic} it is now easy to redo some of the calculations of
8
\cite{KD}. As a first example we check whether the groups indicated
9
as torsion free in \cite{KD} are also determined as torsion free
10
ones by \GAP. In \cite{KD} these almost Bieberbach groups are listed as
11
``AB-groups''. So for type ``013'' these are the groups with parameters
12
$(k,0,1,0,1,0)$ where $k$ is an even integer. Let's look at some examples
13
in \GAP:
14
15
\beginexample
16
gap> G:=AlmostCrystallographicPcpDim4("013",[8,0,1,0,1,0]);
17
Pcp-group with orders [ 2, 2, 0, 0, 0, 0 ]
18
gap> IsTorsionFree(G);
19
true
20
gap> G:=AlmostCrystallographicPcpDim4("013",[9,0,1,0,1,0]);
21
Pcp-group with orders [ 2, 2, 0, 0, 0, 0 ]
22
gap> IsTorsionFree(G);
23
false
24
\endexample
25
26
Further, there is also some cohomology information in the tables
27
of \cite{KD}. In fact, the groups in this library were obtained
28
as extensions $E$ of the form
29
30
$$
31
1 \rightarrow \Z \rightarrow E \rightarrow Q \rightarrow 1
32
$$
33
34
where, in the 4-dimensional case $Q = E/\langle d \rangle$. The
35
cohomology information for the particular example above shows that
36
the groups determined by a parameter set $(k_1,k_2,k_3,k_4,k_4,k_6)$
37
are equivalent as extensions to the groups determined by the parameters
38
$(k_1, k_2 \bmod 2, k_3 \bmod 2, k_4 \bmod 2, k_5 \bmod 2, 0)$. This is
39
also visible in finding torsion:
40
41
\beginexample
42
gap> G:=AlmostCrystallographicPcpDim4("013",[10,0,2,0,1,0]);
43
Pcp-group with orders [ 2, 2, 0, 0, 0, 0 ]
44
gap> IsTorsionFree(G);
45
false
46
gap> G:=AlmostCrystallographicPcpDim4("013",[10,0,3,0,1,9]);
47
Pcp-group with orders [ 2, 2, 0, 0, 0, 0 ]
48
gap> IsTorsionFree(G);
49
true
50
\endexample
51
52
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
53
\Section{Example computations II}
54
55
The computation of cohomology groups played an important role in the
56
classification of the almost Bieberbach groups in \cite{KD}. Using
57
\GAP, it is now possible to check these computations. As an example we
58
consider the 4-dimensional almost crystallographic groups of type 85 on
59
page 202 of \cite{KD}. This group $E$ has 6 generators. In the table, one
60
also finds the information
61
62
$$
63
H^2(Q,\Z) = \Z \oplus (\Z_2)^2 \oplus \Z_4
64
$$
65
66
for $Q=E/\langle d \rangle$ as above. Moreover, the $Q$--module $\Z$ is
67
in fact the group $\langle d \rangle$, where the $Q$-action comes from
68
conjugation inside $E$. In the case of groups of type 85, $\Z$ is a
69
trivial $Q$-module. The following example demonstrates how to (re)compute
70
this two-cohomology group $H^2(Q,\Z)$.
71
72
\beginexample
73
gap> G:=AlmostCrystallographicPcpGroup(4, "085", false);
74
Pcp group with orders [ 2, 4, 0, 0, 0, 0 ]
75
gap> GroupGeneratedByd:=Subgroup(G, [G.6] );
76
Pcp group with orders [ 0 ]
77
gap> Q:=G/GroupGeneratedByd;
78
Pcp group with orders [ 2, 4, 0, 0, 0 ]
79
gap> action:=List( Pcp(Q), x -> [[1]] );
80
[ [ [ 1 ] ], [ [ 1 ] ], [ [ 1 ] ], [ [ 1 ] ], [ [ 1 ] ] ]
81
gap> C:=CRRecordByMats( Q, action);;
82
gap> TwoCohomologyCR( C ).factor.rels;
83
[ 2, 2, 4, 0 ]
84
\endexample
85
86
This last line gives us the abelian invariants of the second
87
cohomology group $H^2(Q,\Z)$. So we should read this line as
88
89
$$
90
H^2(Q,\Z) = \Z_2 \oplus \Z_2 \oplus \Z_4 \oplus \Z
91
$$
92
93
which indeed coincides with the information in \cite{KD}.
94
95
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
96
\Section{Example computations III}
97
98
As another application of the capabilities of the combination of
99
`aclib' and {\sf polycyclic} we check some computations of \cite{DM}.
100
101
Section 5 of the paper \cite{DM} is completely devoted to an example
102
of the computation of the $P$-localization of a virtually nilpotent group,
103
where $P$ is a set of primes. Although it is not our intention to
104
develop the theory of $P$-localization of groups at this place, let us
105
summarize some of the main results concerning this topic here.
106
107
For a set of primes $P$, we say that $n \in P$ if and only if $n$ is
108
a product of primes in $P$. A group $G$ is said to be $P$-local if and
109
only if the map $\mu_n:G\rightarrow G: g \mapsto g^n$ is bijective for
110
all $n \in P'$, where $P'$ is the set of all primes not in $P$. The
111
$P$-localization of a group $G$, is a $P$-local group $G_P$ together
112
with a morphism $\alpha :G \rightarrow G_P$ which satisfy the following
113
universal property: For each $P$-local group $L$ and any morphism
114
$\varphi: G \rightarrow L$, there exists a unique morphism $\psi:G_P
115
\rightarrow L$, such that $\psi \circ \alpha = \varphi$.
116
117
This concept of localization is well developed for finite groups and
118
for nilpotent groups. For a finite group $G$, the $P$-localization is
119
the largest quotient of $G$, having no elements with an order belonging to
120
$P'$ (the morphism $\alpha$, mentioned above is the natural projection).
121
122
In \cite{DM} a contribution is made towards the localization of virtually
123
nilpotent groups. The theory developed in the paper is then illustrated
124
in the last section of the paper by means of the computation of the
125
$P$-localization of an almost crystallographic group. For their example
126
the authors have chosen an almost crystallographic group $G$ of dimension 3
127
and type 17. For the set of parameters $(k_1,k_2,k_3,k_4)$ they have
128
considered all cases of the form $(k_1,k_2,k_3,k_4)=(2,0,0,k_4)$.
129
130
Here we will check their computations in two cases $k_4=0$ and $k_4=1$
131
using the set of primes $P=\{2\}$. The holonomy group of these almost
132
crystallographic groups $G$ is the dihedral group ${\cal D}_6$ of order
133
12. Thus there is a short exact sequence of the form
134
$$ 1 \rightarrow {\rm Fitt}(G) \rightarrow G
135
\rightarrow {\cal D}_6 \rightarrow 1. $$
136
137
As a first step in their computation, Descheemaeker and Malfait determine
138
the group $I_{P'}{\cal D}_6$, which is the unique subgroup of order 3 in
139
${\cal D}_6$. One of the main objects in \cite{DM} is the group $K=p^{-1}
140
(I_{P'}{\cal D}_6)$, where $p$ is the natural projection of $G$ onto its
141
holonomy group. It is known that the $P$-localization of $G$ coincides
142
with the $P$-localization of $G/\gamma_3(K)$, where $\gamma_3(K)$ is the
143
third term in the lower central series of $K$. As $G/\gamma_3(K)$ is
144
finite in this example, we exactly know what this $P$-localization is.
145
Let us now show, how GAP can be used to compute this $P$-localization in
146
two cases:
147
148
\medskip
149
First case: The parameters are $(k_1,k_2,k_3,k_4)=(2,0,0,0)$
150
\beginexample
151
gap> G := AlmostCrystallographicPcpGroup(3, 17, [2,0,0,0] );
152
Pcp group with orders [ 2, 6, 0, 0, 0 ]
153
gap> projection := NaturalHomomorphismOnHolonomyGroup( G );
154
[ g1, g2, g3, g4, g5 ] -> [ g1, g2, identity, identity, identity ]
155
gap> F := HolonomyGroup( G );
156
Pcp group with orders [ 2, 6 ]
157
gap> IPprimeD6 := Subgroup( F , [F.2^2] );
158
Pcp group with orders [ 3 ]
159
gap> K := PreImage( projection, IPprimeD6 );
160
Pcp group with orders [ 3, 0, 0, 0 ]
161
gap> PrintPcpPresentation( K );
162
pcp presentation on generators [ g2^2, g3, g4, g5 ]
163
g2^2 ^ 3 = identity
164
g3 ^ g2^2 = g3^-1*g4^-1
165
g3 ^ g2^2^-1 = g4*g5^-2
166
g4 ^ g2^2 = g3*g5^2
167
g4 ^ g2^2^-1 = g3^-1*g4^-1*g5^2
168
g4 ^ g3 = g4*g5^2
169
g4 ^ g3^-1 = g4*g5^-2
170
gap> Gamma3K := CommutatorSubgroup( K, CommutatorSubgroup( K, K ));
171
Pcp group with orders [ 0, 0, 0 ]
172
gap> quotient := G/Gamma3K;
173
Pcp group with orders [ 2, 6, 3, 3, 2 ]
174
gap> S := SylowSubgroup( quotient, 3);
175
Pcp group with orders [ 3, 3, 3 ]
176
gap> N := NormalClosure( quotient, S);
177
Pcp group with orders [ 3, 3, 3 ]
178
gap> localization := quotient/N;
179
Pcp group with orders [ 2, 2, 2 ]
180
gap> PrintPcpPresentation( localization );
181
pcp presentation on generators [ g1, g2, g3 ]
182
g1 ^ 2 = identity
183
g2 ^ 2 = identity
184
g3 ^ 2 = identity
185
\endexample
186
This shows that $G_P\cong \Z_2^3$.
187
188
\medskip
189
190
Second case: The parameters are $(k_1,k_2,k_3,k_4)=(2,0,0,1)$
191
\beginexample
192
gap> G := AlmostCrystallographicPcpGroup(3, 17, [2,0,0,1]);;
193
gap> projection := NaturalHomomorphismOnHolonomyGroup( G );;
194
gap> F := HolonomyGroup( G );;
195
gap> IPprimeD6 := Subgroup( F , [F.2^2] );;
196
gap> K := PreImage( projection, IPprimeD6 );;
197
gap> Gamma3K := CommutatorSubgroup( K, CommutatorSubgroup( K, K ));;
198
gap> quotient := G/Gamma3K;;
199
gap> S := SylowSubgroup( quotient, 3);;
200
gap> N := NormalClosure( quotient, S);;
201
gap> localization := quotient/N;
202
Pcp group with orders [ 2, 2, 2 ]
203
gap> PrintPcpPresentation( localization );
204
pcp presentation on generators [ g1, g2, g3 ]
205
g1 ^ 2 = identity
206
g2 ^ 2 = g3
207
g3 ^ 2 = identity
208
g2 ^ g1 = g2*g3
209
g2 ^ g1^-1 = g2*g3
210
\endexample
211
212
In this case, we see that $G_P={\cal D}_4$.
213
214
\medskip
215
216
The reader can check that these results coincide with those obtained in
217
\cite{DM}. Note also that we used a somewhat different scheme to compute
218
this localization than the one used in \cite{DM}. We invite the reader to
219
check the same computations, tracing exactly the steps made in \cite{DM}.
220
221
222
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
223
%%
224
%E Emacs . . . . . . . . . . . . . . . . . . . . . local emacs variables
225
%%
226
%% Local Variables:
227
%% fill-column: 73
228
%% End:
229
%%
230
231
232
233
234
235
236
237