An endomorphism is a morphism : its source and target are the same object, with the same specified structure. For a group it is an operation-preserving group homomorphism back into that group; for a vector space it is a linear endomorphism; for a ring it is a ring endomorphism. A self-map must satisfy the chosen compatibility conditions to qualify. The notation records the category in which these conditions are imposed. See Riehl, Category Theory in Context, Definition 1.1.10 and the following paragraph.
An endomorphism can lose information or miss part of its target. On the additive integers, preserves addition and is injective, but is not surjective: no integer maps to . On the vector space over the real numbers, the linear endomorphism loses the second coordinate, so it is neither injective nor surjective. Neither is an automorphism. The same doubling rule becomes a group isomorphism when its target is the additive even integers, as explained under isomorphism.
The finite cyclic group offers a small example of information loss that can be drawn completely. With addition in modular arithmetic, the endomorphism sends the inputs to . Its image of a group homomorphism is and its kernel of a group homomorphism is . Each reached output has two inputs; the other three outputs are missed.
Figure 1.
Two endomorphisms of the additive cyclic group modulo six
. Every arrow maps an input to its output, rather than taking one step of repeated addition. The endomorphism collapses pairs; the group automorphism is a bijection. Orange marks the kernel of a group homomorphism in each panel. Source. Details.
For an endomorphism of a group or ring with a finite underlying set, injectivity is equivalent to surjectivity by counting; either condition makes it an automorphism. The additive integers example shows why the finiteness assumption matters. A linear endomorphism of a finite-dimensional vector space also has equivalent injectivity and surjectivity, this time by the rank-nullity theorem even when its underlying set is infinite.
Self-maps can be iterated without changing the object: , , and so on. Composition in a category and the identity morphism make the endomorphisms of a fixed object in a locally small category into a monoid. This packages repeated compatible operations, including irreversible ones, into a single structure.
The general language has a documented historical milestone in the 1945 paper of Samuel Eilenberg and Saunders Mac Lane. They defined categories of objects and compatible maps, and distinguished maps admitting inverses within that category. Their examples included groups, vector spaces, and topological spaces. This gave a common framework for compatible self-maps and their invertible cases. See Eilenberg and Mac Lane, General Theory of Natural Equivalences, pp. 234 and 237–239.
Every endomorphism of the additive finite cyclic group , for a positive integer , has the form , determined by . This is the self-map case of homomorphism from a finite cyclic group: repeated addition forces the value at every element. Conversely, each choice of respects addition and gives a well-defined map on congruence classes.
Let , the greatest common divisor. The image of a group homomorphism is the cyclic subgroup generated by , with size by order of an element of a finite cyclic group. The kernel of a group homomorphism is
Indeed, is equivalent to dividing , after cancelling and using coprimality. Consequently is a group automorphism exactly when and are coprime. In that case a modular inverse of gives . This connects reversible self-maps directly to the generators of a finite cyclic group.[ref]
A linear endomorphism is a linear map from a vector space to itself. In a finite-dimensional basis it is represented by a square matrix. It need not be invertible; an invertible linear endomorphism is an automorphism of the vector space.
Let be a singular endomorphism of a finite-dimensional vector space. Choose and a nonzero linear functional vanishing on , possible because that image of a linear map is proper. Then is a nonzero rank-one endomorphism with .

Ancestors (5)

  1. Morphism
  2. Algebra
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

In mathematics, an **endomorphism** is a type of morphism that maps a mathematical object to itself. More formally, if \( M \) is an object in some category (like a vector space, group, or topological space), an endomorphism is a morphism \( f: M \to M \).