Inclusion maps tend to be homomorphisms of algebraic structures; thus, such inclusion maps are embeddings. More precisely, given a substructure closed under some operations, the inclusion map will be an embedding for tautological reasons. For example, for some binary operation to require that
is simply to say that is consistently computed in the sub-structure and the large structure. The case of a unary operation is similar; but one should also look at nullary operations, which pick out a constant element. Here the point is that closure means such constants must already be given in the substructure.
Identity function – In mathematics, a function that always returns the same value that was used as its argument
^MacLane, S.; Birkhoff, G. (1967). Algebra. Providence, RI: AMS Chelsea Publishing. p. 5. ISBN 0-8218-1646-2. Note that “insertion” is a function S → U and "inclusion" a relation S ⊂ U; every inclusion relation gives rise to an insertion function.