Determinant

In mathematics, the determinant is a scalar-valued function of the entries of a square matrix. The determinant of a matrix $A$ is commonly denoted $det(A)$, $det A$, or $|A|$. Its value characterizes some properties of the matrix and the linear map represented, on a given basis, by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the corresponding linear map is an isomorphism.

The determinant is completely determined by the two following properties: the determinant of a product of matrices is the product of their determinants, and the determinant of a triangular matrix is the product of its diagonal entries.

The determinant of a $2 × 2$ matrix is
 * $$\begin{vmatrix} a & b\\c & d \end{vmatrix}=ad-bc,$$

and the determinant of a $3 × 3$ matrix is
 * $$ \begin{vmatrix} a & b & c \\ d & e & f \\ g & h & i \end{vmatrix}= aei + bfg + cdh - ceg - bdi - afh.$$

The determinant of an $n × n$ matrix can be defined in several equivalent ways, the most common being Leibniz formula, which expresses the determinant as a sum of $$n!$$ (the factorial of $n$) signed products of matrix entries. It can be computed by the Laplace expansion, which expresses the determinant as a linear combination of determinants of submatrices, or with Gaussian elimination, which allows computing a row echelon form with the same determinant, equal to the product of the diagonal entries of the row echelon form.

Determinants can also be defined by some of their properties. Namely, the determinant is the unique function defined on the $n × n$ matrices that has the four following properties:
 * 1) The determinant of the identity matrix is $1$.
 * 2) The exchange of two rows multiplies the determinant by $−1$.
 * 3) Multiplying a row by a number multiplies the determinant by this number.
 * 4) Adding a multiple of one row to another row does not change the determinant.

The above properties relating to rows (properties 2–4) may be replaced by the corresponding statements with respect to columns.

The determinant is invariant under matrix similarity. This implies that, given a linear endomorphism of a finite-dimensional vector space, the determinant of the matrix that represents it on a basis does not depend on the chosen basis. This allows defining the determinant of a linear endomorphism, which does not depends on the choice of a coordinate system.

