8.

4 Permutation
A permutation σ of the set {1, 2, . . . , n} is a one-to-one mapping of the set onto
itself or, equivalently, a rearrangement of the numbers 1, 2, . . . , n. Such a permutation
σ is denoted by

σ=
( 1j
1
2 ⋯ n
j2 ⋯ j n ) or σ = j 1 j2 ⋯ jn where j i =σ (i)

The set of all such permutations is denoted by Sn, and the number of such
permutations is n!. If σ ∈ S n, then the inverse mapping σ −1 ∈ S n, and if σ , τ ∈ S n, then the
composition mapping σ ∘ τ ∈ Sn . Also, the identity mapping ε =σ ∘ τ ∈ Sn . (In fact, ε =¿
123 . . . n.)

8.5 Determinants of Arbitrary Order

Definition: The determinant of A=[aij ],, denoted by det(A) or | A|, is the sum of
all the above n! products, where each such product is multiplied by sgn σ . That is,

| A|=∑ ( sgn σ ) a 1 a 2 ⋯ a n
σ 1 2 n

Or
| A|= ∑ ( sgn σ ) a 1σ (1) a2 σ (2) ⋯ an σ (n)
σ ∈Sn

Example :
(a) Let A=[aij ], be a 1 ×1 matrix. Because S1 has only one permutation, which
is even, det(A) = a11, the number itself.
(b) Let A=[aij ], be a 2 ×2 matrix. In S2, the permutation 12 is even and the
permutation 21 is odd. Hence,

det ⁡( A)=¿ | |
a11 a12 =a a −a a
a21 a22
11 22 1 2 21

(c) Let A=[aij ], be a 3 ×3 matrix. In S3, the permutations 123, 231, 312 are
even, and the permutations 321, 213,132 are odd. Hence,

| |
a1 1 a 12 a1 3
det ( A )= a21 a2 2 a2 3
a31 a32 a33

¿ a11 a22 a33 + a1 2 a2 3 a 31+a 13 a 21 a32−a 13 a 22 a31−a 12 a2 1 a33−a11 a2 3 a3 2