Cokernel¶

The universal quotient of a morphism's codomain that makes the morphism vanish, realized for linear maps as codomain modulo image.

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

Core Idea¶

Cokernels are dual to kernels, measure obstruction to surjectivity, and support exact sequences, quotient objects, homology, presentations, and categorical colimits where they exist. A morphism is followed by a map annihilating its image; universality requires every other annihilating map to factor uniquely through the quotient. 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.

The load-bearing residual is not the broad topic of category theory and homological algebra. It is the domain-specific identity determined by the category and zero morphisms, input morphism, candidate quotient map, vanishing composite, universal factorization and uniqueness, existence assumptions, and concrete image quotient where applicable are explicit.

How would you explain it like I'm…

The Can't-Make Leftovers

Imagine a machine that can only make piles of 3 stones. You bring a heap of stones and take away as many piles of 3 as you can. Whatever is left over, 0, 1 or 2 stones, is the part the machine could never make. The cokernel is a way of keeping track of what a machine can't reach.

What's Left After Squashing

In math, a map sends things from one place to another, but it might not reach everything in the target. The cokernel measures what gets missed. The trick is to treat everything the map does reach as if it were zero, and see what is left over. For example, if a map multiplies whole numbers by 3, it reaches only multiples of 3. Treat those as zero and you are left with just three kinds of numbers: remainder 0, 1 or 2. If the map reaches everything, the cokernel is just zero.

Quotient by the Image

For a map f from A to B (between groups or vector spaces, say), the image is everything in B that f actually hits. The Cokernel is B with the image collapsed to zero—the quotient of B by the image of f. It measures the obstruction to f being surjective (onto): the Cokernel is zero exactly when f reaches all of B. It is the dual of the kernel, which measures the failure to be one-to-one by collecting what f sends to zero. In category theory it is defined more generally by a universal property: the Cokernel is the map out of B that kills the image of f, through which every other map killing the image passes in exactly one way.

Given a morphism f: A → B in a category with zero morphisms, a Cokernel is a morphism q: B → C with q∘f = 0 that is universal: any g: B → D with g∘f = 0 factors uniquely as g = h∘q. In concrete settings such as modules or abelian groups this is the quotient B/im(f), so the Cokernel measures the failure of f to be surjective. It is dual to the kernel, and it is a special case of a colimit, so it need not exist in every category—existence must be assumed or proved. Cokernels underpin exact sequences, quotient objects, homology, and presentations of modules. The defining data are the category and its zero morphisms, the input morphism, the quotient map, the vanishing composite, and the uniqueness of the factorization; it is a precise construction, not the broad subject of homological algebra.

Scope of Application¶

Cokernel belongs to category theory and homological algebra and is useful where the analyst can specify the typed category theory and homological algebra carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the category and zero morphisms, input morphism, candidate quotient map, vanishing composite, universal factorization and uniqueness, existence assumptions, and concrete image quotient where applicable are explicit. The scope is broad within that domain but bounded by the need for the category and zero morphisms, input morphism, candidate quotient map, vanishing composite, universal factorization and uniqueness, existence assumptions, and concrete image quotient where applicable are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the category and zero morphisms, input morphism, candidate quotient map, vanishing composite, universal factorization and uniqueness, existence assumptions, and concrete image quotient where applicable 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. A bare label is insufficient because the name Cokernel can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 Cokernel. Cokernel 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 and homological algebra carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the category and zero morphisms, input morphism, candidate quotient map, vanishing composite, universal factorization and uniqueness, existence assumptions, and concrete image quotient where applicable are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of category theory and homological algebra because they reuse the typed category theory and homological algebra carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, A morphism is followed by a map annihilating its image; universality requires every other annihilating map to factor uniquely through the quotient., and type the carrier, state every parameter and convention in the definition, test that the category and zero morphisms, input morphism, candidate quotient map, vanishing composite, universal factorization and uniqueness, existence assumptions, and concrete image quotient where applicable are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Cokernel Domain-specific

Parents (1) — outgoing typed relations

Cokernel is a kind of Partition Prime

It remains its own entry because its identity is fixed by the category and zero morphisms, input morphism, candidate quotient map, vanishing composite, universal factorization and uniqueness, existence assumptions, and concrete image quotient where applicable.

Hierarchy path (1) — routes to 1 parentless root

Cokernel → is a kind of Partition → presupposes Set and Membership

Neighborhood in Abstraction Space¶

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

Family — Homological Algebra Constructions (19 abstractions)

Nearest neighbors

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