Group Action

In mathematics, 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 acts also on triangles by transforming triangles into triangles.

Formally, a group action of a group on a set is a group homomorphism from to some group (under function composition) of functions from to itself.

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 , the group of the invertible matrices of dimension over a field .

The symmetric group acts on any set with 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 is a group with identity element , and is a set, then a (''left'') ''group action'' of on is a function
: $\alpha\colon G \times X \to X,$
that satisfies the following two axioms:
:
for all and in and all in .

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

It can be notationally convenient to curry the action , so that, instead, one has a collection of transformations , with one transformation for each group element . The identity and compatibility relations then read
: $\alpha_e(x) = x$
and
: $\alpha_g(\alpha_h(x)) = (\alpha_g \circ \alpha_h)(x) = \alpha_(x)$
with being function composition. The second axiom then 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 .

With the above understanding, it is very common to avoid writing entirely, and to replace it with either a dot, or with nothing at all. Thus, can be shortened to or , especially when the action is clear from context. The axioms are then
: $ex = x$
: $g(hx) = (gh)x$

From these two axioms, it follows that for any fixed in , the function from to itself which maps to is a bijection, with inverse bijection the corresponding map for . Therefore, one may equivalently define a group action of on as a group homomorphism from into the symmetric group of all bijections from to itself.

Right group action

Likewise, a ''right group action'' of on is a function
: $\alpha\colon X \times G \to X,$
that satisfies the analogous axioms:
:
(with often shortened to or when the action being considered is clear from context)
:

for all and in and all in .

The difference between left and right actions is in the order in which a product acts on . For a left action, acts first, followed by second. For a right action, acts first, followed by second. Because of the formula , 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 on can be considered as a left action of its opposite group on .

Thus, for establishing general properties of group actions, it suffices to consider only left actions. However, there are cases where this is not possible. For example, the multiplication of a group induces both a left action and a right action on the group itself—multiplication on the left and on the right, respectively.

Notable properties of actions

Let be a group acting on a set . The action is called ' or ' if for all implies that . Equivalently, the homomorphism from to the group of bijections of corresponding to the action is injective.

The action is called ' (or ''semiregular'' or ''fixed-point free'') if the statement that for some already implies that . In other words, no non-trivial element of fixes a point of . 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 (of cardinality ) acts faithfully on a set of size . This is not always the case, for example the cyclic group cannot act faithfully on a set of size less than .

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 , the icosahedral group and the cyclic group . 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 on is called ' if for any two points there exists a so that .

The action is ' (or ''sharply transitive'', or ') if it is both transitive and free. This means that given the element in the definition of transitivity is unique. If is acted upon simply transitively by a group then it is called a principal homogeneous space for or a -torsor.

For an integer , the action is if has at least elements, and for any pair of -tuples with pairwise distinct entries (that is , when ) there exists a such that for . In other words the action on the subset of of tuples without repeated entries is transitive. For 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 when the action on tuples without repeated entries in is sharply transitive.

Examples

The action of the symmetric group of is transitive, in fact -transitive for any up to the cardinality of . If has cardinality , the action of the alternating group is -transitive but not -transitive.

