Determinant

In mathematics, the determinant is a scalar-valued function of the entries of a square matrix that has many properties which make it fundamental for the study of square matrices and linear transformations represented by them.

Uses your system voice; voice and rate in settings.

≈ 37 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, the determinant is a scalar-valued function of the entries of a square matrix that has many properties which make it fundamental for the study of square matrices and linear transformations represented by them. The determinant of a matrix is commonly denoted , , or .

For square matrices of dimensions two and three, the determinant is explicitly described as \begin{aligned} \det \begin{bmatrix} a & b\\c & d \end{bmatrix}&= ad-bc,\\[10pt] \det \begin{bmatrix} a & b & c \\ d & e & f \\ g & h & i \end{bmatrix} &= aei + bfg + cdh - ceg - bdi - afh. \end{aligned} There are several equivalent ways to define the determinant of an matrix. A simple and conceptual one is that it is the unique function that maps a product of matrices to a product of scalars and whose value on a triangular matrix is the product of the diagonal entries.

So, the determinant of the product of two square matrices is the product of their determinants. A square matrix is invertible if and only if its determinant has a multiplicative inverse. In the common case where the entries belong to a field, a matrix is invertible if and only if the determinant is nonzero.

The adjugate matrix provides an explicit expression of the inverse matrix. A consequence of the multiplicative property is that two similar matrices have the same determinant, and therefore the determinant of a linear transformation is well defined.

For real linear transformations, the value of the determinant is the scale factor by which the transformation alters every volume in the space (positive if the orientation is preserved, negative if the orientation is reversed, zero if the transformation is not bijective). The determinant is linear with respect to each row and each column of the matrix and is therefore a multilinear function.

This means that it is a linear combination of the entries of each row or column of the matrix. Laplace expansion expresses the coefficients of this linear combination as determinants (of one dimension less), called cofactors.

Laplace expansion is useful for computing determinants when the rows or columns are very sparse, typically when there are only one or two nonzero entries in a row or column. Determinants can be efficiently computed with Gaussian elimination and singular value decomposition.

Determinants can also be theoretically computed by means of the Leibniz formula or Laplace expansion, but this is inefficient except in special cases. Determinants occur throughout mathematics. Cramer's rule expresses the solution of a system of linear equations in terms of determinants.

The characteristic polynomial of a square matrix, whose roots are the eigenvalues, is defined as a determinant with polynomial entries. In geometry, determinants are used to define or compute areas and volumes, as well as space orientation and colinearity.

In analysis, the Jacobian determinant is used for change of variables in multiple integrals and its non-nullity is one of the hypotheses of the implicit function theorem in several variables. In algebraic geometry, the Hessian determinant allows finding inflexion points of an algebraic plane curve.

Low dimension

\det [a] = a An example of the coherency of these conventions is the formula for the inverse matrix of a matrix with a nonzero determinant : the inverse is the multiplication by of the adjugate matrix of , which is a matrix whose entries are, up to the sign, determinants of submatrices of . In the case , the single entry of the adjugate matrix is the determinant of the empty matrix, which equals 1.

So, [d]^{-1} = \tfrac 1d \,[1] = \left[ \tfrac 1d \right], which is what is expected for matrices. \det \begin{pmatrix} a & b \\ c & d \end{pmatrix} = \begin{vmatrix} a & b \\ c & d \end{vmatrix} = ad - bc. This simple form allows verifying by direct computation the properties listed in .

Parallelogram area

One of the main uses of determinants is the computation of the area of the parallelogram defined by two vectors in a Euclidean plane. In fact, the two column vectors \textstyle\begin{pmatrix} a \\c\end{pmatrix} and \textstyle\begin{pmatrix} b \\d\end{pmatrix} of the matrix \begin{pmatrix} a & b \\ c & d\end{pmatrix} define a parallelogram with vertices , , , and .

The area of this parallogram is the absolute value of the determinant of the matrix. The sign of the determinant determines the relative orientation of the vectors: the determinant is positive if one passes by a counterclockwise rotation from the direction of the vector to that of , and negative if a clockwise rotation is needed (if the vectors are aligned, the determinant is zero).

