Coequalizer¶

A universal quotient-like object that makes two parallel morphisms equal and factors every other morphism that equalizes them uniquely.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3727
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Category Theory → Mathematics

Core Idea¶

Coequalizers need not exist in every category, are unique only up to unique isomorphism and the coequalizing map is epic without every epimorphism necessarily being a coequalizer. Two parallel arrows are followed by a morphism that identifies their differing images, and universality selects the least such identification by requiring a unique factorization of every competing coequalizing morphism. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Just-Enough Gluing

Imagine two ways to match up stickers from one pile to a second pile. Wherever the two ways disagree, you glue those second-pile stickers together so they count as one. A coequalizer is gluing together just enough so the two ways agree, and not one bit more.

The Best Way to Glue

In category theory, mathematicians study objects and arrows between them. Suppose you have two arrows going from the same starting object to the same ending object. A coequalizer is a new arrow out of the ending object that 'glues together' whatever the two arrows would send to different places, so after gluing, both routes give the same result. It has to be the smallest, most efficient gluing: any other way of making the two routes agree can be done by first using the coequalizer and then one more step. In some kinds of math worlds, such a best gluing does not exist.

Universal Quotient of a Pair

In category theory, given two parallel morphisms f and g from an object X to an object Y, a coequalizer is an object Q with a morphism q from Y to Q such that q after f equals q after g, and which is universal among such. Universal means that for any other morphism h from Y that also makes the two agree, there is exactly one morphism from Q through which h factors. In the category of sets, Q is Y with the smallest set of identifications forcing f(x) and g(x) to be the same for every x, a quotient. Coequalizers do not exist in every category, and when they do they are unique only up to a unique isomorphism. The map q is always an epimorphism, but not every epimorphism is a coequalizer.

In a category, a coequalizer of parallel morphisms f, g: X to Y is an object Q with a morphism q: Y to Q satisfying q composed with f equals q composed with g, such that for every morphism h: Y to Z with h composed with f equals h composed with g, there exists a unique u: Q to Z with h = u composed with q. Intuitively, q identifies the differing images of f and g, and universality selects the least such identification. It is the colimit of the parallel-pair diagram and the dual of an equalizer. Coequalizers need not exist in a given category; when they exist they are unique up to unique isomorphism. The coequalizing map q is always epic, but not every epimorphism arises as a coequalizer, which is why regular epimorphisms are distinguished. A correct claim names the category, the parallel pair, the candidate Q and q, the equation, and the unique factorization for arbitrary competitors.

Scope of Application¶

Coequalizer belongs to category theory and is useful where the analyst can specify the typed category theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the category, objects and parallel morphisms f and g, candidate object Q and arrow q, equation qf equals qg, arbitrary competing coequalizer arrow, unique factor morphism, commutative diagram and existence and uniqueness-up-to-isomorphism conditions are explicit. The scope is broad within that domain but bounded by the need for the category, objects and parallel morphisms f and g, candidate object Q and arrow q, equation qf equals qg, arbitrary competing coequalizer arrow, unique factor morphism, commutative diagram and existence and uniqueness-up-to-isomorphism conditions are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the category, objects and parallel morphisms f and g, candidate object Q and arrow q, equation qf equals qg, arbitrary competing coequalizer arrow, unique factor morphism, commutative diagram and existence and uniqueness-up-to-isomorphism conditions are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Coequalizer. Coequalizer compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed category theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the category, objects and parallel morphisms f and g, candidate object Q and arrow q, equation qf equals qg, arbitrary competing coequalizer arrow, unique factor morphism, commutative diagram and existence and uniqueness-up-to-isomorphism conditions are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of category theory because they reuse the typed category theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Two parallel arrows are followed by a morphism that identifies their differing images, and universality selects the least such identification by requiring a unique factorization of every competing coequalizing morphism., and type the carrier, state every parameter and convention in the definition, test that the category, objects and parallel morphisms f and g, candidate object Q and arrow q, equation qf equals qg, arbitrary competing coequalizer arrow, unique factor morphism, commutative diagram and existence and uniqueness-up-to-isomorphism conditions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Coequalizer Domain-specific

Parents (1) — outgoing typed relations

Coequalizer is a kind of Closure Prime

It remains its own entry because its identity is fixed by the category, objects and parallel morphisms f and g, candidate object Q and arrow q, equation qf equals qg, arbitrary competing coequalizer arrow, unique factor morphism, commutative diagram and existence and uniqueness-up-to-isomorphism conditions.

Hierarchy path (1) — routes to 1 parentless root

Coequalizer → is a kind of Closure

Neighborhood in Abstraction Space¶

Coequalizer sits in a crowded region of the domain-specific corpus (1^st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Category Theory Foundations (48 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25