05.01.2013 Views

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

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Solutions 145<br />

FIGURE 43<br />

190. The permutations <strong>of</strong> degree 5 may be represented as product <strong>of</strong><br />

<strong>in</strong>dependent cycles only <strong>in</strong> the follow<strong>in</strong>g ways: a) b)<br />

c) d) e) f) Apply<strong>in</strong>g the results<br />

<strong>of</strong> Problems 182 <strong>and</strong> 183 we obta<strong>in</strong> that <strong>in</strong> the cases (a)‚ (b)‚ <strong>and</strong><br />

(c) the permutations are even‚ whereas <strong>in</strong> the cases (d)‚ (e) <strong>and</strong> (f) the<br />

permutations are odd.<br />

191. Suppose that the normal subgroup N <strong>in</strong> the group conta<strong>in</strong>s<br />

a permutation <strong>of</strong> the type (a) (see 190). Without loss <strong>of</strong> generality<br />

we may suppose that We prove that any<br />

permutation <strong>of</strong> the type (a) belongs to N. If <strong>in</strong> the row<br />

there is an even number <strong>of</strong> <strong>in</strong>versions then the permuta-<br />

tion is even. Hence by the def<strong>in</strong>ition <strong>of</strong> a<br />

normal subgroup N conta<strong>in</strong>s the permutation If<br />

<strong>in</strong> the row there is an odd number <strong>of</strong> <strong>in</strong>versions then <strong>in</strong><br />

the row there is an even number <strong>of</strong> <strong>in</strong>versions (because<br />

the order <strong>of</strong> elements is reversed <strong>in</strong> three pairs). In this case the per-<br />

mutation is even. Hence N conta<strong>in</strong>s the<br />

reject the four tetrahedra hav<strong>in</strong>g a vertex <strong>in</strong> common with the chosen tetrahedron.<br />

The rema<strong>in</strong><strong>in</strong>g tetrahedra are five. Amongst them four tetrahedra have disjo<strong>in</strong>t sets<br />

<strong>of</strong> vertices‚ whereas the rema<strong>in</strong><strong>in</strong>g tetrahedron has one vertex <strong>in</strong> common with each <strong>of</strong><br />

the four disjo<strong>in</strong>t tetrahedra. The choice <strong>of</strong> the first tetrahedron thus forces the choice<br />

<strong>of</strong> the others‚ so there are <strong>in</strong> all only two choices. (Translator’s note)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!