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.
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.
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. 2. 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) — more general patterns this builds on
-
Corank is a kind of Measurement Prime
The proposed strict upward parent is
prime:measurement.
Hierarchy path (1) — routes to 1 parentless root
- Corank → Measurement
Neighborhood in Abstraction Space¶
Corank sits in a moderately populated region (51st percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Matrix Structure & Linear Maps (48 abstractions)
Nearest neighbors
- Transpose of a linear map — 0.90
- Linear map — 0.89
- Semilinear map — 0.89
- Dimension (vector space) — 0.88
- Exchange matrix — 0.87
Computed from structural-signature embeddings · 2026-09-08