Group action

File:Group action on equilateral triangle.svg

The cyclic group C₃ consisting of the rotations by 0°, 120° and 240° acts on the set of the three vertices.

In mathematics, an action of a group $G$ on a set $S$ is, loosely speaking, an operation that takes an element of $G$ and an element of $S$ and produces another element of $S.$ More formally, it is a group homomorphism from $G$ to the automorphism group of $S$ (the set of all bijections on $S$ along with group operation being function composition). One says that $G$ acts on $S.$

Many sets of transformations form a group under function composition; for example, the rotations around a point in the plane. It is often useful to consider the group as an abstract group, and to say that one has a group action of the abstract group that consists of performing the transformations of the group of transformations. The reason for distinguishing the group from the transformations is that, generally, a group of transformations of a structure acts also on various related structures; for example, the above rotation group also acts on triangles by transforming triangles into triangles.

If a group acts on a structure, it will usually also act on objects built from that structure. For example, the group of Euclidean isometries acts on Euclidean space and also on the figures drawn in it; in particular, it acts on the set of all triangles. Similarly, the group of symmetries of a polyhedron acts on the vertices, the edges, and the faces of the polyhedron.

A group action on a vector space is called a representation of the group. In the case of a finite-dimensional vector space, it allows one to identify many groups with subgroups of the general linear group $\mathrm{GL}(n,K)$, the group of the invertible matrices of dimension $n$ over a field $K$.

The symmetric group $S_n$ acts on any set with $n$ elements by permuting the elements of the set. Although the group of all permutations of a set depends formally on the set, the concept of group action allows one to consider a single group for studying the permutations of all sets with the same cardinality.

Definition

Left group action

If $G$ is a group with identity element $e$, and $X$ is a set, then a (left) group action $\alpha$ of $G$ on $X$ is a function

$\alpha :G\times X\to X$

that satisfies the following two axioms:

Identity:	$\alpha (e,x)=x$
Compatibility:	$\alpha (g,\alpha (h,x))=\alpha (gh,x)$

for all $g$ and $h$ in $G$ and all $x$ in $X$.

The group $G$ is then said to act on $X$ (from the left). A set $X$ together with an action of $G$ is called a (left) $G$-set.

It can be notationally convenient to curry the action $\alpha$, so that, instead, one has a collection of transformations ${\alpha }_g:X\to X$, with one transformation ${\alpha }_g$ for each group element $g\in G$. The identity and compatibility relations then read $${\alpha }_e(x)=x$$ and $${\alpha }_g({\alpha }_h(x))=({\alpha }_g\circ {\alpha }_h)(x)={\alpha }_{gh}(x)$$ The second axiom states that the function composition is compatible with the group multiplication; they form a commutative diagram. This axiom can be shortened even further, and written as ${\alpha }_g\circ {\alpha }_h={\alpha }_{gh}$.