Determinants occur throughout mathematics. For example, a matrix is often used to represent the coefficients in a system of linear equations, and determinants can be used to solve these equations (Cramer's rule), although other methods of solution are computationally much more efficient. Determinants are used for defining the characteristic polynomial of a square matrix, whose roots are the eigenvalues. In geometry, the signed $n$-dimensional volume of a $n$-dimensional parallelepiped is expressed by a determinant, and the determinant of a linear endomorphism determines how the orientation and the $n$-dimensional volume are transformed under the endomorphism. This is used in calculus with exterior differential forms and the Jacobian determinant, in particular for changes of variables in multiple integrals.

Two by two matrices
The determinant of a $2 × 2$ matrix $$\begin{pmatrix} a & b \\c & d \end{pmatrix}$$ is denoted either by "$det$" or by vertical bars around the matrix, and is defined as
 * $$\det \begin{pmatrix} a & b \\c & d \end{pmatrix} = \begin{vmatrix} a & b \\c & d \end{vmatrix} = ad - bc.$$

For example,
 * $$\det \begin{pmatrix} 3 & 7 \\1 & -4 \end{pmatrix} = \begin{vmatrix} 3 & 7 \\ 1 & {-4} \end{vmatrix} = (3 \cdot (-4)) - (7 \cdot 1) = -19.$$

First properties
The determinant has several key properties that can be proved by direct evaluation of the definition for $$2 \times 2$$-matrices, and that continue to hold for determinants of larger matrices. They are as follows: first, the determinant of the identity matrix $$\begin{pmatrix}1 & 0 \\ 0 & 1 \end{pmatrix}$$ is 1. Second, the determinant is zero if two rows are the same:
 * $$\begin{vmatrix} a & b \\ a & b \end{vmatrix} = ab - ba = 0.$$

This holds similarly if the two columns are the same. Moreover,
 * $$\begin{vmatrix}a & b + b' \\ c & d + d' \end{vmatrix} = a(d+d')-(b+b')c = \begin{vmatrix}a & b\\ c & d \end{vmatrix} + \begin{vmatrix}a & b' \\ c & d' \end{vmatrix}.$$

Finally, if any column is multiplied by some number $$r$$ (i.e., all entries in that column are multiplied by that number), the determinant is also multiplied by that number:
 * $$\begin{vmatrix} r \cdot a & b \\ r \cdot c & d \end{vmatrix} = rad - brc = r(ad-bc) = r \cdot \begin{vmatrix} a & b \\c & d \end{vmatrix}.$$

Geometric meaning


If the matrix entries are real numbers, the matrix $A$ can be used to represent two linear maps: one that maps the standard basis vectors to the rows of $A$, and one that maps them to the columns of $A$. In either case, the images of the basis vectors form a parallelogram that represents the image of the unit square under the mapping. The parallelogram defined by the rows of the above matrix is the one with vertices at $(0, 0)$, $(a, b)$, $(a + c, b + d)$, and $(c, d)$, as shown in the accompanying diagram.

The absolute value of $ad − bc$ is the area of the parallelogram, and thus represents the scale factor by which areas are transformed by $A$. (The parallelogram formed by the columns of $A$ is in general a different parallelogram, but since the determinant is symmetric with respect to rows and columns, the area will be the same.)

The absolute value of the determinant together with the sign becomes the oriented area of the parallelogram. The oriented area is the same as the usual area, except that it is negative when the angle from the first to the second vector defining the parallelogram turns in a clockwise direction (which is opposite to the direction one would get for the identity matrix).

To show that $ad − bc$ is the signed area, one may consider a matrix containing two vectors $u ≡ (a, b)$ and $v ≡ (c, d)$ representing the parallelogram's sides. The signed area can be expressed as $|u| |v| sin θ$ for the angle θ between the vectors, which is simply base times height, the length of one vector times the perpendicular component of the other. Due to the sine this already is the signed area, yet it may be expressed more conveniently using the cosine of the complementary angle to a perpendicular vector, e.g. $u^{⊥} = (−b, a)$, so that $|u^{⊥}| |v| cos θ&prime;$ becomes the signed area in question, which can be determined by the pattern of the scalar product to be equal to $ad − bc$ according to the following equations:


 * $$\text{Signed area} =

|\boldsymbol{u}|\,|\boldsymbol{v}|\,\sin\,\theta = \left|\boldsymbol{u}^\perp\right|\,\left|\boldsymbol{v}\right|\,\cos\,\theta' = \begin{pmatrix} -b \\ a \end{pmatrix} \cdot \begin{pmatrix} c \\ d \end{pmatrix} = ad - bc. $$

Thus the determinant gives the scaling factor and the orientation induced by the mapping represented by A. When the determinant is equal to one, the linear mapping defined by the matrix is equi-areal and orientation-preserving.

The object known as the bivector is related to these ideas. In 2D, it can be interpreted as an oriented plane segment formed by imagining two vectors each with origin $(0, 0)$, and coordinates $(a, b)$ and $(c, d)$. The bivector magnitude (denoted by $(a, b) ∧ (c, d)$) is the signed area, which is also the determinant $ad − bc$.

If an $n × n$ real matrix A is written in terms of its column vectors $$A = \left[\begin{array}{c|c|c|c} \mathbf{a}_1 & \mathbf{a}_2 & \cdots & \mathbf{a}_n\end{array}\right]$$, then

A\begin{pmatrix}1 \\ 0\\ \vdots \\0\end{pmatrix} = \mathbf{a}_1, \quad A\begin{pmatrix}0 \\ 1\\ \vdots \\0\end{pmatrix} = \mathbf{a}_2, \quad \ldots, \quad A\begin{pmatrix}0 \\0 \\ \vdots \\1\end{pmatrix} = \mathbf{a}_n. $$

This means that $$A$$ maps the unit n-cube to the n-dimensional parallelotope defined by the vectors $$\mathbf{a}_1, \mathbf{a}_2, \ldots, \mathbf{a}_n,$$ the region $$P = \left\{c_1 \mathbf{a}_1 + \cdots + c_n\mathbf{a}_n \mid 0 \leq c_i\leq 1 \ \forall i\right\}.$$

The determinant gives the signed n-dimensional volume of this parallelotope, $$\det(A) = \pm \text{vol}(P),$$ and hence describes more generally the n-dimensional volume scaling factor of the linear transformation produced by A. (The sign shows whether the transformation preserves or reverses orientation.) In particular, if the determinant is zero, then this parallelotope has volume zero and is not fully n-dimensional, which indicates that the dimension of the image of A is less than n. This means that A produces a linear transformation which is neither onto nor one-to-one, and so is not invertible.

Definition
Let A be a square matrix with n rows and n columns, so that it can be written as
 * $$A = \begin{bmatrix}

a_{1,1} & a_{1,2} & \cdots & a_{1,n} \\ a_{2,1} & a_{2,2} & \cdots & a_{2,n} \\ \vdots & \vdots & \ddots &  \vdots \\ a_{n,1} & a_{n,2} & \cdots & a_{n,n} \end{bmatrix}.$$

The entries $$a_{1,1}$$ etc. are, for many purposes, real or complex numbers. As discussed below, the determinant is also defined for matrices whose entries are in a commutative ring.

The determinant of A is denoted by det(A), or it can be denoted directly in terms of the matrix entries by writing enclosing bars instead of brackets:
 * $$\begin{vmatrix}

a_{1,1} & a_{1,2} & \cdots & a_{1,n} \\ a_{2,1} & a_{2,2} & \cdots & a_{2,n} \\ \vdots & \vdots & \ddots &  \vdots \\ a_{n,1} & a_{n,2} & \cdots & a_{n,n} \end{vmatrix}.$$

There are various equivalent ways to define the determinant of a square matrix A, i.e. one with the same number of rows and columns: the determinant can be defined via the Leibniz formula, an explicit formula involving sums of products of certain entries of the matrix. The determinant can also be characterized as the unique function depending on the entries of the matrix satisfying certain properties. This approach can also be used to compute determinants by simplifying the matrices in question.

3 × 3 matrices
The Leibniz formula for the determinant of a $3 × 3$ matrix is the following:
 * $$\begin{vmatrix}a&b&c\\d&e&f\\g&h&i\end{vmatrix}

= aei + bfg + cdh - ceg - bdi - afh.\ $$ In this expression, each term has one factor from each row, all in different columns, arranged in increasing row order. For example, bdi has b from the first row second column, d from the second row first column, and i from the third row third column. The signs are determined by how many transpositions of factors are necessary to arrange the factors in increasing order of their columns (given that the terms are arranged left-to-right in increasing row order): positive for an even number of transpositions and negative for an odd number. For the example of bdi, the single transposition of bd to db gives dbi, whose three factors are from the first, second and third columns respectively; this is an odd number of transpositions, so the term appears with negative sign. The rule of Sarrus is a mnemonic for the expanded form of this determinant: the sum of the products of three diagonal north-west to south-east lines of matrix elements, minus the sum of the products of three diagonal south-west to north-east lines of elements, when the copies of the first two columns of the matrix are written beside it as in the illustration. This scheme for calculating the determinant of a $3 × 3$ matrix does not carry over into higher dimensions.

n × n matrices
Generalizing the above to higher dimensions, the determinant of an $$n \times n$$ matrix is an expression involving permutations and their signatures. A permutation of the set $$\{1, 2, \dots, n \}$$ is a bijective function $$\sigma$$ from this set to itself, with values $$\sigma(1), \sigma(2),\ldots,\sigma(n)$$ exhausting the entire set. The set of all such permutations, called the symmetric group, is commonly denoted $$S_n$$. The signature $$\sgn(\sigma)$$ of a permutation $$\sigma$$ is $$+1,$$ if the permutation can be obtained with an even number of transpositions (exchanges of two entries); otherwise, it is $$-1.$$

Given a matrix
 * $$A=\begin{bmatrix}

a_{1,1}\ldots a_{1,n}\\ \vdots\qquad\vdots\\ a_{n,1}\ldots a_{n,n} \end{bmatrix},$$ the Leibniz formula for its determinant is, using sigma notation for the sum,
 * $$\det(A)=\begin{vmatrix}

a_{1,1}\ldots a_{1,n}\\ \vdots\qquad\vdots\\ a_{n,1}\ldots a_{n,n} \end{vmatrix} = \sum_{\sigma \in S_n}\sgn(\sigma)a_{1,\sigma(1)}\cdots a_{n,\sigma(n)}.$$

Using pi notation for the product, this can be shortened into
 * $$\det(A) = \sum_{\sigma \in S_n} \left( \sgn(\sigma) \prod_{i=1}^n a_{i,\sigma(i)}\right)$$.

The Levi-Civita symbol $$\varepsilon_{i_1,\ldots,i_n}$$ is defined on the $n$-tuples of integers in $$\{1,\ldots,n\}$$ as $0$ if two of the integers are equal, and otherwise as the signature of the permutation defined by the n-tuple of integers. With the Levi-Civita symbol, the Leibniz formula becomes
 * $$\det(A) = \sum_{i_1,i_2,\ldots,i_n} \varepsilon_{i_1\cdots i_n} a_{1,i_1} \!\cdots a_{n,i_n},$$

where the sum is taken over all $n$-tuples of integers in $$\{1,\ldots,n\}.$$

Characterization of the determinant
The determinant can be characterized by the following three key properties. To state these, it is convenient to regard an $$n \times n$$-matrix A as being composed of its $$n$$ columns, so denoted as
 * $$A = \big ( a_1, \dots, a_n \big ),$$

where the column vector $$a_i$$ (for each i) is composed of the entries of the matrix in the i-th column.

&= \big | a_1, \dots, a_{j-1}, r \cdot v + w, a_{j+1}, \dots, a_n | \\ &= r \cdot | a_1, \dots, v, \dots a_n | + | a_1, \dots, w, \dots, a_n | \end{align}$$
 * 1)  $$\det\left(I\right) = 1$$, where $$I$$ is an identity matrix.
 * 2)  The determinant is multilinear: if the jth column of a matrix $$A$$ is written as a linear combination $$a_j = r \cdot v + w$$ of two column vectors v and w and a number r, then the determinant of A is expressible as a similar linear combination:
 * $$\begin{align}|A|
 * 1) The determinant is alternating: whenever two columns of a matrix are identical, its determinant is 0:
 * $$| a_1, \dots, v, \dots, v, \dots, a_n| = 0.$$

If the determinant is defined using the Leibniz formula as above, these three properties can be proved by direct inspection of that formula. Some authors also approach the determinant directly using these three properties: it can be shown that there is exactly one function that assigns to any $$n \times n$$-matrix A a number that satisfies these three properties. This also shows that this more abstract approach to the determinant yields the same definition as the one using the Leibniz formula.

