Exchange matrix¶

The permutation matrix with ones on the antidiagonal that reverses coordinate, row, or column order.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4458
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Linear Algebra → Mathematics

Core Idea¶

For dimension n, the exchange matrix J has entry one exactly when row plus column equals n plus one and zero otherwise; multiplying by it reverses the corresponding matrix axis. The antidiagonal permutation maps index i to n-plus-one-minus-i, making J symmetric, orthogonal, and involutory and relating Toeplitz to Hankel structure. 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…

The Backwards Flipper

Imagine a row of toy blocks lined up from first to last. The exchange matrix is a magic flip that puts the row in backward order, so the last block comes first. If you flip it again, the blocks go right back where they started.

The Order-Reversing Grid

The exchange matrix is a square grid of numbers that is all zeros except for ones running along the diagonal from the top-right corner to the bottom-left corner. When you multiply a list of numbers by it, the list comes out reversed. Every row and every column has exactly one 1 in it. Reversing twice gets you back to the original, so using the matrix twice does nothing at all.

Antidiagonal Reversal Matrix

The exchange matrix J of size n has a 1 in each spot where the row number plus the column number equals n+1, and 0 everywhere else, so its ones lie on the antidiagonal. Multiplying a vector by J reverses its order: position i goes to position n+1−i. Multiplying a matrix by J on the left flips its rows; on the right, its columns. Every row and column has exactly one 1, so J is a permutation matrix, and J times J gives the identity. Unlike the identity matrix, whose ones run top-left to bottom-right, J's ones run the other way.

Given a dimension n and a fixed indexing convention, the exchange matrix J is defined by J_ij = 1 if i + j = n + 1 and 0 otherwise. It is the permutation matrix of the reversal permutation i ↦ n+1−i. Left-multiplying a matrix by J reverses its rows; right-multiplying reverses its columns. Each row and column contains exactly one antidiagonal 1. J is symmetric (J = Jᵀ), orthogonal (JᵀJ = I), and involutory (J² = I). It also links Toeplitz and Hankel structure: multiplying a Toeplitz matrix by J yields a Hankel matrix and vice versa. Checking that something really is J means fixing n and the indexing, then verifying the antidiagonal pattern and J² = I.

Scope of Application¶

Exchange matrix belongs to linear algebra and is useful where the analyst can specify the typed linear algebra carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the dimension and indexing convention are fixed, each row and column contains one antidiagonal one, and J squared equals the identity. The scope is broad within that domain but bounded by the need for the dimension and indexing convention are fixed, each row and column contains one antidiagonal one, and J squared equals the identity. 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 dimension and indexing convention are fixed, each row and column contains one antidiagonal one, and J squared equals the identity 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 Exchange matrix 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 Exchange matrix. Exchange matrix 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 linear 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 dimension and indexing convention are fixed, each row and column contains one antidiagonal one, and J squared equals the identity independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of linear algebra because they reuse the typed linear algebra carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, The antidiagonal permutation maps index i to n-plus-one-minus-i, making J symmetric, orthogonal, and involutory and relating Toeplitz to Hankel structure., and type the carrier, state every parameter and convention in the definition, test that the dimension and indexing convention are fixed, each row and column contains one antidiagonal one, and J squared equals the identity, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Exchange matrix Domain-specific

Parents (1) — outgoing typed relations

Exchange matrix is a kind of Symmetry Prime

What makes it its own entry: the domain-specific identity determined by the dimension and indexing convention are fixed, each row and column contains one antidiagonal one, and J squared equals the identity.

Hierarchy path (1) — routes to 1 parentless root

Exchange matrix → is a kind of Symmetry

Neighborhood in Abstraction Space¶

Exchange matrix 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 — Structured Matrices & Linear Maps (43 abstractions)

Nearest neighbors

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