So, the determinant is the signed area of the parallelogram. The proof that the determinant is the signed area of the parallelogram can be done either with trigonometry or by dissection and rearrangement, as shown in the figure. \begin{vmatrix} a&b&c\\d&e&f\\g&h&i \end{vmatrix} = aei + bfg + cdh - ceg - bdi - afh.

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 matrix does not carry over into higher dimensions.

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} is a square matrix with rows and columns, its determinant is denoted , , \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} or \det\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}. There are various equivalent ways to define the determinant of a square matrix , and it depends on authors which definition is chosen as the primary one, as well as the level of generality.

In this article, the definition by the multiplicative property has been chosen as the primary one, because it is simple and does not require specific background. In this section, the scalars (matrix entries and determinants) are assumed to belong to a field, such as the real or complex numbers.

The multiplicative and elementary-transformation characterizations remain valid over an integral domain, but their equivalence requires a different argument, using fraction-free elimination and cancellation rather than ordinary Gaussian elimination. That argument is not given here.

By multiplicative property

The determinant is the unique function from the square matrices to the scalars that maps a product of matrices of the same size to the product of their determinants, and maps every triangular matrix to the product of their diagonal entries. That is, \det (AB)=\det(A)\det(B) and \begin{vmatrix} a_{1,1} & a_{1,2} & a_{1,3} & \ldots & a_{1,n} \\ 0 & a_{2,2} & a_{2,3} & \ldots & a_{2,n} \\ \vdots & \ddots & \ddots & \ddots & \vdots \\ 0 & \ldots & 0 & a_{n-1,n-1} & a_{n-1,n} \\ 0 & \ldots & \ldots & 0 & a_{n,n} \end{vmatrix} =\begin{vmatrix} a_{1,1} & 0 & 0 & \ldots & 0 \\ a_{2,1} & a_{2,2} & 0 & \ldots & 0 \\ \vdots & \vdots & \ddots & \ddots & \vdots \\ a_{n-1,1} & a_{n-1,2} & \ldots & a_{n-1,n-1} & 0\\ a_{n,1} & a_{n,2} & \ldots & a_{n,n-1} & a_{n,n} \end{vmatrix} =a_{1,1}\cdots a_{n,n}.

Such a definition requires the proof that such a function exists and is unique. This will be a byproduct of the proof of the equivalence with other definitions.

By elementary transformations

An elementary row transformation is a transformation of a matrix of one of the following types, where denotes the th row of the matrix: Multiplying one row by a scalar: Adding to a row a scalar multiple of another row: Exchanging two rows: Elementary column transformations are defined similarly by replacing "row" with "column". Transformations of type 3 may be obtained as a succession of thansformations of types 1 and 2: the exchange of rows and may be done by the following succession of transformations, where denotes the current th row (not necessarily the original one): R_i\to R_i+R_j, \qquad R_j\to R_j-R_i, \qquad R_i\to R_i+R_j, \qquad R_j\to -R_j This leads to another definition of determinants: The determinant is the unique function of the entries of a square matrix such that the determinant of the identity matrix is 1, the transformations of type 1 multiply the determinant by the involved scalar, and the transformations of type 2 do not change the determinant; it follows that the transformations of type 3 multiply the determinant by –1.

For proving that this definition is equivalent to the preceding one, one has to interpret elementary transformations in terms of elementary matrices. In fact, an elementary transformation amounts to left-multiply the matrix by the diagonal matrix with all diagonal elements equal to except the th that equals .

An elementary transformation amounts to left-multiplication of the matrix by a triangular matrix in which all diagonal entries are equal to , the entry in the th row and the th column is equal to , and all other entries are zero. A determinant function that satisfies the definition by multiplicative properties satisfy the definition by elementary transformations since the identity matrix is a triangular matrix and the other conditions of the latter definition are the restriction of the multiplicative property to the case where the left factor is an elementary matrix.

Conversely, a determinant function that satisfies the definition by elementary transformations satisfies also the other definition. Over a field, Gaussian elimination allows proving that every matrix can be expressed as a product of elementary matrices (provided that zero is allowed as a scalar for the elementary transformations of type 1).

So, for proving , it suffices to express as a product of elementary matrices and apply associative property of matrix product. Uniqueness of the determinant results also from Gaussian elimination. Indeed, over a field one may transform, by means of elementary transformations, any matrix into a row echelon form, which is a specific triangular matrix.

