English
Noun
- An isomorphism
of a mathematical
object or system of objects onto itself.
Translations
an isomorphism of a mathematical object or
system of objects onto itself
- Croatian: automorfizam
- Swedish: automorfi, automorfism
In
mathematics, an automorphism
is an
isomorphism
from a mathematical object to itself. It is, in some sense, a
symmetry of the object,
and a way of
mapping
the object to itself while preserving all of its structure. The set
of all automorphisms of an object forms a
group,
called the automorphism group. It is, loosely speaking, the
symmetry
group of the object.
Definition
The exact definition of an automorphism depends
on the type of "mathematical object" in question and what,
precisely, constitutes an "isomorphism" of that object. The most
general setting in which these words have meaning is an abstract
branch of mathematics called
category
theory. Category theory deals with abstract objects and
morphisms between those
objects.
In category theory, an automorphism is an
endomorphism (i.e.
a
morphism from an
object to itself) which is also an
isomorphism (in the categorical sense of the word).
This is a very abstract definition since, in
category theory, morphisms aren't necessarily functions and objects
aren't necessarily sets. In most concrete settings, however, the
objects will be sets with some additional structure and the
morphisms will be functions preserving that structure.
In the context of
abstract
algebra, for example, a mathematical object is an
algebraic
structure such as a
group,
ring,
or
vector
space. An isomorphism is simply a
bijective homomorphism. (Of course,
the definition of a homomorphism depends on the type of algebraic
structure; see, for example:
group
homomorphism,
ring
homomorphism, and
linear
operator).
The
identity
morphism (
identity
mapping) is called the trivial automorphism in some contexts.
Respectively, other (non-identity) automorphisms are called
nontrivial automorphisms.
Automorphism group
If the automorphisms of an object X form
a set (instead of a proper
class),
then they form a
group
under
composition
of
morphisms. This
group is called the automorphism group of X. That this is indeed a
group is simple to see:
- Closure:
composition of two endomorphisms is another endomorphism.
- Associativity:
composition of functions is always associative.
- Identity:
the identity is the identity morphism from an object to itself
which exists by definition.
- Inverses:
by definition every isomorphism has an inverse which is also an
isomorphism, and since the inverse is also an endomorphism of the
same object it is an automorphism.
The automorphism group of an object X in a
category C is denoted AutC(X), or simply Aut(X) if the category is
clear from context.
- In elementary
arithmetic, the set of integers, Z, considered as a
group under addition, has a unique nontrivial automorphism:
negation. Considered as a ring,
however, it has only the trivial automorphism. Generally speaking,
negation is an automorphism of any abelian
group, but not of a ring or field.
- A group automorphism is a group
isomorphism from a group to itself. Informally, it is a
permutation of the group elements such that the structure remains
unchanged. For every group G there is a natural group homomorphism
G → Aut(G) whose image
is the group Inn(G) of inner
automorphisms and whose kernel
is the center
of G. Thus, if G has trivial
center it can be embedded into its own automorphism
group.
- In graph theory
an automorphism
of a graph is a permutation of the nodes that preserves edges
and non-edges. In particular, if two nodes are joined by an edge,
so are their images under the permutation.
- In topology, morphisms between topological spaces are called
continuous maps, and an automorphism of a topological space is
a homeomorphism of
the space to itself, or self-homeomorphism. In this example it is
not sufficient for a morphism to be bijective in order to be an
isomorphism.
- An automorphism of a differentiable manifold M is a diffeomorphism from M to
itself. The automorphism group is sometimes denoted
Diff(M).
Inner and outer automorphisms
In some categories—notably
groups,
rings,
and
Lie
algebras—it is possible to separate automorphisms
into two types, called "inner" and "outer" automorphisms.
In the case of groups, the
inner
automorphisms are the conjugations by the elements of the group
itself. For each element a of a group G, conjugation by a is the
operation φa : G → G given by φa(g) =
aga−1 (or a−1ga; usage varies). One can easily
check that conjugation by a is a group automorphism. The inner
automorphisms form a
normal
subgroup of Aut(G), denoted by Inn(G); this is called
Goursat's
lemma.
The other automorphisms are called
outer
automorphisms. The
quotient
group Aut(G) / Inn(G) is usually denoted by
Out(G); the non-trivial elements are the cosets that contain the
outer automorphisms.
The same definition holds in any
unital ring
or
algebra
where a is any
invertible
element. For
Lie algebras
the definition is slightly different.
References
External links
automorphism in Catalan: Automorfisme
automorphism in Danish: Automorfi
automorphism in German: Automorphismus
automorphism in Spanish: Automorfismo
automorphism in French: Automorphisme
automorphism in Italian: Automorfismo
automorphism in Dutch: Automorfisme
automorphism in Polish: Automorfizm
automorphism in Portuguese: Automorfismo
automorphism in Russian: Автоморфизм
automorphism in Serbian:
Аутоморфизам