In attempting to solve a linear system of equations for
,
and

one is led in a very natural way to consider the square array

We have written
. The solution of (1) requires that we attach a numerical value to the matrix of elements (2). We do this in the following way: We attach
numerical values to a set of
. If at least two of the superscripts in
are the same, the value of
is zero. Thus
, etc. If the
,
,
are all different, the value of
is to be
or
according to whether it takes an even or odd number of permutations to rearrange the
into the natural order
. Let us lood at
and hence at the arrangement
. Permuting the integers
and
permutes
into
, then permuting
and
permutes
into
, and finally
permutes into
if we interchange the integers
and
. Three (an odd number) permutations were required to permute
into
. Thus
. We have
We now define

The letters
,
,
are indices of summation. Equation (3) defines the determinant of the square matrix of elements (2) Its numerical value is given by the right-hand side of (3). It consists, in general, of
terms, each term a product of three elements, one element from each row and column of (3). Expand (3) to get
Only
terms occur in the exapansion of (3) since there are
permutations of
. All other values of
are zero.
We can define
in exactly the same manner in which the
were defined. We leave it to the reader to show that
The generalization of second and third order determinants (the order of a determinant is the number of rows or columns of the determinant) to the
th order determinants is simple. We define the
to have the following numerical values:
if at least two of the superscripts are the same. The values of the superscripts range from
to
. If the
are distinct, the value of
is to be
or
depending on whether an even or odd number of permutations is required to rearrange
into the natural order
. The numerical value (determinant) of the square array of elements
,
, is defined as

where the
are defined in precisely the same manner in which the
are defined. In general, (4) consists of
terms, each term a product of elements, one element fom each row and column of
.
To facilitate writing, we shall deal with third order determinants, but it will be obvious to the reader that any theorem derived for third order determinants will apply to determinants of any finite order. Le us consider

We can obtain a new third order determinant by interchanging the first and third row of
. This yields

But
, since
amd
are dummy indices. We see that every term of (6) is the same as every term in (5) with the exception that
is replaced by
. Since
, we conclude that
. we thus obtain the following theorems:
THEOREM 1.1 . Interchanging two rows (or columns) of a determinant changes the sign of the determinant.
THEOREM 1.1 . If two rows (or columns) of a determinant are the same, the value of the determinant is zero.
We note that

THEOREM 1.3 . If a row (or column) of a determinant is multiplied by a factor
, the value of the determinant is thereby multiplied by
.
Let us now investigate the determinant

since
from Theorem (1.2). Hence we obtain the following theorem:
THEOREM 1.4 . The value of a determinant remains unchanged if to the elements of any row (or column) is added a scalar multiple of the corresponding elements of another row (or column).
The theorems derived above are very useful in evaluating a determinant.