# Leibniz formula for determinants

In algebra, the **Leibniz formula**, named in honor of Gottfried Leibniz, expresses the determinant of a square matrix in terms of permutations of the matrix elements. If *A* is an *n*×*n* matrix, where *a*_{i,j} is the entry in the *i*th row and *j*th column of *A*, the formula is

where sgn is the sign function of permutations in the permutation group *S*_{n}, which returns +1 and −1 for even and odd permutations, respectively.

Another common notation used for the formula is in terms of the Levi-Civita symbol and makes use of the Einstein summation notation, where it becomes

From alternation it follows that any term with repeated indices is zero. The sum can therefore be restricted to tuples with non-repeating indices, i.e. permutations:

**Existence:** We now show that F, where F is the function defined by the Leibniz formula, has these three properties.