With the above understanding, it is very common to avoid writing $\alpha$ entirely, and to replace it with either a dot, or with nothing at all. Thus, $\alpha (g,x)$ can be shortened to $g\cdot x$ or $gx$, especially when the action is clear from context. The axioms are then $$\{\begin{array}{rl}& e\cdot x=x\\ & g\cdot (h\cdot x)=(gh)\cdot x\end{array}$$

From these two axioms, it follows that for any fixed $g$ in $G$, the function from $X$ to itself which maps $x$ to $g\cdot x$ is a bijection, with inverse bijection the corresponding map for $g^{-1}$. Therefore, one may equivalently define a group action of $G$ on $X$ as a group homomorphism from $G$ into the symmetric group $\mathrm{Sym}(X)$ of all bijections from $X$ to itself.

Right group action

Likewise, a right group action of $G$ on $X$ is a function

$\alpha :X\times G\to X,$

that satisfies the analogous axioms:

Identity:	$\alpha (x,e)=x$
Compatibility:	$\alpha (\alpha (x,g),h)=\alpha (x,gh)$

(with α(x, g) often shortened to xg or x⋅g when the action being considered is clear from context)

Identity:	$x\cdot e=x$
Compatibility:	$(x\cdot g)\cdot h=x\cdot (gh)$

for all Template:Mvar and Template:Mvar in Template:Mvar and all Template:Mvar in Template:Mvar.

The difference between left and right actions is in the order in which a product gh acts on Template:Mvar. For a left action, Template:Mvar acts first, followed by Template:Mvar second. For a right action, Template:Mvar acts first, followed by Template:Mvar second. Because of the formula (gh)⁻¹ = h⁻¹g⁻¹, a left action can be constructed from a right action by composing with the inverse operation of the group. Also, a right action of a group Template:Mvar on Template:Mvar can be considered as a left action of its opposite group G^op on Template:Mvar. Thus, for establishing general properties of a single group action, it suffices to consider only left actions.

Notable properties of actions

Let $G$ be a group acting on a set $X$. The action is called Template:Visible anchor or Template:Visible anchor if $g\cdot x=x$ for all $x\in X$ implies that $g=e_G$. Equivalently, the homomorphism from $G$ to the group of bijections of $X$ corresponding to the action is injective.

The action is called Template:Visible anchor (or semiregular or fixed-point free) if the statement that $g\cdot x=x$ for some $x\in X$ already implies that $g=e_G$. In other words, no non-trivial element of $G$ fixes a point of $X$. This is a much stronger property than faithfulness.

For example, the action of any group on itself by left multiplication is free. This observation implies Cayley's theorem that any group can be embedded in a symmetric group (which is infinite when the group is). A finite group may act faithfully on a set of size much smaller than its cardinality (however such an action cannot be free). For instance the abelian 2-group $(\mathbb{\mathbb{Z}}/2\mathbb{\mathbb{Z}}{)}^n$ (of cardinality $2^n$) acts faithfully on a set of size $2n$. This is not always the case, for example the cyclic group $\mathbb{\mathbb{Z}}/2^n\mathbb{\mathbb{Z}}$ cannot act faithfully on a set of size less than $2^n$.

In general, the smallest set on which a faithful action can be defined can vary greatly for groups of the same size. For example, three groups of size 120 are the symmetric group $S_5$, the icosahedral group $A_5\times \mathbb{\mathbb{Z}}/2\mathbb{\mathbb{Z}}$ and the cyclic group $\mathbb{\mathbb{Z}}/120\mathbb{\mathbb{Z}}$. The smallest sets on which faithful actions can be defined for these groups are of size 5, 7, and 16 respectively.

Transitivity properties

The action of $G$ on $X$ is called Template:Visible anchor if for any two points $x,y\in X$ there exists a $g\in G$ so that $g\cdot x=y$.

The action is Template:Visible anchor (or sharply transitive, or Template:Visible anchor) if it is both transitive and free. This means that given $x,y\in X$ there is exactly one $g\in G$ such that $g\cdot x=y$. If $X$ is acted upon simply transitively by a group $G$ then it is called a principal homogeneous space for $G$ or a $G$-torsor.

For an integer $n\ge 1$, the action is Template:Visible anchor if $X$ has at least $n$ elements, and for any pair of $n$-tuples $(x_1,\dots ,x_n),(y_1,\dots ,y_n)\in X^n$ with pairwise distinct entries (that is $x_i\ne x_j$, $y_i\ne y_j$ when $i\ne j$) there exists a $g\in G$ such that $g\cdot x_i=y_i$ for $i=1,\dots ,n$. In other words, the action on the subset of $X^n$ of tuples without repeated entries is transitive. For $n=2,3$ this is often called double, respectively triple, transitivity. The class of 2-transitive groups (that is, subgroups of a finite symmetric group whose action is 2-transitive) and more generally multiply transitive groups is well-studied in finite group theory.

An action is Template:Visible anchor when the action on tuples without repeated entries in $X^n$ is sharply transitive.

Examples

The action of the symmetric group of X is transitive, in fact n-transitive for any n up to the cardinality of X. If X has cardinality n, the action of the alternating group is (n − 2)-transitive but not (n − 1)-transitive.

The action of the general linear group of a vector space V on the set V ∖ Template:Mset of non-zero vectors is transitive, but not 2-transitive (similarly for the action of the special linear group if the dimension of v is at least 2). The action of the orthogonal group of a Euclidean space is not transitive on nonzero vectors but it is on the unit sphere.

Primitive actions

The action of G on X is called primitive if there is no partition of X preserved by all elements of G apart from the trivial partitions (the partition in a single piece and its dual, the partition into singletons).

Topological properties

Assume that $X$ is a topological space and the action of $G$ is by homeomorphisms.

The action is wandering if every $x\in X$ has a neighbourhood $U$ such that there are only finitely many $g\in G$ with $(g\cdot U)\cap U\ne \mathrm{\varnothing }$.Template:Sfn

More generally, a point $x\in X$ is called a point of discontinuity for the action of $G$ if there is an open subset $U\ni x$ such that there are only finitely many $g\in G$ with $(g\cdot U)\cap U\ne \mathrm{\varnothing }$. The domain of discontinuity of the action is the set of all points of discontinuity. Equivalently it is the largest $G$-stable open subset $\mathrm{\Omega }\subset X$ such that the action of $G$ on $\mathrm{\Omega }$ is wandering.Template:Sfn In a dynamical context this is also called a wandering set.

The action is properly discontinuous if for every compact subset $K\subset X$ there are only finitely many $g\in G$ such that $(g\cdot K)\cap K\ne \mathrm{\varnothing }$. This is strictly stronger than wandering; for instance the action of $\mathbb{\mathbb{Z}}$ on ${\mathbb{ℝ}}^2\mathrm{\setminus }\{(0,0)\}$ given by $n\cdot (x,y)=(2^{n}x,2^{-n}y)$ is wandering and free but not properly discontinuous.Template:Sfn

The action by deck transformations of the fundamental group of a locally simply connected space on a universal cover is wandering and free. Such actions can be characterized by the following property: every $x\in X$ has a neighbourhood $U$ such that $(g\cdot U)\cap U=\mathrm{\varnothing }$ for every $g\in G\mathrm{\setminus }\{e_G\}$.Template:Sfn Actions with this property are sometimes called freely discontinuous, and the largest subset on which the action is freely discontinuous is then called the free regular set.Template:Sfn

An action of a group $G$ on a locally compact space $X$ is called cocompact if there exists a compact subset $A\subset X$ such that $X=G\cdot A$. For a properly discontinuous action, cocompactness is equivalent to compactness of the quotient space $X/G$.

Actions of topological groups

Now assume $G$ is a topological group and $X$ a topological space on which it acts by homeomorphisms. The action is said to be continuous if the map $G\times X\to X$ is continuous for the product topology.

The action is said to be Template:Visible anchor if the map $G\times X\to X\times X$ defined by $(g,x)\mapsto (x,g\cdot x)$ is proper.Template:Sfn This means that given compact sets $K,K^{\prime }$ the set of $g\in G$ such that $(g\cdot K)\cap K^{\prime }\ne \mathrm{\varnothing }$ is compact. In particular, this is equivalent to proper discontinuity if $G$ is a discrete group.

It is said to be locally free if there exists a neighbourhood $U$ of $e_G$ such that $g\cdot x\ne x$ for all $x\in X$ and $g\in U\mathrm{\setminus }\{e_G\}$.

The action is said to be strongly continuous if the orbital map $g\mapsto g\cdot x$ is continuous for every $x\in X$. Contrary to what the name suggests, this is a weaker property than continuity of the action.

If $G$ is a Lie group and $X$ a differentiable manifold, then the subspace of smooth points for the action is the set of points $x\in X$ such that the map $g\mapsto g\cdot x$ is smooth. There is a well-developed theory of Lie group actions, i.e. action which are smooth on the whole space.

Linear actions

If g acts by linear transformations on a module over a commutative ring, the action is said to be irreducible if there are no proper nonzero g-invariant submodules. It is said to be semisimple if it decomposes as a direct sum of irreducible actions.

Orbits and stabilizers

File:Compound of five tetrahedra.png

In the compound of five tetrahedra, the symmetry group is the (rotational) icosahedral group I of order 60, while the stabilizer of a single chosen tetrahedron is the (rotational) tetrahedral group T of order 12, and the orbit space I / T (of order 60/12 = 5) is naturally identified with the 5 tetrahedra – the coset gT corresponds to the tetrahedron to which g sends the chosen tetrahedron.

Consider a group G acting on a set X. The Template:Visible anchor of an element x in X is the set of elements in X to which x can be moved by the elements of G. The orbit of x is denoted by G⋅x: $$G\cdot x=\{g\cdot x:g\in G\}.$$

The defining properties of a group guarantee that the set of orbits of (points x in) X under the action of G form a partition of X. The associated equivalence relation is defined by saying x ~ y if and only if there exists a g in G with g⋅x = y. The orbits are then the equivalence classes under this relation; two elements x and y are equivalent if and only if their orbits are the same, that is, G⋅x = G⋅y.

The group action is transitive if and only if it has exactly one orbit, that is, if there exists x in X with G⋅x = X. This is the case if and only if G⋅x = X for Template:Em x in X (given that X is non-empty).

The set of all orbits of X under the action of G is written as X / G (or, less frequently, as G \ X), and is called the Template:Visible anchor of the action. In geometric situations it may be called the Template:Visible anchor, while in algebraic situations it may be called the space of Template:Visible anchor, and written X_G, by contrast with the invariants (fixed points), denoted X^G: the coinvariants are a Template:Em while the invariants are a Template:Em. The coinvariant terminology and notation are used particularly in group cohomology and group homology, which use the same superscript/subscript convention.

Invariant subsets

If Y is a subset of X, then G⋅Y denotes the set Template:Mset. The subset Y is said to be invariant under G if G⋅Y = Y (which is equivalent G⋅Y ⊆ Y). In that case, G also operates on Y by restricting the action to Y. The subset Y is called fixed under G if g⋅y = y for all g in G and all y in Y. Every subset that is fixed under G is also invariant under G, but not conversely.

Every orbit is an invariant subset of X on which G acts transitively. Conversely, any invariant subset of X is a union of orbits. The action of G on X is transitive if and only if all elements are equivalent, meaning that there is only one orbit.

A G-invariant element of X is x ∈ X such that g⋅x = x for all g ∈ G. The set of all such x is denoted X^G and called the G-invariants of X. When X is a G-module, X^G is the zeroth cohomology group of G with coefficients in X, and the higher cohomology groups are the derived functors of the functor of G-invariants.

Fixed points and stabilizer subgroups

Given g in G and x in X with g⋅x = x, it is said that "x is a fixed point of g" or that "g fixes x". For every x in X, the Template:Visible anchor of G with respect to x (also called the isotropy group or little group) is the set of all elements in G that fix x: $$G_x=\{g\in G:g\cdot x=x\}.$$ This is a subgroup of G, though typically not a normal one. The action of G on X is free if and only if all stabilizers are trivial. The kernel N of the homomorphism with the symmetric group, G → Sym(X), is given by the intersection of the stabilizers G_x for all x in X. If N is trivial, the action is said to be faithful (or effective).

Let x and y be two elements in X, and let g be a group element such that y = g⋅x. Then the two stabilizer groups G_x and G_y are related by G_y = gG_xg⁻¹.

Proof: by definition, h ∈ G_y if and only if h⋅(g⋅x) = g⋅x. Applying g⁻¹ to both sides of this equality yields (g⁻¹hg)⋅x = x; that is, g⁻¹hg ∈ G_x.

An opposite inclusion follows similarly by taking h ∈ G_x and x = g⁻¹⋅y.

The above says that the stabilizers of elements in the same orbit are conjugate to each other. Thus, to each orbit, we can associate a conjugacy class of a subgroup of G (that is, the set of all conjugates of the subgroup). Let (H) denote the conjugacy class of H. Then the orbit O has type (H) if the stabilizer G_x of some/any x in O belongs to (H). A maximal orbit type is often called a principal orbit type.

Template:Visible anchor

Orbits and stabilizers are closely related. For a fixed x in X, consider the map f : G → X given by g ↦ g⋅x. By definition the image f(G) of this map is the orbit G⋅x. The condition for two elements to have the same image is $$f(g)=f(h)⟺g\cdot x=h\cdot x⟺g^{-1}h\cdot x=x⟺g^{-1}h\in G_x⟺h\in g{G}_x.$$ In other words, f(g) = f(h) if and only if g and h lie in the same coset for the stabilizer subgroup G_x. Thus, the fiber fTemplate:I sup(Template:Mset) of f over any y in G⋅x is contained in such a coset, and every such coset also occurs as a fiber. Therefore f induces a Template:Em between the set G / G_x of cosets for the stabilizer subgroup and the orbit G⋅x, which sends gG_x ↦ g⋅x. This result is known as the orbit–stabilizer theorem.

If G is finite then the orbit–stabilizer theorem, together with Lagrange's theorem, gives $$|G\cdot x|=[G:G_x]=|G|/|G_x|.$$ In other words, the length of the orbit of x times the order of its stabilizer is the order of the group. In particular that implies that the orbit length is a divisor of the group order.

Example: Let G be a group of prime order p acting on a set X with k elements. Since each orbit has either 1 or p elements, there are at least k mod p orbits of length 1 which are G-invariant elements. More specifically, k and the number of G-invariant elements are congruent modulo p.

This result is especially useful since it can be employed for counting arguments (typically in situations where X is finite as well).

File:Labeled cube graph.png

Cubical graph with vertices labeled

Example: We can use the orbit–stabilizer theorem to count the automorphisms of a graph. Consider the cubical graph as pictured, and let G denote its automorphism group. Then G acts on the set of vertices Template:Mset, and this action is transitive as can be seen by composing rotations about the center of the cube. Thus, by the orbit–stabilizer theorem, Template:Abs = Template:Abs Template:Abs = 8 Template:Abs. Applying the theorem now to the stabilizer G₁, we can obtain Template:Abs = Template:Abs Template:Abs. Any element of G that fixes 1 must send 2 to either 2, 4, or 5. As an example of such automorphisms consider the rotation around the diagonal axis through 1 and 7 by 2π/3, which permutes 2, 4, 5 and 3, 6, 8, and fixes 1 and 7. Thus, Template:Abs = 3. Applying the theorem a third time gives Template:Abs = Template:Abs Template:Abs. Any element of G that fixes 1 and 2 must send 3 to either 3 or 6. Reflecting the cube at the plane through 1, 2, 7 and 8 is such an automorphism sending 3 to 6, thus Template:Abs = 2. One also sees that ((G₁)₂)₃ consists only of the identity automorphism, as any element of G fixing 1, 2 and 3 must also fix all other vertices, since they are determined by their adjacency to 1, 2 and 3. Combining the preceding calculations, we can now obtain Template:Abs = 8 ⋅ 3 ⋅ 2 ⋅ 1 = 48.

Burnside's lemma

A result closely related to the orbit–stabilizer theorem is Burnside's lemma: $$|X/G|=\frac{1}{|G|}\sum _{g\in G}|X^g|,$$ where X^g is the set of points fixed by g. This result is mainly of use when G and X are finite, when it can be interpreted as follows: the number of orbits is equal to the average number of points fixed per group element.

Fixing a group G, the set of formal differences of finite G-sets forms a ring called the Burnside ring of G, where addition corresponds to disjoint union, and multiplication to Cartesian product.

Examples

• The Template:Visible anchor action of any group G on any set X is defined by g⋅x = x for all g in G and all x in X; that is, every group element induces the identity permutation on X.
• In every group G, left multiplication is an action of G on G: g⋅x = gx for all g, x in G. This action is free and transitive (regular), and forms the basis of a rapid proof of Cayley's theorem – that every group is isomorphic to a subgroup of the symmetric group of permutations of the set G.
• In every group G with subgroup H, left multiplication is an action of G on the set of cosets G / H: g⋅aH = gaH for all g, a in G. In particular if H contains no nontrivial normal subgroups of G this induces an isomorphism from G to a subgroup of the permutation group of degree [G : H].
• In every group G, conjugation is an action of G on G: g⋅x = gxg⁻¹. An exponential notation is commonly used for the right-action variant: x^g = g⁻¹xg; it satisfies (x^g)^h = x^gh.
• In every group G with subgroup H, conjugation is an action of G on conjugates of H: g⋅K = gKg⁻¹ for all g in G and K conjugates of H.
• An action of Z on a set X uniquely determines and is determined by an automorphism of X, given by the action of 1. Similarly, an action of Z / 2Z on X is equivalent to the data of an involution of X.
• The symmetric group S_n and its subgroups act on the set Template:Mset by permuting its elements
• The symmetry group of a polyhedron acts on the set of vertices of that polyhedron. It also acts on the set of faces or the set of edges of the polyhedron.
• The symmetry group of any geometrical object acts on the set of points of that object.
• For a coordinate space V over a field F with group of units F*, the mapping F* × V → V given by a × (x₁, x₂, ..., x_n) ↦ (ax₁, ax₂, ..., ax_n) is a group action called scalar multiplication.
• The automorphism group of a vector space (or graph, or group, or ring ...) acts on the vector space (or set of vertices of the graph, or group, or ring ...).
• The general linear group GL(n, K) and its subgroups, particularly its Lie subgroups (including the special linear group SL(n, K), orthogonal group O(n, K), special orthogonal group SO(n, K), and symplectic group Sp(n, K)) are Lie groups that act on the vector space Kⁿ. The group operations are given by multiplying the matrices from the groups with the vectors from Kⁿ.
• The general linear group GL(n, Z) acts on Zⁿ by natural matrix action. The orbits of its action are classified by the greatest common divisor of coordinates of the vector in Zⁿ.
• The affine group acts transitively on the points of an affine space, and the subgroup V of the affine group (that is, a vector space) has transitive and free (that is, regular) action on these points; indeed this can be used to give a definition of an affine space.
• The projective linear group PGL(n + 1, K) and its subgroups, particularly its Lie subgroups, which are Lie groups that act on the projective space Pⁿ(K). This is a quotient of the action of the general linear group on projective space. Particularly notable is PGL(2, K), the symmetries of the projective line, which is sharply 3-transitive, preserving the cross ratio; the Möbius group PGL(2, C) is of particular interest.
• The isometries of the plane act on the set of 2D images and patterns, such as wallpaper patterns. The definition can be made more precise by specifying what is meant by image or pattern, for example, a function of position with values in a set of colors. Isometries are in fact one example of affine group (action).
• The sets acted on by a group G comprise the category of G-sets in which the objects are G-sets and the morphisms are G-set homomorphisms: functions f : X → Y such that g⋅(f(x)) = f(g⋅x) for every g in G.
• The Galois group of a field extension L / K acts on the field L but has only a trivial action on elements of the subfield K. Subgroups of Gal(L / K) correspond to subfields of L that contain K, that is, intermediate field extensions between L and K.
• The additive group of the real numbers (R, +) acts on the phase space of "well-behaved" systems in classical mechanics (and in more general dynamical systems) by time translation: if t is in R and x is in the phase space, then x describes a state of the system, and t + x is defined to be the state of the system t seconds later if t is positive or −t seconds ago if t is negative.
• The additive group of the real numbers (R, +) acts on the set of real functions of a real variable in various ways, with (t⋅f)(x) equal to, for example, f(x + t), f(x) + t, f(xe^t), f(x)e^t, f(x + t)e^t, or f(xe^t) + t, but not f(xe^t + t).
• Given a group action of G on X, we can define an induced action of G on the power set of X, by setting g⋅U = {g⋅u : u ∈ U} for every subset U of X and every g in G. This is useful, for instance, in studying the action of the large Mathieu group on a 24-set and in studying symmetry in certain models of finite geometries.
• The quaternions with norm 1 (the versors), as a multiplicative group, act on R³: for any such quaternion z = cos α/2 + v sin α/2, the mapping f(x) = zxz^* is a counterclockwise rotation through an angle α about an axis given by a unit vector v; z is the same rotation; see quaternions and spatial rotation. This is not a faithful action because the quaternion −1 leaves all points where they were, as does the quaternion 1.
• Given left G-sets X, Y, there is a left G-set YTemplate:I sup whose elements are G-equivariant maps α : X × G → Y, and with left G-action given by g⋅α = α ∘ (id_X × –g) (where "–g" indicates right multiplication by g). This G-set has the property that its fixed points correspond to equivariant maps X → Y; more generally, it is an exponential object in the category of G-sets.

Group actions and groupoids

The notion of group action can be encoded by the action groupoid G′ = G ⋉ X associated to the group action. The stabilizers of the action are the vertex groups of the groupoid and the orbits of the action are its components.

Morphisms and isomorphisms between G-sets

If X and Y are two G-sets, a morphism from X to Y is a function f : X → Y such that f(g⋅x) = g⋅f(x) for all g in G and all x in X. Morphisms of G-sets are also called equivariant maps or G-maps.

The composition of two morphisms is again a morphism. If a morphism f is bijective, then its inverse is also a morphism. In this case f is called an isomorphism, and the two G-sets X and Y are called isomorphic; for all practical purposes, isomorphic G-sets are indistinguishable.

Some example isomorphisms:

• Every regular G action is isomorphic to the action of G on G given by left multiplication.
• Every free G action is isomorphic to G × S, where S is some set and G acts on G × S by left multiplication on the first coordinate. (S can be taken to be the set of orbits X / G.)
• Every transitive G action is isomorphic to left multiplication by G on the set of left cosets of some subgroup H of G. (H can be taken to be the stabilizer group of any element of the original G-set.)

With this notion of morphism, the collection of all G-sets forms a category; this category is a Grothendieck topos (in fact, assuming a classical metalogic, this topos will even be Boolean).

Variants and generalizations

We can also consider actions of monoids on sets, by using the same two axioms as above. This does not define bijective maps and equivalence relations however. See semigroup action.

Instead of actions on sets, we can define actions of groups and monoids on objects of an arbitrary category: start with an object X of some category, and then define an action on X as a monoid homomorphism into the monoid of endomorphisms of X. If X has an underlying set, then all definitions and facts stated above can be carried over. For example, if we take the category of vector spaces, we obtain group representations in this fashion.

We can view a group G as a category with a single object in which every morphism is invertible. A (left) group action is then nothing but a (covariant) functor from G to the category of sets, and a group representation is a functor from G to the category of vector spaces. A morphism between G-sets is then a natural transformation between the group action functors. In analogy, an action of a groupoid is a functor from the groupoid to the category of sets or to some other category.

In addition to continuous actions of topological groups on topological spaces, one also often considers smooth actions of Lie groups on smooth manifolds, regular actions of algebraic groups on algebraic varieties, and actions of group schemes on schemes. All of these are examples of group objects acting on objects of their respective category.

Gallery

• Orbit of a fundamental spherical triangle (marked in red) under action of the full octahedral group.
  Orbit of a fundamental spherical triangle (marked in red) under action of the full octahedral group.
• Orbit of a fundamental spherical triangle (marked in red) under action of the full icosahedral group.
  Orbit of a fundamental spherical triangle (marked in red) under action of the full icosahedral group.

See also

• Gain graph
• Group with operators
• Measurable group action
• Monoid action
• Young–Deruyts development

References

• .

External links

• Template:Springer