Monomorphism

From Wikipedia, the free encyclopedia

(Redirected from Monomorphic)
Jump to: navigation, search

In the context of abstract algebra or universal algebra, a monomorphism is simply an injective homomorphism.

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, a map f\colon X \to Y such that

f \circ g_1 = f \circ g_2 \implies g_1 = g_2 for all morphisms g_1, g_2 \colon Z \to X.
Image:Monomorphism-01.png

Monomorphisms are a categorical generalization of injective functions; in some categories the notions coincide, but monomorphisms are more general, as in the examples below.

The dual of a monomorphism is an epimorphism (i.e. a monomorphism in a category C is an epimorphism in the dual category Cop).

Contents

The companion terms monomorphism and epimorphism were originally introduced by 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 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.

Left invertible maps are necessarily monic: if l is a left inverse for f (meaning lf = idX), then f is monic, as

f \circ g_1 = f \circ g_2 \implies lfg_1 = lfg_2 \implies g_1 = g_2

A left invertible map is called a split mono.

A map f\colon X \to Y is monic if and only if the induced map f_*\colon \operatorname{Hom}(Z,X) \to\operatorname{Hom}(Z,Y) is injective for all Z.

Every morphism in a concrete category whose underlying function is injective is a monomorphism. 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 groups and rings, and in any abelian category.

It is not true in general, however, that all monomorphisms must be injective in other categories. For example, in the category Div of divisible abelian groups and group homomorphisms between them there are monomorphisms that are not injective: consider the quotient map q : Q → Q/Z. This is clearly not an injective map; nevertheless, it is a monomorphism in this category. To see this, note that if q o f = q o g for some morphisms f,g : GQ where G is some divisible abelian group then q o h = 0 where h = f - g (this makes sense as this is an additive category). This implies that h(x) is an integer if xG. If h(x) is not 0 then, for instance,

h\left(\frac{x}{4h(x)}\right) = \frac{1}{4}

so that

(q \circ h)\left(\frac{x}{4h(x)}\right) \neq 0,

contradicting q o h = 0, so h(x) = 0 and q is therefore a monomorphism.

There are also useful concepts of regular monomorphism, strong monomorphism, and extremal monomorphism. A regular monomorphism equalizes some parallel pair of morphisms. An extremal monomorphism is a monomorphism that cannot be nontrivially factored through an epimorphism: Precisely, if m=g o e with e an epimorphism, then e is an isomorphism. A strong monomorphism satisfies a certain lifting property with respect to commutative squares involving an epimorphism.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.