# Monomorphism

Last updated

In the context of abstract algebra or universal algebra, a monomorphism is an injective homomorphism. A monomorphism from X to Y is often denoted with the notation ${\displaystyle X\hookrightarrow Y}$.

## Contents

In the more general setting of category theory, a monomorphism (also called a monic morphism or a mono) is a left-cancellative morphism. That is, an arrow f : XY such that for all objects Z and all morphisms g1, g2: ZX,

${\displaystyle f\circ g_{1}=f\circ g_{2}\implies g_{1}=g_{2}.}$

Monomorphisms are a categorical generalization of injective functions (also called "one-to-one functions"); in some categories the notions coincide, but monomorphisms are more general, as in the examples below.

The categorical dual of a monomorphism is an epimorphism, that is, a monomorphism in a category C is an epimorphism in the dual category Cop. Every section is a monomorphism, and every retraction is an epimorphism.

## Relation to invertibility

Left-invertible morphisms are necessarily monic: if l is a left inverse for f (meaning l is a morphism and ${\displaystyle l\circ f=\operatorname {id} _{X}}$), then f is monic, as

${\displaystyle f\circ g_{1}=f\circ g_{2}\Rightarrow l\circ f\circ g_{1}=l\circ f\circ g_{2}\Rightarrow g_{1}=g_{2}.}$

A left-invertible morphism is called a split mono or a section.

However, a monomorphism need not be left-invertible. For example, in the category Group of all groups and group homomorphisms among them, if H is a subgroup of G then the inclusion f : HG is always a monomorphism; but f has a left inverse in the category if and only if H has a normal complement in G.

A morphism f : XY is monic if and only if the induced map f : Hom(Z, X) → Hom(Z, Y), defined by f(h) = fh for all morphisms h : ZX, is injective for all objects Z.

## Examples

Every morphism in a concrete category whose underlying function is injective is a monomorphism; in other words, if morphisms are actually functions between sets, then any morphism which is a one-to-one function will necessarily be a monomorphism in the categorical sense. In the category of sets the converse also holds, so the monomorphisms are exactly the injective morphisms. The converse also holds in most naturally occurring categories of algebras because of the existence of a free object on one generator. In particular, it is true in the categories of all groups, of all rings, and in any abelian category.

It is not true in general, however, that all monomorphisms must be injective in other categories; that is, there are settings in which the morphisms are functions between sets, but one can have a function that is not injective and yet is a monomorphism in the categorical sense. For example, in the category Div of divisible (abelian) groups and group homomorphisms between them there are monomorphisms that are not injective: consider, for example, the quotient map q : QQ/Z, where Q is the rationals under addition, Z the integers (also considered a group under addition), and Q/Z is the corresponding quotient group. This is not an injective map, as for example every integer is mapped to 0. Nevertheless, it is a monomorphism in this category. This follows from the implication qh = 0 ⇒ h = 0, which we will now prove. If h : GQ, where G is some divisible group, and qh = 0, then h(x) ∈ Z, ∀ xG. Now fix some xG. Without loss of generality, we may assume that h(x) ≥ 0 (otherwise, choose −x instead). Then, letting n = h(x) + 1, since G is a divisible group, there exists some yG such that x = ny, so h(x) = nh(y). From this, and 0 ≤ h(x) < h(x) + 1 = n, it follows that

${\displaystyle 0\leq {\frac {h(x)}{h(x)+1}}=h(y)<1}$

Since h(y) ∈ Z, it follows that h(y) = 0, and thus h(x) = 0 = h(−x), ∀ xG. This says that h = 0, as desired.

To go from that implication to the fact that q is a monomorphism, assume that qf = qg for some morphisms f, g : GQ, where G is some divisible group. Then q ∘ (fg) = 0, where (fg) : xf(x) − g(x). (Since (fg)(0) = 0, and (fg)(x + y) = (fg)(x) + (fg)(y), it follows that (fg) ∈ Hom(G, Q)). From the implication just proved, q ∘ (fg) = 0 ⇒ fg = 0 ⇔ ∀ xG, f(x) = g(x) ⇔ f = g. Hence q is a monomorphism, as claimed.

## Properties

• In a topos, every mono is an equalizer, and any map that is both monic and epic is an isomorphism.
• Every isomorphism is monic.

There are also useful concepts of regular monomorphism, extremal monomorphism, immediate monomorphism, strong monomorphism, and split monomorphism.

• A monomorphism is said to be regular if it is an equalizer of some pair of parallel morphisms.
• A monomorphism ${\displaystyle \mu }$ is said to be extremal [1] if in each representation ${\displaystyle \mu =\varphi \circ \varepsilon }$, where ${\displaystyle \varepsilon }$ is an epimorphism, the morphism ${\displaystyle \varepsilon }$ is automatically an isomorphism.
• A monomorphism ${\displaystyle \mu }$ is said to be immediate if in each representation ${\displaystyle \mu =\mu '\circ \varepsilon }$, where ${\displaystyle \mu '}$ is a monomorphism and ${\displaystyle \varepsilon }$ is an epimorphism, the morphism ${\displaystyle \varepsilon }$ is automatically an isomorphism.
• A monomorphism ${\displaystyle \mu :C\to D}$ is said to be strong [1] [2] if for any epimorphism ${\displaystyle \varepsilon :A\to B}$ and any morphisms ${\displaystyle \alpha :A\to C}$ and ${\displaystyle \beta :B\to D}$ such that ${\displaystyle \beta \circ \varepsilon =\mu \circ \alpha }$, there exists a morphism ${\displaystyle \delta :B\to C}$ such that ${\displaystyle \delta \circ \varepsilon =\alpha }$ and ${\displaystyle \mu \circ \delta =\beta }$.
• A monomorphism ${\displaystyle \mu }$ is said to be split if there exists a morphism ${\displaystyle \varepsilon }$ such that ${\displaystyle \varepsilon \circ \mu =1}$ (in this case ${\displaystyle \varepsilon }$ is called a left-sided inverse for ${\displaystyle \mu }$).

