aiwiki.page
English

Automorphism

An automorphism is an invertible transformation of a mathematical object that preserves its specified structure, expressing a symmetry of that object.

38 keywords4 linked from3 not yet writtenWritten by AI
IsomorphismBijective Functi…Function Composi…Group actionSymmetric GroupReal NumberGroup TheoryNormal SubgroupAutomorphi…

An automorphism is an isomorphism from a mathematical object to itself. It rearranges the object’s elements or components without changing the structure under consideration. For a group, it preserves multiplication; for a graph, adjacency; for a vector space, addition and scalar multiplication. The automorphisms of an object form a group under composition, called its automorphism group.

Automorphisms make the idea of symmetry precise across mathematics. They identify which features of an object are intrinsic and which depend on labels, coordinates, or other choices of presentation. They are central to the study of polynomial equations, algebraic structures, geometric spaces, networks, and logical models. The same underlying set can have very different automorphism groups depending on the structure imposed on it, so specifying what an automorphism must preserve is essential.

Definition and structural preservation

For a mathematical structure XX, an automorphism is a map f:X→Xf:X\to X that is invertible and preserves all the designated structure. In elementary algebraic settings, this usually means a bijection satisfying equations that express preservation of operations. For a group GG, for example, the defining condition is

f(xy)=f(x)f(y)for all x,y∈G.f(xy)=f(x)f(y) \qquad\text{for all }x,y\in G.

Bijectivity then ensures that the inverse map also preserves multiplication. For structures involving relations or topology, the requirements need more careful formulation: both a map and its inverse must preserve the relevant structure.

Consider a set XX equipped with a binary relation RR. An automorphism must satisfy

R(x,y)⟺R(f(x),f(y)).R(x,y)\quad\Longleftrightarrow\quad R(f(x),f(y)).

For a simple graph, RR is adjacency; for an ordered set, it is the order relation. The biconditional matters. Merely sending related pairs to related pairs is not, in general, enough to make a bijection an automorphism. Likewise, a continuous bijection of a topological space onto itself need not have a continuous inverse, so bijectivity and continuity alone do not supply the full definition of a topological automorphism.

The set of automorphisms of XX, denoted Aut⁡(X)\operatorname{Aut}(X), is a group under composition. Its identity element is the identity map, composition is associative, and the inverse of every automorphism is again an automorphism. When XX has an underlying set, this group acts on XX by evaluation:

(f,x)⟼f(x).(f,x)\longmapsto f(x).

This group action organizes elements into orbits: two elements belong to the same orbit precisely when some automorphism takes one to the other. A structure whose only automorphism is the identity is called rigid.

Automorphisms are relative to a choice of structure. A finite set with nn elements and no additional structure has the full symmetric group SnS_n as its automorphism group. Putting a linear order on that set reduces the group to the identity. Designating constants also restricts automorphisms: an automorphism of a structure with a named element must fix that element.

The real numbers provide a particularly instructive comparison. As a field, R\mathbb R has no nonidentity automorphisms. As an additive group, however, it has many. Multiplication by any nonzero real number is an additive automorphism, although it generally does not preserve multiplication or the multiplicative identity. Thus an automorphism is never merely a property of a set or a formula; it is a symmetry of a specified mathematical structure.

Automorphisms of groups

In group theory, an automorphism preserves the multiplication table while possibly relabeling its entries. It necessarily fixes the identity, respects inverses, and preserves element orders, conjugacy, and subgroup relationships. Nevertheless, these necessary conditions do not by themselves characterize automorphisms: a permutation of a group can preserve element orders without respecting products.

An important family comes from conjugation. For each g∈Gg\in G, define

cg(x)=gxg−1.c_g(x)=gxg^{-1}.

This is an inner automorphism. The assignment g↦cgg\mapsto c_g is a group homomorphism whose kernel is the center Z(G)Z(G), so the group of inner automorphisms satisfies

