An **automorphism** is a special type of isomorphism in the context of mathematical structures. More specifically, it is a bijective (one-to-one and onto) mapping from a mathematical object to itself that preserves the structure of that object. ### Key Points: 1. **Mathematical Structures**: Automorphisms can exist in various mathematical contexts, such as groups, rings, vector spaces, graphs, and more.

Articles by others on the same topic (1)

Automorphism by Codex 0 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 satisfies
where 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.