Abel's theorem in problems and solutions - School of Mathematics
Abel's theorem in problems and solutions - School of Mathematics
Abel's theorem in problems and solutions - School of Mathematics
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Solutions 121<br />
The given group is thus commutative (see 25). In this case let <strong>and</strong> be<br />
two dist<strong>in</strong>ct elements <strong>of</strong> order 2 <strong>of</strong> the <strong>in</strong>itial group. Thus form<br />
a subgroup. If the element does not belong to this subgroup then the<br />
elements form a right coset <strong>of</strong> the subgroup <strong>and</strong><br />
the 8 elements are thus all dist<strong>in</strong>ct. The products<br />
<strong>of</strong> these elements are well def<strong>in</strong>ed, because the group is commutative <strong>and</strong><br />
(for example, Therefore if all<br />
elements have order 2 then there is only one possible group. This group<br />
is, <strong>in</strong> fact,<br />
3) Suppose the element have order 4 <strong>and</strong> that amongst the elements,<br />
different from the powers <strong>of</strong> there is an element <strong>of</strong> order 2, i.e.,<br />
In this case <strong>and</strong> are the two left cosets <strong>of</strong> the<br />
subgroup <strong>and</strong> the 8 elements that they conta<strong>in</strong> are thus all<br />
dist<strong>in</strong>ct. We look for which <strong>of</strong> these elements may be equal to product<br />
It is possible neither that (otherwise nor<br />
(otherwise ). If then <strong>and</strong> (s<strong>in</strong>ce<br />
Thus one obta<strong>in</strong>s the contradiction<br />
This means that either or<br />
Let us consider the two cases:<br />
The table <strong>of</strong> multiplication is <strong>in</strong> this case uniquely def<strong>in</strong>ed.<br />
Indeed,<br />
We can therefore have only one group: this group, <strong>in</strong> fact,<br />
does exist: it is the group If <strong>and</strong> are the unit <strong>and</strong> the<br />
generator <strong>of</strong> <strong>and</strong> the unit <strong>and</strong> the generator <strong>of</strong> then it suffices<br />
to write for all the properties listed above be<strong>in</strong>g<br />
satisfied.<br />
Also <strong>in</strong> this case the table <strong>of</strong> multiplication is uniquely<br />
def<strong>in</strong>ed. Indeed,<br />
In this case we therefore<br />
have only one group. In fact, this group does exist: it is the group <strong>of</strong><br />
symmetries <strong>of</strong> the square. It suffices to put = rotation by 90°, =<br />
reflection with respect to a diagonal, for all the properties listed above<br />
be<strong>in</strong>g satisfied.<br />
4) Suppose that there exists an element <strong>of</strong> order 4 <strong>and</strong> that all<br />
elements different from are <strong>of</strong> order 4 as well. Let be an<br />
arbitrary element different from Thus the elements<br />
are all dist<strong>in</strong>ct. We look for which <strong>of</strong> these elements is<br />
equal to product It is possible neither that (otherwise<br />
nor (because the order <strong>of</strong> is 4). If (or ) one has the