Math 2.0

Linear and multilinear algebra; matrix theory Determinants Theorem

Leibniz formula for determinants

Builds on Determinant

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.

Reading path

To understand this page from the ground up, read these 9 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • 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

Further reading

  1. Web https://en.wikipedia.org/wiki/Leibniz_formula_for_determinants, Formal statement and proof
About this page
Tag016PE4VZ8Q
URIm2://016PE4VZ8Q
Kindstatement, theorem
WritingW0 stub
MSC15A15
StatusThis copy of the site has no build data. Run m2 status 016PE4VZ8Q.
UsesDeterminant
Same as

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

No page links to this page yet.