19,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
  • Broschiertes Buch

High Quality Content by WIKIPEDIA articles! Formally, if M is a set, the identity function f on M is defined to be that function with domain and codomain M which satisfies f(x) = x for all elements x in M. In other words, the function assigns to each element x of M the element x of M. The identity function f on M is often denoted by idM or 1M. In terms of set theory, where a function is defined as a particular kind of binary relation, the identity function is given by the identity relation, or diagonal of M. If f : M N is any function, then we have f o idM = f = idN o f (where "o" denotes…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
High Quality Content by WIKIPEDIA articles! Formally, if M is a set, the identity function f on M is defined to be that function with domain and codomain M which satisfies f(x) = x for all elements x in M. In other words, the function assigns to each element x of M the element x of M. The identity function f on M is often denoted by idM or 1M. In terms of set theory, where a function is defined as a particular kind of binary relation, the identity function is given by the identity relation, or diagonal of M. If f : M N is any function, then we have f o idM = f = idN o f (where "o" denotes function composition). In particular, idM is the identity element of the monoid of all functions from M to M. Since the identity element of a monoid is unique, one can alternately define the identity function on M to be this identity element. Such a definition generalizes to the concept of an identity morphism in category theory, where the endomorphisms of M need not be functions.