Implication Details
Claim: If a functor is conservative and is full, then it is full on isomorphisms.
Proof: This is obvious.
Show 35 functors using this implication
- binary coproduct functor on sets
- countable copower functor on sets
- binary diagonal functor on the category of sets
- discrete topology functor
- doubling functor on sets
- empty functor to the category of sets
- forgetful functor from abelian groups to groups
- forgetful functor from rings to monoids
- forgetful functor from commutative rings to rings
- forgetful functor from finite sets to sets
- forgetful functor from finite abelian groups to abelian groups
- forgetful functor from finite groups to groups
- forgetful functor for groups
- forgetful functor from groups to pointed sets
- forgetful functor from Hausdorff spaces to topological spaces
- forgetful functor from groups to monoids
- forgetful functor for rings
- forgetful functor from torsion abelian groups to abelian groups
- forgetful functor from torsion-free abelian groups to abelian groups
- forgetful functor for vector spaces
- free group functor
- identity functor on the category of sets
- inclusion functor from extended natural numbers to ordinal numbers
- indiscrete topology functor
- nerve functor
- opposite category functor
- opposite monoid functor
- contravariant power set functor
- covariant power set functor
- rational product functor
- sequences functor on sets
- span endpoints inclusion
- squaring functor on sets
- trivial functor from the category of groups
- walking morphism representation