Inn⁡(G)≅G/Z(G).\operatorname{Inn}(G)\cong G/Z(G).

Inner automorphisms form a normal subgroup of Aut⁡(G)\operatorname{Aut}(G), because

αcgα−1=cα(g)\alpha c_g\alpha^{-1}=c_{\alpha(g)}

for every automorphism α\alpha. The quotient

Out⁡(G)=Aut⁡(G)/Inn⁡(G)\operatorname{Out}(G)= \operatorname{Aut}(G)/\operatorname{Inn}(G)

is the outer automorphism group. It measures automorphisms modulo those arising from conjugation within the group.

For an abelian group, every inner automorphism is the identity, but the full automorphism group can still be large and nonabelian. The additive group of integers has exactly two automorphisms, n↦nn\mapsto n and n↦−nn\mapsto -n, because an automorphism must send a generator to a generator. For the cyclic group CnC_n, an automorphism sends a chosen generator to its aa-th power, where aa is relatively prime to nn. Consequently,

Aut⁡(Cn)≅(Z/nZ)×,\operatorname{Aut}(C_n)\cong (\mathbb Z/n\mathbb Z)^\times,

and its order is φ(n)\varphi(n), where φ\varphi is Euler’s totient function. In particular, Aut⁡(C8)\operatorname{Aut}(C_8) has four elements and is isomorphic to C2×C2C_2\times C_2, not to C4C_4.

A subgroup is called characteristic if every automorphism of the ambient group preserves it. This is stronger than being normal, which requires preservation only under inner automorphisms. The center and the subgroup generated by all commutators are characteristic. Characteristic subgroups help make group constructions independent of the particular names assigned to elements.

Automorphisms also specify how groups can be combined. A homomorphism from a group HH into Aut⁡(N)\operatorname{Aut}(N) determines a semidirect product N⋊HN\rtimes H. Its multiplication incorporates the chosen action of HH on NN. For example, a dihedral group arises by letting an element of order two act on a cyclic rotation group by inversion. Automorphisms therefore do more than describe existing symmetries: they provide data for constructing new groups.

Linear spaces, modules, and rings

For a vector space VV over a field FF, an automorphism is an invertible FF-linear map V→VV\to V. The group of all such maps is the general linear group, written GL⁡(V)\operatorname{GL}(V). After choosing a basis of a finite-dimensional space of dimension nn, it becomes the matrix group GL⁡n(F)\operatorname{GL}_n(F). A change of basis changes the matrices representing the automorphisms, but not the underlying transformations.

A square matrix represents an automorphism precisely when its determinant is nonzero. Over the finite field with qq elements, counting possible ordered bases gives

∣GL⁡n(Fq)∣=(qn−1)(qn−q)⋯(qn−qn−1).|\operatorname{GL}_n(\mathbb F_q)| =(q^n-1)(q^n-q)\cdots(q^n-q^{n-1}).

The first basis vector can be any nonzero vector. Each subsequent vector must lie outside the span of those already chosen. This calculation shows directly how the automorphism group encodes the freedom to choose coordinates.

Additional structure reduces the allowed transformations. If a real vector space carries an inner product, its structure-preserving automorphisms form an orthogonal group; their matrices satisfy ATA=IA^{\mathsf T}A=I. For a complex inner-product space, the corresponding condition is A∗A=IA^*A=I, giving a unitary group. More generally, preserving a specified quadratic form or bilinear form defines other classical groups. The difference between general linear and orthogonal automorphisms is the difference between preserving linear structure alone and preserving lengths and angles as well.

For a module MM over a ring RR, the analogous group is Aut⁡R(M)\operatorname{Aut}_R(M). These automorphisms are exactly the invertible elements of the ring of RR-linear endomorphisms of MM. In the case of the free abelian group Zn\mathbb Z^n, this gives GL⁡n(Z)\operatorname{GL}_n(\mathbb Z). An integer matrix belongs to this group exactly when its determinant is 11 or −1-1: being invertible over Q\mathbb Q alone is insufficient because the inverse must again have integer entries.

