Math 2.0

statement theorem

Laplace expansion along a row

Statement

Let KK be a commutative ring, let n≥2n \ge 2, and let A=(aij)A = (a_{ij}) be an n×nn \times n matrix over KK. Let CijC_{ij} be the cofactors of AA. Then, for each row ii, det⁡A=∑j=1naijCij=∑j=1n(−1)i+jaijMij.\det A = \sum_{j=1}^{n} a_{ij} C_{ij} = \sum_{j=1}^{n} (-1)^{i+j} a_{ij} M_{ij}.

Remarks

The expansion reduces a determinant of order nn to nn determinants of order n−1n - 1. It is efficient when the chosen row contains many zeros. There is a similar expansion along a column. Replace the entries of row ii by those of another row kk. Then the sum is 00, because the new matrix has two equal rows.

Explanations

L1 human

To expand a determinant along a row, take each entry of that row. Multiply it by its cofactor, which is the signed determinant of what is left after deleting its row and column. Add these products.

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 11 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. Minor definition
  10. Cofactor definition
  11. Laplace expansion along a row statement

Sources

  1. Web https://en.wikipedia.org/wiki/Laplace_expansion, lead section