To see this it suffices to expand the determinant by multi-linearity in the columns into a (huge) linear combination of determinants of matrices in which each column is a standard basis vector. These determinants are either 0 (by property 9) or else ±1 (by properties 1 and 12 below), so the linear combination gives the expression above in terms of the Levi-Civita symbol. While less technical in appearance, this characterization cannot entirely replace the Leibniz formula in defining the determinant, since without it the existence of an appropriate function is not clear.

Immediate consequences
These rules have several further consequences:
 * The determinant is a homogeneous function, i.e., $$\det(cA) = c^n\det(A)$$ (for an $$n \times n$$ matrix $$A$$).
 * Interchanging any pair of columns of a matrix multiplies its determinant by −1. This follows from the determinant being multilinear and alternating (properties 2 and 3 above): $$|a_1, \dots, a_j, \dots a_i, \dots, a_n| = - |a_1, \dots, a_i, \dots, a_j, \dots, a_n|.$$ This formula can be applied iteratively when several columns are swapped. For example $$|a_3, a_1, a_2, a_4 \dots, a_n| = - |a_1, a_3, a_2, a_4, \dots, a_n| = |a_1, a_2, a_3, a_4, \dots, a_n|.$$ Yet more generally, any permutation of the columns multiplies the determinant by the sign of the permutation.
 * If some column can be expressed as a linear combination of the other columns (i.e. the columns of the matrix form a linearly dependent set), the determinant is 0. As a special case, this includes: if some column is such that all its entries are zero, then the determinant of that matrix is 0.
 * Adding a scalar multiple of one column to another column does not change the value of the determinant. This is a consequence of multilinearity and being alternative: by multilinearity the determinant changes by a multiple of the determinant of a matrix with two equal columns, which determinant is 0, since the determinant is alternating.
 * If $$A$$ is a triangular matrix, i.e. $$a_{ij}=0$$, whenever $$i>j$$ or, alternatively, whenever $$i<j$$, then its determinant equals the product of the diagonal entries: $$\det(A) = a_{11} a_{22} \cdots a_{nn} = \prod_{i=1}^n a_{ii}.$$ Indeed, such a matrix can be reduced, by appropriately adding multiples of the columns with fewer nonzero entries to those with more entries, to a diagonal matrix (without changing the determinant). For such a matrix, using the linearity in each column reduces to the identity matrix, in which case the stated formula holds by the very first characterizing property of determinants. Alternatively, this formula can also be deduced from the Leibniz formula, since the only permutation $$\sigma$$ which gives a non-zero contribution is the identity permutation.

Example
These characterizing properties and their consequences listed above are both theoretically significant, but can also be used to compute determinants for concrete matrices. In fact, Gaussian elimination can be applied to bring any matrix into upper triangular form, and the steps in this algorithm affect the determinant in a controlled way. The following concrete example illustrates the computation of the determinant of the matrix $$A$$ using that method:


 * $$A = \begin{bmatrix}

-2 & -1 & 2 \\ 2 & 1 & 4 \\ -3 & 3 & -1 \end{bmatrix}. $$

Combining these equalities gives $$|A| = -|E| = -(18 \cdot 3 \cdot (-1)) = 54.$$

Transpose
The determinant of the transpose of $$A$$ equals the determinant of A:
 * $$\det\left(A^\textsf{T}\right) = \det(A)$$.

This can be proven by inspecting the Leibniz formula. This implies that in all the properties mentioned above, the word "column" can be replaced by "row" throughout. For example, viewing an $n × n$ matrix as being composed of n rows, the determinant is an n-linear function.

Multiplicativity and matrix groups
The determinant is a multiplicative map, i.e., for square matrices $$A$$ and $$B$$ of equal size, the determinant of a matrix product equals the product of their determinants:
 * $$\det(AB) = \det (A) \det (B)$$

This key fact can be proven by observing that, for a fixed matrix $$B$$, both sides of the equation are alternating and multilinear as a function depending on the columns of $$A$$. Moreover, they both take the value $$\det B$$ when $$A$$ is the identity matrix. The above-mentioned unique characterization of alternating multilinear maps therefore shows this claim.

A matrix $$A$$ with entries in a field is invertible precisely if its determinant is nonzero. This follows from the multiplicativity of the determinant and the formula for the inverse involving the adjugate matrix mentioned below. In this event, the determinant of the inverse matrix is given by
 * $$\det\left(A^{-1}\right) = \frac{1}{\det(A)} = [\det(A)]^{-1}$$.

