Matrix equivalence¶
The two-sided change-of-basis equivalence B=Q⁻¹AP for same-sized rectangular matrices, classifying representations of one linear map under independent domain and codomain bases and determined solely by rank.
Core Idea¶
Matrix equivalence treats a matrix as coordinates for a linear map between two vector spaces. Since the input and output spaces may have different bases, re-expression acts independently on the columns and rows. This produces the two-sided invertible transformation B=Q⁻¹AP.
For a fixed matrix size over a field, rank is the complete invariant. Row and column operations reduce every matrix to an identity block padded by zeros. The simplicity is precisely what distinguishes equivalence from similarity or congruence, which preserve more specialized structure.
Scope of Application¶
- Linear-map classification. Identifies coordinate presentations that differ only by bases in source and target.
- Normal forms. Reduces a matrix to the rank block form for proof and computation.
- Systems of linear equations. Uses row and column transformations while tracking which solution semantics they preserve.
- Algebraic geometry and modules. Provides a basic orbit model later refined by equivalence over rings or parameter families.
Clarity¶
State matrix dimensions, scalar field, left and right transformation conventions, and whether the basis changes are independent and invertible. Use rank as the complete invariant only over the stated field and fixed size; over rings, additional invariants can appear. Inclusion test: Require matrices of the same dimensions over the same field and invertible, independently chosen row- and column-side transformations. Exclusion test: Exclude similarity, congruence, row equivalence alone, and transformations using singular matrices or changing matrix size. Nearest boundary: Matrix similarity uses the linked transformation P⁻¹AP for one square endomorphism; matrix equivalence permits independent P and Q because domain and codomain bases are separate. Exit condition: The identity ends when either side transformation is noninvertible, when dimensions or field change, or when one requires a single shared basis change. Common misclassifications: It is not equality of matrices entry by entry. It is not matrix similarity. It is not row equivalence alone. It does not preserve eigenvalues, trace, characteristic polynomial, or a bilinear form in general. Nearest named distinctions: Matrix Similarity: Similarity links both sides through one basis change and preserves endomorphism eigenstructure; equivalence uses independent bases and preserves only rank. Matrix Congruence: Congruence uses a transpose-linked action appropriate to bilinear forms, not independent domain and codomain changes. Row Equivalence: Row operations form a one-sided special case and preserve row-space information absent from full equivalence. Equivalent Impedance Transforms: That engineering phrase concerns network behavior and is unrelated to the matrix group action.
Manages Complexity¶
The relation compresses all same-sized matrices into rank-indexed orbits under a product of general linear groups. It exposes how much structure is discarded by independent coordinate choices and tells an analyst when a stronger equivalence notion is necessary.
Abstract Reasoning¶
- Interpret the matrix as a map from a declared domain to codomain.
- Allow independent invertible basis changes on the two spaces.
- Compute rank or reduce by elementary row and column operations.
- Compare canonical rank forms to decide equivalence.
- Recover transformation matrices if a concrete change of coordinates is needed.
- Reject the relation when the problem requires similarity, congruence, or one-sided invariants.
Knowledge Transfer¶
The transferable cargo is orbit classification under independent invertible left and right actions. It transfers across coordinate representations of linear maps when field and dimensions are fixed; it stops where a shared basis, form, spectrum, or module structure must be preserved.
Relationships to Other Abstractions¶
Current abstraction Matrix equivalence Domain-specific
Parents (1) — more general patterns this builds on
-
Matrix equivalence is a kind of Mathematical Relation Domain-specific
Matrix equivalence satisfies the defining boundary of Mathematical Relation: A mathematical relation is a formally specified subset of a Cartesian product, predicate over typed objects, equivalence or order structure, or equation constraining quantities, with arity, domain, parameters, and satisfaction conditions declared.
Hierarchy path (1) — routes to 1 parentless root
- Matrix equivalence → Mathematical Relation
Neighborhood in Abstraction Space¶
Matrix equivalence sits in a crowded region of the domain-specific corpus (27th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Physical & Geometric Dynamical Quantities (29 abstractions)
Nearest neighbors
- Complex Affine Space — 0.90
- Jet Group — 0.89
- Parabolic Cylindrical Coordinates — 0.89
- Matrix Multiplication — 0.89
- Invariant Subspace — 0.88
Computed from structural-signature embeddings · 2026-10-08