A determinant-one matrix over permutes the three nonzero vectors of . This group action is faithful because fixing two basis vectors forces the matrix to be the identity. There are invertible matrices, all of determinant one since the only nonzero field element is one, so the action identifies the group with the symmetric group . Reduction of integer determinant-one matrices modulo two is onto: and induce two distinct transpositions, which generate . Its kernel consists of matrices congruent to the identity modulo two, the level-two principal congruence subgroup.
For nonzero holomorphic one-forms and holomorphic quadratic differentials, apply to every flat coordinate. Translation and sign transition maps remain of the same type, defining a new complex structure and differential. Composition gives a group action, zero orders persist and area is preserved. The zero section has no such atlas; fixing it gives only a set-theoretic extension that is generally discontinuous.
Stabilizer as a hidden subgroup Created 2026-09-24 Updated 2026-09-28
For a group action and fixed , the orbit map hides the stabilizer subgroup : exactly when , equivalently when and lie in the same left coset of .
Stabilizer subgroup Created 2026-09-24 Updated 2026-10-14
For a group action of a group on a set , the stabilizer subgroup of consists of the transformations that leave fixed:
It is a subgroup: the identity element fixes , products of transformations fixing fix , and the inverse element of a transformation fixing also fixes . A stabilizer subgroup is a subset of , whereas the orbit of a group action is a subset of . See Ackerman's algebra notes, definition 0.4.1.2.
For the square group actions defined under group action, direct calculation gives
The reflection fixes and individually. The reflection preserves the unoriented side of a polygon by exchanging its two vertices of a polygon. The half-turn rotation exchanges the two ends of the unoriented diagonal of a polygon while preserving that diagonal of a polygon. Thus fixing a side of a polygon or diagonal of a polygon as an object does not mean fixing every point on it; the latter condition uses a pointwise stabilizer. The four stabilizer subgroups have group orders , matching group orbit sizes through the orbit-stabilizer theorem.
A stabilizer subgroup records the transformations still available after imposing a constraint. Fixing a vertex of a polygon of the square leaves two choices; fixing its centroid leaves all eight. In a faithful group action, a stabilizer subgroup can still contain a nonidentity transformation, as shows: a faithful group action requires that only the identity element fix every point of simultaneously, not that every individual stabilizer subgroup be trivial. The two-point cyclic group example under group action has both stabilizer subgroups equal to the group kernel of its associated group homomorphism.
Subgroup Created 2026-09-24 Updated 2026-10-14
A subgroup is a subset of a group that is itself a group under the same group operation. It must contain the identity element of and be closed under products and inverse elements. Associativity is inherited from , so it needs no new proof. The whole group and the trivial group are always subgroups. A proper subgroup satisfies .
A useful single-condition test is
To see why it works, choose ; then . Taking gives every inverse element . Applying the test to and then gives . Conversely, every subgroup satisfies the test by closure under products and inverse elements. This also makes the additive version memorable: a nonempty subset of an additive group is a subgroup exactly when it is closed under differences. See McKernan's MIT lecture 2, Proposition 2.3, for the equivalent closure criterion.
For the square dihedral group above, is a cyclic subgroup: products add exponents modulo four, and . The smaller collections and are subgroups of group order two. But is not a subgroup, since lies outside it. A plausible-looking list of symmetries therefore need not constitute a complete collection of reversible operations.
Inside , the even numbers form a subgroup: is an even number. Its two cosets consist of the even numbers and the odd numbers, so its index of a subgroup is two. The parity group homomorphism has as its kernel of a group homomorphism. A subgroup can thus identify exactly which information a composition-preserving map forgets.
Subgroups also describe residual symmetry. In the group action of on the four vertices, the stabilizer subgroup of is : the diagonal reflection fixes that vertex, and the other six motions move it. Requiring a feature to stay fixed still leaves a group, because both composition and reversal preserve that requirement. This is why subgroups are useful for studying a group action one feature at a time.
Let be finite and let have index , the smallest prime divisor of . The group action on left cosets gives , with . The image order divides both and . By the choice of , the only possible nontrivial prime factor common to these orders is , and contains only one factor of . Thus the image order is or . The action is transitive on cosets, so its image is nontrivial and has order . The first isomorphism theorem gives , hence . A kernel of a group homomorphism is a normal subgroup, proving the claim. For example, every subgroup of order in a group of order is normal.
Symmetry group Created 2026-10-14 Updated 2026-10-14
A symmetry group collects bijections of an object to itself that preserve a specified structure in both directions, with function composition as the operation. For a geometric object one may require Euclidean distances to be preserved, giving an isometry group; for a graph, one preserves adjacency, giving a graph automorphism group. For an unstructured finite set, every permutation is allowed. The structure to be preserved is part of the definition.
For a square with its usual geometric structure, the symmetry group consists of four rotations and four reflections. These form the dihedral group of group order eight. The existing group action example shows how its eight elements move the vertices of a polygon; changing the object to its edges or a marked configuration changes the group action being studied.[ref]
Specifying the preserved data makes it possible to test a proposed symmetry exactly. After the preserved data are declared, function composition, the identity map, and inverse maps automatically preserve them too. Symmetry transformations therefore form a group, and questions about equivalent configurations become questions about group orbits, stabilizer subgroups, and group homomorphisms. This supplies reusable mathematics for comparing many different kinds of objects.
Symplectic quotient of the binary subset module Created 2026-10-14 Updated 2026-11-05
Let be even and let be the vector subspace of even-weight vectors. Its dot product is an alternating bilinear form, since on . The orthogonal complement of in is spanned by the all-one vector , which lies in . Consequently the radical of a bilinear form on is , and
is a nondegenerate symplectic vector space of dimension . The symmetric group acts by coordinate permutations, preserving this alternating bilinear form.
At , this group action is faithful. A weight-two vector and its complement have weights two and four, so a permutation fixing its quotient class must fix that two-element subset itself. Fixing every two-element subset forces the identity. The resulting embedding is an isomorphism, because the symplectic group over a finite field order formula gives .
Symplectic reduction Created 2026-10-05 Updated 2026-10-06
For a Hamiltonian group action, a regular value level preserved by a free proper group action has a smooth quotient. The restricted symplectic form descends to a symplectic form on that quotient when the kernel is exactly the orbit directions; this is symplectic reduction.
Tensor category 2026-11-05
In the algebraic convention used here, a tensor category over a field is a locally finite -linear abelian category with a bilinear monoidal tensor product, left and right duals for every object, and a simple monoidal unit object whose endomorphisms are . A locally finite category has finite-dimensional morphism spaces and objects of finite length. In broader usage, “tensor category” may mean merely a monoidal category; the extra hypotheses should therefore be stated.[ref]
Finite-dimensional representations of a group over give a model example: the tensor product has diagonal group action, the unit is the one-dimensional trivial representation, and the dual is the dual vector space with the contragredient action. A tensor category need not have a braiding; swapping two tensor factors compatibly is additional structure.
Three-transitive group action Created 2026-10-14 Updated 2026-11-05
A group action on a set of at least three points is three-transitive when it is transitive on ordered triples of distinct points. It implies a two-transitive group action, since a distinct pair can be completed to a distinct triple. The implication is strict: the projective general linear group in projective dimension at least two is two-transitive on projective points, but collinear and noncollinear triples belong to different group orbits.
Transformation model Created 2026-10-14 Updated 2026-11-05
A group action on the sample space induces a compatible action on the parameter space, preserving the family of probability laws. In a transitive model every law arises by transforming a fixed reference law. A location-scale model is generated by , , with parameter action .
Transitive group action Created 2026-10-03 Updated 2026-10-25
A group action on a nonempty 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 . There is exactly one group orbit: every position is reachable from every other. Requiring avoids calling the group action on the empty set transitive merely because the quantified statement has no points to test.[ref]
Here a left group action of a group means a function , written , satisfying
where is the identity element. Products move the point by first, then by . Transitivity says that an orbit map , , is surjective for every ; it suffices to check one chosen point.[ref][ref]
For example, the symmetric group acts on by . This is a transitive group action, but it is not a free group action: the stabilizer subgroup of is . Both the transposition and the cyclic permutation send to . In contrast, the cyclic group acts on itself by , using modular arithmetic. The group element sending to is uniquely . These two group actions reach the same number of points, but only the second has unique transport between them.
Figure 1.
Transitive group actions with and without unique transport
. The symmetric group on three labels has a stabilizer subgroup of group order two at each point, hence two group elements sending any chosen point to any other. The cyclic group acting on itself has trivial stabilizer subgroups and one transport per pair. Red arrows show a generating cyclic permutation; blue arrows show the extra transposition in . Gray loops show the identity element in both group actions. Details.
The stabilizer subgroup measures the ambiguity of transport. If , then
The first set is a left coset, and the second identity says that stabilizer subgroups in one group orbit are conjugate subgroups. Briefly, exactly when . Thus, for a finite group in a transitive group action, the orbit-stabilizer theorem gives , and there are exactly transports for each pair of points. The example counts are for and for . This separates the number of reachable positions from the number of ways to reach each one.[ref]
Transitive increasing event Created 2026-10-14 Updated 2026-11-05
An increasing event on a finite product of identically distributed coordinates is transitive if a group action preserving the event is transitive on the coordinate set. Its influences are all equal. Transitivity concerns coordinates, and does not assert transitivity on successful configurations.
Two-transitive group action Created 2026-09-29 Updated 2026-11-05
A group action on a set with at least two points is two-transitive when it acts transitively on ordered pairs of distinct points. Equivalently, the group action is transitive and the stabilizer subgroup of one point acts transitively on the remaining points. First move the initial first point to the target first point, then use that stabilizer subgroup to move the second point. Conversely, two-transitivity supplies both kinds of moves.
The transitivity requirement cannot be omitted: a group that fixes one point and permutes all others has a stabilizer subgroup transitive on the remaining points, while the whole group action is not even transitive. This is the case of an n-transitive group action.
Unitary representation Created 2026-09-24 Updated 2026-11-05
A unitary representation of a group on a complex Hilbert space is a group homomorphism into its unitary operators. Thus and . In finite dimension, this is the condition in an orthonormal basis.
For a topological group, one normally also requires strong continuity: is continuous for every vector . This gives a continuous group action on and permits the integrated unitary representation. For example, is a strongly continuous unitary representation of the additive real numbers on ; preservation of the inner product follows from translation invariance of the Lebesgue measure.
An unlabelled combinatorial structure is a combinatorial structure considered up to an appropriate isomorphism, so the names assigned to underlying elements do not distinguish objects. For graphs, this means a bijection of vertices preserving adjacency. A different drawing or vertex numbering can therefore represent the same unlabelled graph.
On three labelled vertices there are simple graphs, but only four unlabelled types: the empty graph, one edge with an isolated vertex, the two-edge path, and the triangle. Simply dividing eight by cannot work because these types have different numbers of automorphisms.
More generally, relabelling gives a group action of the symmetric group on labelled structures. Unlabelled structures are its orbits, and the orbit-stabilizer theorem explains how automorphisms affect orbit size. Burnside's lemma counts the orbits by averaging fixed-point counts.
Variable-permutation action on polynomials Created 2026-10-06 Updated 2026-11-05
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.
Word metric Created 2026-09-24 Updated 2026-10-14
The word metric measures how many allowed moves are needed to change one group element into another. For a finite symmetric generating set of a group with , it is the graph distance between vertices of the Cayley graph, equivalently
Here word length counts letters in a shortest representative of . The path metric on the entire Cayley graph also permits points inside edges; the word metric is its restriction to the group itself.[ref]
The word metric is left invariant:
This corresponds to the label-preserving group action on the Cayley graph. Symmetry follows by reversing a shortest graph path; concatenating routes gives the triangle inequality.[ref]
Right invariance can fail in a non-abelian group, because right multiplication replaces by through conjugation. In the free group with , we have , whereas : the latter freely reduced word has three letters. In an abelian group, conjugation fixes each element, so right invariance does hold. Cayley graphs of the integers and word metric balls in the integer lattice give examples where the word metric can be calculated explicitly.