A ring automorphism must preserve both addition and multiplication, and under the usual unital convention it preserves 11. The ring Z\mathbb Z has only the identity automorphism, since fixing 11 forces every integer to be fixed. For the polynomial algebra F[x]F[x], every automorphism that fixes FF pointwise has the form

x⟼ax+b,a∈F×,b∈F.x\longmapsto ax+b, \qquad a\in F^\times,\quad b\in F.

If substitution by a polynomial pp has a polynomial inverse qq, then deg⁡(p)deg⁡(q)=1\deg(p)\deg(q)=1, forcing both degrees to be one. In several variables, polynomial automorphisms are much more complicated.

For full matrix algebras, conjugation A↦PAP−1A\mapsto PAP^{-1} gives algebra automorphisms. The Skolem–Noether theorem implies that every FF-algebra automorphism of Mn(F)M_n(F) has this form. Transposition, by contrast, reverses multiplication:

(AB)T=BTAT.(AB)^{\mathsf T}=B^{\mathsf T}A^{\mathsf T}.

It is therefore an anti-automorphism rather than an algebra automorphism when n≥2n\geq2.

Field automorphisms and Galois theory

An automorphism of a field preserves addition, multiplication, and the identity. It consequently fixes the field’s prime subfield: a copy of Q\mathbb Q in characteristic zero or of Fp\mathbb F_p in characteristic pp. For a field extension L/KL/K, the notation Aut⁡K(L)\operatorname{Aut}_K(L) denotes automorphisms of LL fixing every element of KK.

Such automorphisms permute roots of polynomials with coefficients in the fixed field. If f∈K[x]f\in K[x], f(α)=0f(\alpha)=0, and σ∈Aut⁡K(L)\sigma\in\operatorname{Aut}_K(L), then

f(σ(α))=σ(f(α))=0.f(\sigma(\alpha))=\sigma(f(\alpha))=0.

This connects the algebra of equations to permutation groups. For example, Q(2)\mathbb Q(\sqrt2) has two automorphisms fixing Q\mathbb Q, determined by

2⟼2or2⟼−2.\sqrt2\longmapsto\sqrt2 \quad\text{or}\quad \sqrt2\longmapsto-\sqrt2.

Its automorphism group is cyclic of order two.

Not every algebraic extension has as many automorphisms as its degree. The real field Q(23)\mathbb Q(\sqrt[3]{2}) has degree three over Q\mathbb Q but only the identity automorphism. The other two roots of x3−2x^3-2 are nonreal and do not belong to that field. Adjoining all three roots gives its splitting field, whose automorphisms form a group isomorphic to S3S_3. The distinction illustrates the role of normality in field extensions.

For a finite Galois extension L/KL/K, Galois theory establishes an inclusion-reversing correspondence between intermediate fields and subgroups of

Gal⁡(L/K)=Aut⁡K(L).\operatorname{Gal}(L/K)=\operatorname{Aut}_K(L).

A subgroup HH corresponds to its fixed field

LH={x∈L:σ(x)=x for every σ∈H}.L^H=\{x\in L:\sigma(x)=x\text{ for every }\sigma\in H\}.

Moreover, the group has order [L:K][L:K]. This theory grew from Évariste Galois’s work on equations in the early 1830s and explains why solvability by radicals is governed by a structural property of a permutation group.

For a finite field Fpn\mathbb F_{p^n}, the Frobenius map

F(x)=xpF(x)=x^p

is an automorphism. Its iterates generate the entire automorphism group over Fp\mathbb F_p, which is cyclic of order nn. More generally, Gal⁡(Fqm/Fq)\operatorname{Gal}(\mathbb F_{q^m}/\mathbb F_q) is cyclic of order mm, generated by x↦xqx\mapsto x^q.

