Implication Details
Claim: A functor is exact if and only if it is left exact and is right exact.
Proof: This holds by definition.
Show 40 functors using this implication
- abelianization functor for groups
- binary coproduct functor on sets
- binary diagonal functor on the category of sets
- binary product functor on sets
- contravariant power set functor
- countable copower functor on sets
- covariant power set functor
- discrete topology functor
- doubling functor on sets
- enveloping group functor
- forgetful functor for groups
- forgetful functor for rings
- forgetful functor for topological spaces
- forgetful functor for vector spaces
- forgetful functor from abelian groups to groups
- forgetful functor from groups to monoids
- forgetful functor from groups to pointed sets
- forgetful functor from rings to monoids
- free group functor
- functor of continuous functions
- fundamental group functor
- group of units functor
- identity functor on the category of sets
- indiscrete topology functor
- modulo p functor
- monoid ring functor
- opposite category functor
- opposite monoid functor
- p-torsion functor
- path components functor
- sequences functor on sets
- simple-group probing functor
- span endpoints inclusion
- squaring functor on sets
- torsion functor
- trivial functor from the category of groups
- trivial functor from the category of sets
- trivial functor from the delooping
- trivial functor from the walking idempotent
- walking isomorphism object inclusion