The action of the general linear group of a vector space on the set of non-zero vectors is transitive, but not 2-transitive (similarly for the action of the special linear group if the dimension of 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 on is called ''primitive'' if there is no partition of preserved by all elements of apart from the trivial partitions (the partition in a single piece and its dual, the partition into singletons).

Topological properties

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

The action is ''wandering'' if every has a neighbourhood such that there are only finitely many with .

More generally, a point is called a point of discontinuity for the action of if there is an open subset such that there are only finitely many with . The ''domain of discontinuity'' of the action is the set of all points of discontinuity. Equivalently it is the largest -stable open subset such that the action of on is wandering. In a dynamical context this is also called a '' wandering set''.

The action is ''properly discontinuous'' if for every compact subset there are only finitely many such that . This is strictly stronger than wandering; for instance the action of on given by is wandering and free but not properly discontinuous.

The action by deck transformations of the fundamental group of a locally simply connected space on an covering space is wandering and free. Such actions can be characterized by the following property: every has a neighbourhood such that for every . 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''.

An action of a group on a locally compact space is called '' cocompact'' if there exists a compact subset such that . For a properly discontinuous action, cocompactness is equivalent to compactness of the quotient space .

Actions of topological groups

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

The action is said to be ' if the map defined by is proper. This means that given compact sets the set of such that is compact. In particular, this is equivalent to proper discontinuity is a discrete group.

It is said to be ''locally free'' if there exists a neighbourhood of such that for all and .

The action is said to be ''strongly continuous'' if the orbital map is continuous for every . Contrary to what the name suggests, this is a weaker property than continuity of the action.

If is a Lie group and a differentiable manifold, then the subspace of ''smooth points'' for the action is the set of points such that the map 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 acts by linear transformations on a module over a commutative ring, the action is said to be irreducible if there are no proper nonzero -invariant submodules. It is said to be '' semisimple'' if it decomposes as a direct sum of irreducible actions.

Orbits and stabilizers

Consider a group acting on a set . The ' of an element in is the set of elements in to which can be moved by the elements of . The orbit of is denoted by :
$Gx = \.$

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

The group action is transitive if and only if it has exactly one orbit, that is, if there exists in with . This is the case if and only if for in (given that is non-empty).

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

Invariant subsets

If is a subset of , then denotes the set . The subset is said to be ''invariant under '' if (which is equivalent ). In that case, also operates on by restricting the action to . The subset is called ''fixed under '' if for all in and all in . Every subset that is fixed under is also invariant under , but not conversely.

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

A ''-invariant'' element of is such that for all . The set of all such is denoted and called the ''-invariants'' of . When is a -module, is the zeroth cohomology group of with coefficients in , and the higher cohomology groups are the derived functors of the functor of -invariants.

Fixed points and stabilizer subgroups

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

Let and be two elements in , and let be a group element such that . Then the two stabilizer groups and are related by . Proof: by definition, if and only if . Applying to both sides of this equality yields ; that is, . An opposite inclusion follows similarly by taking and .

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 (that is, the set of all conjugates of the subgroup). Let denote the conjugacy class of . Then the orbit has type if the stabilizer of some/any in belongs to . A maximal orbit type is often called a principal orbit type.

and Burnside's lemma

Orbits and stabilizers are closely related. For a fixed in , consider the map given by . By definition the image of this map is the orbit . The condition for two elements to have the same image is
$f(g)=f(h) \iff gx = hx \iff g^hx = x \iff g^h \in G_x \iff h \in gG_x.$
In other words, ''if and only if'' and lie in the same coset for the stabilizer subgroup . Thus, the fiber of over any in is contained in such a coset, and every such coset also occurs as a fiber. Therefore induces a between the set of cosets for the stabilizer subgroup and the orbit , which sends . This result is known as the ''orbit-stabilizer theorem''.

If is finite then the orbit-stabilizer theorem, together with Lagrange's theorem, gives
, G \cdot x, = \,:\,G_x= , G, / , G_x, ,
in other words the length of the orbit of 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 be a group of prime order acting on a set with elements. Since each orbit has either or elements, there are at most orbits of length which are -invariant elements.

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

: Example: We can use the orbit-stabilizer theorem to count the automorphisms of a graph. Consider the cubical graph as pictured, and let denote its automorphism group. Then acts on the set of vertices , and this action is transitive as can be seen by composing rotations about the center of the cube. Thus, by the orbit-stabilizer theorem, . Applying the theorem now to the stabilizer , we can obtain . Any element of 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 , which permutes 2, 4, 5 and 3, 6, 8, and fixes 1 and 7. Thus, . Applying the theorem a third time gives . Any element of 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 . One also sees that consists only of the identity automorphism, as any element of 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 .

A result closely related to the orbit-stabilizer theorem is Burnside's lemma:
$, X/G, =\frac\sum_ , X^g, ,$
where is the set of points fixed by . This result is mainly of use when and 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 , the set of formal differences of finite -sets forms a ring called the Burnside ring of , where addition corresponds to disjoint union, and multiplication to Cartesian product.

Examples

* The ' action of any group on any set is defined by for all in and all in ; that is, every group element induces the identity permutation on .
* In every group , left multiplication is an action of on : for all , in . 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 .
* In every group with subgroup , left multiplication is an action of on the set of cosets : for all , in . In particular if contains no nontrivial normal subgroups of this induces an isomorphism from to a subgroup of the permutation group of degree .
* In every group , conjugation is an action of on : . An exponential notation is commonly used for the right-action variant: ; it satisfies (.
* In every group with subgroup , conjugation is an action of on conjugates of : for all in and conjugates of .
* An action of on a set uniquely determines and is determined by an automorphism of , given by the action of 1. Similarly, an action of on is equivalent to the data of an involution of .
* The symmetric group and its subgroups act on the set 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 over a field with group of units , the mapping given by 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 and its subgroups, particularly its Lie subgroups (including the special linear group , orthogonal group , special orthogonal group , and symplectic group ) are Lie groups that act on the vector space . The group operations are given by multiplying the matrices from the groups with the vectors from .
* The general linear group acts on by natural matrix action. The orbits of its action are classified by the greatest common divisor of coordinates of the vector in .
* 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 and its subgroups, particularly its Lie subgroups, which are Lie groups that act on the projective space . This is a quotient of the action of the general linear group on projective space. Particularly notable is , the symmetries of the projective line, which is sharply 3-transitive, preserving the cross ratio; the Möbius group 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 comprise the category of -sets in which the objects are -sets and the morphisms are -set homomorphisms: functions such that for every in .
* The Galois group of a field extension acts on the field but has only a trivial action on elements of the subfield . Subgroups of correspond to subfields of that contain , that is, intermediate field extensions between and .
* The additive group of the real numbers acts on the phase space of " well-behaved" systems in classical mechanics (and in more general dynamical systems) by time translation: if is in and is in the phase space, then describes a state of the system, and is defined to be the state of the system seconds later if is positive or seconds ago if is negative.
*The additive group of the real numbers acts on the set of real functions of a real variable in various ways, with equal to, for example, , , , , , or , but not .
* Given a group action of on , we can define an induced action of on the power set of , by setting for every subset of and every in . 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 : for any such quaternion , the mapping is a counterclockwise rotation through an angle about an axis given by a unit vector ; is the same rotation; see quaternions and spatial rotation. This is not a faithful action because the quaternion leaves all points where they were, as does the quaternion .
* Given left -sets , , there is a left -set whose elements are -equivariant maps , and with left -action given by (where "" indicates right multiplication by ). This -set has the property that its fixed points correspond to equivariant maps ; more generally, it is an exponential object in the category of -sets.

Group actions and groupoids

The notion of group action can be encoded by the ''action groupoid'' 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 and are two -sets, a ''morphism'' from to is a function such that for all in and all in . Morphisms of -sets are also called '' equivariant maps'' or -''maps''.

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

Some example isomorphisms:
* Every regular action is isomorphic to the action of on given by left multiplication.
* Every free action is isomorphic to , where is some set and acts on by left multiplication on the first coordinate. ( can be taken to be the set of orbits .)
* Every transitive action is isomorphic to left multiplication by on the set of left cosets of some subgroup of . ( can be taken to be the stabilizer group of any element of the original -set.)

With this notion of morphism, the collection of all -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 of some category, and then define an action on as a monoid homomorphism into the monoid of endomorphisms of . If 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 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 to the category of sets, and a group representation is a functor from to the category of vector spaces. A morphism between -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

File:Octahedral-group-action.png, Orbit of a fundamental spherical triangle (marked in red) under action of the full octahedral group.
File:Icosahedral-group-action.png, 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

Notes

Citations

References

*
*
*
* .
*
*
*
*
*
*
*
*

External links

*
*

{{Authority control

Group theory

Representation theory of groups
Symmetry