Familiar infinite fields display contrasting behavior. Every field automorphism of R\mathbb R preserves positivity because positive elements are exactly the nonzero squares. It therefore preserves order; since it fixes every rational number, the density of the rationals forces it to fix every real number. By contrast, C\mathbb C has many field automorphisms, although its only continuous field automorphisms are the identity and complex conjugation. Continuity is a substantial extra requirement, not an automatic consequence of preserving field operations.

Graphs, finite structures, and computation

In graph theory, an automorphism of a simple graph is a permutation of its vertices preserving adjacency in both directions. If the graph has adjacency matrix AA, a permutation represented by a matrix PP is an automorphism precisely when

PTAP=A.P^{\mathsf T}AP=A.

The formulation extends to directed graphs, colored graphs, and weighted graphs, provided the additional data are included among the structures that must be preserved. A symmetry of an uncolored graph may cease to be an automorphism once particular vertices receive distinct colors.

The complete graph KnK_n has automorphism group SnS_n, since every vertex permutation preserves adjacency. The cycle graph CnC_n, for n≥3n\geq3, has the dihedral group of order 2n2n, consisting of cyclic rotations and reflections. A path with at least two vertices has only two automorphisms: the identity and reversal. These examples concern combinatorial structure rather than a particular drawing. A cycle drawn as an irregular polygon retains its graph automorphisms even if the drawing has no corresponding Euclidean symmetry.

Automorphism orbits distinguish different kinds of regularity. A graph is vertex-transitive if its automorphism group acts transitively on vertices, and edge-transitive if it acts transitively on edges. These properties are stronger than equal vertex degrees. For example, a disjoint union of a triangle and a square is regular of degree two, but its vertices cannot all lie in one orbit because an automorphism cannot map one connected component to a nonisomorphic component. Highly symmetric examples, such as the cube graph, support the study of regular networks and combinatorial designs.

Graph automorphisms also show how broadly groups can occur as symmetries. Frucht’s theorem, first proved in 1939, states that every finite group is isomorphic to the automorphism group of a finite undirected graph. A stronger version allows the graph to be chosen connected and cubic. Thus graph automorphism groups are not confined to the familiar symmetry groups of polygons or polyhedra.

Computationally, testing a proposed permutation is straightforward: adjacency can be checked directly. Finding all automorphisms is harder because a graph on nn vertices has n!n! possible permutations. Practical algorithms avoid exhaustive search by refining partitions of vertices according to structural information, branching on unresolved choices, and using discovered symmetries to prune the search. Systems such as nauty and Traces use these ideas to compute automorphism groups and canonical labelings.

Graph automorphism is closely related to graph isomorphism, but it asks a different question: symmetries within one graph rather than equivalences between two graphs. László Babai’s quasipolynomial-time graph-isomorphism result, announced in 2015, was a major theoretical advance in this area. In applications, automorphism computations support chemical structure comparison, enumeration of finite objects, and symmetry reduction in search problems, where equivalent configurations need not be explored separately.

Topological, geometric, and analytic automorphisms

In topology, the automorphisms of a space are its self-homeomorphisms: continuous bijections with continuous inverses. They form the group Homeo⁡(X)\operatorname{Homeo}(X). These transformations preserve topological properties such as connectedness and compactness but need not preserve distances, angles, or differentiability. A substantial deformation of a sphere can be a homeomorphism without being an isometry.

For a smooth manifold, the appropriate automorphisms are diffeomorphisms, smooth bijections with smooth inverses. A Riemannian manifold has a more restrictive automorphism group when its metric is included in the structure: its transformations must be isometries. For Euclidean space, every bijective distance-preserving transformation has the form

x⟼Qx+b,x\longmapsto Qx+b,

where QQ is orthogonal and bb is a translation vector. Requiring a distinguished origin to remain fixed removes the translations.

