|
|
| Line 1: |
Line 1: |
| {{about|the mathematical term|other uses|Monomorphic (disambiguation)|and|Polymorphism (disambiguation)}}
| | My name: Ϝrederick Nisbet<br>Age: 28 yeɑrs ߋld<br>Country: Italy<br>Home tߋwn: Cornale <br>Post code: 27050<br>Address: Via Alessandrօ Manzoni 106<br><br>Feel free tߋ surf to my weƄlog; LiveJasmin Creditѕ Hack ([http://getlivejasmincreditshack.Blogspot.com mouse click for source]) |
| | |
| [[Image:Monomorphism-01.png|right|thumb|220px]]
| |
| | |
| In the context of [[abstract algebra]] or [[universal algebra]], a '''monomorphism''' is an [[Injective function|injective]] [[homomorphism]]. A monomorphism from ''X'' to ''Y'' is often denoted with the notation <math>X \hookrightarrow Y</math>.
| |
| | |
| 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 {{nobreak|''f'' : ''X'' → ''Y''}} such that, for all morphisms {{nobreak|''g''<sub>1</sub>, ''g''<sub>2</sub> : ''Z'' → ''X''}},
| |
| : <math>f \circ g_1 = f \circ g_2 \Rightarrow g_1 = g_2.</math>
| |
| | |
| Monomorphisms are a categorical generalization of [[injective function]]s (also called "one-to-one functions"); in some categories the notions coincide, but monomorphisms are more general, as in the [[#Examples|examples below]].
| |
| | |
| The [[categorical dual]] of a monomorphism is an [[epimorphism]], i.e. a monomorphism in a category ''C'' is an epimorphism in the [[dual category]] ''C''<sup>op</sup>. Every [[section (category theory)|section]] is a monomorphism, and every [[retract (category theory)|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 <math>l \circ f = \operatorname{id}_{X}</math>), then ''f'' is monic, as
| |
| : <math>f \circ g_1 = f \circ g_2 \Rightarrow lfg_1 = lfg_2 \Rightarrow g_1 = g_2.</math> | |
| | |
| A left invertible morphism is called a '''[[Section (category theory)|split mono]]'''.
| |
| | |
| However, a monomorphism need not be left-invertible. For example, in the category '''Group''' of all [[Group (mathematics)|groups]] and group morphisms among them, if ''H'' is a subgroup of ''G'' then the inclusion ''f'' : ''H'' → ''G'' is always a monomorphism; but ''f'' has a left inverse in the category if and only if ''H'' has a [[Complement (group theory)|normal complement]] in ''G''.
| |
| | |
| A morphism ''f'' : ''X'' → ''Y''<!--This looks bad when rendered as html?!: <math>f : X \to Y</math> --> is monic if and only if the induced map ''f''<sub>∗</sub> : Hom(''Z'', ''X'') → Hom(''Z'', ''Y'')<!--and similarly: <math>f_{*} : \mathrm{Hom} ( Z, X ) \to \mathrm{Hom} ( Z, Y )</math> -->, defined by <math>f_{*}h = f \circ h</math><!--The function composition symbol renders wrong: ''f''<sub>∗</sub>(''h'') = ''f'' ∘ ''h''--> for all morphisms ''h'' : ''Z'' → ''X'' <!-- <math>h : Z \to X</math> -->, is [[injective]] for all ''Z''.
| |
| | |
| ==Examples==
| |
| | |
| Every morphism in a [[concrete category]] whose underlying [[function (mathematics)|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 group|divisible]] [[abelian group|(abelian) group]]s and [[group homomorphism]]s between them there are monomorphisms that are not injective: consider, for example, the quotient map ''q'' : '''Q''' → '''Q'''/'''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 ''q'' ∘ ''h'' = 0 ⇒ ''h'' = 0, which we will now prove. If ''h'' : ''G'' → '''Q''', where ''G'' is some divisible group, and {{Nowrap|''q'' <small>o</small> ''h''}} = 0, then ''h''(''x'') ∈ '''Z''', ∀ ''x'' ∈ ''G''. Now fix some ''x'' ∈ ''G''. 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 ''y'' ∈ ''G'' such that ''x'' = ''ny'', so ''h''(''x'') = ''n'' ''h''(''y''). From this, and 0 ≤ ''h''(''x'') < ''h''(''x'') + 1=''n'', it follows that
| |
| | |
| :<math>0 \leq \frac{h(x)}{h(x) + 1} = h(y) < 1 </math>
| |
| | |
| Since ''h''(''y'') ∈ '''Z''', it follows that ''h''(''y'') = 0, and thus ''h''(''x'') = 0 = ''h''(−''x''), ∀ ''x'' ∈ ''G''. This says that ''h'' = 0, as desired.
| |
| | |
| To go from that implication to the fact that ''q'' is an monomorphism, assume that {{Nowrap|''q'' <small>o</small> ''f''}} = {{Nowrap|''q'' <small>o</small> ''g''}} for some morphisms ''f'', ''g'' : ''G'' → '''Q''', where ''G'' is some divisible group. Then {{Nowrap|''q'' <small>o</small> (''f'' − ''g'')}} = 0, where (''f'' − ''g'') : ''x'' ↦ ''f''(''x'') − ''g''(''x''). (Since (''f'' − ''g'')(0) = 0, and (''f'' - ''g'')(''x'' + ''y'') = (''f'' - ''g'')(''x'') + (''f'' - ''g'')(''y''), it follows that (''f'' - ''g'') ∈ ''Hom''(''G'', '''Q''')). From the implication just proved, {{Nowrap|''q'' <small>o</small> (''f'' − ''g'')}} = 0 ⇒ ''f'' − ''g'' = 0 ⇔ ∀ ''x'' ∈ ''G'', ''f''(''x'') = ''g''(''x'') ⇔ ''f'' = ''g''. Hence ''q'' is a monomorphism, as claimed.
| |
| | |
| ==Properties==
| |
| *In a [[topos]], every monic is an equalizer, and any map that is both monic and [[epic morphism|epic]] is an isomorphism.
| |
| *Every isomorphism is monic.
| |
| | |
| ==Related concepts==
| |
| | |
| There are also useful concepts of '''regular monomorphism''', '''strong monomorphism''', and '''extremal monomorphism'''. A regular monomorphism [[equaliser (mathematics)|equalizes]] some parallel pair of morphisms. An extremal monomorphism is a monomorphism that cannot be nontrivially factored through an epimorphism: Precisely, if ''m''=''g'' ∘ ''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.
| |
| | |
| ==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 (model theory)|extension]]'', although this has other uses too.
| |
| | |
| ==See also==
| |
| *[[epimorphism]]
| |
| *[[embedding]]
| |
| *[[isomorphism]]
| |
| *[[subobject]]
| |
| | |
| ==References==
| |
| *Francis Borceux (1994), ''Handbook of Categorical Algebra 1'', Cambridge University Press. ISBN 0-521-44178-1.
| |
| *George Bergman (1998), ''[http://math.berkeley.edu/~gbergman/245/index.html An Invitation to General Algebra and Universal Constructions]'', Henry Helson Publisher, Berkeley. ISBN 0-9655211-4-1.
| |
| * {{springer|title=Monomorphism|id=p/m064800}}
| |
| *Jaap van Oosten, [http://www.math.uu.nl/people/jvoosten/syllabi/catsmoeder.pdf Basic Category Theory]
| |
| | |
| [[Category:Morphisms]]
| |
My name: Ϝrederick Nisbet
Age: 28 yeɑrs ߋld
Country: Italy
Home tߋwn: Cornale
Post code: 27050
Address: Via Alessandrօ Manzoni 106
Feel free tߋ surf to my weƄlog; LiveJasmin Creditѕ Hack (mouse click for source)