# Determinant

In mathematics, the **determinant** is a scalar value that is a function of the entries of a square matrix. It allows characterizing some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible, and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one).
The determinant of a matrix *A* is denoted det(*A*), det *A*, or |*A*|.

Each determinant of a 2 × 2 matrix in this equation is called a minor of the matrix *A*. This procedure can be extended to give a recursive definition for the determinant of an *n* × *n* matrix, known as *Laplace expansion*.

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 matrix, whose roots are the eigenvalues. In geometry, the signed n-dimensional volume of a n-dimensional parallelepiped is expressed by a determinant. This is used in calculus with exterior differential forms and the Jacobian determinant, in particular for changes of variables in multiple integrals.

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. Perhaps the simplest way to express the determinant is by considering the elements in the top row and the respective minors; starting at the left, multiply the element by the minor, then subtract the product of the next element and its minor, and alternate adding and subtracting such products until all elements in the top row have been exhausted. For example, here is the result for a 4 × 4 matrix:

Another way to define the determinant is expressed in terms of the columns of the matrix. If we write an *n* × *n* matrix *A* in terms of its column vectors

where *b* and *c* are scalars, *v* is any vector of size *n* and *I* is the identity matrix of size *n*. These equations say that the determinant is a linear function of each column, that interchanging adjacent columns reverses the sign of the determinant, and that the determinant of the identity matrix is 1. These properties mean that the determinant is an alternating multilinear function of the columns that maps the identity matrix to the underlying unit scalar. These suffice to uniquely calculate the determinant of any square matrix. Provided the underlying scalars form a field (more generally, a commutative ring), the definition below shows that such a function exists, and it can be shown to be unique.^{[2]}

Equivalently, the determinant can be expressed as a sum of products of entries of the matrix where each product has *n* terms and the coefficient of each product is −1 or 1 or 0 according to a given rule: it is a polynomial expression of the matrix entries. This expression grows rapidly with the size of the matrix (an *n* × *n* matrix has *n*! terms), so it will first be given explicitly for the case of 2 × 2 matrices and 3 × 3 matrices, followed by the rule for arbitrary size matrices, which subsumes these two cases.

Assume *A* is a square matrix with *n* rows and *n* columns, so that it can be written as

The entries can be numbers or expressions (as happens when the determinant is used to define a characteristic polynomial); the definition of the determinant depends only on the fact that they can be added and multiplied together in a commutative manner.

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:

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 *θ′*, which can be determined by the pattern of the scalar product to be equal to *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*.^{[3]}

The rule of Sarrus is a mnemonic for the 3 × 3 matrix 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.

The determinant of a matrix of arbitrary size can be defined by the Leibniz formula or the Laplace formula.

is notation for the product of the entries at positions (*i*, σ_{i}), where *i* ranges from 1 to *n*:

The determinant has many properties. Some basic properties of determinants are

This can be deduced from some of the properties below, but it follows most easily directly from the Leibniz formula (or from the Laplace expansion), in which the identity permutation is the only one that gives a non-zero contribution.

A number of additional properties relate to the effects on the determinant of changing particular rows or columns:

Properties 1, 8 and 10 — which all follow from the Leibniz formula — completely characterize the determinant; in other words the determinant is the unique function from *n* × *n* matrices to scalars that is *n*-linear alternating in the columns, and takes the value 1 for the identity matrix (this characterization holds even if scalars are taken in any given commutative ring). 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. For matrices over non-commutative rings, properties 8 and 9 are incompatible for *n* ≥ 2,^{[7]} so there is no good definition of the determinant in this setting.

Property 2 above implies that properties for columns have their counterparts in terms of rows:

Property 5 says that the determinant on *n* × *n* matrices is homogeneous of degree *n*. These properties can be used to facilitate the computation of determinants by simplifying the matrix to the point where the determinant can be determined immediately. Specifically, for matrices with coefficients in a field, properties 13 and 14 can be used to transform any matrix into a triangular matrix, whose determinant is given by property 7; this is essentially the method of Gaussian elimination. For example, the determinant of

