HOME

TheInfoList



OR:

In
category theory Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Nowadays, ca ...
, an epimorphism (also called an epic morphism or, colloquially, an epi) is a
morphism 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 ...
''f'' : ''X'' → ''Y'' that is right-cancellative in the sense that, for all objects ''Z'' and all morphisms , : g_1 \circ f = g_2 \circ f \implies g_1 = g_2. Epimorphisms are categorical analogues of onto or surjective functions (and in the
category of sets In the mathematical field of category theory, the category of sets, denoted as Set, is the category whose objects are sets. The arrows or morphisms between sets ''A'' and ''B'' are the total functions from ''A'' to ''B'', and the composition o ...
the concept corresponds exactly to the surjective functions), but they may not exactly coincide in all contexts; for example, the inclusion \mathbb\to\mathbb is a ring epimorphism. The dual of an epimorphism is a monomorphism (i.e. an epimorphism in a
category Category, plural categories, may refer to: Philosophy and general uses *Categorization, categories in cognitive science, information science and generally * Category of being * ''Categories'' (Aristotle) * Category (Kant) * Categories (Peirce) ...
''C'' is a monomorphism in the dual category ''C''op). Many authors in
abstract algebra In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The ter ...
and
universal algebra Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples ("models") of algebraic structures. For instance, rather than take particular groups as the object of study ...
define an epimorphism simply as an ''onto'' or
surjective In mathematics, a surjective function (also known as surjection, or onto function) is a function that every element can be mapped from element so that . In other words, every element of the function's codomain is the image of one element o ...
homomorphism In algebra, a homomorphism is a morphism, structure-preserving map (mathematics), map between two algebraic structures of the same type (such as two group (mathematics), groups, two ring (mathematics), rings, or two vector spaces). The word ''homo ...
. Every epimorphism in this algebraic sense is an epimorphism in the sense of category theory, but the converse is not true in all categories. In this article, the term "epimorphism" will be used in the sense of category theory given above. For more on this, see below.


Examples

