|
|
|
|
|
Introduction 09}}In mathematics, a morphism is an abstraction derived from structure-preserving mappings between two mathematical structures. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in topology, continuous functions, and so on.The study of morphisms and of the structures (called objects) over which they are defined, is central to category theory. Much of the terminology of morphisms, as well as the intuition underlying them, comes from concrete categories, where the objects are simply sets with some additional structure, and morphisms are structure-preserving functions. Introduction Definition Some specific morphisms Examples See also Notes Definition A category C consists of two classes, one of objects and the other of morphisms.There are two operations which are defined on every morphism, the domain (or source) and the codomain (or target).If a morphism f has domain X and codomain Y, we write f X ? Y. Thus a morphism is represented by an arrow from its domain to its codomain. The collection of all morphisms from X to Y is denoted homC(X,Y) or simply hom(X, Y) and called the hom-set between X and Y. Some authors write MorC(X,Y) or Mor(X, Y). Note that the term hom-set is a bit of a misnomer as the collection of morphisms is not required to be a set.For every three objects X, Y, and Z, there exists a binary operation hom(X, Y) × hom(Y, Z) ? hom(X, Z) called composition. The composite of is written g o f or gf. The composition of morphisms is often represented by a commutative diagram. For example,Morphisms satisfy two axioms: X ? X called the identity morphism on X, such that for every morphism we have idB o f = f = f o idA. Some specific morphisms X ? Y is called a monomorphism if f o g1 = f o g2 implies g1 = g2 for all morphisms g1, g2Z ? X. It is also called a mono or a monic. Morphisms with left inverses are always monomorphisms, but the converse is not always true in every category; a monomorphism may fail to have a left-inverse. X ? Y is a monomorphism having a left inverse gY ? X, so that g o h = idX. Thus h o gY ? Y is idempotent, so that (h o g)2 = h o g. X ? Y is called an epimorphism if g1 o f = g2 o f implies g1 = g2 for all morphisms g1, g2Y ? Z. It is also called an epi or an epic. Y ? X such that f o g = idY. The right inverse g is also called a section of f. Morphisms having a right inverse are always epimorphisms, but the converse is not always true in every category, as an epimorphism may fail to have a right inverse. X ? Y is called an isomorphism if there exists a morphism gY ? X such that f o g = idY and g o f = idX. If a morphism has both left-inverse and right-inverse, then the two inverses are equal, so f is an isomorphism, and g is called simply the inverse of f. Inverse morphisms, if they exist, are unique. The inverse g is also an isomorphism with inverse f. Two objects with an isomorphism between them are said to be isomorphic or equivalent. Note that while every isomorphism is a bimorphism, a bimorphism is not necessarily an isomorphism. For example, in the category of commutative rings the inclusion Z ? Q is a bimorphism, which is not an isomorphism. However, any morphism that is both an epimorphism and a split monomorphism, or both a monomorphism and a split epimorphism, must be an isomorphism. A category, such as Set, in which every bimorphism is an isomorphism is known a |
|
![]() |
|
|