<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Monomorphism - Page 10 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Monomorphism&amp;p=9">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Monomorphism&amp;p=11">3.Next</a>
</p>
<p>where G is some divisible group, and 1=''q'' ? ''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 1=''n'' = ''h''(''x'') + 1, since G is a divisible group, there exists some ''y'' ? ''G'' such that 1=''x'' = ''ny'', so 1=''h''(''x'') = ''n'' ''h''(''y'').  From this, and 1=0 <= ''h''(''x'') < ''h''(''x'') + 1 = ''n'', it follows that</p>

<p>
:</p>

<p>Since ''h''(''y'') ? '''Z''', it follows that 1=''h''(''y'') = 0, and thus 1=''h''(''x'') = 0 = ''h''(-''x''), ? ''x'' ? ''G''.  This says that 1=''h'' = 0, as desired.  </p>

<p>To go from that implication to the fact that q is a monomorphism, assume that 1=''q''  ? ''f'' = ''q'' ? ''g'' for some morphisms ''f'', ''g'' : ''G'' -> '''Q''', where G is some divisible group. Then 1=''q'' ? (''f'' - ''g'') = 0, where (''f'' - ''g'') : ''x'' ? ''f''(''x'') - ''g''(''x'').  (Since 1=(''f'' - ''g'')(0) = 0, and 1=(''f'' - ''g'')(''x'' + ''y'') = (''f'' - ''g'')(''x'') + (''f'' - ''g'')(''y''), it follows that (''f'' - ''g'') ? Hom(''G'', '''Q''')).  From the implication just proved, 1=''q''  ? (''f'' - ''g'') = 0  => ''f'' - ''g'' = 0  <=> ? ''x'' ? ''G'', ''f''(''x'') = ''g''(''x'') <=> ''f'' = ''g''.  Hence q is a monomorphism, as claimed.</=></=></p>

<p><big>Properties</big></p>
<p>
*In a <a href="page.php?w=topos">topos</a>, every mono is an equalizer, and any map that is both monic and <a href="page.php?w=epic_morphism">epic</a> is an <a href="page.php?w=isomorphism_%28category_theory%29">isomorphism</a>.<br/>
*Every isomorphism is monic.</p>

<p><big>Related concepts</big></p>
<p>There are also useful concepts of regular monomorphism, extremal monomorphism, immediate monomorphism, strong monomorphism, and split monomorphism. </p>

<p>
* A monomorphism is said to be <b>regular</b> if it is an <a href="page.php?w=equaliser_%28mathematics%29">equalizer</a> of some pair of parallel morphisms. <br/>
* A monomorphism  is said to be <b>extremal</b> if in each representation , where  is an epimorphism, the morphism  is automatically an <a href="page.php?w=isomorphism">isomorphism</a>. <br/>
* A monomorphism  is said to be <b>immediate</b> if in each representation , where  is a monomorphism and  is an epimorphism, the morphism  is automatically an <a href="page.php?w=isomorphism">isomorphism</a>.<br/>
* A monomorphism  is said to be <b>strong</b> if for any epimorphism  and any morphisms  and  such that , there exists a morphism  such that  and .<br/>
* A monomorphism  is said to be <b>split</b> if there exists a morphism  such that  (in this case  is called a left-sided inverse for ).</p>

<p><big>Terminology</big></p>
<p>The companion terms monomorphism and epimorphism were originally introduced by <a href="page.php?w=Nicolas_Bourbaki">Nicolas Bourbaki</a>; 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.  <a href="page.php?w=Saunders_Mac_Lane">Saunders Mac Lane</a> 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.</p>

<p>In adjectival form, a monomorphism is said to be monic; in common shorthand, it is also called a mono.</p>

<p><big>See also</big></p>
<p>
*<a href="page.php?w=Embedding">Embedding</a><br/>
*<a href="page.php?w=Nodal_decomposition">Nodal decomposition</a><br/>
*<a href="page.php?w=Subobject">Subobject</a></p>

<p><big>Notes</big></p>
<p><big>References</big></p>
<p>
*<br/>
*<br/>
*<br/>
*<br/>
*<br/>
* </p>

<p><big>External links</big></p>
<p>
*<br/>
*</p>

<p></p>
<p>
<a accesskey="1" href="page.php?w=Monomorphism&amp;p=9">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Monomorphism&amp;p=11">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
