Almost simple group Created 2026-10-14 Updated 2026-11-05
A group between a nonabelian simple group and its automorphism group. Finite two-transitive groups are either of this type or affine two-transitive groups, a structural theorem rather than an order-divisibility test.
Automorphism Created 2026-09-24 Updated 2026-10-14
An automorphism is an isomorphism : a structure-preserving self-map that can be undone by another structure-preserving self-map. Equivalently, it is an invertible endomorphism. Its inverse satisfieswhere is the identity morphism. Both maps must be morphisms in the chosen category. For ordinary groups, rings, and vector spaces over a fixed field, a bijective morphism automatically has a compatible inverse. For topological spaces, an automorphism is a homeomorphism from the space to itself: a continuous bijection needs a continuous inverse as well. See Riehl, Category Theory in Context, Definition 1.1.10 and Example 1.1.11.
For example, is an automorphism of the vector space over the real numbers, with inverse . Both are linear maps. The linear endomorphism from endomorphism preserves addition and scalar multiplication too, but discards a coordinate and cannot be undone. Preserving the structure and preserving enough information for reversal are separate requirements.
The automorphisms of a fixed object in a locally small category form a group under composition in a category: the identity morphism is the identity element, and the inverse element of a composite reverses the order of its factors. This makes reversible internal changes calculable. For a group, the resulting automorphism group records which relabelings preserve all products; the examples in group automorphism show how restrictive that condition can be.
Automorphism-count bound for a finite field extension Created 2026-09-29 Updated 2026-11-05
If is finite, then any distinct -automorphisms of are linearly independent in the -vector space , whose dimension over is . Hence . In particular, a finite automorphism group satisfies .
Automorphism-count divisibility theorem Created 2026-09-24 Updated 2026-11-05
For a finite extension , the automorphism group has order dividing . Indeed, Artin's theorem gives , while and the tower law gives the divisibility.
Automorphism group Created 2026-09-24 Updated 2026-11-05
Automorphism group of a quiver representation Created 2026-10-06 Updated 2026-11-05
For a finite-dimensional quiver representation , its automorphism group is the unit group . It is a connected linear algebraic group: the units of a finite-dimensional algebra form a nonempty Zariski-open set in an affine space, hence a geometrically irreducible variety. This automorphism group is the stabilizer under the base change action on quiver representations.
Over an algebraically closed field , write the Krull-Schmidt decomposition as with pairwise nonisomorphic indecomposable modules . Reduction modulo the Jacobson radical gives the quotient . The field hypothesis matters: over a general field, the corresponding factors are general linear groups over the division rings , which need not equal .
Automorphism of a root system Created 2026-10-05 Updated 2026-11-05
An automorphism of a root system is an orthogonal transformation of mapping onto itself. The Weyl group is a subgroup of this automorphism group; additional automorphisms can act nontrivially on a Dynkin diagram while preserving a root basis.
Centralizer and normalizer Created 2026-09-24 Updated 2026-10-14
Both constructions are stabilizer subgroups for the conjugation action. The centralizer fixes an individual element ; the normalizer preserves a subgroup as a whole, while possibly moving its elements. The centralizer of a subset fixes every member of individually, soFor a cyclic subgroup , commuting with the group generator is equivalent to commuting with all its powers, giving .
In the symmetric group , let and . ThenEvery transposition sends to under conjugation. In particular, for ,Thus belongs to the normalizer of but not to the centralizer of . Preserving the collection of powers allows the two possible directions of its group generator to be exchanged.
This distinction lets one ask separately which operations leave a chosen operation unchanged and which operations preserve the subgroup it generates. The normalizer also supplies a group homomorphism to the automorphism group of , by ; its group kernel is . In this example the group homomorphism has two possible outputs, fixing or replacing it by . The quotient group is therefore a cyclic group of group order two. Milne develops the normalizer as a stabilizer subgroup in Group Theory (v4.01) by James S. Milne.
Dihedral fixed field in one rational variable Created 2026-10-14 Updated 2026-11-05
Automorphisms and generate a dihedral group of order . The invariant has rational map degree , so . The fixed-field theorem for a finite automorphism group gives the same degree over its fixed field, proving equality. For odd prime , the nontrivial proper subgroups are the rotation group and the reflection groups. Their fixed fields are and for reflections , respectively.
Field automorphism group Created 2026-10-14 Updated 2026-11-05
The field automorphism group fixing consists of all field automorphisms of fixing pointwise, with composition. It is defined without assuming that is Galois. For with algebraic degree , the action on the roots of the minimal polynomial inside is faithful, so this group embeds in and is finite.
G2 (mathematics) 2026-10-14
denotes an exceptional Lie group and its associated Lie algebra, of rank two and dimension fourteen. Its roots form the G2 root system. The compact real form is the automorphism group of the octonion algebra; other real forms and the complex Lie algebra have the same complex root-system type.
Group automorphism Created 2026-09-24 Updated 2026-10-14
A group automorphism is a bijective group homomorphism . It preserves the group operation, the identity element, and inverse elements; its inverse is another group homomorphism. Thus it is a group isomorphism with identical source and target. These maps form the automorphism group under function composition.[ref]
For the additive finite cyclic group , take . Its output list on is , a permutation of all six elements. It preserves addition because , and applying it twice gives . Hence it is a group automorphism and its own inverse function. Compare the collapsing in the figure under endomorphism. The general criterion under endomorphism of a finite cyclic group says exactly when such a map is reversible: its multiplier must be coprime to the size of the finite cyclic group.
A permutation need not be a group automorphism, even if it fixes the identity element. Let exchange and in and fix . It is a bijection, and , butThus it fails to preserve addition and is not even a group homomorphism. Reversibility alone does not preserve the group operation.
A group automorphism carries each cyclic subgroup onto the cyclic subgroup generated by the image of its defining element, preserving the order of a group element. In particular, it carries a generator of a group to another generator of a group. For , the existing calculation of generators of a finite cyclic group leaves only the images and for , so its automorphism group consists exactly of the identity function and . This turns the problem of compatible relabeling into a much smaller choice than enumerating arbitrary permutations.
Mathieu group Created 2026-10-14 Updated 2026-11-05
The five simple Mathieu groups are the exceptional finite simple groups . Their natural permutation group degrees are the displayed subscripts, with transitivity degrees , respectively.
One concrete definition of is the subgroup of generated byThese are the explicit generators of a group in the official Chapter 50, section 50.1-13, MathieuGroup example. Its order is , and its natural group action is sharply four-transitive.
The larger groups have useful design and coding realizations. is the automorphism group of the small Witt design; a point stabilizer is . The coordinate permutations preserving the extended binary Golay code form ; its one-point and two-point pointwise stabilizers are and . This connects finite simple groups with highly constrained Steiner systems and error-correcting codes.[ref]
Sporadic simple groups by Robert A. Wilson. Lecture 5, Mathieu groups and the Golay-code realization
Normalizer Created 2026-09-24 Updated 2026-10-14
For a subgroup of a group , the normalizer isIt is the stabilizer subgroup of under the conjugation action on subgroups. Its elements can permute members of ; they need not commute with them. For in the symmetric group , the cyclic subgroup has normalizer , although the centralizer of has only three elements, as illustrated in centralizer and normalizer.
Every element of preserves under conjugation, so . Moreover, is a normal subgroup of , and this is the largest subgroup of with that property. Indeed, any subgroup in which is a normal subgroup consists entirely of elements preserving under conjugation. In particular, exactly when is a normal subgroup of .[ref]
The orbit-stabilizer theorem counts distinct conjugate subsets of a subgroup byFor in , there is just one, since . For the subgroup , preserving forces its unique nonidentity element to stay fixed. Hence , and its three distinct conjugate subsets are , and . This is the subgroup counterpart of counting a conjugacy class with a centralizer: the object being stabilized determines which denominator belongs in the count.[ref]
The equality in the definition is essential. For a subgroup that is a finite group, an inclusion already gives equality by equal cardinalities. For an infinite subgroup, that inference can fail: conjugation might carry it onto a proper subgroup. The normal subgroup criterion is therefore, with the explicit hypothesis ,No finiteness or commutativity assumption is needed. A normal subgroup is preserved as a set; its elements need not lie in the center of a group.
There is a second useful count, distinct from counting conjugate subgroups. The normalizer acts on itself by group automorphisms, giving the group homomorphismIts group kernel is , so the centralizer of a subset is a normal subgroup of and the first isomorphism theorem givesThis quotient group records the different rearrangements of induced by the surrounding group. It gives a faithful group action on , but need not be the entire automorphism group of . For example, take the ambient group . Since is an abelian group, , so the quotient group is trivial; nevertheless is a nonidentity group automorphism of . Returning to the ambient symmetric group makes that group automorphism available through a reflection, and . Its two cosets are the three rotations and the three reflections.
The subgroup itself need not be contained in : their intersection is the center of a group . It is contained precisely when is an abelian group. Thus , which exists because is a normal subgroup of its normalizer, and answer different questions and should not be substituted for one another.
Oligomorphic permutation group Created 2026-10-14 Updated 2026-11-05
A permutation group on a set is oligomorphic when its diagonal action on ordered -tuples has finitely many orbits for every positive integer . For a countable model of a complete theory, an oligomorphic automorphism group makes every finite-arity type space finite: realized types are dense, and only finitely many are possible because types are constant on orbits.
Orbit polynomial under a finite automorphism group Created 2026-10-03 Updated 2026-11-05
For and a finite automorphism group , the polynomialhas coefficients in the fixed field , because every element of permutes its factors.
Outer automorphism group Created 2026-09-28 Updated 2026-11-05
Past exam of the mathematics course of the University of Cambridge 2005 ib Paper 2 2C Solution Created 2026-09-24 Updated 2026-10-14
A group automorphism is a bijective group homomorphism from to itself. The multiplication in is composition: . Composition is associative, the identity map is the identity element, and each inverse bijection is again a homomorphism, so these maps form the automorphism group.
For conjugation by , multiplication is preserved becauseConjugation by is its inverse, so is an group automorphism. MoreoverHence is a homomorphism, with image the inner automorphisms. Its group homomorphism kernel is the group center of , since is the identity precisely when for every .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 2 1 Solution Created 2026-10-03 Updated 2026-10-14
A composition series is a subnormal chain whose nontrivial successive quotients are simple. The Jordan–Hölder theorem asserts that any two composition series of a finite group have the same length and the same multiset of simple factors, up to isomorphism. Existence follows by successively choosing maximal proper normal subgroups until the identity is reached.
For uniqueness, induct on the group order. Let be the penultimate terms of two series. If , apply induction to that subgroup and add the common top factor. If , their normality and maximality give . Put . The isomorphism theorems giveBoth are simple. Take any composition series of . Appending to it gives a series for , so induction identifies the factors of the original series inside with the factors of together with . Similarly the factors inside are those of together with . Adding the respective top factors produces the same multiset in both cases. This proves uniqueness, including multiplicities and length.
A normal subgroup of order two is central because its automorphism group is trivial. By Jordan–Hölder, a composition series through leaves the simple quotient . The image of in this quotient is central and hence trivial, since is nonabelian simple. ThusThe symmetric group has trivial group center: conjugation of each transposition by a central permutation must preserve its two-element support, forcing the permutation to fix every point. Since its Jordan–Hölder factors are and , a normal subgroup of order two would equal that trivial group center, a contradiction.
Identify and put in . Its three maximal normal subgroups areThey are the three kernels of nonzero maps from the abelianization to . There is no quotient : a central must map trivially, while has no quotient . The latter follows from its normal subgroups , which can themselves be obtained by intersecting with the simple subgroup and using its trivial centralizer. The complete list of composition series isWithin the two direct factors are the only maximal normal subgroups; within each of the only such subgroup is its copy of . Hence there are exactly four series.
For , put , , andAgain these are exactly the maximal normal subgroups: they are the three cyclic quotient kernels, and there is no simple quotient of the whole product. All series aretogether withTo verify exhaustiveness, has maximal normal subgroups and , and has and . A quotient of a direct product can receive a nontrivial image from only one simple factor, since the images commute and has trivial group center. The remaining maximal-normal possibility is . Its derived subgroup is , because both alternating factors are perfect. A hypothetical quotient would project one alternating factor isomorphically and kill the other, but conjugation by an odd diagonal element induces an outer automorphism on that surviving factor, impossible inside . Odd conjugation is outer because otherwise an odd permutation times an even one would centralize ; a permutation commuting with every three-cycle fixes every three-element support and is the identity. Thus is the only maximal normal subgroup of . Finally the only maximal normal subgroups of are : normal subgroups of a product of two centerless simple groups are products of the factors, as follows by commutating with each factor. This proves exactly eight series and the classification of composition chains in products with S5.
For , commuting with both elementary upper and lower transvections forces a central matrix to be scalar. A scalar has determinant , soIf , characteristic five makes diagonalizable with eigenvalues in . Determinant one rules out one of each, so the unique nonidentity involution is . An index-two subgroup would have order and, by the Cauchy theorem for groups, contain that involution and hence the group center. Its image in would have index two. The simplicity and identification are established by the independent matrix argument in Solution 4; a simple group has no proper index-two subgroup. Therefore has no subgroup of index two.
Past exam of the mathematics course of the University of Cambridge 2018 ia Paper 3 6D Solution Created 2026-09-24 Updated 2026-10-03
For fixed , conjugation preserves multiplication:and its inverse is . It is therefore a group automorphism. Furthermore,so is a homomorphism . Its kernel consists of elements commuting with every , hence
If is cyclic, every automorphism has the form . Two such maps commute because , so is abelian. The conclusion fails for general abelian groups: for , its three nonidentity elements may be permuted arbitrarily, givingwhich is nonabelian.

