
We know that if we are given a system of two linear equations
![\[\begin{cases} a_{11}x_1+a_{12}x_2=b_1 \\ a_{21}x_1+a_{22}x_2=b_2 \end{cases}\]](//latex.artofproblemsolving.com/4/0/9/409126f71cd61c2d52dde1060f5ab88bf28323f1.png)
we can solve it by elimination method and get:
![\[x_1=\frac{b_1a_{22}-a_{12}b_2}{a_{11}a_{22}-a_{12}a_{21}}, x_2=\frac{a_{11}b_2-a_{21}b_1}{a_{11}a_{22}-a_{12}a_{21}}\]](//latex.artofproblemsolving.com/e/8/8/e88385c857c1dbb9e878c1b40d115d7a69d3bc1f.png)
notice that the expressions in the numerator and the denominator of

consist of

numbers with

numbers multiplied together respectively and subtracted with the other. In particular, the numbers in the expression

are the coefficients in our system of two linear equations, so let's put them in rows and columns of a matrix,
![\[\begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix}\]](//latex.artofproblemsolving.com/6/e/3/6e33c5e5d00fcb54825bf310732b0e1fdddaf914.png)
we can then represent

as a

determinant,
![\[\begin{vmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{vmatrix}.\]](//latex.artofproblemsolving.com/0/8/f/08f968fa2382b4cd031e991439c378a22f883e21.png)
Therefore, we can rewrite

as
![\[x_1=\frac{\begin{vmatrix} b_{1} & a_{12} \\ b_{2} & a_{22} \end{vmatrix}}{\begin{vmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{vmatrix}}, x_2=\frac{\begin{vmatrix} a_{11} & b_{1} \\ a_{21} & b_{2} \end{vmatrix}}{\begin{vmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{vmatrix}}.\]](//latex.artofproblemsolving.com/6/c/5/6c5a6fe417007d5c2acb50d32a4493790b924656.png)
Now, we then define the 3x3 determinant as
![\[\begin{vmatrix} a_{11} & a_{12} &a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33}\end{vmatrix}= a_{11}a_{22}a_{33}+a_{12}a_{23}a_{31}+a_{13}a_{21}a_{32}-a_{13}a_{22}a_{31}-a_{12}a_{21}a_{33}-a_{11}a_{23}a_{32}.\]](//latex.artofproblemsolving.com/8/2/b/82b231c9b8c5e890b37712eeb17cf17359cc1913.png)

Let's consider the following example:
Given three numbers
, how many different arrangements are there for these numbers?
It's easy, there are

of these,
![\[123, 231, 312, 132, 213, 321.\]](//latex.artofproblemsolving.com/f/a/f/faf77b1114f6b8b29569ba77d562a6d17df85ac7.png)
In general, these numbers like in the example above,

are called
elements. So, given

different elements, there are

arrangements and these arrangements are also called
permutations of the elements.
We then define the
inversion number of a permutation. First, an
inversion in a permutation is a pair of numbers such that the larger number appears to the left of the smaller one in the permutation. The
inversion number of a permutation is the total number of inversions. One way to help calculate the inversion number is to look at each position in the permutation and count how many bigger numbers are to the left, and then add those numbers up.
Exercise wrote:
Calculate the inversion number of the permutation,
.
Answer
.
Lastly, we say that a permutation is
odd if the inversion number is odd and a permutation of
even if the inversion number is even.

Let's go back to the

determinant,
![\[\begin{vmatrix} a_{11} & a_{12} &a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33}\end{vmatrix}= a_{11}a_{22}a_{33}+a_{12}a_{23}a_{31}+a_{13}a_{21}a_{32}-a_{13}a_{22}a_{31}-a_{12}a_{21}a_{33}-a_{11}a_{23}a_{32}.\]](//latex.artofproblemsolving.com/8/2/b/82b231c9b8c5e890b37712eeb17cf17359cc1913.png)
It's easy to see that there are three elements in each term of the above expression and these three elements are from different row and columns. Thus, each term of the expression (neglecting the positive and negative signs) can be rewritten as
. Here, the row numbers of each term are assigned

and the column numbers of each term are assigned
, there are the permutations of elements
. There are

permutations which is the same as the number of terms.
By a close inspection, we realise that terms with positive sign have the column numbers being the permutations,

and terms with negative sign are the permutations
. Also, by some calculations, we find out that the first three are even permutations and the latter are odd permutations. Therefore, the sign of each term can be represented as
, where

is the inversion number of the column numbers of each term.
Hence, the
order determinant can be rewritten as
![\[\begin{vmatrix} a_{11} & a_{12} &a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33}\end{vmatrix}= \sum (-1)^t a_{1p_1}a_{2p_2}a_{3p_3},\]](//latex.artofproblemsolving.com/d/8/0/d80e6964a119ecce8fa366c84d509f99182fe498.png)
where

is the inversion number of the permutation
.
In general, given a
order matrix,
![\[\begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1n}\\ a_{21} & a_{22} & \cdots & a_{2n} \\ & \cdots
& \cdots &\\ a_{n1} & a_{n2} & \cdots & a_{nn}\end{pmatrix}\]](//latex.artofproblemsolving.com/5/0/b/50b06ccfcca9528ef5d5f3bc771b67b10f85aa76.png)
we can form products of

elements from different rows and columns and with their respective signs
,
. The numbers

are permutations of

and

as the inversion number. Since there are

permutations, there are total

terms and their sum
![\[\sum (-1)^t a_{1p_1}a_{2p_2}\cdots a_{np_n}\]](//latex.artofproblemsolving.com/2/2/6/2266c64de13930637c69b73bf5f3445e43b80d55.png)
is the
order determinant, denoted by
Exercise wrote:
Prove the following
order determinant
![\[\begin{vmatrix}\lambda_1 & &\\ & \lambda_2 & \\ & &\ddots & \\ & & & \lambda_n \end{vmatrix}=\lambda_1 \lambda_2 \cdots \lambda_n\]](//latex.artofproblemsolving.com/1/4/f/14fd7a993147c8bb60fc21acc619550d031f4baf.png)
![\[\begin{vmatrix} & & & \lambda_1 \\ & & \lambda_2 \\ & \iddots \\ \lambda_n & \end{vmatrix}=(-1)^{\frac{n(n-1)}{2}}\lambda_1 \lambda_2 \cdots \lambda_n,\]](//latex.artofproblemsolving.com/6/e/d/6edf70c9a29d7d3e47b9b380fdeef74b57701520.png)
where the unfilled elements are all
.
Exercise wrote:
Prove the following determinant of a lower triangular matrix:
![\[D=\begin{vmatrix} a_{11} \\ a_{21} & a_{22} \\ \vdots & \vdots & \ddots \\ a_{n1} & a_{n2} & \cdots & a_{nn}\end{vmatrix}=a_{11}a_{22}\cdots a_{nn}. \]](//latex.artofproblemsolving.com/d/2/f/d2f16c25b6dd9b98eeece2bbda08411080954c92.png)