This allows computing the determinant. However, it does not by itself establish that the value obtained is independent of the elimination path or of the elementary matrices, so it does not prove the existence of the determinant. Instead, what it shows is that if two determinant functions are given, then they agree on every such path and therefore are identical.

So it remains only to construct a function that satisfies the properties defining the determinant, a task taken up below.

By Leibniz formula

The Leibniz formula is one of the most common definitions of determinants. It is an explicit expression of a determinant as a multivariate polynomial function of the matrix entries. It also makes sense in a general commutative ring, and does not require it to be a field or integral domain.

The proof that it satisfies the preceding definitions implies the required existence proof. Also, per uniqueness in the special case of an integral domain, this proves also the equivalence with the other definitions. To write the Leibniz formula, one needs permutations and their signatures.

That is, the determinant of a matrix \left. A=\big(a_{i,j}\big)\right|_{i=1...n}^{j=1...n} is \det(A)=\sum_{\sigma}\operatorname{sgn}(\sigma) \prod_{i=1}^n a_{i,\sigma(i)} , where runs over all permutations of . When is the empty matrix, the usual conventions for the empty set and the empty product give .

If ,one has . Otherwise, the above formula is often expanded as \det(A)=\sum_{\sigma}\operatorname{sgn}(\sigma) a_{1,\sigma(1)}\cdots a_{n,\sigma(n)}. The Levi-Civita symbol allows a variant of the Leibniz formula that is useful in some contexts.

It is denoted \varepsilon_{i_1,\ldots,i_n} and defined on the -tuples (i_1,\ldots,i_n) of integers in \{1,\ldots,n\} as if two of the integers are equal, and otherwise as the signature of the permutation formed by the n-tuple. 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 -tuples of integers in \{1,\ldots,n\}.

To prove that the Leibniz formula satisfies the definition of the preceding sections, one proves first that it is an alternating multilinear form that takes the value 1 on the identity matrix (see next section): multilinearity results from the fact that the Leibniz formula is a homogeneous polynomial of degree one in the entries of each column of the matrix; the fact that the form is alternating and takes the value 1 on the identity matrix result from basic properties of permutations. Then, it suffices to applies the results of the next section.

A = \big ( a_1, \dots, a_n \big ), where the column vector a_i (for each ) is composed of the entries of the matrix in the -th column. Being a multilinear form means that if A = \big ( a_1, \dots, a_i, \ldots, a_n \big ) and A' = \big ( a_1, \dots, a'_i, \ldots, a_n \big ) are two matrices that differs on one column only, then, for every scalar , one has \det\big ( a_1, \dots, a_i+ra'_i , \ldots, a_n\big ) = \det \big ( a_1, \dots, a_i , \ldots, a_n\big )+ r\det \big ( a_1, \dots, a'_i , \ldots, a_n\big ).

The fact that the form is alternating means that it takes the value 0 if two columns are equal. To prove that this definition is equivalent with the preceding ones, it suffices to verify the properties of the definition by elementary transformations (above), which is straightforward.

Generic determinant

A generic matrix is a matrix whose entries are distinct indeterminates. Leibniz formula implies that the determinant of a generic matrix is a polynomial in these indeterminates, with integer coefficients, called a generic determinant.

More precisely, if is an by matrix with the indeterminates as coefficients, then the entries and the determinant of this matrix belong to the polynomial ring and thus also to its field of fractions. A matrix over a commutative ring defines a ring homorphism that maps each to the corresponding entry of . By the invariance under ring homomorphisms, maps the generic determinant to .

So, for proving properties of determinants over a commutative ring that is not an integral domain, it suffices often to prove it over fields, then, to use the invariance under ring homorphisms to "transfer" it over integral domains, and finally to use to transfer it over . A property of a generic determinant that is useful in some contexts is that it is an irreducible polynomial (See for a more general property).

Basic rules

The properties listed here are parts or immediate consequences of above definitions. They are often used without being referred to explicitly. It follows that it is useful to have them in mind when working with determinants and learning related concepts.

In the following list, simple important cases of a property are often listed separately. Zero test: A determinant equals zero if all entries of a row or column equal 0, two rows or columns are equal, a row or column is a linear combination of the other rows or columns, a linear combination of rows or columns, with at least one nonzero coefficient, has all its entries equal to zero.

