CACrown ArchivesThe cinema collection
Menu
Research dossier · General Reference

Permutation matrix

matrices representing permutation of vector elements; with exactly one 1 per row and column

Cross-disciplinary reference desk with index cards, atlas, dictionary and catalogue
General referenceInterpretive dossier study · Crown Archives visual atlas
Record originEnglish Wikipedia
Text licenseCC BY-SA 4.0
Source revisionSep 7, 2026
Entity authorityQ851512
Source-derived summary

In mathematics, particularly in matrix theory, a permutation matrix is a square binary matrix that has exactly one entry of 1 in each row and each column with all other entries 0. An n × n permutation matrix can represent a permutation of n elements. Pre-multiplying an n-row matrix M by a permutation matrix P, forming PM, results in permuting the rows of M, while post-multiplying an n-column matrix M, forming MP, permutes the columns of M.

Every permutation matrix P is orthogonal, with its inverse equal to its transpose:

P

1

=

P

T

{\displaystyle P^{-1}=P^{\mathsf {T}}}

. Indeed, permutation matrices can be characterized as the orthogonal matrices whose entries are all non-negative.

The two permutation/matrix correspondences

There are two natural one-to-one correspondences between permutations and permutation matrices, one of which works along the rows of the matrix, the other along its columns. Here is an example, starting with a permutation π in two-line form at the upper left:

π

:

(

1

2

3

4

3

2

4

1

)

R

π

:

(

0

0

1

0

0

1

0

0

0

0

0

1

1

0

0

0

)

C

π

:

(

0

0

0

1

0

1

0

0

1

0

0

0

0

0

1

0

)

π

1

:

(

1

2

3

4

4

2

1

3

)

{\displaystyle {\begin{matrix}\pi \colon {\begin{pmatrix}1&2&3&4\\3&2&4&1\end{pmatrix}}&\longleftrightarrow &R_{\pi }\colon {\begin{pmatrix}0&0&1&0\\0&1&0&0\\0&0&0&1\\1&0&0&0\end{pmatrix}}\\[5pt]{\Big \updownarrow }&&{\Big \updownarrow }\\[5pt]C_{\pi }\colon {\begin{pmatrix}0&0&0&1\\0&1&0&0\\1&0&0&0\\0&0&1&0\end{pmatrix}}&\longleftrightarrow &\pi ^{-1}\colon {\begin{pmatrix}1&2&3&4\\4&2&1&3\end{pmatrix}}\end{matrix}}}

The row-based correspondence takes the permutation π to the matrix

R

π

{\displaystyle R_{\pi }}

at the upper right. The first row of

R

π

{\displaystyle R_{\pi }}

has its 1 in the third column because

π

(

1

)

=

3

{\displaystyle \pi (1)=3}

. More generally, we have

R

π

=

(

r

i

j

)

{\displaystyle R_{\pi }=(r_{ij})}

where

r

i

j

=

1

{\displaystyle r_{ij}=1}

when

j

=

π

(

i

)

{\displaystyle j=\pi (i)}

and

r

i

j

=

0

{\displaystyle r_{ij}=0}

otherwise.

The column-based correspondence takes π to the matrix

C

π

{\displaystyle C_{\pi }}

at the lower left. The first column of

C

π

{\displaystyle C_{\pi }}

has its 1 in the third row because

π

(

1

)

=

3

{\displaystyle \pi (1)=3}

.

Editorial summary

“Permutation matrix” enters the record as matrices representing permutation of vector elements; with exactly one 1 per row and column. Crown Archives preserves that source wording while asking what Permutation, matrix and matrices can confirm, complicate or overturn.

Editorial reviewA practical starting point whose main value is the path it opens into stronger specialist and primary sources. The current 381-word lead offers orientation but no explicit four-digit date, so chronology should not be assumed. The selected authority fields contribute no independent date. Its strongest next move is a source search built around Permutation, matrix and matrices.
Editorial analysis

Why this record matters

“Permutation matrix” is worth following because a concise public description often conceals a longer documentary argument. Here, Permutation, matrix and matrices provides the most credible route into that argument.

Evidence profile

Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Sep 7, 2026. The linked authority identifier is Q851512. None of the 0 selected statements returned an explicit reference.

Critical limits

Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.

How to read it

Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.

Best used for
  • Subject orientation
  • Search vocabulary
  • Locating named sources
Verify next

The closest primary source, responsible institution and strongest cited specialist reference.

Three-step research path

  1. Establish the record: confirm the title “Permutation matrix”, its source revision and the description used here.
  2. Expand the search: follow Permutation matrix primary sources, Permutation matrix archive and Permutation research across catalogues and specialist indexes.
  3. Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.

Questions for further research

  1. Which source most directly establishes the central claim about “Permutation matrix”?
  2. What terminology or title could unlock a more precise catalogue search?
  3. Which institution is responsible for the underlying evidence?
Subject index

Search terms from this dossier

Source & attribution

This entry incorporates text from Permutation matrix” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.