Math 2.0

statement theorem

Leibniz formula for determinants

Statement

Let KK be a commutative ring, let n≥1n \ge 1, and let A=(aij)A = (a_{ij}) be an n×nn \times n matrix over KK. Let SnS_n be the group of permutations of {1,…,n}\{1, \dots, n\}, and let sgn⁡(σ)∈{1,−1}\sgn(\sigma) \in \{1, -1\} be the sign of σ\sigma. Then the determinant of AA is det⁡A=∑σ∈Snsgn⁡(σ)∏i=1nai,σ(i).\det A = \sum_{\sigma \in S_n} \sgn(\sigma) \prod_{i=1}^{n} a_{i, \sigma(i)}.

Remarks

The sum has n!n! terms. Each term takes exactly one entry from each row and from each column. For n=3n = 3, the formula is the rule of Sarrus. The formula shows that the determinant is a polynomial in the entries, with integer coefficients.

Explanations

L1 human

To compute a determinant by this formula, choose one entry in each row so that no two lie in the same column. Multiply the chosen entries, and give the product the sign of the permutation. Add these signed products over all choices.

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. Leibniz formula for determinants statement

Sources

  1. Web https://en.wikipedia.org/wiki/Leibniz_formula_for_determinants, Formal statement and proof