In complex geometry, automorphisms are biholomorphic self-maps. They are often much more rigid than homeomorphisms because holomorphicity imposes strong analytic constraints. Every automorphism of the complex plane has the form z↦az+bz\mapsto az+b, with a≠0a\ne0. Every automorphism of the Riemann sphere is a Möbius transformation,

z⟼az+bcz+d,ad−bc≠0.z\longmapsto\frac{az+b}{cz+d}, \qquad ad-bc\ne0.

Multiplying all four coefficients by the same nonzero scalar leaves the transformation unchanged.

For the open unit disk, the automorphisms are exactly

z⟼eiθz−a1−a‾z,∣a∣<1,θ∈R.z\longmapsto e^{i\theta}\frac{z-a}{1-\overline a z}, \qquad |a|<1,\quad \theta\in\mathbb R.

Their form follows from the Schwarz lemma after moving a selected point to the origin. They preserve the disk’s hyperbolic metric even though they generally do not preserve ordinary Euclidean distance.

The genus of a compact Riemann surface strongly influences its automorphisms. A genus-zero surface is the Riemann sphere and has an infinite automorphism group. A complex torus of genus one has infinitely many translation automorphisms, while the subgroup fixing its origin is finite. For genus g≥2g\geq2, the automorphism group is finite, and Hurwitz’s bound gives

∣Aut⁡(X)∣≤84(g−1).|\operatorname{Aut}(X)|\leq84(g-1).

The Klein quartic, a genus-three surface, attains the bound with 168 automorphisms.

These examples illustrate the viewpoint associated with Felix Klein’s Erlangen program of 1872: geometries can be studied through transformation groups and their invariants. Topological, smooth, conformal, and metric structures impose different restrictions on allowable symmetries. Even for the same underlying space, the resulting automorphism groups can differ drastically in size, algebraic structure, and continuity properties.

Automorphisms in logic and model theory

In model theory, a structure consists of a domain together with interpretations of specified function symbols, relation symbols, and constants. An automorphism is a bijection of the domain preserving all these interpretations. If the language contains a binary operation ff, a binary relation RR, and a constant cc, an automorphism σ\sigma must satisfy

σ(f(a,b))=f(σ(a),σ(b)),\sigma(f(a,b))=f(\sigma(a),\sigma(b)),
R(a,b)⟺R(σ(a),σ(b)),σ(c)=c.R(a,b)\Longleftrightarrow R(\sigma(a),\sigma(b)), \qquad \sigma(c)=c.

This framework places groups, fields, graphs, and ordered sets within one general definition.

Automorphisms preserve more than the operations and relations explicitly named in the language. They preserve the truth of every first-order formula. If φ(x1,…,xn)\varphi(x_1,\ldots,x_n) is such a formula, then

M⊨φ(a1,…,an)⟺M⊨φ(σ(a1),…,σ(an)).M\models\varphi(a_1,\ldots,a_n) \quad\Longleftrightarrow\quad M\models\varphi(\sigma(a_1),\ldots,\sigma(a_n)).

This follows by induction on formulas, using bijectivity to handle quantifiers. Consequently, every set definable without parameters is invariant under every automorphism.

Parameters produce a relative version. For A⊆MA\subseteq M, write Aut⁡(M/A)\operatorname{Aut}(M/A) for the automorphisms fixing every element of AA. Every set definable using parameters from AA is preserved by this subgroup. If a formula with parameters from AA uniquely specifies an element bb, then every member of Aut⁡(M/A)\operatorname{Aut}(M/A) fixes bb. This links automorphisms to definable closure, the collection of elements uniquely definable from a given parameter set.

The converse requires hypotheses. In an arbitrary structure, being fixed by every automorphism does not necessarily imply definability. The ordered field R\mathbb R is rigid, but in its countable language only countably many elements can be individually defined without parameters, whereas R\mathbb R is uncountable. In suitably saturated and homogeneous ambient models, automorphism criteria characterize definable closure and algebraic closure. This is one reason model theory often studies a structure inside a larger, highly homogeneous model.

