Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Business Industries Finance Tax

Home > Group action


First Prev [ 1 2 3 ] Next Last

In mathematics, groups are often used to describe symmetries of objects. This is formalized by the notion of a group action: every element of the group "acts" like a bijective map (or "symmetry") on some set. In this case, the group is also called a transformation group of the set. A permutation representation of a group G is almost the same thing: formally it may be described as a group representation of G by permutation matrices, and is usually considered in the finite-dimensional case — it is the same as a group action of G on an ordered basis of a vector space.

1 Definition

If G is a group and X is a set, then a (left) group action of G on X is a binary function G × XX (where the image of g in G and x in X is written as g.x) which satisfies the following two axioms:

g.(h.x) = (gh).x for all g, h in G and x in X.
e.x = x for every x in X; here e denotes the identity element of G.

From these two axioms, it follows that for every g in G, the function which maps x in X to g.x is a bijective map from X to X. Therefore, one may alternatively and equivalently define a group action of G on X as a group homomorphism G → Sym(X), where Sym(X) denotes the group of all bijective maps from X to X.

If a group action G × XX is given, we also say that G acts on the set X or X is a G-set.

In complete analogy, one can define a right group action of G on X as a function X × GX by the two axioms (x.g).h = x.(gh) and x.e = x. In the sequel, we consider only left group actions.

2 Examples





Non User