Every morphism in a
concrete category In mathematics, a concrete category is a category that is equipped with a faithful functor to the category of sets (or sometimes to another category, ''see Relative concreteness below''). This functor makes it possible to think of the objects of t ...
whose underlying function is
surjective In mathematics, a surjective function (also known as surjection, or onto function) is a function that every element can be mapped from element so that . In other words, every element of the function's codomain is the image of one element o ...
is an epimorphism. In many concrete categories of interest the converse is also true. For example, in the following categories, the epimorphisms are exactly those morphisms that are surjective on the underlying sets: *
Set Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
: sets and functions. To prove that every epimorphism ''f'': ''X'' → ''Y'' in Set is surjective, we compose it with both the
characteristic function In mathematics, the term "characteristic function" can refer to any of several distinct concepts: * The indicator function of a subset, that is the function ::\mathbf_A\colon X \to \, :which for a given subset ''A'' of ''X'', has value 1 at points ...
''g''1: ''Y'' → of the image ''f''(''X'') and the map ''g''2: ''Y'' → that is constant 1. *Rel: sets with
binary relation In mathematics, a binary relation associates elements of one set, called the ''domain'', with elements of another set, called the ''codomain''. A binary relation over sets and is a new set of ordered pairs consisting of elements in and in ...
s and relation-preserving functions. Here we can use the same proof as for Set, equipping with the full relation ×. *Pos:
partially ordered set In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary ...
s and
monotone function In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order ...
s. If ''f'' : (''X'', ≤) → (''Y'', ≤) is not surjective, pick ''y''0 in ''Y'' \ ''f''(''X'') and let ''g''1 : ''Y'' → be the characteristic function of and ''g''2 : ''Y'' → the characteristic function of . These maps are monotone if is given the standard ordering 0 < 1. * Grp:
groups A group is a number of persons or things that are located, gathered, or classed together. Groups of people * Cultural group, a group whose members share the same cultural identity * Ethnic group, a group whose members share the same ethnic ide ...
and
group homomorphism In mathematics, given two groups, (''G'', ∗) and (''H'', ·), a group homomorphism from (''G'', ∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that : h(u*v) = h(u) \cdot h(v) w ...
s. The result that every epimorphism in Grp is surjective is due to Otto Schreier (he actually proved more, showing that every
subgroup In group theory, a branch of mathematics, given a group ''G'' under a binary operation ∗, a subset ''H'' of ''G'' is called a subgroup of ''G'' if ''H'' also forms a group under the operation ∗. More precisely, ''H'' is a subgroup ...
is an equalizer using the free product with one amalgamated subgroup); an elementary proof can be found in (Linderholm 1970). *FinGrp:
finite groups Finite is the opposite of infinite. It may refer to: * Finite number (disambiguation) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb, a verb form that has a subject, usually being inflected or marke ...
and group homomorphisms. Also due to Schreier; the proof given in (Linderholm 1970) establishes this case as well. * Ab:
abelian group In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is comm ...
s and group homomorphisms. * ''K''-Vect:
vector space In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called '' vectors'', may be added together and multiplied ("scaled") by numbers called ''scalars''. Scalars are often real numbers, but can ...
s over a field ''K'' and ''K''-linear transformations. *Mod-''R'': right modules over a ring ''R'' and module homomorphisms. This generalizes the two previous examples; to prove that every epimorphism ''f'': ''X'' → ''Y'' in Mod-''R'' is surjective, we compose it with both the canonical quotient map ''g'' 1: ''Y'' → ''Y''/''f''(''X'') and the
zero map 0 (zero) is a number representing an empty quantity. In place-value notation such as the Hindu–Arabic numeral system, 0 also serves as a placeholder numerical digit, which works by multiplying digits to the left of 0 by the radix, u ...
''g''2: ''Y'' → ''Y''/''f''(''X''). * Top:
topological spaces In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called point ...
and
continuous function In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in val ...
s. To prove that every epimorphism in Top is surjective, we proceed exactly as in Set, giving the
indiscrete topology In topology, a topological space with the trivial topology is one where the only open sets are the empty set and the entire space. Such spaces are commonly called indiscrete, anti-discrete, concrete or codiscrete. Intuitively, this has the conseque ...
, which ensures that all considered maps are continuous. *HComp:
compact Compact as used in politics may refer broadly to a pact or treaty; in more specific cases it may refer to: * Interstate compact * Blood compact, an ancient ritual of the Philippines * Compact government, a type of colonial rule utilized in Britis ...
Hausdorff space In topology and related branches of mathematics, a Hausdorff space ( , ), separated space or T2 space is a topological space where, for any two distinct points, there exist neighbourhoods of each which are disjoint from each other. Of the ma ...
s and continuous functions. If ''f'': ''X'' → ''Y'' is not surjective, let ''y'' ∈ ''Y'' − ''fX''. Since ''fX'' is closed, by
Urysohn's Lemma In topology, Urysohn's lemma is a lemma that states that a topological space is normal if and only if any two disjoint closed subsets can be separated by a continuous function. Section 15. Urysohn's lemma is commonly used to construct continuo ...
there is a continuous function ''g''1:''Y'' → ,1such that ''g''1 is 0 on ''fX'' and 1 on ''y''. We compose ''f'' with both ''g''1 and the zero function ''g''2: ''Y'' → ,1 However, there are also many concrete categories of interest where epimorphisms fail to be surjective. A few examples are: *In the
category of monoids Category, plural categories, may refer to: Philosophy and general uses *Categorization, categories in cognitive science, information science and generally *Category of being * ''Categories'' (Aristotle) *Category (Kant) *Categories (Peirce) *C ...
, Mon, the
inclusion map In mathematics, if A is a subset of B, then the inclusion map (also inclusion function, insertion, or canonical injection) is the function \iota that sends each element x of A to x, treated as an element of B: \iota : A\rightarrow B, \qquad \iota ...
N → Z is a non-surjective epimorphism. To see this, suppose that ''g''1 and ''g''2 are two distinct maps from Z to some monoid ''M''. Then for some ''n'' in Z, ''g''1(''n'') ≠ ''g''2(''n''), so ''g''1(''-n'') ≠ ''g''2(−''n''). Either ''n'' or −''n'' is in N, so the restrictions of ''g''1 and ''g''2 to N are unequal. *In the category of algebras over commutative ring R, take R ''N→ R ''Z where R ''Gis the
group ring In algebra, a group ring is a free module and at the same time a ring, constructed in a natural way from any given ring and any given group. As a free module, its ring of scalars is the given ring, and its basis is the set of elements of the giv ...
of the group G and the morphism is induced by the inclusion N → Z as in the previous example. This follows from the observation that 1 generates the algebra R ''Z(note that the unit in R ''Zis given by 0 of Z), and the inverse of the element represented by n in Z is just the element represented by −n. Thus any homomorphism from R ''Zis uniquely determined by its value on the element represented by 1 of Z. *In the
category of rings In mathematics, the category of rings, denoted by Ring, is the category whose objects are rings (with identity) and whose morphisms are ring homomorphisms (that preserve the identity). Like many categories in mathematics, the category of ring ...
, Ring, the inclusion map Z → Q is a non-surjective epimorphism; to see this, note that any
ring homomorphism In ring theory, a branch of abstract algebra, a ring homomorphism is a structure-preserving function between two rings. More explicitly, if ''R'' and ''S'' are rings, then a ring homomorphism is a function such that ''f'' is: :addition preser ...
on Q is determined entirely by its action on Z, similar to the previous example. A similar argument shows that the natural ring homomorphism from any
commutative ring In mathematics, a commutative ring is a ring in which the multiplication operation is commutative. The study of commutative rings is called commutative algebra. Complementarily, noncommutative algebra is the study of ring properties that are not ...
''R'' to any one of its localizations is an epimorphism. *In the category of commutative rings, a finitely generated homomorphism of rings ''f'' : ''R'' → ''S'' is an epimorphism if and only if for all
prime ideal In algebra, a prime ideal is a subset of a ring that shares many important properties of a prime number in the ring of integers. The prime ideals for the integers are the sets that contain all the multiples of a given prime number, together wi ...
s ''P'' of ''R'', the ideal ''Q'' generated by ''f''(''P'') is either ''S'' or is prime, and if ''Q'' is not ''S'', the induced map Frac(''R''/''P'') → Frac(''S''/''Q'') is an
isomorphism In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word i ...
( EGA IV 17.2.6). *In the category of Hausdorff spaces, Haus, the epimorphisms are precisely the continuous functions with dense images. For example, the inclusion map Q → R, is a non-surjective epimorphism. The above differs from the case of monomorphisms where it is more frequently true that monomorphisms are precisely those whose underlying functions are
injective In mathematics, an injective function (also known as injection, or one-to-one function) is a function that maps distinct elements of its domain to distinct elements; that is, implies . (Equivalently, implies in the equivalent contrapositi ...
. As for examples of epimorphisms in non-concrete categories: * If a
monoid In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being 0. Monoid ...
or ring is considered as a category with a single object (composition of morphisms given by multiplication), then the epimorphisms are precisely the right-cancellable elements. * If a directed graph is considered as a category (objects are the vertices, morphisms are the paths, composition of morphisms is the concatenation of paths), then ''every'' morphism is an epimorphism.


Properties

Every
isomorphism In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word i ...
is an epimorphism; indeed only a right-sided inverse is needed: if there exists a morphism ''j'' : ''Y'' → ''X'' such that ''fj'' = id''Y'', then ''f'': ''X'' → ''Y'' is easily seen to be an epimorphism. A map with such a right-sided inverse is called a split epi. In a
topos In mathematics, a topos (, ; plural topoi or , or toposes) is a category that behaves like the category of sheaves of sets on a topological space (or more generally: on a site). Topoi behave much like the category of sets and possess a notio ...
, a map that is both a monic morphism and an epimorphism is an isomorphism. The composition of two epimorphisms is again an epimorphism. If the composition ''fg'' of two morphisms is an epimorphism, then ''f'' must be an epimorphism. As some of the above examples show, the property of being an epimorphism is not determined by the morphism alone, but also by the category of context. If ''D'' is a
subcategory In mathematics, specifically category theory, a subcategory of a category ''C'' is a category ''S'' whose objects are objects in ''C'' and whose morphisms are morphisms in ''C'' with the same identities and composition of morphisms. Intuitively, ...
of ''C'', then every morphism in ''D'' that is an epimorphism when considered as a morphism in ''C'' is also an epimorphism in ''D''. However the converse need not hold; the smaller category can (and often will) have more epimorphisms. As for most concepts in category theory, epimorphisms are preserved under equivalences of categories: given an equivalence ''F'' : ''C'' → ''D'', a morphism ''f'' is an epimorphism in the category ''C'' if and only if ''F''(''f'') is an epimorphism in ''D''. A duality between two categories turns epimorphisms into monomorphisms, and vice versa. The definition of epimorphism may be reformulated to state that ''f'' : ''X'' → ''Y'' is an epimorphism if and only if the induced maps :\begin\operatorname(Y,Z) &\rightarrow& \operatorname(X,Z)\\ g &\mapsto& gf\end are
injective In mathematics, an injective function (also known as injection, or one-to-one function) is a function that maps distinct elements of its domain to distinct elements; that is, implies . (Equivalently, implies in the equivalent contrapositi ...
for every choice of ''Z''. This in turn is equivalent to the induced
natural transformation In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure (i.e., the composition of morphisms) of the categories involved. Hence, a natur ...
:\begin\operatorname(Y,-) &\rightarrow& \operatorname(X,-)\end being a monomorphism in the
functor category In category theory, a branch of mathematics, a functor category D^C is a category where the objects are the functors F: C \to D and the morphisms are natural transformations \eta: F \to G between the functors (here, G: C \to D is another object in t ...
Set''C''. Every coequalizer is an epimorphism, a consequence of the uniqueness requirement in the definition of coequalizers. It follows in particular that every cokernel is an epimorphism. The converse, namely that every epimorphism be a coequalizer, is not true in all categories. In many categories it is possible to write every morphism as the composition of an epimorphism followed by a monomorphism. For instance, given a group homomorphism ''f'' : ''G'' → ''H'', we can define the group ''K'' = im(''f'') and then write ''f'' as the composition of the surjective homomorphism ''G'' → ''K'' that is defined like ''f'', followed by the injective homomorphism ''K'' → ''H'' that sends each element to itself. Such a factorization of an arbitrary morphism into an epimorphism followed by a monomorphism can be carried out in all abelian categories and also in all the concrete categories mentioned above in (though not in all concrete categories).


Related concepts

Among other useful concepts are ''regular epimorphism'', ''extremal epimorphism'', ''immediate epimorphism'', ''strong epimorphism'', and ''split epimorphism''. * An epimorphism is said to be regular if it is a coequalizer of some pair of parallel morphisms. * An epimorphism \varepsilon is said to be extremal if in each representation \varepsilon=\mu\circ\varphi, where \mu is a monomorphism, the morphism \mu is automatically an
isomorphism In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word i ...
. * An epimorphism \varepsilon is said to be immediate if in each representation \varepsilon=\mu\circ\varepsilon', where \mu is a monomorphism and \varepsilon' is an epimorphism, the morphism \mu is automatically an
isomorphism In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word i ...
. * An epimorphism \varepsilon:A\to B is said to be strong if for any monomorphism \mu:C\to D and any morphisms \alpha:A\to C and \beta:B\to D such that \beta\circ\varepsilon=\mu\circ\alpha, there exists a morphism \delta:B\to C such that \delta\circ\varepsilon=\alpha and \mu\circ\delta=\beta. * An epimorphism \varepsilon is said to be split if there exists a morphism \mu such that \varepsilon\circ\mu=1 (in this case \mu is called a right-sided inverse for \varepsilon). There is also the notion of homological epimorphism in ring theory. A morphism ''f'': ''A'' → ''B'' of rings is a homological epimorphism if it is an epimorphism and it induces a
full and faithful functor In category theory, a faithful functor is a functor that is injective on hom-sets, and a full functor is surjective on hom-sets. A functor that has both properties is called a full and faithful functor. Formal definitions Explicitly, let ''C'' an ...
on derived categories: D(''f'') : D(''B'') → D(''A''). A morphism that is both a monomorphism and an epimorphism is called a bimorphism. Every isomorphism is a bimorphism but the converse is not true in general. For example, the map from the
half-open interval In mathematics, a (real) interval is a set of real numbers that contains all real numbers lying between any two numbers of the set. For example, the set of numbers satisfying is an interval which contains , , and all numbers in between. Othe ...
,1)_to_the_unit_circle_S1_(thought_of_as_a_topological_subspace.html" ;"title="unit_circle.html" ;"title=",1) to the unit circle">,1) to the unit circle S1 (thought of as a topological subspace">subspace of the complex plane) that sends ''x'' to exp(2πi''x'') (see Euler's formula) is continuous and bijective but not a homeomorphism since the inverse map is not continuous at 1, so it is an instance of a bimorphism that is not an isomorphism in the category Top. Another example is the embedding Q → R in the category Haus; as noted above, it is a bimorphism, but it is not bijective and therefore not an isomorphism. Similarly, in the category of rings, the map Z → Q is a bimorphism but not an isomorphism. Epimorphisms are used to define abstract
quotient object In category theory, a branch of mathematics, a subobject is, roughly speaking, an object that sits inside another object in the same category. The notion is a generalization of concepts such as subsets from set theory, subgroups from group theory ...
s in general categories: two epimorphisms ''f''1 : ''X'' → ''Y''1 and ''f''2 : ''X'' → ''Y''2 are said to be ''equivalent'' if there exists an isomorphism ''j'' : ''Y''1 → ''Y''2 with ''j'' ''f''1 = ''f''2. This is an
equivalence relation In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. Each equivalence relatio ...
, and the equivalence classes are defined to be the quotient objects of ''X''.


Terminology

The companion terms ''epimorphism'' and '' monomorphism'' were first introduced by Bourbaki. Bourbaki uses ''epimorphism'' as shorthand for a
surjective function In mathematics, a surjective function (also known as surjection, or onto function) is a function that every element can be mapped from element so that . In other words, every element of the function's codomain is the image of one element of ...
. Early category theorists believed that epimorphisms were the correct analogue of surjections in an arbitrary category, similar to how monomorphisms are very nearly an exact analogue of injections. Unfortunately this is incorrect; strong or regular epimorphisms behave much more closely to surjections than ordinary epimorphisms.
Saunders Mac Lane Saunders Mac Lane (4 August 1909 – 14 April 2005) was an American mathematician who co-founded category theory with Samuel Eilenberg. Early life and education Mac Lane was born in Norwich, Connecticut, near where his family lived in Taftville ...
attempted to create a distinction between ''epimorphisms'', which were maps in a concrete category whose underlying set maps were surjective, and ''epic morphisms'', which are epimorphisms in the modern sense. However, this distinction never caught on. It is a common mistake to believe that epimorphisms are either identical to surjections or that they are a better concept. Unfortunately this is rarely the case; epimorphisms can be very mysterious and have unexpected behavior. It is very difficult, for example, to classify all the epimorphisms of rings. In general, epimorphisms are their own unique concept, related to surjections but fundamentally different.


See also

* List of category theory topics * Monomorphism


Notes


References

* * * * * * *


External links

* *{{nlab, id=strong+epimorphism, title=Strong epimorphism Morphisms Algebraic properties of elements