Discontinuous Action
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, a group action on a space is a group homomorphism of a given group into the group of transformations of the space. Similarly, a group action on a
mathematical structure In mathematics, a structure is a set endowed with some additional features on the set (e.g. an operation, relation, metric, or topology). Often, the additional features are attached or related to the set, so as to provide it with some additional ...
is a group homomorphism of a group into the automorphism group of the structure. It is said that the group ''acts'' on the space or structure. 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. For example, it acts on the set of all triangles. Similarly, the group of symmetries of a polyhedron acts on the vertices, the
edges Edge or EDGE may refer to: Technology Computing * Edge computing, a network load-balancing system * Edge device, an entry point to a computer network * Adobe Edge, a graphical development application * Microsoft Edge, a web browser developed by ...
, and the faces of the polyhedron. A group action on a vector space is called a
representation Representation may refer to: Law and politics *Representation (politics), political activities undertaken by elected representatives, as well as other theories ** Representative democracy, type of democracy in which elected officials represent a ...
of the group. In the case of a finite-dimensional vector space, it allows one to identify many groups with subgroups of , 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
permutation In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or proc ...
s 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 In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = \ contains 3 elements, and therefore A has a cardinality of 3. Beginning in the late 19th century, this concept was generalized ...
.


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: : (with often shortened to or when the action being considered is clear from context): : for all and in and all in . The group is said to act on (from the left). A set together with an action of is called a (''left'') -''set''. 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.


Remarkable properties of actions

Let G be a group acting on a set X. The action is called ' or ' if g \cdot x = x for all x \in X implies that g = e_G. Equivalently, the morphism from G to the group of bijections of X corresponding to the action is injective. The action is called ' (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 Z/2\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 Z/2^n\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 Z/2\mathbb Z and the cyclic group \mathbb Z / 120\mathbb Z. The smallest sets on which faithful actions can be defined for these groups are of size 5, 12, and 16 respectively.


Transitivity properties

