Beruflich Dokumente
Kultur Dokumente
permutation
0 1
0 0
1 0
0 0
0 0
0
0
0
0
1
0
1
0
0
0
0
a1
a2
a2 a4
0
0
a3 = a1
1 a4 a5
0
a5
a3
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
1
0
0
0
0
0
1
0
1
1 XXX
* 1
XX
X
X
X 2
z
2 H
3
H
HHH
*
H
H
j
H
4 XXX
4
XXX
X
X 5
z
5
-1
*2
H
H
j3
H
3
2H
4
5
-4H
-1H
*1
H
H
-2
j2
H
-3
*
H
- 5 HH
j5
-1
-2
@
R
@
-3
HH
*3
H
j4
H
-4
-5
3
4
-5
@
R
@
@
- @
R
@
- @
R
@
R
@
-
@
- @
R
@
- @
R
@
- @
R
There are many other ways that this permutation can be represented as composition of transpositions. Just take any drawing where you draw
curves going to the right from the numbers 1, 2,
3, 4, and 5 to their correct targets. (Youll need
to make sure that all the crossings are only double
crossings and that there are only finitely many of
crossings.) The number of crossings will vary, but
well the parity of the number of crossings doesnt
change. We expressed this example as a composition of 4 transpositions, so however its expressed,
it will have to involve an even number of transpositions.
2
@
R
@
@
- @
R
-
@
R
@
@
- @
R
Therefore, the total number of crossings has to dicated with +, odd with
be even. That says that the identity transformation
1234 + 2134
can only be expressed as the composition of an even
1243 2143 +
number of transpositions.
q.e.d.
1324 2314 +
1342 + 2341
We can now define the parity of a permutation
1423 + 2413
to be either even if its the product of an even
1432 2431 +
number of transpositions or odd if its the product
.
3124
3142
3214
3241
3412
3421
+
+
4123
4132
4213
4231
4312
4321
+
+
This definition usually is used to compute determinants when n is small, 2 or 3, and it agrees with
what we did above. But when n is 4 or greater,
there are so many terms that it isnt practical to
use the definition to compute the value of a determinant. There are much faster ways of computing
determinants.
The determinant of a 4 4 matrix. Lets take
a generic matrix.
a11
a21
A=
a31
a41
a12
a22
a32
a42
a13
a23
a33
a43
a14
a24
a34
a44