Math 2.0

statement proposition

Permuting rows multiplies the determinant by the sign

Statement

Let KK be a commutative ring, let A=(aij)A = (a_{ij}) be an n×nn \times n matrix over KK, and let σ\sigma be a permutation of {1,…,n}\{1, \dots, n\}. Let B=(bij)B = (b_{ij}) be the matrix with bij=aσ(i),jb_{ij} = a_{\sigma(i), j}. Then det⁡B=sgn⁡(σ)det⁡A\det B = \sgn(\sigma) \det A, where det⁡\det is the determinant.

Remarks

In particular, exchanging two rows changes the sign of the determinant. For a permutation matrix PP, this gives det⁡P=±1\det P = \pm 1. The same holds for a permutation of the columns.

Explanations

L1 human

When we exchange two rows, the determinant changes its sign. A general reordering of the rows is a sequence of such exchanges. So it multiplies the determinant by 11 or by −1-1, according to the sign of the permutation.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 9 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Identity matrix object
  2. Matrix definition
  3. Vector space definition
  4. Square matrix definition
  5. Linear map definition
  6. Multilinear map definition
  7. Alternating multilinear map definition
  8. Determinant definition
  9. Permuting rows multiplies the determinant by the sign statement

Sources

  1. Web https://en.wikipedia.org/wiki/Determinant, Basic rules