In many fields of mathematics, morphism refers to a ations are defined, that is when the target of f is the
structure-preserving map from one mathematical struc- source of g, and the target of g is the source of h.
ture to another. The notion of morphism recurs in much
of contemporary mathematics. In set theory, morphisms For a concrete category (that is the objects are sets with
are functions; in linear algebra, linear transformations;
additional structure, and of the morphisms as structure-
in group theory, group homomorphisms; in topology, preserving functions), the identity morphism is just the
continuous functions, and so on. identity function, and composition is just the ordinary
In category theory, morphism is a broadly similar idea, composition of functions. Associativity then follows, be-
but somewhat more abstract: the mathematical objects cause the composition of functions is associative.
involved need not be sets, and the relationship between The composition of morphisms is often represented by a
them may be something more general than a map. commutative diagram. For example,
The study of morphisms and of the structures (called “ob-
jects”) 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 ad-
ditional structure, and morphisms are structure-preserving
functions. In category theory, morphisms are sometimes
also called arrows.
1
2 4 SEE ALSO
• A morphism f has a left inverse if there is a mor- or equivalent. Note that while every isomorphism is a
phism g: Y → X such that g ∘ f = idX. The left in- bimorphism, a bimorphism is not necessarily an isomor-
verse g is also called a retraction of f.[1] Morphisms
phism. For example, in the category of commutative
with left inverses are always monomorphisms, but rings the inclusion Z → Q is a bimorphism that is not
the converse is not always true in every category; aan isomorphism. However, any morphism that is both
monomorphism may fail to have a left-inverse. an epimorphism and a split monomorphism, or both a
monomorphism and a split epimorphism, must be an iso-
• A split monomorphism h: X → Y is a monomor- morphism. A category, such as Set, in which every bi-
phism having a left inverse g: Y → X, so that g ∘ h morphism is an isomorphism is known as a balanced cat-
= idX. Thus h ∘ g: Y → Y is idempotent; that is, (h egory.
∘ g)2 = h ∘ (g ∘ h) ∘ g = h ∘ g.
5 Notes
[1] Jacobson (2009), p. 15.
6 References
• Jacobson, Nathan (2009), Basic algebra, 2 (2nd ed.),
Dover, ISBN 978-0-486-47187-7.
7 External links
• Hazewinkel, Michiel, ed. (2001), “Morphism”,
Encyclopedia of Mathematics, Springer, ISBN 978-
1-55608-010-4
• “Category”. PlanetMath.
• “TypesOfMorphisms”. PlanetMath.
4 8 TEXT AND IMAGE SOURCES, CONTRIBUTORS, AND LICENSES
8.2 Images
• File:Commutative_diagram_for_morphism.svg Source: https://upload.wikimedia.org/wikipedia/commons/e/ef/Commutative_
diagram_for_morphism.svg License: Public domain Contributors: Own work, based on en:Image:MorphismComposition-01.png Original
artist: User:Cepheus
• File:Text_document_with_red_question_mark.svg Source: https://upload.wikimedia.org/wikipedia/commons/a/a4/Text_document_
with_red_question_mark.svg License: Public domain Contributors: Created by bdesham with Inkscape; based upon Text-x-generic.svg
from the Tango project. Original artist: Benjamin D. Esham (bdesham)