Here, *B* is obtained from *A* by adding −1/2×the first row to the second, so that det(*A*) = det(*B*). *C* is obtained from *B* by adding the first to the third row, so that det(*C*) = det(*B*). Finally, *D* is obtained from *C* by exchanging the second and third row, so that det(*D*) = −det(*C*). The determinant of the (upper) triangular matrix *D* is the product of its entries on the main diagonal: (−2) · 2 · 4.5 = −18. Therefore, det(*A*) = −det(*D*) = +18.

A block matrix has a Gaussian decomposition in terms of the Schur complement:

The first and last matrices on the RHS have determinant unity, so we have

This is Schur's determinant identity, with **A** − **BD**^{−1}**C** being the Schur complement of **D** in **M**.

The determinant of a matrix product of square matrices equals the product of their determinants:

Thus the determinant is a *multiplicative map*. This property is a consequence of the characterization given above of the determinant as the unique *n*-linear alternating function of the columns with value 1 on the identity matrix, since the function M_{n}(*K*) → *K* that maps *M* ↦ det(*AM*) can easily be seen to be *n*-linear and alternating in the columns of *M*, and takes the value det(*A*) at the identity. The formula can be generalized to (square) products of rectangular matrices, giving the Cauchy–Binet formula, which also provides an independent proof of the multiplicative property.

The determinant det(*A*) of a matrix *A* is non-zero if and only if *A* is invertible or, yet another equivalent statement, if its rank equals the size of the matrix. If so, the determinant of the inverse matrix is given by

In particular, products and inverses of matrices with determinant one still have this property. Thus, the set of such matrices (of fixed size *n*) form a group known as the special linear group. 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.

Laplace expansion expresses the determinant of a matrix in terms of its minors. The minor *M*_{i,j} is defined to be the determinant of the (*n*−1) × (*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

which is called the *Laplace expansion along the ith row*. Similarly, the *Laplace expansion along the jth column* is the equality

Laplace expansion can be used iteratively for computing determinants, but this is efficient for small matrices and sparse matrices only, since for general matrices this requires to compute an exponential number of determinants, even if care is taken to compute each minor only once.
The adjugate matrix adj(*A*) is the transpose of the matrix of the cofactors, that is,

Thus the adjugate matrix can be used for expressing the inverse of a nonsingular matrix:

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):

where *I*_{m} and *I*_{n} are the *m* × *m* and *n* × *n* identity matrices, respectively.

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

Conversely, determinants can be used to find the eigenvalues of the matrix A: they are the solutions of the characteristic equation

where *I* is the identity matrix of the same dimension as A and λ is a (scalar) number which solves the equation (there are no more than n solutions, where n is the dimension of A).

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

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,

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

cf. Cayley-Hamilton theorem. Such expressions are deducible from combinatorial arguments, Newton's identities, or the Faddeev–LeVerrier algorithm. That is, for generic n, det*A* = (−1)^{n}*c*_{0} the signed constant term of the characteristic polynomial, determined recursively from

where the sum is taken over the set of all integers *k _{l}* ≥ 0 satisfying the equation

The formula can be expressed in terms of the complete exponential Bell polynomial of *n* arguments *s*_{l} = −(*l* – 1)! tr(*A*^{l}) as

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

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,

is expanded as a formal power series in s then all coefficients of s^{m} for *m* > *n* are zero and the remaining polynomial is det(*I* + *sA*).

For a positive definite matrix *A*, the trace operator gives the following tight lower and upper bounds on the log determinant

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

These inequalities can be proved by bringing the matrix *A* to the diagonal form. 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.

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.

It has recently been shown that Cramer's rule can be implemented in O(*n*^{3}) time,^{[11]} which is comparable to more common methods of solving systems of linear equations, such as LU, QR, or singular value decomposition.

Suppose *A*, *B*, *C*, and *D* are matrices of dimension *n* × *n*, *n* × *m*, *m* × *n*, and *m* × *m*, respectively. Then

This can be seen from the Leibniz formula for determinants, or from a decomposition like (for the former case)

When the blocks are square matrices of the same order further formulas hold. For example, if *C* and *D* commute (i.e., *CD* = *DC*), then the following formula comparable to the determinant of a 2 × 2 matrix holds:^{[13]}

Generally, if all pairs of *n* × *n* matrices of the *np* × *np* block matrix commute, then the determinant of the block matrix is equal to the determinant of the matrix obtained by computing the determinant of the block matrix considering its entries as the entries of a *p* × *p* matrix.^{[14]} As the previous formula shows, for *p* = 2, this criterion is sufficient, but not necessary.