In particular, products and inverses of matrices with non-zero determinant (respectively, determinant one) still have this property. Thus, the set of such matrices (of fixed size $$n$$ over a field $$K$$) forms a group known as the general linear group $$\operatorname{GL}_n(K)$$ (respectively, a subgroup called the special linear group $$\operatorname{SL}_n(K) \subset \operatorname{GL}_n(K)$$. More generally, the word "special" indicates the subgroup of another matrix group of matrices of determinant one. Examples include the special orthogonal group (which if n is 2 or 3 consists of all rotation matrices), and the special unitary group.

Because the determinant respects multiplication and inverses, it is in fact a group homomorphism from $$\operatorname{GL}_n(K)$$ into the multiplicative group $$K^\times$$ of nonzero elements of $$K$$. This homomorphism is surjective and its kernel is $$\operatorname{SL}_n(K)$$ (the matrices with determinant one). Hence, by the first isomorphism theorem, this shows that $$\operatorname{SL}_n(K)$$ is a normal subgroup of $$\operatorname{GL}_n(K)$$, and that the quotient group $$\operatorname{GL}_n(K)/\operatorname{SL}_n(K)$$ is isomorphic to $$K^\times$$.

The Cauchy–Binet formula is a generalization of that product formula for rectangular matrices. This formula can also be recast as a multiplicative formula for compound matrices whose entries are the determinants of all quadratic submatrices of a given matrix.

Laplace expansion
Laplace expansion expresses the determinant of a matrix $$A$$ recursively in terms of determinants of smaller matrices, known as its minors. The minor $$M_{i,j}$$ is defined to be the determinant of the $$(n-1) \times (n-1)$$-matrix that results from $$A$$ by removing the $$i$$-th row and the $$j$$-th column. The expression $$(-1)^{i+j}M_{i,j}$$ is known as a cofactor. For every $$i$$, one has the equality
 * $$\det(A) = \sum_{j=1}^n (-1)^{i+j} a_{i,j} M_{i,j},$$

which is called the Laplace expansion along the $i$th row. For example, the Laplace expansion along the first row ($$i=1$$) gives the following formula:

\begin{vmatrix}a&b&c\\ d&e&f\\ g&h&i\end{vmatrix} = a\begin{vmatrix}e&f\\ h&i\end{vmatrix} - b\begin{vmatrix}d&f\\ g&i\end{vmatrix} + c\begin{vmatrix}d&e\\ g&h\end{vmatrix} $$ Unwinding the determinants of these $$2 \times 2$$-matrices gives back the Leibniz formula mentioned above. Similarly, the Laplace expansion along the $$j$$-th column is the equality
 * $$\det(A)= \sum_{i=1}^n (-1)^{i+j} a_{i,j} M_{i,j}.$$

Laplace expansion can be used iteratively for computing determinants, but this approach is inefficient for large matrices. However, it is useful for computing the determinants of highly symmetric matrix such as the Vandermonde matrix $$\begin{vmatrix} 1 &        1 &         1 & \cdots &         1 \\ x_1 &      x_2 &       x_3 & \cdots &       x_n \\ x_1^2 &    x_2^2 &     x_3^2 & \cdots &     x_n^2 \\ \vdots &   \vdots &    \vdots & \ddots &    \vdots \\ x_1^{n-1} & x_2^{n-1} & x_3^{n-1} & \cdots & x_n^{n-1} \end{vmatrix} = \prod_{1 \leq i < j \leq n} \left(x_j - x_i\right). $$The n-term Laplace expansion along a row or column can be generalized to write an n x n determinant as a sum of $$\tbinom nk$$ terms, each the product of the determinant of a k x k submatrix and the determinant of the complementary (n−k) x (n−k) submatrix.

Adjugate matrix
The adjugate matrix $$\operatorname{adj}(A)$$ is the transpose of the matrix of the cofactors, that is,
 * $$(\operatorname{adj}(A))_{i,j} = (-1)^{i+j} M_{ji}.$$

For every matrix, one has
 * $$(\det A) I = A\operatorname{adj}A = (\operatorname{adj}A)\,A. $$

Thus the adjugate matrix can be used for expressing the inverse of a nonsingular matrix:
 * $$A^{-1} = \frac 1{\det A}\operatorname{adj}A. $$

Block matrices
The formula for the determinant of a $$2 \times 2$$-matrix above continues to hold, under appropriate further assumptions, for a block matrix, i.e., a matrix composed of four submatrices $$A, B, C, D$$ of dimension $$m \times m$$, $$m \times n$$, $$n \times m$$ and $$n \times n$$, respectively. The easiest such formula, which can be proven using either the Leibniz formula or a factorization involving the Schur complement, is
 * $$\det\begin{pmatrix}A& 0\\ C& D\end{pmatrix} = \det(A) \det(D) = \det\begin{pmatrix}A& B\\ 0& D\end{pmatrix}.$$

If $$A$$ is invertible, then it follows with results from the section on multiplicativity that
 * $$\begin{align}

\det\begin{pmatrix}A& B\\ C& D\end{pmatrix} & = \det(A)\det\begin{pmatrix}A& B\\ C& D\end{pmatrix} \underbrace{\det\begin{pmatrix}A^{-1}& -A^{-1} B\\ 0& I_n\end{pmatrix}}_{=\,\det(A^{-1})\,=\,(\det A)^{-1}}\\ & = \det(A) \det\begin{pmatrix}I_m& 0\\ C A^{-1}& D-C A^{-1} B\end{pmatrix}\\ & = \det(A) \det(D - C A^{-1} B), \end{align}$$ which simplifies to $$\det (A) (D - C A^{-1} B)$$ when $$D$$ is a $$1 \times 1$$-matrix.

A similar result holds when $$D$$ is invertible, namely
 * $$\begin{align}

\det\begin{pmatrix}A& B\\ C& D\end{pmatrix} & = \det(D)\det\begin{pmatrix}A& B\\ C& D\end{pmatrix} \underbrace{\det\begin{pmatrix}I_m& 0\\ -D^{-1} C& D^{-1}\end{pmatrix}}_{=\,\det(D^{-1})\,=\,(\det D)^{-1}}\\ & = \det(D) \det\begin{pmatrix}A - B D^{-1} C& B D^{-1}\\ 0& I_n\end{pmatrix}\\ & = \det(D) \det(A - B D^{-1} C). \end{align}$$ Both results can be combined to derive Sylvester's determinant theorem, which is also stated below.

If the blocks are square matrices of the same size further formulas hold. For example, if $$C$$ and $$D$$ commute (i.e., $$CD=DC$$), then


 * $$\det\begin{pmatrix}A& B\\ C& D\end{pmatrix} = \det(AD - BC).$$

This formula has been generalized to matrices composed of more than $$2 \times 2$$ blocks, again under appropriate commutativity conditions among the individual blocks.

For $$A = D $$ and $$B = C$$, the following formula holds (even if $$A$$ and $$B$$ do not commute)
 * $$\det\begin{pmatrix}A& B\\ B& A\end{pmatrix} = \det(A - B) \det(A + B).$$

Sylvester's determinant theorem
Sylvester's determinant theorem states that for A, an $m × n$ matrix, and B, an $n × m$ matrix (so that A and B have dimensions allowing them to be multiplied in either order forming a square matrix):


 * $$\det\left(I_\mathit{m} + AB\right) = \det\left(I_\mathit{n} + BA\right),$$

where Im and In are the $m × m$ and $n × n$ identity matrices, respectively.

From this general result several consequences follow. 1. For the case of column vector c and row vector r, each with m components, the formula allows quick calculation of the determinant of a matrix that differs from the identity matrix by a matrix of rank 1:
 * $\det\left(I_\mathit{m} + cr\right) = 1 + rc.$

2. More generally, for any invertible $m × m$ matrix X,
 * $\det(X + AB) = \det(X) \det\left(I_\mathit{n} + BX^{-1}A\right),$

3. For a column and row vector as above:
 * $\det(X + cr) = \det(X) \det\left(1 + rX^{-1}c\right) = \det(X) + r\,\operatorname{adj}(X)\,c.$

4. For square matrices $A$ and $B$ of the same size, the matrices $AB$ and $BA$ have the same characteristic polynomials (hence the same eigenvalues).

Sum
The determinant of the sum $$A+B$$ of two square matrices of the same size is not in general expressible in terms of the determinants of A and of B.

However, for positive semidefinite matrices $$A$$, $$B$$ and $$C$$ of equal size, $$\det(A + B + C) + \det(C) \geq \det(A + C) + \det(B + C)\text{,}$$ with the corollary $$\det(A + B) \geq \det(A) + \det(B)\text{.}$$

Brunn–Minkowski theorem implies that the $n$th root of determinant is a concave function, when restricted to Hermitian positive-definite $$n\times n$$ matrices. Therefore, if $A$ and $B$ are Hermitian positive-definite $$n\times n$$ matrices, one has $$\sqrt[n]{\det(A+B)}\geq\sqrt[n]{\det(A)}+\sqrt[n]{\det(B)},$$ since the $n$th root of the determinant is a homogeneous function.

Sum identity for 2×2 matrices
For the special case of $$2\times 2$$ matrices with complex entries, the determinant of the sum can be written in terms of determinants and traces in the following identity:
 * $$\det(A+B) = \det(A) + \det(B) + \text{tr}(A)\text{tr}(B) - \text{tr}(AB).$$

$$

This has an application to $$2\times 2$$ matrix algebras. For example, consider the complex numbers as a matrix algebra. The complex numbers have a representation as matrices of the form $$aI + b\mathbf{i} := a\begin{pmatrix} 1 &       0 \\         0 & 1 \end{pmatrix} + b\begin{pmatrix} 0 &        -1 \\         1 & 0 \end{pmatrix}$$ with $$a$$ and $$b$$ real. Since $$\text{tr}(\mathbf{i}) = 0$$, taking $$A = aI$$ and $$B = b\mathbf{i}$$ in the above identity gives
 * $$\det(aI + b\mathbf{i}) = a^2\det(I) + b^2\det(\mathbf{i}) = a^2 + b^2.$$

This result followed just from $$\text{tr}(\mathbf{i}) = 0$$ and $$\det(I) = \det(\mathbf{i}) = 1$$.

Eigenvalues and characteristic polynomial
The determinant is closely related to two other central concepts in linear algebra, the eigenvalues and the characteristic polynomial of a matrix. Let $$A$$ be an $$n \times n$$-matrix with complex entries. Then, by the Fundamental Theorem of Algebra, $$A$$ must have exactly n eigenvalues $$\lambda_1, \lambda_2, \ldots, \lambda_n$$. (Here it is understood that an eigenvalue with algebraic multiplicity $μ$ occurs $μ$ times in this list.) Then, it turns out the determinant of $A$ is equal to the product of these eigenvalues,
 * $$\det(A) = \prod_{i=1}^n \lambda_i=\lambda_1\lambda_2\cdots\lambda_n.$$

The product of all non-zero eigenvalues is referred to as pseudo-determinant.

From this, one immediately sees that the determinant of a matrix $$A$$ is zero if and only if $$0$$ is an eigenvalue of $$A$$. In other words, $$A$$ is invertible if and only if $$0$$ is not an eigenvalue of $$A$$.

The characteristic polynomial is defined as
 * $$\chi_A(t) = \det(t \cdot I - A).$$

Here, $$t$$ is the indeterminate of the polynomial and $$I$$ is the identity matrix of the same size as $$A$$. By means of this polynomial, determinants can be used to find the eigenvalues of the matrix $$A$$: they are precisely the roots of this polynomial, i.e., those complex numbers $$\lambda$$ such that
 * $$\chi_A(\lambda) = 0.$$

A Hermitian matrix is positive definite if all its eigenvalues are positive. Sylvester's criterion asserts that this is equivalent to the determinants of the submatrices
 * $$A_k := \begin{bmatrix}

a_{1,1} & a_{1,2} & \cdots & a_{1,k} \\ a_{2,1} & a_{2,2} & \cdots & a_{2,k} \\ \vdots & \vdots & \ddots &  \vdots \\ a_{k,1} & a_{k,2} & \cdots & a_{k,k} \end{bmatrix}$$

being positive, for all $$k$$ between $$1$$ and $$n$$.

Trace
The trace tr(A) is by definition the sum of the diagonal entries of $A$ and also equals the sum of the eigenvalues. Thus, for complex matrices $A$,
 * $$\det(\exp(A)) = \exp(\operatorname{tr}(A))$$

or, for real matrices $A$,
 * $$\operatorname{tr}(A) = \log(\det(\exp(A))).$$

Here exp($A$) denotes the matrix exponential of $A$, because every eigenvalue $λ$ of $A$ corresponds to the eigenvalue exp($λ$) of exp($A$). In particular, given any logarithm of $A$, that is, any matrix $L$ satisfying
 * $$\exp(L) = A$$

the determinant of $A$ is given by
 * $$\det(A) = \exp(\operatorname{tr}(L)).$$

For example, for $n = 2$, $n = 3$, and $n = 4$, respectively,
 * $$\begin{align}

\det(A) &= \frac{1}{2}\left(\left(\operatorname{tr}(A)\right)^2 - \operatorname{tr}\left(A^2\right)\right), \\ \det(A) &= \frac{1}{6}\left(\left(\operatorname{tr}(A)\right)^3 - 3\operatorname{tr}(A) ~ \operatorname{tr}\left(A^2\right) + 2 \operatorname{tr}\left(A^3\right)\right), \\ \det(A) &= \frac{1}{24}\left(\left(\operatorname{tr}(A)\right)^4 - 6\operatorname{tr}\left(A^2\right)\left(\operatorname{tr}(A)\right)^2 + 3\left(\operatorname{tr}\left(A^2\right)\right)^2 + 8\operatorname{tr}\left(A^3\right)~\operatorname{tr}(A) - 6\operatorname{tr}\left(A^4\right)\right). \end{align}$$

cf. Cayley-Hamilton theorem. Such expressions are deducible from combinatorial arguments, Newton's identities, or the Faddeev–LeVerrier algorithm. That is, for generic $n$, $detA = (−1)^{n}c_{0}$ the signed constant term of the characteristic polynomial, determined recursively from
 * $$c_n = 1; c_{n-m} = -\frac{1}{m}\sum_{k=1}^m c_{n-m+k} \operatorname{tr}\left(A^k\right) (1 \le m \le n)~.$$

In the general case, this may also be obtained from
 * $$\det(A) = \sum_{\begin{array}{c}k_1,k_2,\ldots,k_n \geq 0\\k_1+2k_2+\cdots+nk_n=n\end{array}}\prod_{l=1}^n \frac{(-1)^{k_l+1}}{l^{k_l}k_l!} \operatorname{tr}\left(A^l\right)^{k_l},$$

where the sum is taken over the set of all integers $k_{l} ≥ 0$ satisfying the equation
 * $$\sum_{l=1}^n lk_l = n.$$

The formula can be expressed in terms of the complete exponential Bell polynomial of n arguments sl = −(l – 1)! tr(Al) as
 * $$\det(A) = \frac{(-1)^n}{n!} B_n(s_1, s_2, \ldots, s_n).$$

This formula can also be used to find the determinant of a matrix $A^{I}_{J}$ with multidimensional indices $I = (i_{1}, i_{2}, ..., i_{r})$ and $J = (j_{1}, j_{2}, ..., j_{r})$. The product and trace of such matrices are defined in a natural way as
 * $$(AB)^I_J = \sum_K A^I_K B^K_J, \operatorname{tr}(A) = \sum_I A^I_I.$$

An important arbitrary dimension $n$ identity can be obtained from the Mercator series expansion of the logarithm when the expansion converges. If every eigenvalue of A is less than 1 in absolute value,
 * $$\det(I + A) = \sum_{k=0}^\infty \frac{1}{k!} \left(-\sum_{j=1}^\infty \frac{(-1)^j}{j} \operatorname{tr}\left(A^j\right)\right)^k\,,$$

where $I$ is the identity matrix. More generally, if
 * $$\sum_{k=0}^\infty \frac{1}{k!} \left(-\sum_{j=1}^\infty \frac{(-1)^j s^j}{j}\operatorname{tr}\left(A^j\right)\right)^k\,,$$

is expanded as a formal power series in $s$ then all coefficients of $s$$m$ for $m &gt; n$ are zero and the remaining polynomial is $det(I + sA)$.

Upper and lower bounds
For a positive definite matrix $A$, the trace operator gives the following tight lower and upper bounds on the log determinant
 * $$\operatorname{tr}\left(I - A^{-1}\right) \le \log\det(A) \le \operatorname{tr}(A - I)$$

with equality if and only if $A = I$. This relationship can be derived via the formula for the Kullback-Leibler divergence between two multivariate normal distributions.

Also,
 * $$\frac{n}{\operatorname{tr}\left(A^{-1}\right)} \leq \det(A)^\frac{1}{n} \leq \frac{1}{n}\operatorname{tr}(A) \leq \sqrt{\frac{1}{n}\operatorname{tr}\left(A^2\right)}.$$

These inequalities can be proved by expressing the traces and the determinant in terms of the eigenvalues. As such, they represent the well-known fact that the harmonic mean is less than the geometric mean, which is less than the arithmetic mean, which is, in turn, less than the root mean square.

Derivative
The Leibniz formula shows that the determinant of real (or analogously for complex) square matrices is a polynomial function from $$\mathbf R^{n \times n}$$ to $$\mathbf R$$. In particular, it is everywhere differentiable. Its derivative can be expressed using Jacobi's formula:


 * $$\frac{d \det(A)}{d \alpha} = \operatorname{tr}\left(\operatorname{adj}(A) \frac{d A}{d \alpha}\right).$$

where $$\operatorname{adj}(A)$$ denotes the adjugate of $$A$$. In particular, if $$A$$ is invertible, we have


 * $$\frac{d \det(A)}{d \alpha} = \det(A) \operatorname{tr}\left(A^{-1} \frac{d A}{d \alpha}\right).$$

Expressed in terms of the entries of $$A$$, these are


 * $$ \frac{\partial \det(A)}{\partial A_{ij}}= \operatorname{adj}(A)_{ji} = \det(A)\left(A^{-1}\right)_{ji}.$$

Yet another equivalent formulation is


 * $$\det(A + \epsilon X) - \det(A) = \operatorname{tr}(\operatorname{adj}(A) X) \epsilon + O\left(\epsilon^2\right) = \det(A) \operatorname{tr}\left(A^{-1} X\right) \epsilon + O\left(\epsilon^2\right)$$,

using big O notation. The special case where $$A = I$$, the identity matrix, yields


 * $$\det(I + \epsilon X) = 1 + \operatorname{tr}(X) \epsilon + O\left(\epsilon^2\right).$$

This identity is used in describing Lie algebras associated to certain matrix Lie groups. For example, the special linear group $$\operatorname{SL}_n$$ is defined by the equation $$\det A = 1$$. The above formula shows that its Lie algebra is the special linear Lie algebra $$\mathfrak{sl}_n$$ consisting of those matrices having trace zero.

Writing a $$3 \times 3$$-matrix as $$A = \begin{bmatrix}a & b & c\end{bmatrix}$$ where $$a, b,c$$ are column vectors of length 3, then the gradient over one of the three vectors may be written as the cross product of the other two:


 * $$\begin{align}

\nabla_\mathbf{a}\det(A) &= \mathbf{b} \times \mathbf{c} \\ \nabla_\mathbf{b}\det(A) &= \mathbf{c} \times \mathbf{a} \\ \nabla_\mathbf{c}\det(A) &= \mathbf{a} \times \mathbf{b}. \end{align}$$

History
Historically, determinants were used long before matrices: A determinant was originally defined as a property of a system of linear equations. The determinant "determines" whether the system has a unique solution (which occurs precisely if the determinant is non-zero). In this sense, determinants were first used in the Chinese mathematics textbook The Nine Chapters on the Mathematical Art (九章算術, Chinese scholars, around the 3rd century BCE). In Europe, solutions of linear systems of two equations were expressed by Cardano in 1545 by a determinant-like entity.

Determinants proper originated separately from the work of Seki Takakazu in 1683 in Japan and parallelly of Leibniz in 1693. stated, without proof, Cramer's rule. Both Cramer and also were led to determinants by the question of plane curves passing through a given set of points.

Vandermonde (1771) first recognized determinants as independent functions. gave the general method of expanding a determinant in terms of its complementary minors: Vandermonde had already given a special case. Immediately following, Lagrange (1773) treated determinants of the second and third order and applied it to questions of elimination theory; he proved many special cases of general identities.

Gauss (1801) made the next advance. Like Lagrange, he made much use of determinants in the theory of numbers. He introduced the word "determinant" (Laplace had used "resultant"), though not in the present signification, but rather as applied to the discriminant of a quantic. Gauss also arrived at the notion of reciprocal (inverse) determinants, and came very near the multiplication theorem.

The next contributor of importance is Binet (1811, 1812), who formally stated the theorem relating to the product of two matrices of m columns and n rows, which for the special case of $m = n$ reduces to the multiplication theorem. On the same day (November 30, 1812) that Binet presented his paper to the Academy, Cauchy also presented one on the subject. (See Cauchy–Binet formula.) In this he used the word "determinant" in its present sense, summarized and simplified what was then known on the subject, improved the notation, and gave the multiplication theorem with a proof more satisfactory than Binet's. With him begins the theory in its generality.

used the functional determinant which Sylvester later called the Jacobian. In his memoirs in Crelle's Journal for 1841 he specially treats this subject, as well as the class of alternating functions which Sylvester has called alternants. About the time of Jacobi's last memoirs, Sylvester (1839) and Cayley began their work. introduced the modern notation for the determinant using vertical bars.

The study of special forms of determinants has been the natural result of the completion of the general theory. Axisymmetric determinants have been studied by Lebesgue, Hesse, and Sylvester; persymmetric determinants by Sylvester and Hankel; circulants by Catalan, Spottiswoode, Glaisher, and Scott; skew determinants and Pfaffians, in connection with the theory of orthogonal transformation, by Cayley; continuants by Sylvester; Wronskians (so called by Muir) by Christoffel and Frobenius; compound determinants by Sylvester, Reiss, and Picquet; Jacobians and Hessians by Sylvester; and symmetric gauche determinants by Trudi. Of the textbooks on the subject Spottiswoode's was the first. In America, Hanus (1886), Weld (1893), and Muir/Metzler (1933) published treatises.

Cramer's rule
Determinants can be used to describe the solutions of a linear system of equations, written in matrix form as $$Ax = b$$. This equation has a unique solution $$x$$ if and only if $$\det (A)$$ is nonzero. In this case, the solution is given by Cramer's rule:
 * $$x_i = \frac{\det(A_i)}{\det(A)} \qquad i = 1, 2, 3, \ldots, n$$

where $$A_i$$ is the matrix formed by replacing the $$i$$-th column of $$A$$ by the column vector $$b$$. This follows immediately by column expansion of the determinant, i.e.
 * $$\det(A_i) =

\det\begin{bmatrix}a_1 & \ldots & b & \ldots & a_n\end{bmatrix} = \sum_{j=1}^n x_j\det\begin{bmatrix}a_1 & \ldots & a_{i-1} & a_j & a_{i+1} & \ldots & a_n\end{bmatrix} = x_i\det(A) $$ where the vectors $$a_j$$ are the columns of A. The rule is also implied by the identity


 * $$A\, \operatorname{adj}(A) = \operatorname{adj}(A)\, A = \det(A)\, I_n.$$

Cramer's rule can be implemented in $$\operatorname O(n^3)$$ time, which is comparable to more common methods of solving systems of linear equations, such as LU, QR, or singular value decomposition.

Linear independence
Determinants can be used to characterize linearly dependent vectors: $$\det A$$ is zero if and only if the column vectors (or, equivalently, the row vectors) of the matrix $$A$$ are linearly dependent. For example, given two linearly independent vectors $$v_1, v_2 \in \mathbf R^3$$, a third vector $$v_3$$ lies in the plane spanned by the former two vectors exactly if the determinant of the $$3 \times 3$$-matrix consisting of the three vectors is zero. The same idea is also used in the theory of differential equations: given functions $$f_1(x), \dots, f_n(x)$$ (supposed to be $$n-1$$ times differentiable), the Wronskian is defined to be
 * $$W(f_1, \ldots, f_n)(x) =

\begin{vmatrix} f_1(x) &        f_2(x) & \cdots &         f_n(x) \\ f_1'(x) &       f_2'(x) & \cdots &        f_n'(x) \\ \vdots &        \vdots & \ddots &         \vdots \\ f_1^{(n-1)}(x) & f_2^{(n-1)}(x) & \cdots & f_n^{(n-1)}(x) \end{vmatrix}.$$

It is non-zero (for some $$x$$) in a specified interval if and only if the given functions and all their derivatives up to order $$n-1$$ are linearly independent. If it can be shown that the Wronskian is zero everywhere on an interval then, in the case of analytic functions, this implies the given functions are linearly dependent. See the Wronskian and linear independence. Another such use of the determinant is the resultant, which gives a criterion when two polynomials have a common root.

Orientation of a basis
The determinant can be thought of as assigning a number to every sequence of n vectors in Rn, by using the square matrix whose columns are the given vectors. The determinant will be nonzero if and only if the sequence of vectors is a basis for Rn. In that case, the sign of the determinant determines whether the orientation of the basis is consistent with or opposite to the orientation of the standard basis. In the case of an orthogonal basis, the magnitude of the determinant is equal to the product of the lengths of the basis vectors. For instance, an orthogonal matrix with entries in Rn represents an orthonormal basis in Euclidean space, and hence has determinant of ±1 (since all the vectors have length 1). The determinant is +1 if and only if the basis has the same orientation. It is −1 if and only if the basis has the opposite orientation.

More generally, if the determinant of A is positive, A represents an orientation-preserving linear transformation (if A is an orthogonal $2 × 2$ or $3 × 3$ matrix, this is a rotation), while if it is negative, A switches the orientation of the basis.

Volume and Jacobian determinant
As pointed out above, the absolute value of the determinant of real vectors is equal to the volume of the parallelepiped spanned by those vectors. As a consequence, if $$f : \mathbf R^n \to \mathbf R^n$$ is the linear map given by multiplication with a matrix $$A$$, and $$S \subset \mathbf R^n$$ is any measurable subset, then the volume of $$f(S)$$ is given by $$|\det(A)|$$ times the volume of $$S$$. More generally, if the linear map $$f : \mathbf R^n \to \mathbf R^m$$ is represented by the $$m \times n$$-matrix $$A$$, then the $$n$$-dimensional volume of $$f(S)$$ is given by:
 * $$\operatorname{volume}(f(S)) = \sqrt{\det\left(A^\textsf{T} A\right)} \operatorname{volume}(S).$$

By calculating the volume of the tetrahedron bounded by four points, they can be used to identify skew lines. The volume of any tetrahedron, given its vertices $$a, b, c, d$$, $$\frac 1 6 \cdot |\det(a-b,b-c,c-d)|$$, or any other combination of pairs of vertices that form a spanning tree over the vertices.

For a general differentiable function, much of the above carries over by considering the Jacobian matrix of f. For
 * $$f: \mathbf R^n \rightarrow \mathbf R^n,$$

the Jacobian matrix is the $n × n$ matrix whose entries are given by the partial derivatives
 * $$D(f) = \left(\frac {\partial f_i}{\partial x_j}\right)_{1 \leq i, j \leq n}.$$

Its determinant, the Jacobian determinant, appears in the higher-dimensional version of integration by substitution: for suitable functions f and an open subset U of Rn (the domain of f), the integral over f(U) of some other function $φ : R^{n} → R^{m}$ is given by
 * $$\int_{f(U)} \phi(\mathbf{v})\, d\mathbf{v} = \int_U \phi(f(\mathbf{u})) \left|\det(\operatorname{D}f)(\mathbf{u})\right| \,d\mathbf{u}.$$

The Jacobian also occurs in the inverse function theorem.

When applied to the field of Cartography, the determinant can be used to measure the rate of expansion of a map near the poles.

Determinant of an endomorphism
The above identities concerning the determinant of products and inverses of matrices imply that similar matrices have the same determinant: two matrices A and B are similar, if there exists an invertible matrix X such that $A = X^{−1}BX$. Indeed, repeatedly applying the above identities yields


 * $$\det(A) = \det(X)^{-1} \det(B)\det(X) = \det(B) \det(X)^{-1} \det(X) = \det(B).$$

The determinant is therefore also called a similarity invariant. The determinant of a linear transformation
 * $$T : V \to V$$

for some finite-dimensional vector space V is defined to be the determinant of the matrix describing it, with respect to an arbitrary choice of basis in V. By the similarity invariance, this determinant is independent of the choice of the basis for V and therefore only depends on the endomorphism T.

Square matrices over commutative rings
The above definition of the determinant using the Leibniz rule holds works more generally when the entries of the matrix are elements of a commutative ring $$R$$, such as the integers $$\mathbf Z$$, as opposed to the field of real or complex numbers. Moreover, the characterization of the determinant as the unique alternating multilinear map that satisfies $$\det(I) = 1$$ still holds, as do all the properties that result from that characterization.

A matrix $$A \in \operatorname{Mat}_{n \times n}(R)$$ is invertible (in the sense that there is an inverse matrix whose entries are in $$R$$) if and only if its determinant is an invertible element in $$R$$. For $$R = \mathbf Z$$, this means that the determinant is +1 or −1. Such a matrix is called unimodular.

The determinant being multiplicative, it defines a group homomorphism
 * $$\operatorname{GL}_n(R) \rightarrow R^\times, $$

between the general linear group (the group of invertible $$n \times n$$-matrices with entries in $$R$$) and the multiplicative group of units in $$R$$. Since it respects the multiplication in both groups, this map is a group homomorphism.

Given a ring homomorphism $$f : R \to S$$, there is a map $$\operatorname{GL}_n(f) : \operatorname{GL}_n(R) \to \operatorname{GL}_n(S)$$ given by replacing all entries in $$R$$ by their images under $$f$$. The determinant respects these maps, i.e., the identity
 * $$f(\det((a_{i,j}))) = \det ((f(a_{i,j})))$$

holds. In other words, the displayed commutative diagram commutes.

For example, the determinant of the complex conjugate of a complex matrix (which is also the determinant of its conjugate transpose) is the complex conjugate of its determinant, and for integer matrices: the reduction modulo $$m$$ of the determinant of such a matrix is equal to the determinant of the matrix reduced modulo $$m$$ (the latter determinant being computed using modular arithmetic). In the language of category theory, the determinant is a natural transformation between the two functors $$\operatorname{GL}_n$$ and $$(-)^\times$$. Adding yet another layer of abstraction, this is captured by saying that the determinant is a morphism of algebraic groups, from the general linear group to the multiplicative group,
 * $$\det: \operatorname{GL}_n \to \mathbb G_m.$$

Exterior algebra
The determinant of a linear transformation $$T : V \to V$$ of an $$n$$-dimensional vector space $$V$$ or, more generally a free module of (finite) rank $$n$$ over a commutative ring $$R$$ can be formulated in a coordinate-free manner by considering the $$n$$-th exterior power $$\bigwedge^n V$$ of $$V$$. The map $$T$$ induces a linear map
 * $$\begin{align}

\bigwedge^n T: \bigwedge^n V &\rightarrow \bigwedge^n V \\ v_1 \wedge v_2 \wedge \dots \wedge v_n &\mapsto T v_1 \wedge T v_2 \wedge \dots \wedge T v_n. \end{align}$$

As $$\bigwedge^n V$$ is one-dimensional, the map $$\bigwedge^n T$$ is given by multiplying with some scalar, i.e., an element in $$R$$. Some authors such as use this fact to define the determinant to be the element in $$R$$ satisfying the following identity (for all $$v_i \in V$$):
 * $$\left(\bigwedge^n T\right)\left(v_1 \wedge \dots \wedge v_n\right) = \det(T) \cdot v_1 \wedge \dots \wedge v_n.$$

This definition agrees with the more concrete coordinate-dependent definition. This can be shown using the uniqueness of a multilinear alternating form on $$n$$-tuples of vectors in $$R^n$$. For this reason, the highest non-zero exterior power $$\bigwedge^n V$$ (as opposed to the determinant associated to an endomorphism) is sometimes also called the determinant of $$V$$ and similarly for more involved objects such as vector bundles or chain complexes of vector spaces. Minors of a matrix can also be cast in this setting, by considering lower alternating forms $$\bigwedge^k V$$ with $$k < n$$.

Generalizations and related notions
Determinants as treated above admit several variants: the permanent of a matrix is defined as the determinant, except that the factors $$\sgn(\sigma)$$ occurring in Leibniz's rule are omitted. The immanant generalizes both by introducing a character of the symmetric group $$S_n$$ in Leibniz's rule.

Determinants for finite-dimensional algebras
For any associative algebra $$A$$ that is finite-dimensional as a vector space over a field $$F$$, there is a determinant map
 * $$\det : A \to F.$$

This definition proceeds by establishing the characteristic polynomial independently of the determinant, and defining the determinant as the lowest order term of this polynomial. This general definition recovers the determinant for the matrix algebra $$A = \operatorname{Mat}_{n \times n}(F)$$, but also includes several further cases including the determinant of a quaternion,
 * $$\det (a + ib+jc+kd) = a^2 + b^2 + c^2 + d^2$$,

the norm $$N_{L/F} : L \to F$$ of a field extension, as well as the Pfaffian of a skew-symmetric matrix and the reduced norm of a central simple algebra, also arise as special cases of this construction.

Infinite matrices
For matrices with an infinite number of rows and columns, the above definitions of the determinant do not carry over directly. For example, in the Leibniz formula, an infinite sum (all of whose terms are infinite products) would have to be calculated. Functional analysis provides different extensions of the determinant for such infinite-dimensional situations, which however only work for particular kinds of operators.

The Fredholm determinant defines the determinant for operators known as trace class operators by an appropriate generalization of the formula
 * $$\det(I+A) = \exp(\operatorname{tr}(\log(I+A))). $$

Another infinite-dimensional notion of determinant is the functional determinant.

Operators in von Neumann algebras
For operators in a finite factor, one may define a positive real-valued determinant called the Fuglede−Kadison determinant using the canonical trace. In fact, corresponding to every tracial state on a von Neumann algebra there is a notion of Fuglede−Kadison determinant.

Related notions for non-commutative rings
For matrices over non-commutative rings, multilinearity and alternating properties are incompatible for $n ≥ 2$, so there is no good definition of the determinant in this setting.

For square matrices with entries in a non-commutative ring, there are various difficulties in defining determinants analogously to that for commutative rings. A meaning can be given to the Leibniz formula provided that the order for the product is specified, and similarly for other definitions of the determinant, but non-commutativity then leads to the loss of many fundamental properties of the determinant, such as the multiplicative property or that the determinant is unchanged under transposition of the matrix. Over non-commutative rings, there is no reasonable notion of a multilinear form (existence of a nonzero with a regular element of R as value on some pair of arguments implies that R is commutative). Nevertheless, various notions of non-commutative determinant have been formulated that preserve some of the properties of determinants, notably quasideterminants and the Dieudonné determinant. For some classes of matrices with non-commutative elements, one can define the determinant and prove linear algebra theorems that are very similar to their commutative analogs. Examples include the q-determinant on quantum groups, the Capelli determinant on Capelli matrices, and the Berezinian on supermatrices (i.e., matrices whose entries are elements of $$\mathbb Z_2$$-graded rings). Manin matrices form the class closest to matrices with commutative elements.

Calculation
Determinants are mainly used as a theoretical tool. They are rarely calculated explicitly in numerical linear algebra, where for applications such as checking invertibility and finding eigenvalues the determinant has largely been supplanted by other techniques. Computational geometry, however, does frequently use calculations related to determinants.

While the determinant can be computed directly using the Leibniz rule this approach is extremely inefficient for large matrices, since that formula requires calculating $$n!$$ ($$n$$ factorial) products for an $$n \times n$$-matrix. Thus, the number of required operations grows very quickly: it is of order $$n!$$. The Laplace expansion is similarly inefficient. Therefore, more involved techniques have been developed for calculating determinants.

Gaussian elemination
Gaussian elimination consists of left multiplying a matrix by elementary matrices for getting a matrix in a row echelon form. One can restrict the computation to elementary matrices of determinant $1$. In this case, the determinant of the resulting row echelon form equals the determinant of the initial matrix. As a row echelon form is a triangular matrix, its determinant is the product of the entries of its diagonal.

So, the determinant can be computed for almost free from the result of a Gaussian elemination.

Decomposition methods
Some methods compute $$\det(A)$$ by writing the matrix as a product of matrices whose determinants can be more easily computed. Such techniques are referred to as decomposition methods. Examples include the LU decomposition, the QR decomposition or the Cholesky decomposition (for positive definite matrices). These methods are of order $$\operatorname O(n^3)$$, which is a significant improvement over $$\operatorname O (n!)$$.

For example, LU decomposition expresses $$A$$ as a product
 * $$ A = PLU. $$

of a permutation matrix $$P$$ (which has exactly a single $$1$$ in each column, and otherwise zeros), a lower triangular matrix $$L$$ and an upper triangular matrix $$U$$. The determinants of the two triangular matrices $$L$$ and $$U$$ can be quickly calculated, since they are the products of the respective diagonal entries. The determinant of $$P$$ is just the sign $$\varepsilon$$ of the corresponding permutation (which is $$+1$$ for an even number of permutations and is $$ -1 $$ for an odd number of permutations). Once such a LU decomposition is known for $$A$$, its determinant is readily computed as


 * $$ \det(A) = \varepsilon \det(L)\cdot\det(U). $$

Further methods
The order $$\operatorname O(n^3)$$ reached by decomposition methods has been improved by different methods. If two matrices of order $$n$$ can be multiplied in time $$M(n)$$, where $$M(n) \ge n^a$$ for some $$a>2$$, then there is an algorithm computing the determinant in time $$O(M(n))$$. This means, for example, that an $$\operatorname O(n^{2.376})$$ algorithm for computing the determinant exists based on the Coppersmith–Winograd algorithm. This exponent has been further lowered, as of 2016, to 2.373.

In addition to the complexity of the algorithm, further criteria can be used to compare algorithms. Especially for applications concerning matrices over rings, algorithms that compute the determinant without any divisions exist. (By contrast, Gauss elimination requires divisions.) One such algorithm, having complexity $$\operatorname O(n^4)$$ is based on the following idea: one replaces permutations (as in the Leibniz rule) by so-called closed ordered walks, in which several items can be repeated. The resulting sum has more terms than in the Leibniz rule, but in the process several of these products can be reused, making it more efficient than naively computing with the Leibniz rule. Algorithms can also be assessed according to their bit complexity, i.e., how many bits of accuracy are needed to store intermediate values occurring in the computation. For example, the Gaussian elimination (or LU decomposition) method is of order $$\operatorname O(n^3)$$, but the bit length of intermediate values can become exponentially long. By comparison, the Bareiss Algorithm, is an exact-division method (so it does use division, but only in cases where these divisions can be performed without remainder) is of the same order, but the bit complexity is roughly the bit size of the original entries in the matrix times $$n$$.

If the determinant of A and the inverse of A have already been computed, the matrix determinant lemma allows rapid calculation of the determinant of $A + uv^{T}$, where u and v are column vectors.

Charles Dodgson (i.e. Lewis Carroll of Alice's Adventures in Wonderland fame) invented a method for computing determinants called Dodgson condensation. Unfortunately this interesting method does not always work in its original form.