permutation representation
Let G be a group, and S any finite set on which G acts.
That means that for any g,h∈G; 𝐯,𝐰∈S
-
•
g𝐯∈V,
-
•
(gh)𝐯=g(h𝐯),
-
•
e𝐯=𝐯.
Notice that we almost have what it takes to make S a representation of G, but S is no vector space
. We can however obtain a G-module (a vector space carrying a representation of G) as follows.
Let S={𝐬1,𝐬2,…,𝐬n}. And let ℂS=ℂ[𝐬1,𝐬2,…,𝐬n] be the vector space generated by S over ℂ. in other words, ℂS is made of all formal linear combinations
c1𝐬1+c2𝐬2+⋯+cn𝐬n with cj∈ℂ.
The sum is defined coordinate-wise as is scalar multiplication.
Then the action of G in S can be extended linearly to ℂS as
g(c1𝐬1+c2𝐬2+⋯+cn𝐬n)=c1(g𝐬1)+c2(g𝐬2)+⋯+cn(g𝐬n) |
and then the map ρ:G→GL(ℂS) where ρ is such that ρ(g)(𝐯)=g𝐯 makes ℂS into a G-module. The G-module ℂS is known as the permutation representation associated with S.
Example.
If G=Sn acts on S={𝟏,𝟐,…,𝐧}, then
ℂS={c1𝟏+c2𝟐+⋯+cn𝐧}. |
If σ∈Sn, the action becomes
σ(c1𝟏+c2𝟐+⋯+cn𝐧)=c1σ(𝟏)+c2σ(𝟐)+⋯+cnσ(𝐧). |
Since S forms a basis for this space, we can compute the matrices corresponding to the defining permutation and we will see that the corresponding permutation matrices
are obtained.
References.
Bruce E. Sagan. The Symmetric Group: Representations, Combinatorial Algorithms and Symmetric Functions. 2a Ed. 2000. Graduate Texts in Mathematics. Springer.
Title | permutation representation |
---|---|
Canonical name | PermutationRepresentation |
Date of creation | 2013-03-22 14:53:59 |
Last modified on | 2013-03-22 14:53:59 |
Owner | drini (3) |
Last modified by | drini (3) |
Numerical id | 6 |
Author | drini (3) |
Entry type | Definition |
Classification | msc 20Cxx |
Related topic | MatrixRepresentation |