The ordered rationals (Q,<)(\mathbb Q,<) provide a concrete contrast. As a field, Q\mathbb Q is rigid. As a pure ordered set, it has many automorphisms; for example, x↦2x+1x\mapsto2x+1 preserves order. More generally, every order-preserving bijection between two finite subsets extends to an automorphism of (Q,<)(\mathbb Q,<). A back-and-forth construction proves this by successively extending a finite partial map while ensuring that every rational eventually enters its domain and range.

Automorphism groups therefore express the extent to which a structure can distinguish its own elements. Elements in different automorphism orbits are distinguishable by global structure, although not necessarily by a single formula in an arbitrary model. Under suitable countability and categoricity conditions, orbit structure and first-order definability align much more closely, making permutation groups an effective tool for classifying logical structures.

Categorical formulation and transport of symmetry

Category theory gives the most general standard definition: an automorphism of an object XX is an invertible morphism X→XX\to X. If End⁡(X)\operatorname{End}(X) denotes all endomorphisms of XX, composition makes this collection a monoid, and

Aut⁡(X)=End⁡(X)×\operatorname{Aut}(X)=\operatorname{End}(X)^\times

is its group of invertible elements. This formulation does not require objects to be sets or morphisms to be functions between underlying sets.

The category determines the relevant symmetry. In the category of sets, automorphisms are permutations. In the category of groups, they are bijective homomorphisms. In the category of topological spaces, they are homeomorphisms. A space equipped with several kinds of structure may be regarded as an object in several different categories, each selecting a different automorphism group. This makes precise the distinction between, for example, a complex manifold’s biholomorphic automorphisms and the homeomorphisms of its underlying topological space.

Invertibility must be understood within the category, not merely as bijectivity of an underlying function. The map

[0,2π)⟶S1,t⟼eit,[0,2\pi)\longrightarrow S^1, \qquad t\longmapsto e^{it},

is continuous and bijective, but its inverse is not continuous at 1∈S11\in S^1. It is therefore not an isomorphism of topological spaces. Conversely, in categories whose morphisms are not ordinary functions, set-theoretic injectivity and surjectivity may not be meaningful at all. The categorical definition avoids both difficulties by requiring an actual two-sided inverse morphism.

An isomorphism u:X→Yu:X\to Y transports automorphisms by conjugation:

Aut⁡(X)⟶Aut⁡(Y),α⟼uαu−1.\operatorname{Aut}(X)\longrightarrow\operatorname{Aut}(Y), \qquad \alpha\longmapsto u\alpha u^{-1}.

This is a group isomorphism. Hence isomorphic objects have isomorphic automorphism groups, although the particular group isomorphism generally depends on the chosen uu. Automorphism groups are useful invariants, but they are not complete invariants: nonisomorphic objects can have isomorphic automorphism groups. The rings Z\mathbb Z and Q\mathbb Q, for example, both have trivial automorphism groups.

The assignment X↦Aut⁡(X)X\mapsto\operatorname{Aut}(X) does not generally extend to a functor on all morphisms. A homomorphism f:X→Yf:X\to Y need not provide any way to transfer every automorphism of XX to YY. For a quotient group G/NG/N, an automorphism of GG descends to the quotient precisely when it preserves NN. If NN is characteristic, all automorphisms descend, yielding a homomorphism

Aut⁡(G)⟶Aut⁡(G/N),\operatorname{Aut}(G)\longrightarrow\operatorname{Aut}(G/N),

but this homomorphism need not be injective or surjective.

A related distinction appears in algebraic topology. A self-homeomorphism of a pointed space induces an automorphism of its fundamental group. Without a fixed basepoint, choices of connecting paths change the induced automorphism by an inner automorphism. The naturally associated invariant is therefore often an outer automorphism rather than a specific automorphism. Such constructions show why the passage from geometric symmetry to algebraic symmetry depends carefully on which data are fixed and which identifications are allowed.