An injective function from a finite set to itself is surjective: its image of a function contains as many distinct elements as the entire set, so it cannot omit one. Thus every element of is a bijection, and conversely every bijection is injective. Hence
It is a group under function composition by i.
The shift , , is injective, so . It is not surjective: the least natural number is missing from its image of a function, whether starts at zero or one. For every , the image of a function of is contained in the image of a function of , so .
The identity function belongs to and is its identity element under function composition; any group structure using that operation would have this same identity element. Since has no right inverse element, is not a group under function composition. It is a monoid, since injectivity is preserved by function composition.

Articles by others on the same topic (0)

There are currently no matching articles.