Group action

Uses your system voice; voice and rate in settings.

Snapshot

≈ 17 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.…

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 \operatorname{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. \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 \left\{\begin{align}& e\cdot x=x \\ & g\cdot(h\cdot x)=(gh)\cdot x\end{align}\right. 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 \operatorname{Sym}(X) of all bijections from X to itself. The difference between left and right actions is in the order in which a product gh acts on x . For a left action, h acts first, followed by g second. For a right action, g acts first, followed by h second. Because of the formula (gh)^{-1}=h^{-1}g^{-1} , 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 G on X can be considered as a left action of its opposite group G^{\text{op}} on X . Thus, for establishing general properties of a single group action, it suffices to consider only left 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 homomorphism 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, 7, and 16 respectively. 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 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\geq 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\neq x_j , y_i\neq y_j when i\neq 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 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 X^n is sharply transitive. For an integer n\geq 1 , the action of G on X is called if X has at least n elements, and for any pair of n -subsets S,T\subseteq X there exists a g\in G such that gS=T . In other words, the action on the set of n -subsets of X is transitive. An action is when the action on n -subsets of X is sharply transitive. An n -transitive action is also n -homogeneous. As 1-subsets, 1-tuples and points are equivalent, the concepts of 1-homogeneity, 1-transitivity and transitivity coincide. A group that acts n -homogeneously on a set X of m elements also acts (m-n) -homogeneously, as gS=T implies g\left(X\setminus S\right)=X\setminus T . The action of the symmetric group of X is n -homogeneous for any n up to the cardinality of X . So is the action of the alternating group, which is (n-1) -homogeneous (since it is transitive, and thus 1-homogeneous) without being (n-1) -transitive. For n=3 , this has a geometric interpretation: the full group of Euclidean symmetries of an equilateral triangle acts as the full symmetric group on its vertices and hence 2-transitively thereon, while the subgroup of in-plane rotations (which correspond to alternating permutations) merely acts 2-homogeneously. 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\neq\emptyset . This is strictly stronger than wandering; for instance the action of \mathbb{Z} on \mathbb{R}^2\backslash\{(0,0)\} given by n\cdot(x,y)=(2^nx,2^{-n}y) is wandering and free but not properly discontinuous. 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=\emptyset for every g\in G\backslash\{e_G\} . 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 X/G .

Orbits and stabilizers

, the symmetry group is the (rotational) icosahedral group of order 60, while the stabilizer of a single chosen tetrahedron is the (rotational) tetrahedral group of order 12, and the orbit space (of order 60/12 = 5) is naturally identified with the 5 tetrahedra – the coset corresponds to the tetrahedron to which sends the chosen tetrahedron. 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 : G \cdot x = \{ g \cdot x : g \in G \}. 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. If Y is a subset of X , then G\cdot Y denotes the set \{g\cdot y\mid g\in G,y\in Y\} . The subset Y is said to be invariant under G if G\cdot Y=Y (which is equivalent 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. 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, 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. 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 = \{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\rightarrow\operatorname{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\cdot x . Then the two stabilizer groups G_x and G_y are related by G_y=gG_xg^{-1} . Proof: by definition, h\in G_y if and only if h\cdot(g\cdot x)=g\cdot x . Applying g^{-1} to both sides of this equality yields (g^{-1}hg)\cdot x=x ; that is, g^{-1}hg\in G_x . An opposite inclusion follows similarly by taking h\in G_x and x=g^{-1}\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. f(g)=f(h) \iff g \cdot x = h \cdot x \iff g^{-1}h \cdot x = x \iff g^{-1}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 G / G_x \cong G \cdot x 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\,:\,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 least orbits of length which are -invariant elements. More specifically, and the number of -invariant elements are congruent modulo . 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 . |X/G|=\frac{1} \sum_{g\in G} |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. 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

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375417358 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.