When *A* = *D* and *B* = *C*, the blocks are square matrices of the same order and the following formula holds (even if *A* and *B* do not commute)

When *D* is a 1×1 matrix, *B* is a column vector, and *C* is a row vector then

It can be seen, e.g. using the Leibniz formula, that the determinant of real (or analogously for complex) square matrices is a polynomial function from **R**^{n×n} to **R**, and so it is everywhere differentiable. Its derivative can be expressed using Jacobi's formula:^{[15]}

where adj(*A*) denotes the adjugate of *A*. In particular, if *A* is invertible, we have

This identity is used in describing the tangent space of certain matrix Lie groups.

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

The determinant is therefore also called a similarity invariant. The determinant of a linear transformation

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*.

The determinant of a linear transformation *T* : *V* → *V* of an *n*-dimensional vector space *V* can be formulated in a coordinate-free manner by considering the *n*th exterior power Λ^{n}*V* of *V*. *T* induces a linear map

As Λ^{n}*V* is one-dimensional, the map Λ^{n}T is given by multiplying with some scalar. This scalar coincides with the determinant of *T*, that is to say

For this reason, the highest non-zero exterior power Λ^{n}(*V*) 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 Λ^{k}*V* with *k* < *n*.

from the set of all *n* × *n* matrices with entries in a field *K* to that field satisfying the following three properties: first, *D* is an *n*-linear function: considering all but one column of *A* fixed, the determinant is linear in the remaining column, that is

for any column vectors *v*_{1}, ..., *v*_{n}, and *w* and any scalars (elements of *K*) *a* and *b*. Second, *D* is an alternating function: for any matrix *A* with two identical columns, *D*(*A*) = 0. Finally, *D*(*I*_{n}) = 1, where *I*_{n} is the identity matrix.

This fact also implies that every other *n*-linear alternating function *F*: M_{n}(*K*) → *K* satisfies

This definition can also be extended where *K* is a commutative ring *R*, in which case a matrix is invertible if and only if its determinant is an invertible element in *R*. For example, a matrix *A* with entries in **Z**, the integers, is invertible (in the sense that there exists an inverse matrix with integer entries) if the determinant is +1 or −1. Such a matrix is called unimodular.

between the group of invertible *n* × *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. Secondly, given a ring homomorphism *f*: *R* → *S*, there is a map *GL _{n}(f)*: GL

_{n}(

*R*) → GL

_{n}(

*S*) given by replacing all entries in

*R*by their images under

*f*. The determinant respects these maps, i.e., given a matrix

*A*= (

*a*

_{i,j}) with entries in

*R*, the identity

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 GL_{n} and (⋅)^{×} (see also *Natural transformation § Determinant*).^{[16]} 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,

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

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

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.

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 bilinear form^{[clarify]} 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. Manin matrices form the class closest to matrices with commutative elements.

Determinants of matrices in superrings (that is, Z_{2}-graded rings) are known as Berezinians or superdeterminants.^{[17]}

The permanent of a matrix is defined as the determinant, except that the factors sgn(*σ*) 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 are mainly used as a theoretical tool. They are rarely calculated explicitly in numerical linear algebra, where for applications like checking invertibility and finding eigenvalues the determinant has largely been supplanted by other techniques.^{[18]} Computational geometry, however, does frequently use calculations related to determinants.^{[19]}

Naive methods of implementing an algorithm to compute the determinant include using the Leibniz formula or Laplace's formula. Both these approaches are extremely inefficient for large matrices, though, since the number of required operations grows very quickly: it is of order *n*! (*n* factorial) for an *n* × *n* matrix *M*. For example, Leibniz's formula requires calculating *n*! products. Therefore, more involved techniques have been developed for calculating determinants.

Given a matrix *A*, some methods compute its determinant by writing *A* 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 O(*n*^{3}), which is a significant improvement over O(*n*!)

The LU decomposition expresses *A* in terms of a lower triangular matrix *L*, an upper triangular matrix *U* and a permutation matrix *P*:

(See determinant identities.) Moreover, the decomposition can be chosen such that *L* is a unitriangular matrix and therefore has determinant 1, in which case the formula further simplifies to

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.

