For a group acting on a ring by ring automorphisms, the elements fixed by every group element form a subring containing . For finite acting on a commutative ring, each satisfies the monic orbit equation , whose coefficients are fixed. Thus is integral over its invariant subring. This uses an orbit product, not division by the group order.
A fraction of invariant elements is fixed by every automorphism. If that fraction is integral over , its monic equation also makes it integral over . A normal domain therefore places it in , and fixedness places it in . This proves integral closedness of the invariant subring in its own fraction field. The proof works for any group and in every characteristic; no averaging or finiteness of the group is needed for normality.
A transitive group action is primitive if the only blocks are singletons and the whole set; a block has every translate either equal to it or disjoint from it. Orbits of a normal subgroup form blocks. Hence a nontrivial normal subgroup in a faithful primitive action is transitive. Two-transitivity implies primitivity. This normal-subgroup observation is a hypothesis engine for Iwasawa's simplicity lemma.
The symmetric group acts on multivariate polynomials by replacing each variable by . With , substitution gives . Thus it is a left group action. A polynomial encoding a combinatorial partition has a group orbit encoding all relabelings and a stabiliser subgroup encoding its label symmetries.
A fixed point of a group action is an element fixed by every group element. The set is the categorical limit of the action viewed as a functor from the one-object category associated with to the Category of sets.
The left regular action of a group on its own underlying set is left multiplication. It is faithful, because an element fixing the identity is itself the identity. For a finite group it gives the permutation representation used in Cayley theorem.
A block system for a group action is a partition of the acted-on set such that every group element permutes its parts. For a transitive action, a nontrivial block system has more than one part and more than one element per part. The full symmetric group preserves no such partition: a transposition exchanging one point in each of two parts breaks it.
A group action on a set is transitive when every two points lie in the same orbit of a group action, equivalently when for all there is a group element with .
A regular permutation subgroup acts transitively with trivial point stabilizers. Each ordered pair of points is related by exactly one subgroup element. A finite regular subgroup on points has order . Normality and characteristicity are additional properties; they do not follow from regularity alone.
An action is sharply -transitive if each ordered -tuple of distinct points is carried to any other by exactly one group element. For finite degree , its order is and each ordered-tuple stabilizer is trivial. Sharp one-transitivity is a regular action. Finite sharp two-transitivity gives a regular kernel of a finite sharply two-transitive group.
In a finite sharply two-transitive group, the identity together with all fixed-point-free elements forms a regular normal subgroup. One proof constructs virtual characters from induced point-stabilizer characters and the augmentation character, proves their norms are one, and realizes this set as an intersection of representation kernels. Conjugation by the point stabilizer is transitive on the kernel's nonidentity elements. This forces the kernel to be elementary abelian, so it is a unique Sylow subgroup and is characteristic. Closure of the fixed-point-free set is a theorem, not something supplied merely by counting its size.
Adjoin a new point fixed by a transitive group . A one-point extension is a transitive group on the enlarged set whose stabilizer of is exactly , acting on the remaining points in the prescribed way. Its order is in the finite degree- case. The double-coset criterion for a one-point extension gives a concrete generator test.
If interchanges the new point and , put . Then is a one-point extension exactly when , , and for every . These conditions make multiplication-closed, hence a group in the finite setting, with new-point stabilizer . Necessity comes from the two double cosets in the extended two-transitive action.
A transitive subgroup for prime that contains a transposition is . Form a graph on the letters with edges given by all conjugates in of that transposition. The transitive action permutes connected components, so their common size divides . An edge rules out size one, hence the graph is connected. Its edge transpositions generate : successive swaps along a path generate the swap of its endpoint with any chosen start. All these edge transpositions belong to .
A group action on a set is two-transitive when it acts transitively on ordered pairs of distinct points. Equivalently, a point stabilizer acts transitively on the remaining points.
For a group acting on a set and a point , the orbit map is , . Its image is the orbit of a group action of , and its fibres are cosets of the stabilizer subgroup of .
For a subset of a group and an element , its conjugate subset isConjugation is a bijection and a group automorphism, so it preserves cardinality and every property expressed using the group operation.
Two group elements and are conjugate when for some group element , equivalently when they belong to the same conjugacy class. Conjugate elements have the same order of a group element.
If an infinite group has a single nonidentity conjugacy class, it is a torsion-free group. Otherwise every nonidentity element has the same finite order . Powers show is prime. For , choose ; then gives , impossible by Fermat's little theorem. For , the group has exponent two and is abelian, so every conjugacy class is a singleton and the hypothesis would force the group to have only two elements. Infinitude excludes this final case.
A shortest conjugacy representative is a word having the fewest written letters among all words representing elements of a fixed conjugacy class. This minimum equals the least group word length of an element in the class; a longer spelling of that element is not itself a shortest representative. Such a word exists because lengths are nonnegative integers. It is freely and cyclically reduced: free cancellation shortens the same representative, while removing mutually inverse first and last letters shortens a conjugate. Every cyclic rotation has the same minimal length.
A nonempty shortest conjugacy representative is a cyclically reduced word. If with first and last letters inverse, is a shorter word representing a conjugate. Consequently has length exactly as a freely reduced word, and any segment of the periodic word of length at most fits in a cyclic rotation of . This observation turns a Dehn shortening segment crossing copy boundaries into a shortening of a conjugacy representative.
If has prime index , a conjugacy class of lying in splits into one or conjugacy classes of . Conjugation by acts transitively on these smaller classes, while fixes every one. This factors through , and the orbit-stabilizer theorem makes the number of classes a divisor of .
For an even permutation , its symmetric group class splits into two equal alternating group classes exactly when its symmetric-group centralizer contains no odd permutation. If an odd commuting element exists, an odd conjugator can be multiplied by it to become even; otherwise the index-two subgroup has two conjugation orbits. In cycle notation the splitting types are precisely distinct odd cycle lengths, counting fixed points as length-one cycles: rotating odd cycles is even, whereas an even cycle or the exchange of two equal odd cycles supplies an odd centralizer element.
For a finite group with trivial centre of a group and a prime divisor of its order, some nonidentity conjugacy class has size coprime to . Otherwise the class equation would give . Primality is essential: in the symmetric group , neither nonidentity class size is coprime to the composite divisor .
Commutation with a fixed-point-free involution preserves its partner relation. A commuting permutation can permute the pairs and independently swap each pair. This gives the permutation wreath product with order .
A permutation commutes with a transposition exactly when it preserves its two-element support as a set. It may swap those two points and independently permute the remaining points. Thus this centraliser has order .
Over the reals or a finite field with more than two elements, the normalizer of all invertible diagonal matrices in consists of monomial matrices and has quotient over that diagonal subgroup. Over its size is for . For the diagonal subgroup is trivial, so its normalizer is all of , of order six.
For a finite group acting on a set and any point ,Indeed, is a well-defined bijection from the left cosets of the stabilizer to the orbit.
For an algebraic group action, the orbit dimension is the dimension of the group minus that of its stabilizer. For a finite-dimensional representation, the stabilizer is an automorphism group, open in its endomorphism ring, so their dimensions agree. In a quiver representation space, the Ringel form turns the orbit codimension into the dimension of the self-extension group.
The full isometry group of a cube has order . Its transitive actions on the vertices, edges, and main diagonals have stabilizers isomorphic respectively toThe action on main diagonals has kernel .
The full symmetry group of a cube acts transitively and faithfully on its twelve edges. For vertices , its signed permutation matrices act transitively on the edges. The stabilizer subgroup of consists of independently swapping and reversing , and is a Klein four-group. The orbit-stabilizer theorem gives order . Fixing every edge fixes every vertex, as each vertex is the unique intersection of its three incident edges, so the group action is faithful. The resulting subgroup of has index and is not normal: central inversion has cycle type , whose conjugacy class in has elements.
The symmetry group of a cube splits into its central inversion and its rotational symmetry group of a cube. Inversion has determinant , the rotation subgroup has determinant , and together they generate the full group with trivial intersection. The rotation subgroup acts faithfully on the four body diagonals and is isomorphic to . Consequently the full group is this direct product of groups.
The orientation-preserving symmetries of a cube are the signed permutation matrices with determinant one. There are of them. Their group action on the four body diagonals identifies this group with the symmetric group . Indeed choose diagonal directions , whose sum is zero and whose only linear relation has all coefficients equal. A rotation fixing every diagonal sends each direction to itself or its negative; the relation forces all four signs equal. All negative would give , which has determinant , so the kernel of a group homomorphism is trivial. Both groups have order 24, giving the identification. Its face permutations have cycle types , , , and , occurring times respectively.
If a group acts transitively on a set of prime size and is normal, then the -orbits form a -invariant block system of equal size. They are therefore either singletons or the whole set. In a faithful action the singleton case forces , so every nontrivial normal subgroup is transitive.
For satisfying , the real and imaginary parts obey and . Simultaneous real rotations preserve . At the group orbit is the unit sphere, with stabilizer subgroup . At each , the normalized pair is an oriented two-frame, giving a free transitive SO(3) group action. The group orbit space is , and the whole quadric is diffeomorphic to the tangent bundle of . Its varying Hermitian norm prevents it from being a single SU(3) group orbit.
The general linear group over a finite field acting diagonally on projective triples has five orbits of a group action: all equal, three different positions for the repeated coordinate when exactly two are equal, and all distinct. The corresponding representative stabilizer subgroups are upper triangular, diagonal, and scalar matrices. Their orders are , , and , respectively; the orbit sizes are , , and . Transitivity follows from the action being sharply three-transitive on a projective line.
Articles by others on the same topic
In mathematics, particularly in the field of group theory, a **group action** is a formal way that a group operates on a set. More specifically, a group action is a way of describing how the elements of a group interact with the elements of a set in a way that respects the group structure. ### Definition: Let \( G \) be a group and \( X \) be a set.