nLab permutation matrix

Redirected from "permutation matrices".
Contents

Context

Linear algebra

homotopy theory, (∞,1)-category theory, homotopy type theory

flavors: stable, equivariant, rational, p-adic, proper, geometric, cohesive, directed

models: topological, simplicial, localic, …

see also algebraic topology

Introductions

Definitions

Paths and cylinders

Homotopy groups

Basic facts

Theorems

Contents

Idea

A square matrix is called a permutation matrix if every row and every column has all entries 0 except for precisely one entry, which has value 1 (a special case of monomial matrices).

Permutation matrices represent linear permutation representations in their canonical linear basis.

References

See also

Last revised on June 12, 2024 at 16:12:40. See the history of this page for a list of all contributions to it.