World Library  
Flag as Inappropriate
Email this Article

Morphism

Article Id: WHEBN0027716891
Reproduction Date:

Title: Morphism  
Author: World Heritage Encyclopedia
Language: English
Subject: Category theory, Automorphism, Sheaf (mathematics), Homomorphism, Map (mathematics)
Collection: Morphisms
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Morphism

In many fields of mathematics, morphism refers to a structure-preserving map from one mathematical structure to another. 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.

In category theory, morphism is a broadly similar idea, but somewhat more abstract: the mathematical objects involved need not be sets, and the relationship between them may be something more general than a map.

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. In category theory, morphisms are sometimes also called arrows.

Contents

  • Definition 1
  • Some specific morphisms 2
  • Examples 3
  • See also 4
  • Notes 5
  • References 6
  • External links 7

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 : XY. 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), Mor(X, Y) or C(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, a category where hom(X, Y) is a set for all objects X and Y is called locally small.

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 f : XY and g : YZ is written gf or gf. The composition of morphisms is often represented by a commutative diagram. For example,

Morphisms satisfy two axioms:

  • Identity: for every object X, there exists a morphism idX : XX called the identity morphism on X, such that for every morphism f : AB we have idBf = f = f ∘ idA.
  • Associativity: h ∘ (gf) = (hg) ∘ f whenever the operations are defined.

When C is a concrete category, the identity morphism is just the identity function, and composition is just the ordinary composition of functions. Associativity then follows, because the composition of functions is associative.

Note that the domain and codomain are in fact part of the information determining a morphism. For example, in the category of sets, where morphisms are functions, two functions may be identical as sets of ordered pairs (may have the same range), while having different codomains. The two functions are distinct from the viewpoint of category theory. Thus many authors require that the hom-classes hom(X, Y) be disjoint. In practice, this is not a problem because if this disjointness does not hold, it can be assured by appending the domain and codomain to the morphisms, (say, as the second and third components of an ordered triple).

Some specific morphisms

  • Monomorphism: f : XY is called a monomorphism if fg1 = fg2 implies g1 = g2 for all morphisms g1, g2 : ZX. It is also called a mono or a monic.[1]
    • The morphism f has a left inverse if there is a morphism g:YX such that gf = idX. The left inverse g is also called a retraction of f.[1] 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.
    • A split monomorphism h : XY is a monomorphism having a left inverse g : YX, so that gh = idX. Thus hg : YY is idempotent, so that (hg)2 = hg.
    • In concrete categories, a function that has a left inverse is injective. 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.
  • Epimorphism: Dually, f : XY is called an epimorphism if g1f = g2f implies g1 = g2 for all morphisms g1, g2 : YZ. It is also called an epi or an epic.[1]
    • The morphism f has a right-inverse if there is a morphism g : YX such that fg = idY. The right inverse g is also called a section of f.[1] 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.
    • A split epimorphism is an epimorphism having a right inverse. Note that if a monomorphism f splits with left-inverse g, then g is a split epimorphism with right-inverse f.
    • In concrete categories, a function that has a right inverse is surjective. 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, a result equivalent to the axiom of choice.
  • A bimorphism is a morphism that is both an epimorphism and a monomorphism.
  • Isomorphism: f : XY is called an isomorphism if there exists a morphism g : YX such that fg = idY and gf = 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 ZQ is a bimorphism that 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 as a balanced category.
  • Endomorphism: f : XX is an endomorphism of X. A split endomorphism is an idempotent endomorphism f if f admits a decomposition f = hg with gh = id. In particular, the Karoubi envelope of a category splits every idempotent morphism.
  • An automorphism is a morphism that is both an endomorphism and an isomorphism.

Examples

For more examples, see the entry category theory.

See also

Notes

  1. ^ a b c d Jacobson (2009), p. 15.

References

  •  .
  • Adámek, Jiří; Horst Herrlich; George E. Strecker (1990). Abstract and Concrete Categories. John Wiley & Sons.   Now available as free on-line edition (4.2MB PDF).

External links

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.