# Group action

In mathematics, groups often arise as (subsets of) the set of permutations of some mathematical object (where the group multiplication law is just composition). Some examples of this would be the symmetric group , the alternating group , or the dihedral group .

We can formalize this notion with the concept of a **group action**. Loosely speaking, a group action of a group on a set is an assignment of a bijection to each element .

More formally, we can define a group action of a group on a set as a function , (where we denote the image of by ) which satisfies the following properties:

- for all and all
- for all (where is the identity element of ).

Typically, we call a **-set**, and we say that **acts** on .

Notice that any indeed gets associated with a function , specifically the function . The first property means that the multiplication of two group elements and is indeed just the composition of their corresponding functions, and the second property states that the function associated to the identity element it's just the identity function. Notice also that the function associated to always has an inverse, specifically the function associated to . It follows that each group element is in fact associated to a *bijection* .

Notice that this assignment is not necessarily one-to-one, that is it is possible that two distinct elements of will be associated to the same function (for instance, it is possible that we would have for all and , and so every element of would be associated to the identity function). If this assignment is one-to-one (i.e. if for every , there is some for which ) then we say acts **faithfully** on .

Now since the symmetric group is the group of *all* bijections we can think of a group action as a homomorphism from to . This homomorphism is injective iff the action is faithful.

## Group Actions on More General Objects

It is frequently useful to talk about the action of a group on an object besides a set (such as the action of a group on a vector space, a group, a ring, a field, a graph, etc.). This can be done rigorously in the language of category theory. Given a category and an object of is a function from to such that:

- For any
- , where is the identity element of and is the identity of .

Notice that, as before, each morphism has an inverse , and so is an automorphism of .

For instance, by this definition, a group action on a vector space, (also known as a group representation) is a group action on the set of elements of , where each element of the group is associated to a linear function.

Although the above definition is the easiest to understand, it is not necessarily the most useful. To give an alternate definition, we first re-define the notion of a group.

We define a **group** to be a category with only one object, (say ), and in which every morphism is invertible (and is therefore an automorphism of ). In terms of our old definition, the 'elements' of the group are actually the *morphisms* in this category. It is fairly simple to show that definition is equivalent to our old definition.

We can now define an action of a group to be a functor from to another category, and we define the action of on some object of a category to be a functor such that . It follows from the definition of a functor, that this definition is equivalent to the one given above. This definition allows us to easily study the concept of a group action in the framework of category theory.
*This article is a stub. Help us out by expanding it.*