isomorphism

A morphism $f : A \to B$ is an isomorphism if it has an inverse, i.e. a morphism $f^{-1} : B \to A$ satisfying $f \circ f^{-1} = \id_B$ and $f^{-1} \circ f = \id_A$.

Relevant implications

• epimorphism andextremal monomorphism implies isomorphism
• epimorphism andmonomorphism () implies isomorphism
• epimorphism andsplit monomorphism implies isomorphism
• epimorphism () implies isomorphism
• extremal epimorphism andmonomorphism implies isomorphism
• isomorphism implies effective epimorphism andsplit epimorphism
• isomorphism implies effective monomorphism andsplit monomorphism
• isomorphism () implies normal epimorphism
• isomorphism () implies normal monomorphism
• monomorphism andsplit epimorphism implies isomorphism
• monomorphism () implies isomorphism

Examples

There are 2 morphisms with this property.

• identity map of a group
• identity map of a set

Counterexamples

There are 13 morphisms without this property.

• Baer-Specker relations
• embedding of A3 into S3
• embedding of integer into rational numbers
• example of a non-strong extremal monomorphism
• handle of the universal fork
• inclusion of positive numbers
• map from the empty set
• map into the singleton set
• multiplication with 2
• presentation of the walking idempotent
• reduction modulo p
• universal morphism
• universal split epimorphism

Unknown

There are 0 morphisms for which the database has no information on whether they satisfy this property.

—