Product Code Database
Example Keywords: raincoat -trousers $50
barcode-scavenger
   » » Wiki: Automorphism
Tag Wiki 'Automorphism'.
Tag

In , an automorphism is an from a mathematical object to itself. It is, in some sense, a 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 of the object.


Definition
In an algebraic structure such as a group, a ring, or , an automorphism is simply a of an object into itself. (The definition of a homomorphism depends on the type of algebraic structure; see, for example, group homomorphism, ring homomorphism, and .)

More generally, for an object in some category, an automorphism is a morphism of the object to itself that has an inverse morphism; that is, a morphism f: X\to X is an automorphism if there is a morphism g: X\to X such that g\circ f= f\circ g = \operatorname {id}_X, where \operatorname {id}_X is the identity morphism of . For algebraic structures, the two definitions are equivalent; in this case, the identity morphism is simply the identity function, and is often called the trivial automorphism.


Automorphism group
The automorphisms of an object form a group under composition of , which is called the automorphism group of . This results straightforwardly from the definition of a category.

The automorphism group of an object in a category is often denoted , or simply Aut( X) if the category is clear from context.


Examples
  • In , an arbitrary of the elements of a set X is an automorphism. The automorphism group of X is also called the symmetric group on X.
  • In elementary arithmetic, the set of , , 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 , 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 center it can be embedded into its own automorphism group.
    (2025). 9783540679950, Springer.
  • In , an endomorphism of a V is a linear operator VV. An automorphism is an invertible linear operator on V. When the vector space is finite-dimensional, the automorphism group of V is the same as the general linear group, GL( V). (The algebraic structure of all endomorphisms of V is itself an algebra over the same base field as V, whose invertible elements precisely consist of GL( V).)
  • A field automorphism is a ring homomorphism from a field to itself.
    • The field \Q of the has no other automorphism than the identity, since an automorphism must fix the additive identity and the multiplicative identity ; the sum of a finite number of must be fixed, as well as the additive inverses of these sums (that is, the automorphism fixes all ); finally, since every rational number is the quotient of two integers, all rational numbers must be fixed by any automorphism.
    • The field \R of the has no automorphisms other than the identity. Indeed, the rational numbers must be fixed by every automorphism, per above; an automorphism must preserve inequalities since x is equivalent to \exists z\mid y-x=z^2, and the latter property is preserved by every automorphism; finally every real number must be fixed since it is the least upper bound of a sequence of rational numbers.
    • The field \Complex of the has a unique nontrivial automorphism that fixes the real numbers. It is the complex conjugation, which maps i to -i. The axiom of choice implies the existence of automorphisms that do not fix the real numbers.
    • The study of automorphisms of algebraic field extensions is the starting point and the main object of .
  • The automorphism group of the () as a ring are the inner automorphisms, by the Skolem–Noether theorem: maps of the form . This group is isomorphic to SO(3), the group of rotations in 3-dimensional space.
  • The automorphism group of the () is the exceptional G2.
  • In 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 , an automorphism may be called a motion of the space. Specialized terminology is also used:
    • In an automorphism is a self-. The automorphism group is also called the .
    • In the category of , an automorphism is a map (also called a ), from a surface to itself. For example, the automorphisms of the are Möbius transformations.
    • An automorphism of a differentiable M is a from M to itself. The automorphism group is sometimes denoted Diff( M).
    • In , morphisms between topological spaces are called continuous maps, and an automorphism of a topological space is a of the space to itself, or self-homeomorphism (see homeomorphism group). In this example it is not sufficient for a morphism to be bijective to be an isomorphism.


History
One of the earliest group automorphisms (automorphism of a group, not simply a group of automorphisms of points) was given by the Irish mathematician William Rowan Hamilton in 1856, in his , where he discovered an order two automorphism, writing:
so that \mu is a new fifth root of unity, connected with the former fifth root \lambda by relations of perfect reciprocity.


Inner and outer automorphisms
In some categories—notably groups, rings, and —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 given by (or a−1 ga; usage varies). One can easily check that conjugation by a is a group automorphism. The inner automorphisms form a of Aut( G), denoted by Inn( G); this is called Goursat's lemma.

The other automorphisms are called outer automorphisms. The is usually denoted by Out( G); the non-trivial elements are the that contain the outer automorphisms.

The same definition holds in any ring or algebra where a is any invertible element. For the definition is slightly different.


See also
  • Automorphism (in Sudoku puzzles)
  • Characteristic subgroup
  • Endomorphism ring
  • Frobenius automorphism
  • Order automorphism (in ).
  • Relation-preserving automorphism
  • Fractional Fourier transform


External links

Page 1 of 1
1
Page 1 of 1
1

Account

Social:
Pages:  ..   .. 
Items:  .. 

Navigation

General: Atom Feed Atom Feed  .. 
Help:  ..   .. 
Category:  ..   .. 
Media:  ..   .. 
Posts:  ..   ..   .. 

Statistics

Page:  .. 
Summary:  .. 
1 Tags
10/10 Page Rank
5 Page Refs