For each of the following parts, tell whether it specifies as a permutation on
. If not, explain how Definition 1 is not satisfied.
(a) .
(b) .
(c) .
Extracted from A. P. Hillman. (1999). Abstract Algebra A First Undergraduate Course.
Roughwork.
(a)
The arrow form
may also be expressed as in function form
For any finite non-empty set ,
the set of all
transformations (mappings) of
onto
forms a group called permutation group and any element of
, i.e., a mapping from
onto itself, is called permutation.
From Wikibooks on Permutation groups
As is seen, function here is
injective (i.e.,
), for
sends both
and
to
. Hence it cannot specify a permutation.
(b)
The arrow form
or two-line form
or cyclic form
also in diagram

is obviously a one-to-one function (/an injection). Thus function here specifies a permutation.
(c)
In arrow form
or matrix form
or cyclic form
is the identity permutation.
This problem is not to be attempted.
