Corank¶

A rank-deficiency quantity, commonly the codomain dimension minus rank of a linear map or matrix, equivalently the dimension of its cokernel in finite-dimensional linear algebra.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3912
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Linear Algebra, Rank and Nullity → Mathematics

Core Idea¶

The corank of a finite-dimensional linear map is dim(W) minus rank, equal to the dimension of its cokernel; related contexts use an explicitly stated complementary-rank convention. Rank counts realized independent output directions and subtraction from codomain dimension counts missing directions or independent linear constraints. 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 linear algebra. It is codomain-side deficiency dual to kernel-side nullity. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the ambient dimension and rank convention are stated and corank is computed as their exact complement for that context fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

How would you explain it like I'm…

Missing Directions Count

Think of a flat page where you can draw left-right and up-down. Suppose a drawing machine can only ever make marks along one left-right line, no matter what you tell it. It reaches one direction and misses one. Corank counts how many directions the machine can never reach.

Directions the Map Can't Reach

In math, some rules, called linear maps, take arrows in one space and turn them into arrows in another space. The target space has a certain number of independent directions, like left-right, forward-back, and up-down in a room. The rank is how many of those directions the map can actually reach. The corank is how many directions are left over that it can never reach: the number of target directions minus the rank. For example, if a map lands in 3-D space but everything it makes lies flat on a tabletop, its rank is 2 and its corank is 1.

Codomain Rank Deficiency

For a linear map from a vector space V to a finite-dimensional vector space W, the corank is dim(W) minus the rank. The rank counts how many independent output directions the map actually produces — the dimension of its image — so the corank counts how many independent directions in W are missed. Equivalently, it's the number of independent linear conditions an output must satisfy to be reachable, and it equals the dimension of the cokernel. Corank is the output-side counterpart of nullity: nullity measures what collapses on the input side, corank measures what's missing on the output side. Because the word is also used in related settings with other conventions, you should always say what dimension you're subtracting from.

For a linear map T from V to a finite-dimensional space W, the corank is dim(W) minus rank(T). Since the rank counts the independent directions actually realized in the image, the corank counts the directions of W that the image misses, which is exactly the dimension of the cokernel W / im(T). Equivalently, it counts the independent linear constraints that every output must satisfy. Corank is the codomain-side deficiency dual to nullity, which measures the kernel on the domain side; rank-nullity relates nullity to dim(V), while corank relates to dim(W). A map is surjective exactly when its corank is 0. In related contexts, such as matrices or other structures with a rank notion, corank is defined as an explicitly stated complement of rank relative to a stated ambient dimension, and the convention must be specified before values are compared.

Scope of Application¶

Corank belongs to linear algebra and is useful where the analyst can specify a linear map V to W or an m-by-n matrix, image rank, codomain dimension, cokernel or left nullspace, and a convention for matroids or infinite dimensions, then evaluate the ambient dimension and rank convention are stated and corank is computed as their exact complement for that context. The scope is broad within that domain but bounded by the need for the ambient dimension and rank convention are stated and corank is computed as their exact complement for that context. 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 ambient dimension and rank convention are stated and corank is computed as their exact complement for that context 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 Corank 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 Corank. Corank 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: a linear map V to W or an m-by-n matrix, image rank, codomain dimension, cokernel or left nullspace, and a convention for matroids or infinite dimensions. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the ambient dimension and rank convention are stated and corank is computed as their exact complement for that context independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of linear algebra because they reuse a linear map V to W or an m-by-n matrix, image rank, codomain dimension, cokernel or left nullspace, and a convention for matroids or infinite dimensions, Rank counts realized independent output directions and subtraction from codomain dimension counts missing directions or independent linear constraints., and type the carrier, state every parameter and convention in the definition, test that the ambient dimension and rank convention are stated and corank is computed as their exact complement for that context, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Corank Domain-specific

Parents (1) — outgoing typed relations

Corank is a kind of Measurement Prime

Corank measures missing independent output dimensions.

Hierarchy path (1) — routes to 1 parentless root

Corank → is a kind of Measurement

Neighborhood in Abstraction Space¶

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

Family — Structured Matrices & Linear Maps (43 abstractions)

Nearest neighbors

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