 |
It has been suggested that this article or section be merged into endomorphism. (Discuss) |
In mathematics, an endofunction is a function whose codomain is a subset of its domain. A homomorphic endofunction is an endomorphism.
Let S be an arbitrary set. Among endofunctions on S one finds permutations of S and constant functions associating to each 
a given 
. Every permutation of S has the codomain equal to its domain and is bijective and invertible. A constant function on S, if S has more than 1 element, has a codomain that is a proper subset of its domain, is not bijective (and non invertible). The function associating to each natural integer n the floor of n/2 has its codomain equal to its domain and is not invertible.
Finite endofuctions are equivalent to monogeneous digraphs, i.e. digraphs having all nodes with outdegree equal to 1, and can be easily described.
Particular bijective endofunctions are the involutions, i.e. the functions coinciding with their inverses.
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
