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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Groups 13<br />

7. F<strong>in</strong>d all symmetries <strong>of</strong> the rectangle <strong>and</strong> write their multiplication<br />

table.<br />

1.2 Groups <strong>of</strong> transformations<br />

Let X <strong>and</strong> Y be two sets <strong>of</strong> elements <strong>of</strong> arbitrary nature, <strong>and</strong> suppose that<br />

every element <strong>of</strong> X is put <strong>in</strong>to correspondence with a def<strong>in</strong>ed element<br />

<strong>of</strong> Y. Thus one says that there exists a mapp<strong>in</strong>g <strong>of</strong> the set X <strong>in</strong>to<br />

the set The element is called the image <strong>of</strong> the element<br />

<strong>and</strong> the pre-image <strong>of</strong> element One writes:<br />

DEFINITION. The mapp<strong>in</strong>g is called surjective (or, equivalently,<br />

a mapp<strong>in</strong>g <strong>of</strong> set X onto set Y) if for every element <strong>of</strong> Y there<br />

exists an element <strong>of</strong> X such that i.e., every <strong>of</strong> Y has a<br />

pre-image <strong>in</strong> X.<br />

8. Let the mapp<strong>in</strong>g put every capital city <strong>in</strong> the world <strong>in</strong> correspondence<br />

with the first letter <strong>of</strong> its name <strong>in</strong> English (for example,<br />

= L). Is a mapp<strong>in</strong>g <strong>of</strong> the set <strong>of</strong> capitals onto the entire English alphabet?<br />

DEFINITION. The mapp<strong>in</strong>g is called a one to one (or<br />

bijective) mapp<strong>in</strong>g <strong>of</strong> the set X <strong>in</strong>to the set Y if for every <strong>in</strong> Y there<br />

exists a pre-image <strong>in</strong> X <strong>and</strong> this pre-image is unique.<br />

9. Consider the follow<strong>in</strong>g mapp<strong>in</strong>gs <strong>of</strong> the set <strong>of</strong> all <strong>in</strong>teger numbers<br />

<strong>in</strong>to the set <strong>of</strong> the non-negative <strong>in</strong>teger numbers:<br />

Which amongst these mapp<strong>in</strong>gs are surjective, which are bijective?<br />

Let M be an arbitrary set. For brevity we shall call any bijective<br />

mapp<strong>in</strong>g <strong>of</strong> M <strong>in</strong>to itself a transformation <strong>of</strong> set M.<br />

Two transformations <strong>and</strong> will be considered equal if<br />

for every element A <strong>of</strong> M. Instead <strong>of</strong> term ‘transformation’ the<br />

term permutation is <strong>of</strong>ten used. We shall use this term only when the<br />

transformation is def<strong>in</strong>ed on a f<strong>in</strong>ite set. A permutation can thus be<br />

written <strong>in</strong> the form

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

Saved successfully!

Ooh no, something went wrong!