Automorphism Group

The group obtained by collecting every structure-preserving self-isomorphism of a fixed mathematical object and using composition as the group operation.

Version

v3 · 2026-09-19 · History

Domain-specific #

1323

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomains

Abstract Algebra, Automorphism Groups → Mathematics

Aliases

Group of automorphisms, Full automorphism group

Core Idea

The automorphism group of a mathematical object \(X\), written \(\operatorname{Aut}(X)\) or more explicitly \(\operatorname{Aut}_{\mathcal C}(X)\), collects all isomorphisms from \(X\) to itself and equips them with composition. The subscript matters conceptually: the ambient category or declared structure determines which self-maps count as morphisms and therefore which invertible self-maps count as automorphisms. The Stacks Project gives the categorical definition directly: the invertible elements of \(\operatorname{Mor}_{\mathcal C}(X,X)\) form a group under composition.

How would you explain it like I'm…

The Same-Looking Moves Club

A square can be turned a quarter turn, or flipped over, and it still looks exactly the same. If you collect every move like that, including 'do nothing,' you get a little club of moves. Doing one move and then another is always another move in the club, and every move can be undone. That club is the square's automorphism group.

All the Symmetries of a Thing

An automorphism is a way of rearranging a thing so that all its important structure stays the same, like turning a square a quarter turn so it still fits its outline. The automorphism group collects every such rearrangement for one object. It's not just a list: you can combine moves by doing one after another, doing nothing counts as a move, and every move can be undone. What counts as 'structure' depends on what you decide the object is: a square drawn on paper and a square treated just as four dots might have different collections of moves.

Group of Self-Isomorphisms

The automorphism group Aut(X) of a mathematical object X is the set of all isomorphisms from X to itself — invertible, structure-preserving self-maps — with composition as the operation. It really is a group: composing two automorphisms gives another, composition is associative, the identity map is the neutral element, and every automorphism's inverse is also an automorphism. Which maps count depends on the structure you declare: the automorphisms of a set are all its permutations, but the automorphisms of a graph must also preserve which vertices are connected. So Aut(X) is not just a list of symmetries; it packages all the self-symmetry of X into one group you can compare, compute with, and use as an invariant. Any action of a group on X by structure-preserving transformations can be described as a homomorphism into Aut(X).

 

The automorphism group Aut(X), or more precisely Aut_C(X), of an object X in a category C is the set of isomorphisms from X to itself under composition. The category, or declared structure, determines which self-maps are morphisms and hence which invertible self-maps count as automorphisms. Formally, Aut_C(X) consists of those f ∈ Mor_C(X, X) for which there is g: X → X with f∘g = id_X = g∘f. It is a group: composites of invertible structure-preserving maps are again such maps (closure), composition is associative, id_X is the identity, and the inverse morphism serves as the group inverse; for algebraic systems this amounts to preservation of operations and relations under composition and inversion. Crucially, it is a construction rather than a mere plural of 'automorphism': it packages the complete self-symmetry of X into a group that can be compared, represented, computed, quotiented, and used as an invariant. It also serves as a universal receptacle for actions: an action of a group G on X by structure-preserving transformations is exactly a homomorphism G → Aut(X).

Scope of Application

The construction recurs wherever mathematical objects and isomorphisms are defined. In abstract algebra, it applies to groups, rings, fields, modules, algebras, lattices, and relational structures. In linear algebra, \(\operatorname{Aut}(V)\) for a vector space is the general linear group of invertible linear operators. In field theory, automorphisms that fix a base field form the group central to Galois theory. In graph theory, graph automorphisms are vertex permutations preserving adjacency and any declared direction or labels; the full set forms a permutation group.

Clarity

Use a four-question diagnostic:

1. What is the object? Name \(X\), not merely its underlying set.
2. Which structure must maps preserve? This determines the category and endomorphisms.
3. Are all eligible invertible self-maps included? If only a chosen subset is used, it may be an automorphism subgroup rather than the full group.
4. Is composition the operation? If transformations are combined by another operation, the construction has changed.

Manages Complexity

A structured object may admit many equivalent presentations. Automorphism groups compress all reversible self-representations into one algebraic object. Instead of checking pairwise how transformations combine, one can use generators, relations, subgroups, conjugacy classes, orbits, and stabilizers. Large collections of apparently unrelated relabelings become a group action with reusable theorems.

Abstract Reasoning

1. If \(f,g\in\operatorname{Aut}(X)\), then \(f\circ g\) is an automorphism because \(g^{-1}\circ f^{-1}\) is its inverse and composition preserves the same morphism class.
2. If a self-map preserves the declared structure but lacks a two-sided inverse in the category, it belongs to \(\operatorname{End}(X)\) but not \(\operatorname{Aut}(X)\). 3.

Knowledge Transfer

Exact transfer occurs across mathematical categories. Replace “preserves multiplication” with “preserves addition and scalar multiplication,” “preserves adjacency,” “is continuous with continuous inverse,” or another categorical morphism condition. The proof that invertible endomorphisms form a group transfers unchanged because it uses only identity, associative composition, and inverse morphisms.

The automorphism group also transfers information among equivalent presentations. A basis identifies \(\operatorname{Aut}(V)\) with a matrix general linear group; a vertex enumeration represents a graph automorphism group as a permutation group; generators and relations can represent a group automorphism group computationally.

Relationships to Other Abstractions

Current abstraction Automorphism Group Domain-specific

Parents (1) — outgoing typed relations

• Automorphism Group is a kind of Group Prime

  Group is the broader abstraction this entry instantiates.

Hierarchy paths (5) — routes to 5 parentless roots

• Automorphism Group → is a kind of Group → is a kind of Monoid → is a kind of Semigroup → is a kind of Set and Membership

Show alternative paths (4)

Neighborhood in Abstraction Space

Automorphism Group sits in a sparse region of the domain-specific corpus (78^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

• Moduli Space — 0.83
• Invariant Sigma-Algebra — 0.83
• Initial and terminal objects — 0.82
• Symmetric group — 0.82
• Schröder–Bernstein Property — 0.82

Computed from structural-signature embeddings · 2026-10-25