Immediate computation: The determinant of an identity matrix equals . The determinant of a diagonal matrix is the product of its diagonal entries. The determinant of a triangular matrix is the product of its diagonal entries.

Simple transformations: Interchanging two rows or two columns multiplies the determinant by Homogeneity: Multiplying a row or column by a scalar multiplies the determinant by the same scalar. A matrix and its transpose have the same determinant. Adding to a row or column the product of a row or column by a scalar does not change the determinant.

Adding to a row or column a linear combination of the other rows or columns does not change the determinant. Matrix multiplication: The determinant of the product of two matices is the product of their determinant. Two similar matrices have the same determinant.That is, given two square matrices and , if there is an invertible matrix such that , then .

Inversibility: Over a field, a matrix is invertible if and only if its determinant is nonzero. Over a commutative ring, a matrix is invertible if and only if its determinant is invertible in the ring. In this case, the entries of the inverse matrix belong also to the ring.

In particular, a square matrix of integers has an inverse that is also a matrix of integers if and only if its determinant is or . \det A = \sum_{j=1}^n a_{i,j}A_{i,j}, where is a polynomial in the other entries of the matrix that is called the cofactor of . This linear expansion is called the expansion of the determinant along the th row.

The expansion of the determinant along the th column is defined similarly. Laplace expansion provides an explicit expression of the coefficients : one has A_{i,j} = (-1)^{i+j}M_{i,j}, where is the minor of the th row and the th column, that is, the determinant of matrix of order obtained by removing the th row and the th column of the matrix .

For example, the Laplace expansion along the first row of a 3 by 3 matrix is: \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} Laplace expansion can be used iteratively for computing determinants, but this approach is inefficient for large matrices. Indeed a naive implementation requires the computation of (factorial of ) sub-determinants; if computed determinants are memorized for avoiding to compute them several times, there are nevertheless sub-determinants to compute, giving an exponential algorithm, when Gaussian elimination provides a polynomial time algorithm.

However, Laplace expansion nmay be useful for proving by recursion formulas depending of parameters. Laplace expansion is also often useful for sparse matrices. For example, if is the unique nonzero entry of its row or of its column, one has \det A = (-1)^{i,j}M_{i,j}, where is the minor obtained by removing the th row and the th column of the matrix.

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.

Invariance under ring homomorphisms

The determinant is invariant under ring homomorphisms in the following sense. Let be a ring homomorphism. For every matrix with entries in , let denote by the matrix obtained by applying to the entries of .

The invariance under ring homomorphisms is the relation \det f(M) = f(\det M). When is an inclusion, this means that the determinant of a matrix with entries in does not depend whether the entries are considered as belonging to or . In particular the determinant of a matrix belongs to the smallest ring that contains the entries of the matrix.

The determinant of a matrix of integers is always an integer, and, for computing it, one can use divisions, that is, working over the field of the rational numbers. Even if divisions introduce intermediate values that are not in ⁠ , the final result will be in ⁠ , and will be be the same as if the computation would have been done without division.

The invariance applies also when and is an automorphism. In particular, the determinant of the conjugate of a matrix of complex numbers is the conjugate of the determinant of the matrix. The invariance allows also using modular arithmetic for efficiently computing a determinant with integer entries.

This consists in reducing the entries modulo several prime numbers , computing the determinant in each field (possibly with different methods), and recovering the result with the Chinese remainder theorem. The invariance under ring homomorphisms can be expressed in terms of category theory as follows.

The determinant is a natural transformation between two functors from the category of commutative rings to the category of monoids. The first functor maps each ring to the monoid (under matrix multiplication) of the square matrices of order with entries in the ring.

The second functor is the forgetful functor that maps a ring to its underlying multiplicative monoid. \vert \det(A)\vert \le n^{n/2}B^n. This inequality is often called "Hadamard inequality", but properrly speaking, Hadamard inequality is \vert \det(A)\vert \le \prod_{j=1}^n\|A_j \|, where \|A_j \| is the quadratic norm of the th column of , that is, \|A_i \| = \sqrt{|a_{1,j}|^2 +\cdots +|a_{n,j}|^2}. The inequality becomes an equality if and only if the columns are pairwise orthogonal, that is, if \textstyle\sum_{i=1}^n a_{i,j}a_{i,k}=0, for .

Hadamard inequality is the algebraic counterpart of the following theorem of Euclidean geometry: the volume of the parallelotope defined by vectors in an -dimensional Euclidean vector space is at most the product of the lengths of the vectors, and the equality holds if and only if the vectors are pairwise ortogonal. If the matrix is positive definite, Hadamard inequality implies that the determinant is upperbounded by the protuct of the entries of the main diagonal; that is, \det(A) \le \prod_{i=1}^n a_{i,i}.

(No absolute value is needed here, since the determinant of a psitive definite matrix and its diagonal enties are all real and positive.) This inequality is sometimes also called the Hadamard inequality. B=S^{-1} AS.

This implies, by the multiplicative property of determinants, that \det(B)=\det(A). This allows defining the determinant of an endomorphism as the determinant of the matrix that represents the endomorphism on any basis. Indeed, this determinant does not depend on the basis chosen for representing the endomorphism by a matrix.

Discriminant of a quadratic form

A quadratic form over a field is a homogeneous polynomial of degree 2. It can be naturally represented by a square matrix. The discriminant of the quadratic form is the determinant of this matrix.

It is defined only up to the multiplication by a square. This means that the discriminant is an element of the multiplicative monoid , where denotes the set of the nonzero squares in . \frac{d}{dx} \det(A) = \operatorname{tr}\left(\operatorname{adj}(A) \frac{d A}{d x}\right), where denotes the trace of a matrix (the sum of its diagonal entries), \operatorname{adj}(A) denotes the adjugate of , and denotes the derivative of the matrix, that is the matrix of the derivatives of the entries of .

In particular, if A is invertible, one has \frac{d}{dx} \det(A) = \det(A) \operatorname{tr}\left(A^{-1} \frac{d A}{d x}\right). The partial derivative of the determinant with respect to an entry of , can be deduced from Jacobi's formula, by using the fact that {{tmath|\textstyle \frac{\partial A}{\partial A_{i,j} } }} is the matrix such that the entrry of the th row and the th column is , and all other entries are zero.

One has \frac{\partial }{\partial A_{i,j}} \det(A) = \operatorname{adj}(A)_{j,i} = \det(A)\left(A^{-1}\right)_{j,i}, the last equality making sense only in the case of an invertible matrix. This allows also to approximate the change of the determinant under a small deformation of the matrix: \det(A + \varepsilon X) - \det(A) = \operatorname{tr}(\operatorname{adj}(A) X) \varepsilon + O\left(\varepsilon^2\right) , In the case of a deformation of the identity matrix this yields \det(I + \varepsilon X) = 1 + \operatorname{tr}(X) \varepsilon + O\left(\varepsilon^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, and this shows that its Lie algebra is the special linear Lie algebra \mathfrak{sl}_n consisting of those matrices having trace zero.

Gaussian elimination

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

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). \det \begin{pmatrix} 1&1&1\\ x_0 & x_1 & x_2\\ y_0 & y_1 & y_2 \end{pmatrix} =0. If one subtracts the first column from the two others, and then computes the Laplace expansion along the first row, one gets the equality \det \begin{pmatrix} 1&1&1\\ x_0 & x_1 & x_2\\ y_0 & y_1 & y_2 \end{pmatrix} = \det \begin{pmatrix} x_1-x_0 & x_2-x_0\\ y_1-y_0 & y_2-y_0 \end{pmatrix} .

This means that the determinant considered here is the determinant of the vectors and . If the points are not aligned, the absolute value of the determinant is twice the area of the triangle defined by the points, and the sign of the determinant determines the orientation of the triangle: it is positive if and only if is on the left when running from to .

If one replaces with an indeterminate point , one gets the implicit equation of the line passing through two (distinct) points and : \det \begin{pmatrix} 1&1&1\\ X & x_1 & x_2\\ Y & y_1 & y_2 \end{pmatrix} =0. Expanding along the first column and reordering terms gives a more usual form of the implicit equation: X(y_2-y_1) + Y (x_2-x_1) +(x_1y_2-x_2y_1)=0.

Dimension 3 and higher

Let , , , and be four points in a tridimensional Euclideaan space.. The four points are coplanar (that is, belong to the same plane), if and only if \det \begin{pmatrix} 1&1&1&1\\ x_0 & x_1 & x_2 & x_3\\ y_0 & y_1 & y_2 & y_3 \\ z_0 & z_1 & z_2 & z_3 \end{pmatrix} =0.

If one subtracts the first column from the three others, and then computes the Laplace expansion along the first row, one gets the equality \det \begin{pmatrix} 1&1&1&1\\ x_0 & x_1 & x_2 & x_3\\ y_0 & y_1 & y_2 & y_3 \\ z_0 & z_1 & z_2 & z_3 \end{pmatrix} = \det \begin{pmatrix} x_1-x_0 & x_2-x_0 & x_3 -x_0\\ y_1-y_0 & y_2-y_0 & y_3 -y_0\\ z_1-z_0 & z_2-z_0 & z_3 -z_0 \end{pmatrix} . This means that the determinant considered here is the determinant of the vectors , , and .

If the points are not coplanar, the absolute value of the determinant is six times the volume of the tetrahedron defined by the points, and the sign of the determinant determines the orientation of the tetrahedon; in particular, this sign determines the side of the plane where is placed. This criterion is commonly used in computer graphics and computer vision to recognize the hidden parts of a 3D figure.

If one replaces with an indeterminate point , one gets the implicit equation of the plane passing through three non-colinear points , , and : \det \begin{pmatrix} 1&1&1&1\\ X & x_1 & x_2 & x_3\\ Y & y_1 & y_2 & y_3 \\ Z & z_1 & z_2 & z_3 \end{pmatrix} =0. Expanding along the first column reordering the terms, and changing the sign gives a conventional form of the implicit equation: X \,\begin{vmatrix} 1&1&1\\ y_1 & y_2 & y_3\\ z_1 & z_2 & z_3 \end{vmatrix} -Y \, \begin{vmatrix} 1&1&1\\ x_1 & x_2 & x_3\\ z_1 & z_2 & z_3 \end{vmatrix} + Z\, \begin{vmatrix} 1&1&1\\ x_1 & x_2 & x_3\\ y_1 & y_2 & y_3 \end{vmatrix} - \begin{vmatrix} x_1 & x_2 & x_3\\ y_1 & y_2 & y_3 \\ z_1 & z_2 & z_3 \end{vmatrix} =0.

In a higher dimension , things work similarly, with coordinates, points, and "coplanar" and "tetrahedron" replaced with "belonging to the same hyperplane" and "simplex". Besides the change of matrix dimensions, the main change is that the determinant is (factorial ) times the volume of the simplex.

AU=\lambda U. It is equivalent to say that (\lambda I-A) U=0, where and denote respectively the identity matrix and the zero column vector of the convenient size. This means exactly that the columns of are linearly dependent, or equivalently that \det (\lambda I-A) =0.

In other words, the eigenvalues are the roots of the polynomial , which is called the characteristic polynomial of the matrix . Being a determinant, the characteristic polynomial is invariant under matrix similarity, and is therefore defined also for linear endomorphisms. For a square matrix of order , the characteristic polynomial is a monic polynomial of degree .

All its coefficients are invariant under matrix similarity. Its constant coefficient, obtained by setting , is . The coefficient of in the characteristic polynomial is , where , denotes the trace of the matrix.

Per Viete's formula, it is the sum of the eigenvalues (counted with their multiplicities). It results from the Leibniz formula that the trace is also the sum of the diagonal entries of and of every matrix similar to .

Determinants of functions

Several sorts of determinant of matrices having functions as entries are commonly considered. They are named typically after the mathematician who introduced them.

Jacobian determinant

The Jacobian matrix of a tuple of differentiable functions is the matrix of their partial derivatives. That is, given differentiable functions in variables , the Jacobian matrix is the matrix \begin{pmatrix}\tfrac{\partial f_1}{\partial x_1} & \ldots & \tfrac{\partial f_n}{\partial x_1}\\ \vdots & \cdots & \vdots\\ \tfrac{\partial f_1}{\partial x_m} & \ldots & \tfrac{\partial f_n}{\partial x_m} \end{pmatrix}.

When , the determinant of a Jacobian matrix is called the Jacobian determinant. It is thus a function of the variables. The Jacobian matrix is a generalization of the usual derivative to multivariate vector valued functions.

In this generalization, the common condition is replaced , where is the Jacobian determinant. Among the numerous uses of the Jacobian determinant, the two following ones are especially important: The Jacobian determinant occurs in the formula for a change of variable in a multiple integral.

The nonnullity of the Jacobian determinant is a hypothesis of the Implicit function theorem and the inverse function theorem .

Wronskian

Determinants can be used to characterize 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}. If it can be shown that the Wronskian is zero everywhere on an interval then, in the case of analytic functions, this implies that the given functions are linearly dependent.

See the Wronskian and linear independence.

In vector geometry

The determinant provides a convenient notational tool for calculating the vector cross product—specifically, for vectors \mathbf{a}=a_1\mathbf{i}+a_2\mathbf{j}+a_3\mathbf{k} , and \mathbf{b}=b_1\mathbf{i}+b_2\mathbf{j}+b_3\mathbf{k} : \mathbf{a\times b} = \det \begin{pmatrix} \mathbf{i}&\mathbf{j}&\mathbf{k}\\ a_1 & a_2 & a_3 \\ b_1 & b_2 & b_3 \\ \end{pmatrix} From this definition, one can easily derive the anticommutative property of cross products, since swapping \mathbf{a} and \mathbf{b} is equivalent to swapping two rows in the determinant, which entails changing the sign of the determinant, giving: \mathbf{a} \times \mathbf{b} = -(\mathbf{b} \times \mathbf{a}).

Signed volume of a parallelotope

is the absolute value of the determinant of the matrix formed by the columns constructed from the vectors r1, r2, and r3. If an 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\} ( \forall stands for "for all" as a logical symbol.) 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 scale 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. \frac{\operatorname{volume}(f(S))}{\operatorname{volume}(S)} = \sqrt{\det\left(A^\textsf{T} A\right)}. When m this is zero.

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 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 R n (the domain of f), the integral over f(U) of some other function 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. \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 .

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

Block matrices and matrix sums

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\begin{pmatrix}A+B & B\\ B+A & A\end{pmatrix} = \det\begin{pmatrix}A+B & B\\ 0 & A-B\end{pmatrix} = \det(A+B) \det(A-B). It is possible to compute the determinant by the block matrices in a fast way with the use of fast matrix multiplication algorithms in the time O({n^\omega }) for ~2.37 \le \omega , by the LU decomposition.

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 th root of determinant is a concave function, when restricted to Hermitian positive-definite n\times n matrices. Therefore, if and 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 th root of the determinant is a homogeneous function.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378901987 under CC BY-SA 4.0; modifications have been made.

Words in each sectionGaussian eliminationGaussian eliminationGaussian elimination: 1,112 words1,112In vector geometryIn vector geometryIn vector geometry: 741 words741Low dimensionLow dimensionLow dimension: 680 words680Basic rulesBasic rulesBasic rules: 636 words636Invariance under ring h…Invariance under ring homomorphismsInvariance under ring homomorphisms: 570 words570By Leibniz formulaBy Leibniz formulaBy Leibniz formula: 541 words541By elementary transform…By elementary transformationsBy elementary transformations: 515 words515Block matrices and matr…Block matrices and matrix sumsBlock matrices and matrix sums: 483 words483Discriminant of a quadr…Discriminant of a quadratic formDiscriminant of a quadratic form: 355 words355Determinants of functio…Determinants of functionsDeterminants of functions: 322 words322By multiplicative prope…By multiplicative propertyBy multiplicative property: 223 words223Generic determinantGeneric determinantGeneric determinant: 170 words170SumSumSum: 149 words149Determinants for finite…Determinants for finite-dimensional algebrasDeterminants for finite-dimensional algebras: 139 words139Adjugate matrixAdjugate matrixAdjugate matrix: 67 words67Operators in von Neuman…Operators in von Neumann algebrasOperators in von Neumann algebras: 42 words42
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001378901987 · captured 2026-10-06 · ledger · version history

Cite this page as: encyclopegia.org, “Determinant”, snapshot enwiki-001378901987. https://encyclopegia.org/a/determinant

Sources cited in this revision

14 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.