Given two groups, and , we can define a group homomorphism, denoted as the sign function as
- Recall, every can be decomposed into k transpositions. the number of transpositions = number of permutations as it is the number of times we swap two numbers!
Where does it come from?
suppose we have an where we can define the following group action for function of the following form : f = \prod_{i < j} (x_i - x_j)$$$$\sigma \cdot f = \prod_{i < j} (x_{\sigma(i)} - x_{\sigma(j)}) lets do a simple example, , how does look like for all ?
Notice how the functions with odd number of permutations have a negative sign, while the ones that have an even number is the original function? That is our goal that we want to encode into our function!
Hence we can actually define the above as a group action!
Prove it is a group Homomorphism
- Note : permutations add up!
anagrams
e, ae, ea, eb, be, ab
1, 2, 2, 2, 2, 4
e, a, b, ab
1, 2, 2, 4
ab = cd
Fundamental properties :
trihedral group :
,
baabb = a aabb = ba
(1, 2, 3)(1, 2, 3)
e, ea, ae, eb, be, eaa, aae, ebb, bbe, abb, bba, aabb, bbaa, ba, ab
a, b, c, d, e, f, g, h, i e, a, b, aa, bb, abb, bba, aabb, bbaa
1, 2, 2, 3, 3, 4, 4, 5, 5
1 x 4 +
det : aei - afh + bdi - bfg + cdh - ceh
aei - bfg + cdh = afh - bdi + ceh