## Terminology

The companion terms monomorphism and epimorphism were originally introduced by Nicolas Bourbaki; Bourbaki uses monomorphism as shorthand for an injective function. Early category theorists believed that the correct generalization of injectivity to the context of categories was the cancellation property given above. While this is not exactly true for monic maps, it is very close, so this has caused little trouble, unlike the case of epimorphisms. Saunders Mac Lane attempted to make a distinction between what he called monomorphisms, which were maps in a concrete category whose underlying maps of sets were injective, and monic maps, which are monomorphisms in the categorical sense of the word. This distinction never came into general use.

Another name for monomorphism is extension , although this has other uses too.

## Related Research Articles

In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type. The word homomorphism comes from the Ancient Greek language: ὁμός meaning "same" and μορφή meaning "form" or "shape". However, the word was apparently introduced to mathematics due to a (mis)translation of German ähnlich meaning "similar" to ὁμός meaning "same". The term "homomorphism" appeared as early as 1892, when it was attributed to the German mathematician Felix Klein (1849–1925).

In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure of the categories involved. Hence, a natural transformation can be considered to be a "morphism of functors". Indeed, this intuition can be formalized to define so-called functor categories. Natural transformations are, after categories and functors, one of the most fundamental notions of category theory and consequently appear in the majority of its applications.

In mathematics, a category is a collection of "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple example is the category of sets, whose objects are sets and whose arrows are functions.

In mathematics, specifically category theory, adjunction is a relationship that two functors may have. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems, such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology.

In category theory, an epimorphism is a morphism f : XY that is right-cancellative in the sense that, for all objects Z and all morphisms g1, g2: YZ,

An exact sequence is a sequence of morphisms between objects such that the image of one morphism equals the kernel of the next.

Homological algebra is the branch of mathematics that studies homology in a general algebraic setting. It is a relatively young discipline, whose origins can be traced to investigations in combinatorial topology and abstract algebra at the end of the 19th century, chiefly by Henri Poincaré and David Hilbert.

In category theory, a branch of mathematics, the image of a morphism is a generalization of the image of a function.

In category theory, a branch of mathematics, a monad is an endofunctor, together with two natural transformations required to fulfill certain coherence conditions. Monads are used in the theory of pairs of adjoint functors, and they generalize closure operators on partially ordered sets to arbitrary categories.

In mathematics, the category Ab has the abelian groups as objects and group homomorphisms as morphisms. This is the prototype of an abelian category: indeed, every small abelian category can be embedded in Ab.

In mathematics, especially in the field of category theory, the concept of injective object is a generalization of the concept of injective module. This concept is important in cohomology, in homotopy theory and in the theory of model categories. The dual notion is that of a projective object.

In category theory, a branch of mathematics, a pullback is the limit of a diagram consisting of two morphisms f : X → Z and g : Y → Z with a common codomain. The pullback is often written

This is a glossary of properties and concepts in category theory in mathematics.

In category theory, a Kleisli category is a category naturally associated to any monad T. It is equivalent to the category of free T-algebras. The Kleisli category is one of two extremal solutions to the question Does every monad arise from an adjunction? The other extremal solution is the Eilenberg–Moore category. Kleisli categories are named for the mathematician Heinrich Kleisli.

In category theory, a branch of mathematics, a section is a right inverse of some morphism. Dually, a retraction is a left inverse of some morphism. In other words, if f : XY and g : YX are morphisms whose composition fog : YY is the identity morphism on Y, then g is a section of f, and f is a retraction of g.

In category theory, the concept of an element, or a point, generalizes the more usual set theoretic concept of an element of a set to an object of any category. This idea often allows restating of definitions or properties of morphisms given by a universal property in more familiar terms, by stating their relation to elements. Some very general theorems, such as Yoneda's lemma and the Mitchell embedding theorem, are of great utility for this, by allowing one to work in a context where these translations are valid. This approach to category theory, in particular the use of the Yoneda lemma in this way, is due to Grothendieck, and is often called the method of the functor of points.

In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. 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 mathematics, weak bialgebras are a generalization of bialgebras that are both algebras and coalgebras but for which the compatibility conditions between the two structures have been "weakened". In the same spirit, weak Hopf algebras are weak bialgebras together with a linear map S satisfying specific conditions; they are generalizations of Hopf algebras.

In category theory, an abstract mathematical discipline, a nodal decomposition of a morphism is a representation of as a product , where is a strong epimorphism, a bimorphism, and a strong monomorphism.

In mathematics, specifically homotopical algebra, an H-object is a categorical generalization of an H-space, which can be defined in any category with a product and an initial object . These are useful constructions because they help export some of the ideas from algebraic topology and homotopy theory into other domains, such as in commutative algebra and algebraic geometry.

## References

• Bergman, George (2015). An Invitation to General Algebra and Universal Constructions. Springer. ISBN   978-3-319-11478-1.
• Borceux, Francis (1994). Handbook of Categorical Algebra. Volume 1: Basic Category Theory. Cambridge University Press. ISBN   978-0521061193.
• "Monomorphism", Encyclopedia of Mathematics , EMS Press, 2001 [1994]
• Van Oosten, Jaap (1995). "Basic Category Theory" (PDF). Brics Lecture Series. BRICS, Computer Science Department, University of Aarhus. ISSN   1395-2048.
• Tsalenko, M.S.; Shulgeifer, E.G. (1974). Foundations of category theory. Nauka. ISBN   5-02-014427-4.