A morphism m: A → B in a category that is left-cancellative: for any pair of parallel morphisms g,h with domain X, mg = mh implies g = h. It generalizes the notion of an injective structure-preserving map in concrete categories.

Principle

Monomorphisms preserve distinguishability of arrows into their domain: composing any two different maps with a mono cannot make them equal; in Set this corresponds to injectivity of functions.

Demonstration

The inclusion map i: S → T of a subset S ⊆ T in Set is a monomorphism because two maps into S that differ remain different after inclusion; in the category of modules, an injective linear map is a mono.

Misapplication

Assuming every monomorphism splits (has a left-inverse) or that monomorphism and injectivity coincide in all categories; in some categories a mono need not be an embedding of underlying sets or may fail to split.

Consequence

Monomorphisms behave like embeddings: they identify a subobject up to isomorphism and support constructions of subobjects and limits; chains of monos can describe filtrations or substructure lattices.

Reversal

A non-monomorphism can collapse distinct incoming morphisms upon composition, so it does not faithfully reflect distinctions among maps into its domain.

Boundary

Monomorphism is a purely categorical condition and must not be conflated with pointwise injectivity except in categories presented on sets; details depend on the ambient category and its notion of equality of arrows.

Semantic Tension

Monomorphism versus injective map: in concrete categories these align often but not always; also tension between 'mono as subobject' and ‘mono as cancellable arrow' in abstract contexts.

Synthesis

A monomorphism is the categorical abstraction of an injective embedding: it is a left-cancellative morphism that, where possible, identifies an object as a bona fide subobject while respecting the ambient category's arrow equality.