- #1
Math Amateur
Gold Member
MHB
- 3,998
- 48
I am beginning to read "Category Theory: Second Edition" by Steve Awodey.
On page 12 (see attachment) he defines isomorphisms as follows:
-------------------------------------------------------------------------------
Definition 1.3. In any category,\(\displaystyle C \), an arrow \(\displaystyle f \ : \ A \to B \) is called an isomorphism, if there is an arrow \(\displaystyle g \ : \ B \to A \) such that
\(\displaystyle g \circ f = 1_A \text{ and } f \circ g = 1_B \)
Since inverses are unique (proof?), we write \(\displaystyle g = f^{-1} \). We say that A is isomorphic to B, written \(\displaystyle A \cong B \), if there exists an isomorphism between them.
----------------------------------------------------------------------------
Awodey then writes:
"... ... (this definition) has the advantage over other possible definitions that it applies in any category. For example, one sometimes defines an isomorphism of sets (monoids etc.) as a bijective function (respectively homomorphism) , that is, one that is "1-1" and onto - making use of the elements of the objects. This is equivalent to our definition in some cases, such as sets and monoids. But note that in the category of posets, Pos, the category theoretic definition gives the right notion, while there are "bijective homomorphisms" between non-isomorphic posets. ... ..."
BUT ... I thought previously that an isomorphism was defined as a bijective homomorphism ... but it seems this is only suitable for some contexts ... ?
I cannot imagine two posets with a bijective homomorphism between them that is not an isomorphism ... can someone come up with an example of such a case ...
Further, since I do not know much about posets can someone supply a good reference - online notes or text? (Awodey is threatening to use posets and monoids as examples throughout the text!)
Peter
On page 12 (see attachment) he defines isomorphisms as follows:
-------------------------------------------------------------------------------
Definition 1.3. In any category,\(\displaystyle C \), an arrow \(\displaystyle f \ : \ A \to B \) is called an isomorphism, if there is an arrow \(\displaystyle g \ : \ B \to A \) such that
\(\displaystyle g \circ f = 1_A \text{ and } f \circ g = 1_B \)
Since inverses are unique (proof?), we write \(\displaystyle g = f^{-1} \). We say that A is isomorphic to B, written \(\displaystyle A \cong B \), if there exists an isomorphism between them.
----------------------------------------------------------------------------
Awodey then writes:
"... ... (this definition) has the advantage over other possible definitions that it applies in any category. For example, one sometimes defines an isomorphism of sets (monoids etc.) as a bijective function (respectively homomorphism) , that is, one that is "1-1" and onto - making use of the elements of the objects. This is equivalent to our definition in some cases, such as sets and monoids. But note that in the category of posets, Pos, the category theoretic definition gives the right notion, while there are "bijective homomorphisms" between non-isomorphic posets. ... ..."
BUT ... I thought previously that an isomorphism was defined as a bijective homomorphism ... but it seems this is only suitable for some contexts ... ?
I cannot imagine two posets with a bijective homomorphism between them that is not an isomorphism ... can someone come up with an example of such a case ...
Further, since I do not know much about posets can someone supply a good reference - online notes or text? (Awodey is threatening to use posets and monoids as examples throughout the text!)
Peter
Last edited: