1 Definition and basic ideas
The determinant is a scalar assigned to every square matrix. It summarizes key features of the associated linear transformation, including whether the transformation can be reversed, how it changes size, and whether it preserves or reverses orientation. In elementary terms, the determinant is one of the central numerical invariants of a matrix.
Determinants can be introduced in several equivalent ways. Some definitions start with simple formulas for small matrices and extend recursively to larger ones. Others use permutations of indices or geometric reasoning based on areas and volumes. Although these approaches look different, they lead to the same quantity.
1.1 Determinants of 1×1 and 2×2 matrices
For a 1×1 matrix \([a]\), the determinant is simply \(a\). This agrees with the idea that a one-dimensional linear map scales lengths by its single coefficient.
For a 2×2 matrix \[ \begin{pmatrix} a & b \\ c & d \end{pmatrix}, \] the determinant is \[ ad - bc. \] This formula is the first nontrivial case and already shows the main features of determinants. The value changes sign when rows or columns are exchanged and becomes zero when the two rows or columns are linearly dependent.
1.2 Determinants of 3×3 and larger matrices
For 3×3 matrices, the determinant can be computed by expanding along a row or column or by using the permutation formula. A common explicit expression is \[ \begin{vmatrix} a & b & c \\ d & e & f \\ g & h & i \end{vmatrix} = aei+bfg+cdh-ceg-bdi-afh. \] This pattern extends to larger matrices, but the number of terms grows rapidly.
For an \(n \times n\) matrix with \(n>3\), direct formulas become cumbersome. In practice, one typically uses recursive expansion, row reduction, or structural properties of the matrix.
1.3 Notation and terminology
| The determinant of a matrix \(A\) is often written \(\det(A)\) or \( | A | \). The vertical-bar notation is traditional but can be confused with absolute value, so \(\det(A)\) is usually clearer in modern writing. |
|---|
A matrix with nonzero determinant is called nonsingular or invertible. A matrix with determinant zero is called singular. The determinant is defined only for square matrices.
2 Computation methods
Several standard methods are used to calculate determinants. The most suitable method depends on the matrix size and structure. Small matrices can be handled directly, while larger ones are usually simplified by algebraic operations.
2.1 Expansion by minors
Expansion by minors reduces the determinant of a large matrix to determinants of smaller matrices. It is based on selecting a row or column and combining its entries with corresponding subdeterminants.
2.1.1 Cofactors
The cofactor of an entry \(a_{ij}\) is the minor determinant obtained by deleting row \(i\) and column \(j\), multiplied by a sign factor \((-1)^{i+j}\). This sign pattern alternates across the matrix in a checkerboard arrangement.
Cofactors are useful because they encode both the smaller determinant and the sign needed in expansion formulas.
2.1.2 Laplace expansion
Laplace expansion expresses a determinant as a sum of products of entries from a chosen row or column and their cofactors. This method works for any row or column.
The expansion is especially efficient when a row or column contains many zeros, since only a few terms remain. Although conceptually important, Laplace expansion is not always the fastest method for numerical work.
2.2 Row reduction methods
Row reduction converts a matrix into an easier form, usually upper triangular. Determinants can then be read off from the simplified matrix, provided one keeps track of how row operations change the value.
2.2.1 Effect of elementary row operations
Elementary row operations alter the determinant in specific ways. Swapping two rows changes the sign. Multiplying a row by a scalar multiplies the determinant by the same scalar. Adding a multiple of one row to another row does not change the determinant.
These rules make it possible to simplify a matrix while preserving enough information to recover the original determinant.
2.2.2 Triangular matrices
For an upper or lower triangular matrix, the determinant is the product of the diagonal entries. This follows from the structure of the matrix and makes triangular forms especially convenient.
Row reduction often aims to transform a matrix into triangular form. Once this is done, the determinant can be obtained quickly from the diagonal, adjusted for any swaps or scalings used during the reduction.
2.3 Permutation formula
A determinant can also be written as a sum over all permutations of the indices \(1,\dots,n\). This is the most direct algebraic definition for general matrices.
2.3.1 Sign of a permutation
Each permutation is either even or odd, depending on whether it can be expressed as an even or odd number of transpositions. The sign of a permutation is \(+1\) for even permutations and \(-1\) for odd permutations.
This sign determines whether the corresponding term contributes positively or negatively in the determinant formula.
2.3.2 Leibniz formula
The Leibniz formula states that the determinant of an \(n \times n\) matrix is the sum, over all permutations, of products of one entry from each row and each column, weighted by the sign of the permutation.
This formula is elegant and fundamental, but computationally expensive for large \(n\), since the number of terms is \(n!\).
3 Fundamental properties
Determinants satisfy a small set of structural properties that characterize them uniquely. These properties explain why determinants behave consistently under matrix operations and why they are so useful in linear algebra.
3.1 Multilinearity
A determinant is linear in each row separately, and also linear in each column separately. This means one row or column can be treated as a variable while the others are held fixed.
3.1.1 Linearity in rows
If a row is written as a sum of two vectors, the determinant splits into a sum of two determinants. Similarly, scalar factors may be pulled out of a row.
This property is often used to simplify symbolic calculations and to prove identities involving determinants.
3.1.2 Linearity in columns
The same linear behavior holds for columns. Since row and column versions are equivalent, one may work in whichever direction is more convenient.
Column linearity is especially useful in applications involving matrix factorizations and geometric interpretations.
3.2 Alternating property
Determinants vanish when two rows or two columns are equal, and they change sign when two rows or columns are exchanged. This alternating behavior reflects the sensitivity of determinants to orientation.
3.2.1 Repeated rows or columns
If a matrix has two identical rows or two identical columns, its determinant is zero. More generally, if one row or column is a linear combination of others in a way that creates dependence, the determinant may vanish.
This property is one of the clearest indicators of singularity.
3.2.2 Swapping rows or columns
Interchanging two rows or two columns multiplies the determinant by \(-1\). The magnitude stays the same, but the sign reverses.
This rule underlies the orientation interpretation and appears frequently in row-reduction calculations.
3.3 Multiplicative property
Determinants interact neatly with matrix multiplication and inversion. These rules make determinants powerful in the study of matrix groups and linear transformations.
3.3.1 Determinant of a product
For square matrices \(A\) and \(B\) of the same size, \[ \det(AB)=\det(A)\det(B). \] This multiplicative law is one of the most important determinant identities.
It implies that the determinant of a composite linear transformation is the product of the scaling factors of the components.
3.3.2 Determinant of an inverse
If \(A\) is invertible, then \[ \det(A^{-1})=\frac{1}{\det(A)}. \] This follows immediately from the product rule, since \(AA^{-1}=I\) and \(\det(I)=1\).
The formula shows that invertibility requires a nonzero determinant.
4 Geometric interpretation
Determinants have a strong geometric meaning. In low dimensions, they measure signed area or volume after a linear transformation. This makes them more than algebraic symbols; they describe how space is stretched and oriented.
4.1 Area in two dimensions
In two dimensions, the absolute value of the determinant of a matrix gives the area scaling factor of the associated linear map. A unit square is sent to a parallelogram whose area equals the absolute value of the determinant.
The sign indicates whether the map preserves or reverses orientation.
4.2 Volume in three dimensions
In three dimensions, the absolute value of the determinant gives the volume scaling factor. A unit cube is transformed into a parallelepiped, and the determinant measures its signed volume.
This interpretation extends the area picture from two dimensions and helps visualize determinants as generalized scaling factors.
4.3 Orientation and signed measure
The sign of the determinant records orientation. A positive determinant preserves orientation, while a negative determinant reverses it.
The notion of signed measure allows one to distinguish between a transformation that merely scales space and one that also flips it. This distinction is important in geometry and in change-of-variable formulas.
5 Relation to matrices and linear transformations
Determinants are closely tied to the linear-algebraic structure of matrices. They help classify transformations, reveal dependence relations, and connect with spectral theory.
5.1 Invertibility criterion
A square matrix is invertible exactly when its determinant is nonzero. This criterion is one of the most widely used facts in linear algebra.
5.1.1 Nonzero determinant and nonsingularity
If \(\det(A)\neq 0\), then the matrix \(A\) has an inverse. The corresponding linear transformation is bijective, mapping distinct vectors to distinct images.
This situation indicates that the transformation does not collapse space into a lower-dimensional subset.
5.1.2 Zero determinant and singularity
If \(\det(A)=0\), then the matrix is singular and not invertible. Geometrically, the transformation collapses some dimension, sending space into a lower-dimensional set.
Zero determinant often reflects linear dependence among the rows or columns.
5.2 Rank and kernel
A determinant of zero is related to reduced rank and a nontrivial kernel. When a square matrix is singular, at least one nonzero vector is mapped to the zero vector.
Thus, the determinant detects whether the associated transformation loses information. In full-rank cases, the matrix has no nontrivial kernel and the determinant is nonzero.
5.3 Eigenvalues and characteristic polynomial
The determinant appears in the characteristic polynomial of a matrix. In fact, the determinant of \(A\) equals the product of its eigenvalues, counted with multiplicity, over an algebraically closed field.
This connection links determinants to spectral theory. It also explains why determinant-based criteria often reflect the behavior of eigenvalues, such as invertibility and volume scaling.
6 Applications
Determinants occur in many areas of mathematics. They are used both as theoretical tools and as practical devices for computation and modeling.
6.1 Solving linear systems
Determinants can be used to analyze whether a linear system has a unique solution, infinitely many solutions, or no solution at all.
6.1.1 Cramer's rule
Cramer's rule expresses the solution of a square linear system in terms of determinants. Each variable is given by a ratio of determinants obtained by replacing one column of the coefficient matrix with the constants column.
Although elegant, Cramer's rule is usually inefficient for large systems. It is mainly useful for theoretical arguments and small systems.
6.1.2 Existence and uniqueness of solutions
A linear system with a square coefficient matrix has a unique solution exactly when the determinant of that matrix is nonzero. If the determinant is zero, uniqueness fails, and the system may have either no solution or many solutions.
This criterion provides a fast test for solvability in the square case.
6.2 Change of variables
Determinants govern how integrals and coordinate descriptions change under transformation. They measure the local scaling of area or volume elements.
6.2.1 Jacobian determinants
In multivariable calculus, the Jacobian determinant is the determinant of a matrix of partial derivatives. It describes how a differentiable map locally stretches or compresses space.
The Jacobian is essential in integration formulas involving coordinate changes.
6.2.2 Coordinate transformations
When coordinates are changed, the determinant determines the scaling factor for differential area or volume. It also reflects whether the transformation preserves orientation.
This role makes determinants central in analytic geometry, physics, and calculus.
6.3 Areas, volumes, and scaling factors
Determinants provide a unified way to describe scaling in any dimension. In two dimensions they measure areas, in three dimensions volumes, and in higher dimensions the corresponding hypervolume.
They also track whether a transformation contracts, expands, or leaves size unchanged.
7 Special types of matrices
Certain matrix classes have determinants with especially simple forms. These cases are useful for examples, proofs, and computations.
7.1 Diagonal matrices
The determinant of a diagonal matrix is the product of its diagonal entries. Off-diagonal entries are zero, so no cross terms appear in the determinant.
This makes diagonal matrices among the easiest to analyze.
7.2 Triangular matrices
For upper or lower triangular matrices, the determinant is again the product of the diagonal entries. The triangular shape eliminates most terms in the expansion formula.
This property is frequently used in elimination procedures and matrix factorizations.
7.3 Orthogonal matrices
An orthogonal matrix has determinant \(+1\) or \(-1\). Such matrices preserve lengths and angles, so their determinant reflects whether they preserve or reverse orientation.
Because they represent rigid motions in linear form, orthogonal matrices have especially stable geometric behavior.
7.4 Symmetric and skew-symmetric matrices
Symmetric matrices satisfy \(A^T=A\), while skew-symmetric matrices satisfy \(A^T=-A\). Their determinants can exhibit special patterns, especially over the real numbers.
A skew-symmetric matrix of odd size has determinant zero. This is a notable consequence of the relation between transposition and sign.
8 Advanced topics
More abstract settings extend the notion of determinant beyond elementary matrix theory. These generalizations preserve much of the original structure while requiring additional algebraic language.
8.1 Determinants over commutative rings
The determinant can be defined for matrices whose entries lie in a commutative ring, not just a field. The usual permutation formula still makes sense because multiplication in the ring is commutative.
This broader setting is important in algebra and number theory.
8.2 Determinants in abstract algebra
In abstract algebra, determinants help study modules, ring homomorphisms, and algebraic structures such as the general linear group. They provide a bridge between linear transformations and multiplicative invariants.
Determinants also appear in representation theory and in the theory of multilinear maps.
8.3 Generalizations to infinite-dimensional settings
In infinite-dimensional analysis, one cannot always define determinants in the same straightforward way. Specialized notions, such as Fredholm determinants, are used for certain operators.
These generalizations preserve the idea of a determinant as a global summary of an operator, but they require additional convergence and functional-analytic conditions.