Functor

Functors encode invariants of isomorphism classes

Since functors take compositions to compositions and identities to identities, they also take isomorphisms to isomorphisms, thereby preserving isomorphism classes. #m/thm/cat

Proof

Let 𝐹 :𝖢 →𝖣 and 𝑓 ∈𝖢(𝑋,𝑌) be an isomorphism. Then there exists 𝑓−1 ∈𝖢(𝑌,𝑋) such that 𝑓−1𝑓 =id𝑋 and 𝑓𝑓−1 =id𝑌. It follows that (𝐹𝑓−1)(𝐹𝑓) =𝐹id𝑋 =id𝐹𝑋 and (𝐹𝑓)(𝐹𝑓−1) =(𝐹id𝑌) =id𝐹𝑌. Therefore 𝐹𝑓 ∈𝖣(𝐹𝑋,𝐹𝑌) has inverse 𝐹𝑓−1 ∈𝖣(𝐹𝑌,𝐹𝑋), whence 𝐹𝑓 is an isomorphism.

This is a fundamental idea that captures the very essence of what makes category theory useful. For example, in Topology MOC, the value an arbitrary functor 𝐹 :𝖳𝗈𝗉 →𝖢 assigns to any topological space is immediately a Topological property.1

Fully faithful

If a functor 𝐹 is Fully faithful functor this becomes bidirectional:

𝑋≅𝑌⟺𝐹𝑋≅𝐹𝑌


#state/tidy | #lang/en | #SemBr

Footnotes

  1. 2020, Topology: A categorical approach, p. 11 ↩