**As used in mathematics,** the word determinant refers to a number associated with a square matrix, that is, an array of numerical quantities arranged in, say, n rows and n columns. Matrices of this sort typically arise as a means for representing the coefficients in a system of n linear equations in n unknowns.

Suppose the system of equations is

Then the matrix of detached coefficients

is said to be nonsingular if and only if its determinant is nonzero. The existence and uniqueness of a solution to the system of equations are determined by the nonsingularity of A. If A lacks this property, it is said to be singular, and when this is the case, the system might have no solution (nonexistence) or infinitely many solutions (nonuniqueness).

The determinant of a square matrix A is the number

where A(i j) denotes the submatrix obtained from A by deleting its ith row and jth column. This definition of the determinant uses what is called expansion by a row, in this case by row i. There is an analogous definition of det(A) in terms of expansion by a column, say j, which says

These formulas are associated with the name of the French mathematician Pierre-Simon Laplace (1749— 1827). From either of them it is evident that the determinant of the identity matrix I is 1, and hence it is nonsingular.

The determinant of a square matrix A and that of its transpose AT are always equal. Moreover, the determinant of the product of two square matrices is the product of their determinants. In symbols, if A and B are two n X n matrices, then

From this and the fact that the determinant of the identity matrix I is 1, it follows that when A is non-singular,

Thus, the determinant of a nonsingular matrix and that of its inverse are reciprocals of each other.

**As can readily be appreciated,** the calculation of the determinant of a large matrix by means of a row or column expansion can entail a significant amount of work. Fortunately, there are matrices whose determinants are not difficult to compute. Among these are diagonal matrices (the identity matrix being an example) and, more generally, lower triangular matrices. The determinant of any such matrix is the product of its diagonal elements. (The same is true for all upper triangular matrices.) Finding a determinant is aided by procedures (such as Gaussian elimination) that transform the matrix to another whose structure permits relatively easy calculation of its determinant.

Cramer’s Rule for solving the system Ax = b proceeds from the assumption that A is nonsingular. In that case, the system has a unique solution: x = A b. Cramer’s rule gives formulae for the values for the components of this vector in terms of the data, specifically as ratios of determinants. The expression of these ratios requires the introduction of a notation for the matrix obtained from A and b by replacing the jth column of A by the vector b. Let this notation be A__(d). Then Cramer’s Rule says that for each j = \ n

In the system

the determinant of A is 15. The matrices A_1(b), A_2(b), A_3(b) are, respectively,

To use Cramer’s Rule in this case, one would compute

Cramer’s Rule then yields

Although Cramer’s Rule is useful in numerically solving small systems of equations (those consisting of two equations in two unknowns, or three equations in three unknowns), it is not recommended for solving larger systems due to the difficulty in computing determinants of order larger than 3. This caution does not apply to situations in which the calculation is entirely symbolic. An example of the latter sort can be found in P. A. Samuelson’s Foundations of Economic Analysis (Harvard University Press, Cambridge, 1963; see equation 7, p. 14).

**The task of solving square systems of linear equations arises** from least-squares problems which in turn arise in linear regression analysis. The square system is typically of the form ATAx = ATb. These are called the normal equations. The problem is to find x. The first question one faces is whether the matrix ATA is nonsingular. If it is not—that is, det(A’A) = 0—then Cramer’s Rule is not applicable. If it is nonsingular, then in principle, the solution is x = (AtA)-1 ATb. When n, the number of variables x1, …, xn, is quite small (and det[ATA] ^ 0), the use of Cramer’s Rule for solving equations can be considered. But most practical problems of this nature are not small and need to be solved with computers. Since exact arithmetic is then lost, several numerical issues come to the fore. The extensive use of determinants is not advisable simply on computational efficiency grounds. Another consideration, the condition number of ATA, enters the picture here. As stated by Gilbert Strang, "Forming A A can turn a healthy problem into a sick one, and it is much better (except for very small problems) to use either Gram-Schmidt or the singular value decomposition" (Strang 1976, p. 272).