Morphism

The most common example occurs when the process is a Function or Map which preserves the structure in some sense. In Set Theory , for example, morphisms are just functions; in Group Theory they are Group Homomorphism s; while in Topology they are Continuous Functions . In the context of Universal Algebra morphisms are generically known as Homomorphisms .

The abstract study of morphisms and the structures (or objects) between which they are defined forms part of Category Theory . In category theory, morphisms need not be functions at all and are usually thought as ''arrows'' between two different objects (which need not be sets). Rather than mapping elements of one set to another they simply represent some sort of relationship between the domain and codomain.

Despite the abstract nature of morphisms, most people's intuition about them (and indeed much of the terminology) comes from the case of Concrete Categories where the objects are simply sets with some additional structure and morphisms are functions preserving this structure.

DEFINITION

A of ''objects'' and a class of ''morphisms''.

There are two operations defined on every morphism, the Domain (or '''source''') and the ''' Codomain ''' (or '''target''').

Morphisms are often depicted as arrows from their domain to their codomain, e.g. if a morphism ''f'' has domain ''X'' and codomain ''Y'', it is denoted ''f'' : ''X'' → ''Y''. The set of all morphisms from ''X'' to ''Y'' is denoted hom_''C''(''X'',''Y'') or simply hom(''X'', ''Y'') and called the ''hom-set'' between ''X'' and ''Y''. (Some authors write Mor_''C''(''X'',''Y'') or Mor(''X'', ''Y'')).

For every three objects ''X'', ''Y'', and ''Z'', there exists a . For example,

Morphisms must satisfy two Axiom s:

IDENTITY: for every object ''X'', there exists a morphism id_''X'' : ''X'' → ''X'' called the identity morphism on ''X'', such that for every morphism ''f'' : ''A'' → ''B'' we have ${
m id}_B\circ f=f=f\circ{
m id}_A$ .

ASSOCIATIVITY: $h\circ(g\circ f)=(h\circ g)\circ f$ whenever the operations are defined.

When ''C'' is a concrete category, composition is just ordinary Composition Of Functions , the identity morphism is just the Identity Function , and associativity is automatic. (Functional composition is associative.)

Note that the domain and codomain are really part of the information determining the morphism. For example, in the category of sets, where morphisms are functions, two functions may be identical as set of ordered pairs, but have different codomains. These functions are considered ''distinct'' for the purposes of category theory. For this reason, many authors require that the hom-classes hom(''X'', ''Y'') be disjoint. In practice, this is not a problem, because if they are not disjoint, the domain and codomain can be appended to the morphisms, (say, as the second and third components of an ordered triple), making them disjoint.

SOME REMARKABLE MORPHISMS

A morphism ''f'' : ''X'' → ''Y'' is called a '''. Thus in concrete categories, monomorphisms are often, but not always, injective. The condition of being an injection is stronger than that of being a monomorphism, but weaker than that of being a split monomorphism.

Dually, a morphism ''f'' : ''X'' → ''Y'' is called an '''. Thus in concrete categories, epimorphisms are often, but not always, surjective. The condition of being a surjection is stronger than that of being an epimorphism, but weaker than that of being a split epimorphism. In the Category Of Sets , every surjection has a section. This result is equivalent to the Axiom Of Choice .

Note that if a split monomorphism ''f'' has a left-inverse ''g'', then ''g'' is a split epimorphism and has right-inverse ''f''.

A morphism which is both an epimorphism and a monomorphism is called a bimorphism.

A morphism ''f'' : ''X'' → ''Y'' is called an ''' or equivalent.

Note that every isomorphism is a bimorphism but, in general, ''not'' every bimorphism is 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 in which every bimorphism is an isomorphism is a '''balanced category'''. For example, '''Set''' is a balanced category.

Any morphism ''f'' : ''X'' → ''X'' is called an Endomorphism of ''X''.

An endomorphism that is also an isomorphism is called an Automorphism .

If a split monomorphism ''h'' : ''X'' → ''Y'' has left-inverse ''g'' : ''Y'' → ''X'', so that $g\circ h={
m id}_X$ , then $h\circ g:\, Y o Y$ is Idempotent , which means that $(h\circ g)^2=h\circ g$ . More generally, any idempotent endomorphism ''f'' is said to be split if it admits a decomposition $f=h\circ g$ with $g\circ h=\mathrm{id}$ . In particular, the Karoubi Envelope of a category splits every idempotent.

''See also'':

Zero Morphism s

Normal Morphism s

Holomorphism

EXAMPLES

In the concrete categories studied in Universal Algebra (such as those of Groups , Rings , Modules , etc.), morphisms are called Homomorphism s. The terms isomorphism, epimorphism, monomorphism, endomorphism, and automorphism are all used in that specialized context as well.

In the Category Of Topological Spaces , morphisms are Continuous Function s and isomorphisms are called Homeomorphism s.

In the category of Smooth Manifold s, morphisms are Smooth Function s and isomorphisms are called Diffeomorphism s.

Functor s can be thought of as morphisms in the category of Small Categories .

In a Functor Category the morphisms are Natural Transformation s.

For more examples see the article on Category Theory .

	APPAREL
	BABY
	BEAUTY
	BOOKS
	CAR TOYS
	CELL PHONES
	DVD'S
	ELECTRONICS
	GOURMET FOOD
	GROCERIES
	HEALTH & PERSONAL
	HOME & GARDEN
	JEWELRY
	MUSIC
	MUSIC INSTRUMENTS
	OFFICE PRODUCTS
	SOFTWARE
	SPORTING GOODS
	TOOLS & HARDWARE
	TOYS
	VIDEO GAMES
	SHOPPING HOME

	MORE SHOPPING...

	CATEGORIES ABOUT MORPHISM

	functions and mappings

	category theory

Information About

Morphism