Since the definition of the determinant does not need divisions, a question arises: do fast algorithms exist that do not need divisions? This is especially interesting for matrices over rings. Indeed, algorithms with run-time proportional to *n*^{4} exist. An algorithm of Mahajan and Vinay, and Berkowitz is based on closed ordered walks (shortened as *clow*).^{[20]} It computes more products than the determinant definition requires, but some of these products cancel and the sum of these products can be computed more efficiently. The final algorithm looks very much like an iterated product of triangular matrices.

If two matrices of order *n* can be multiplied in time *M*(*n*), where *M*(*n*) ≥ *n*^{a} for some *a* > 2, then the determinant can be computed in time O(*M*(*n*)).^{[21]} This means, for example, that an O(*n*^{2.376}) algorithm exists based on the Coppersmith–Winograd algorithm.

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.

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 O(*n*^{3}), but the bit length of intermediate values can become exponentially long.^{[22]} The Bareiss Algorithm, on the other hand, is an exact-division method based on Sylvester's identity is also of order *n*^{3}, but the bit complexity is roughly the bit size of the original entries in the matrix times *n*.^{[23]}

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, 2 × 2 determinants were considered by Cardano at the end of the 16th century and larger ones by Leibniz.^{[24]}^{[25]}^{[26]}^{[27]}

In Japan, Seki Takakazu is credited with the discovery of the resultant and the determinant (at first in 1683, the complete version no later than 1710). In Europe, Cramer (1750) added to the theory, treating the subject in relation to sets of equations. The recurrence law was first announced by Bézout (1764).

It was Vandermonde (1771) who first recognized determinants as independent functions.^{[24]} Laplace (1772)^{[28]}^{[29]} 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,

^{[30]}

^{[31]}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.

^{[24]}

^{[32]}With him begins the theory in its generality.

The next important figure was Jacobi^{[25]} (from 1827). He early used the functional determinant which Sylvester later called the Jacobian, and 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.^{[33]}^{[34]}

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.

As mentioned above, the determinant of a matrix (with real or complex entries, say) is zero if and only if the column vectors (or the row vectors) of the matrix are linearly dependent. Thus, determinants can be used to characterize linearly dependent vectors. For example, given two linearly independent vectors *v*_{1}, *v*_{2} in **R**^{3}, a third vector *v*_{3} lies in the plane spanned by the former two vectors exactly if the determinant of the 3 × 3 matrix consisting of the three vectors is zero. The same idea is also used in the theory of differential equations: given *n* functions *f*_{1}(*x*), ..., *f*_{n}(*x*) (supposed to be *n* − 1 times differentiable), the Wronskian is defined to be

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.

The determinant can be thought of as assigning a number to every sequence of *n* vectors in **R**^{n}, by using the square matrix whose columns are the given vectors. For instance, an orthogonal matrix with entries in **R**^{n} represents an orthonormal basis in Euclidean space. The determinant of such a matrix determines whether the orientation of the basis is consistent with or opposite to the orientation of the standard basis. If the determinant is +1, the basis has the same orientation. If it is −1, 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.

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* : **R**^{n} → **R**^{n} is the linear map represented by the matrix *A*, and *S* is any measurable subset of **R**^{n}, then the volume of *f*(*S*) is given by |det(*A*)| times the volume of *S*. More generally, if the linear map *f* : **R**^{n} → **R**^{m} is represented by the *m* × *n* matrix *A*, then the *n*-dimensional volume of *f*(*S*) is given by:

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**, and **d**, is (1/6)·|det(**a** − **b**, **b** − **c**, **c** − **d**)|, or any other combination of pairs of vertices that would 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

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 **R**^{n} (the domain of *f*), the integral over *f*(*U*) of some other function *φ* : **R**^{n} → **R**^{m} is given by

where the right-hand side is the continued product of all the differences that can be formed from the *n*(*n* − 1)/2 pairs of numbers taken from *x*_{1}, *x*_{2}, ..., *x*_{n}, with the order of the differences taken in the reversed order of the suffixes that are involved.

The determinant of a circulant matrix has a simple closed-form expression: Second order

where *ω* and *ω*^{2} are the complex cube roots of 1. In general, the *n*th-order circulant determinant is^{[35]}