The action of G on X is called ' if for any two points x, y \in X there exists a g \in G so that g \cdot x = y. The action is ' (or ''sharply transitive'', or ') if it is both transitive and free. This means that given x, y \in X the element g in the definition of transitivity is unique. 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 if X has at least n elements, and for any pair of n-tuples (x_1, \ldots, x_n), (y_1, \ldots, y_n) \in X^n with pairwise distinct entries (that is x_i \not=x_j, y_i \not=y_j when i \not= j) there exists a g \in G such that g \cdot x_i = y_i for i=1,\ldots,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 group A group G acts 2-transitively on a set S if it acts transitively on the set of distinct ordered pairs \. That is, assuming (without a real loss of generality) that G acts on the left of S, for each pair of pairs (x,y),(w,z)\in S\times S with x \neq ...
s (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 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 \setminus \ 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 In mathematics, the orthogonal group in dimension , denoted , is the Group (mathematics), group of isometry, distance-preserving transformations of a Euclidean space of dimension that preserve a fixed point, where the group operation is given by ...
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 \not= \emptyset. 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 \not= \emptyset. The ''domain of discontinuity'' of the action is the set of all points of discontinuity. Equivalently it is the largest G-stable open subset \Omega \subset X such that the action of G on \Omega is wandering. In a dynamical context this is also called '' wandering set''. The action is ''properly discontinuous'' if for every compact subset K \subset X there are finitely many g \in G such that g \cdot K \cap K \not= \emptyset. This is strictly stronger than wandering; for instance the action of \mathbb Z on \mathbb^2 \setminus \ given by n\cdot (x, y) = (2^n x, 2^ y) is wandering and free but not properly discontinuous. The action by deck transformations of the
fundamental group In the mathematical field of algebraic topology, the fundamental group of a topological space is the group of the equivalence classes under homotopy of the loops contained in the space. It records information about the basic shape, or holes, of ...
of a locally simply connected space on an covering space 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 = \emptyset for every g \in G \setminus \. 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 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 G \backslash X.


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 ' if the map G \times X \to X \times X defined by (g, x) \mapsto (x, g\cdot x) is proper. This means that given compact sets K, K' the set of g \in G such that g \cdot K \cap K' \not= \emptyset is compact. In particular, this is equivalent to proper discontinuity when 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 \not= x for all x \in X and g \in U \setminus \. 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 In mathematics, a Lie group (pronounced ) is a group that is also a differentiable manifold. A manifold is a space that locally resembles Euclidean space, whereas groups define the abstract concept of a binary operation along with the additio ...
and X a
differentiable manifold In mathematics, a differentiable manifold (also differential manifold) is a type of manifold that is locally similar enough to a vector space to allow one to apply calculus. Any manifold can be described by a collection of charts (atlas). One ma ...
, then the subspace of ''smooth points'' for the action is the set of points x \in X such that the map x \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

Consider a group ''G'' acting on a set ''X''. The ' 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 \cdot x: G \cdot x = \. 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 In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. Each equivalence relation ...
is defined by saying x \sim y if and only if there exists a ''g'' in ''G'' with g \cdot x = y. The orbits are then the
equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements a ...
es under this relation; two elements ''x'' and ''y'' are equivalent if and only if their orbits are the same, that is, G \cdot x = G \cdot 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 \cdot x = X. This is the case if and only if G \cdot x = X for ''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: ''G''\''X''), 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 X_G, by contrast with the invariants (fixed points), denoted ''XG'': the coinvariants are a while the invariants are a . The coinvariant terminology and notation are used particularly in
group cohomology In mathematics (more specifically, in homological algebra), group cohomology is a set of mathematical tools used to study groups using cohomology theory, a technique from algebraic topology. Analogous to group representations, group cohomology loo ...
and group homology, which use the same superscript/subscript convention.


Invariant subsets

If ''Y'' is a
subset In mathematics, Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are ...
of ''X'', then G \cdot Y denotes the set \. The subset ''Y'' is said to be ''invariant under G'' if G \cdot Y = Y (which is equivalent to G \cdot Y \subseteq 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 \cdot 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 Transitivity or transitive may refer to: Grammar * Transitivity (grammar), a property of verbs that relates to whether a verb can take direct objects * Transitive verb, a verb which takes an object * Transitive case, a grammatical case to mark a ...
. 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 \in X such that g \cdot x = x for all g \in G. The set of all such ''x'' is denoted X^G and called the ''G-invariants'' of ''X''. When ''X'' is a ''G''-module, ''XG'' 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 \cdot x = x, it is said that "''x'' is a fixed point of ''g''" or that "''g'' fixes ''x''". For every ''x'' in ''X'', the 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 = \. This is a subgroup of ''G'', though typically not a normal one. The action of ''G'' on ''X'' is
free Free may refer to: Concept * Freedom, having the ability to do something, without having to obey anyone/anything * Freethought, a position that beliefs should be formed only on the basis of logic, reason, and empiricism * Emancipate, to procur ...
if and only if all stabilizers are trivial. The kernel ''N'' of the homomorphism with the symmetric group, G \to \operatorname(X), is given by the
intersection In mathematics, the intersection of two or more objects is another object consisting of everything that is contained in all of the objects simultaneously. For example, in Euclidean geometry, when two lines in a plane are not parallel, their i ...
of the stabilizers ''Gx'' 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 \cdot x. Then the two stabilizer groups G_x and G_y are related by G_y = g G_x g^. Proof: by definition, h \in G_y if and only if h \cdot (g \cdot x) = g \cdot x. Applying g^ to both sides of this equality yields \left(g^ hg\right) \cdot x = x; that is, g^ h g \in G_x. An opposite inclusion follows similarly by taking h \in G_x and supposing x = g^ \cdot 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.


and Burnside's lemma

Orbits and stabilizers are closely related. For a fixed ''x'' in ''X'', consider the map f : G \to X given by g \mapsto g \cdot x. By definition the image f(G) of this map is the orbit G \cdot x. The condition for two elements to have the same image is f(g)=f(h) \iff g\cdot x=h \cdot x \iff g^h \cdot x=x \iff g^h \in G_x \iff h \in gG_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 f^(\) 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 between the set G/G_x of cosets for the stabilizer subgroup and the orbit G \cdot x, which sends gG_x \mapsto g \cdot 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_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 \bmod p orbits of length 1 which are ''G''-invariant elements. This result is especially useful since it can be employed for counting arguments (typically in situations where ''X'' 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 ''G'' denote its
automorphism In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms ...
group. Then ''G'' 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, , G, = , G\cdot1, , G_1, = 8, G_1, . Applying the theorem now to the stabilizer G_1, we can obtain , G_1, = , (G_1)\cdot2, , (G_1)_2, . 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\pi/3 which permutes 2,4,5 and 3,6,8, and fixes 1 and 7. Thus, \left, (G_1)\cdot2\ = 3. Applying the theorem a third time gives , \left(G_1\right)_2, = , \left(\left(G_1\right)_2\right)\cdot3, , \left(\left(G_1\right)_2\right)_3, . 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 \left, \left(\left(G_1\right)_2\right)\cdot3\ = 2. One also sees that \left(\left(G_1\right)_2\right)_3 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 , G, = 8\cdot3\cdot2\cdot1 = 48. A result closely related to the orbit-stabilizer theorem is
Burnside's lemma Burnside's lemma, sometimes also called Burnside's counting theorem, the Cauchy–Frobenius lemma, the orbit-counting theorem, or the Lemma that is not Burnside's, is a result in group theory that is often useful in taking account of symmetry when ...
: , X/G, =\frac\sum_ , 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 In mathematics, the Burnside ring of a finite group is an algebraic construction that encodes the different ways the group can act on finite sets. The ideas were introduced by William Burnside at the end of the nineteenth century. The algebraic r ...
of ''G'', where addition corresponds to disjoint union, and multiplication to
Cartesian product In mathematics, specifically set theory, the Cartesian product of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is : A\ti ...
.


Examples

* The ' action of any group ''G'' on any set ''X'' is defined by 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'': 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'': 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 '' : H'. * In every group ''G'', conjugation is an action of ''G'' on ''G'': . An exponential notation is commonly used for the right-action variant: ; it satisfies (. * In every group ''G'' with subgroup ''H'', conjugation is an action of ''G'' on conjugates of ''H'': for all ''g'' in ''G'' and ''K'' conjugates of ''H''. * The symmetric group S''n'' and its subgroups act on the set by permuting its elements * The
symmetry group In group theory, the symmetry group of a geometric object is the group of all transformations under which the object is invariant, endowed with the group operation of composition. Such a transformation is an invertible mapping of the ambient ...
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. * 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 In mathematics, the orthogonal group in dimension , denoted , is the Group (mathematics), group of isometry, distance-preserving transformations of a Euclidean space of dimension that preserve a fixed point, where the group operation is given by ...
, special orthogonal group , and symplectic group ) are
Lie group In mathematics, a Lie group (pronounced ) is a group that is also a differentiable manifold. A manifold is a space that locally resembles Euclidean space, whereas groups define the abstract concept of a binary operation along with the additio ...
s that act on the vector space ''K''''n''. The group operations are given by multiplying the matrices from the groups with the vectors from ''K''''n''. * The general linear group acts on Z''n'' by natural matrix action. The orbits of its action are classified by the greatest common divisor of coordinates of the vector in Z''n''. * The affine group acts
transitively Transitivity or transitive may refer to: Grammar * Transitivity (grammar), a property of verbs that relates to whether a verb can take direct objects * Transitive verb, a verb which takes an object * Transitive case, a grammatical case to mark a ...
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 In mathematics, the concept of a projective space originated from the visual effect of perspective, where parallel lines seem to meet ''at infinity''. A projective space may thus be viewed as the extension of a Euclidean space, or, more generally ...
Pn(''K''). 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 ''G'' comprise the category of ''G''-sets in which the objects are ''G''-sets and the
morphism In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms a ...
s are ''G''-set homomorphisms: functions such that for every ''g'' in ''G''. * The Galois group of a
field extension In mathematics, particularly in algebra, a field extension is a pair of fields E\subseteq F, such that the operations of ''E'' are those of ''F'' restricted to ''E''. In this case, ''F'' is an extension field of ''E'' and ''E'' is a subfield of ...
''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 acts on the
phase space In dynamical system theory, a phase space is a space in which all possible states of a system are represented, with each possible state corresponding to one unique point in the phase space. For mechanical systems, the phase space usually ...
of " well-behaved" systems in classical mechanics (and in more general
dynamical systems In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space. Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in a p ...
) by time translation: if ''t'' is in R and ''x'' is in the phase space, then ''x'' describes a state of the system, and 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 acts on the set of real functions of a real variable in various ways, with (''t''⋅''f'')(''x'') equal to, for example, , , , , , or , but not . *Given a group action of ''G'' on ''X'', we can define an induced action of ''G'' on the power set of ''X'', by setting 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
quaternion In mathematics, the quaternion number system extends the complex numbers. Quaternions were first described by the Irish mathematician William Rowan Hamilton in 1843 and applied to mechanics in three-dimensional space. Hamilton defined a quatern ...
s with norm 1 (the versors), as a multiplicative group, act on R3: for any such quaternion , the mapping 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. Note that 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 Y^X whose elements are ''G''-equivariant maps \alpha:X\times G\to Y, and with left ''G''-action given by g\cdot\alpha=\alpha\circ (id_X\times-g) (where "-g" indicates right multiplication by g). This ''G''-set has the property that its fixed points correspond to equivariant maps X\to 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 \ltimes 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 such that 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 , where ''S'' is some set and ''G'' acts on 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

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 In mathematics, a measurable acting group is a special group that Group action (mathematics), acts on some space in a way that is compatible with structures of measure theory. Measurable acting groups are found in the intersection of measure theor ...
* Monoid action


Notes


Citations


References

* * * * * * * * *


External links

* * {{Authority control Group theory Representation theory of groups Symmetry