Place-permutation action explained

In mathematics, there are two natural interpretations of the place-permutation action of symmetric groups, in which the group elements act on positions or places. Each may be regarded as either a left or a right action, depending on the order in which one chooses to compose permutations. There are just two interpretations of the meaning of "acting by a permutation

\sigma " but these lead to four variations, depending whether maps are written on the left or right of their arguments. The presence of so many variations often leads to confusion. When regarding the group algebra of a symmetric group as a diagram algebra^[1] it is natural to write maps on the right so as to compute compositions of diagrams from left to right.

Maps written on the left

First we assume that maps are written on the left of their arguments, so that compositions take place from right to left. Let

ak{S} _{n} be the symmetric group^[2] on n letters, with compositions computed from right to left.

Imagine a situation in which elements of

ak{S} _{n} act^[3] on the “places” (i.e., positions) of something. The places could be vertices of a regular polygon of n sides, the tensor positions of a simple tensor, or even the inputs of a polynomial of n variables. So we have n places, numbered in order from 1 to n , occupied by n objects that we can number x _{1,} ... , x _{n} . In short, we can regard our items as a word x = x _{1} … x _{n} of length n in which the position of each element is significant. Now what does it mean to act by “place-permutation” on x ? There are two possible answers:

1. an element

\sigma \in ak{S} _{n} can move the item in the j th place to the \sigma(j) th place, or

1. it can do the opposite, moving an item from the

\sigma(j) th place to the j th place.

Each of these interpretations of the meaning of an “action” by

\sigma (on the places) is equally natural, and both are widely used by mathematicians. Thus, when encountering an instance of a "place-permutation" action one must take care to determine from the context which interpretation is intended, if the author does not give specific formulas.

Consider the first interpretation. The following descriptions are all equivalent ways to describe the rule for the first interpretation of the action:

• For each

j , move the item in the j th place to the \sigma(j) th place.

• For each

j , move the item in the \sigma ^{-1} (j) th place to the j th place.

• For each

j , replace the item in the j th position by the one that was in the \sigma ^{-1} (j) th place.

This action may be written as the rule

x _{1} … x _{n} \overset{\sigma} {\longrightarrow} x _{\sigma ^{-1} ( 1 )} … x _{\sigma ^{-1} (n)} .

Now if we act on this by another permutation

\tau then we need to first relabel the items by writing y _{1} … y _{n} = x _{\sigma ^{-1} ( 1 )} … x _{\sigma ^{-1} (n)} . Then \tau takes this to y _{\tau ^{-1} ( 1 )} … y _{\tau ^{-1} (n)} = x _{\sigma ^{-1} \tau ^{-1} ( 1 )} … x _{\sigma ^{-1} \tau ^{-1} (n)} = x _{(\tau\sigma) ^{-1} ( 1 )} … x _{(\tau\sigma) ^{-1} (n)} . This proves that the action is a left action: \tau ⋅ (\sigma ⋅ x) = (\tau \sigma) ⋅ x .

Now we consider the second interpretation of the action of

\sigma , which is the opposite of the first. The following descriptions of the second interpretation are all equivalent:

• For each

j , move the item in the j th place to the \sigma ^{-1} (j) th place.

• For each

j , move the item in the \sigma(j) th place to the j th place.

• For each

j , replace the item in the j th position by the one that was in the \sigma(j) th place.

This action may be written as the rule

x _{1} … x _{n} \overset{\sigma} {\longrightarrow} x _{\sigma(1)} … x _{\sigma(n)} .

In order to act on this by another permutation

\tau , again we first relabel the items by writing y _{1} … y _{n} = x _{\sigma(1)} … x _{\sigma(n)} . Then the action of \tau takes this to y _{\tau(1)} … y _{\tau(n)} = x _{\sigma} … x _{\sigma} = x _{(\sigma\tau)(1)} … x _{(\sigma\tau)(n)} . This proves that our second interpretation of the action is a right action: (x ⋅ \sigma) ⋅ \tau = x ⋅ (\sigma \tau) .

Example

If

\sigma = ( 1 , 2 , 3 ) is the 3-cycle 1 \to 2 \to 3 \to 1 and \tau = ( 1 , 3 ) is the transposition 1 \to 3 \to 1 , then since we write maps on the left of their arguments we have \sigma \tau = ( 1 , 2 , 3 )( 1 , 3 ) = ( 2 , 3 ), \tau \sigma = ( 1 , 3 )( 1 , 2 , 3 ) = ( 1 , 2 ). Using the first interpretation we have x = x _{1} x _{2} x _{3} \overset{\sigma} {\longrightarrow} x _{3} x _{1} x _{2} \overset{\tau} {\longrightarrow} x _{2} x _{1} x _{3} , the result of which agrees with the action of \tau \sigma = ( 1 , 2 ) on x = x _{1} x _{2} x _{3} . So \tau ⋅ (\sigma ⋅ x) = (\tau\sigma) ⋅ x .

On the other hand, if we use the second interpretation, we have

x = x _{1} x _{2} x _{3} \overset{\sigma} {\longrightarrow} x _{2} x _{3} x _{1} \overset{\tau} {\longrightarrow} x _{1} x _{3} x _{2} , the result of which agrees with the action of \sigma \tau = ( 2 , 3 ) on x = x _{1} x _{2} x _{3} . So (x ⋅ \sigma) ⋅ \tau = x ⋅ (\sigma\tau) .

Maps written on the right

Sometimes people like to write maps on the right^[4] of their arguments. This is a convenient convention to adopt when working with symmetric groups as diagram algebras, for instance, since then one may read compositions from left to right instead of from right to left. The question is: how does this affect the two interpretations of the place-permutation action of a symmetric group?

The answer is simple. By writing maps on the right instead of on the left we are reversing the order of composition, so in effect we replace

ak{S} _{n} by its opposite group ak{S} ^{op} _{n} . This is the same group, but the order of compositions is reversed.

Reversing the order of compositions evidently changes left actions into right ones, and vice versa, changes right actions into left ones. This means that our first interpretation becomes a right action while the second becomes a left one.

In symbols, this means that the action

x _{1 …} x _{n \overset{\sigma}{\longrightarrow}} x _{1 \sigma ^{-1}} … x _{n\sigma ^{-1}} is now a right action, while the action x _{1 …} x _{n \overset{\sigma}{\longrightarrow}} x _{1\sigma} … x _{n\sigma} is now a left action.

Example

We let

\sigma = ( 1 , 2 , 3 ) be the 3-cycle 1 \to 2 \to 3 \to 1 and \tau = ( 1 , 3 ) the transposition 1 \to 3 \to 1 , as before. Since we now write maps on the right of their arguments we have \sigma \tau = ( 1 , 2 , 3 )( 1 , 3 ) = ( 1 , 2 ), \tau \sigma = ( 1 , 3 )( 1 , 2 , 3 ) = ( 2 , 3 ). Using the first interpretation we have x = x _{1} x _{2} x _{3} \overset{\sigma} {\longrightarrow} x _{3} x _{1} x _{2} \overset{\tau} {\longrightarrow} x _{2} x _{1} x _{3} , the result of which agrees with the action of \sigma \tau = ( 1 , 2 ) on x = x _{1} x _{2} x _{3} . So (x ⋅ \sigma) ⋅ \tau = x ⋅ (\sigma\tau) .

On the other hand, if we use the second interpretation, we have

x = x _{1} x _{2} x _{3} \overset{\sigma} {\longrightarrow} x _{2} x _{3} x _{1} \overset{\tau} {\longrightarrow} x _{1} x _{3} x _{2} , the result of which agrees with the action of \tau\sigma = ( 2 , 3 ) on x = x _{1} x _{2} x _{3} . So \tau ⋅ (\sigma ⋅ x) = (\tau\sigma) ⋅ x .

Summary

In conclusion, we summarize the four possibilities considered in this article. Here are the four variations:

Rule	Type of action
x _{1} … x _{n} \overset{\sigma} {\longrightarrow} x _{\sigma ^{-1} ( 1 )} … x _{\sigma ^{-1} (n)}	left action
x _{1} … x _{n} \overset{\sigma} {\longrightarrow} x _{\sigma(1)} … x _{\sigma(n)}	right action
x _{1} … x _{n} \overset{\sigma} {\longrightarrow} x _{1 \sigma ^{-1}} … x _{n\sigma ^{-1}}	right action
x _{1} … x _{n} \overset{\sigma} {\longrightarrow} x _{1\sigma} … x _{n\sigma}	left action

Although there are four variations, there are still only two different ways of acting; the four variations arise from the choice of writing maps on the left or right, a choice which is purely a matter of convention.

References

• Tom Halverson and Arun Ram, "Partition algebras", European J. Combin. 26 (2005), no. 6, 869–921.
• Thomas Hungerford, Algebra. Springer Lecture Notes 73, Springer-Verlag 1974.
• Gordon D. James, The Representation Theory of the Symmetric Groups. Lecture Notes in Math. 682 (1978), Springer.
• Hermann Weyl, The Classical Groups: Their Invariants and Representations. Princeton University Press, Princeton, N.J., 1939.

Notes and References

1. For a readable overview of various diagram algebras generalizing group algebras of symmetric groups, see Halverson and Ram 2005.
2. See James 1978 for the representation theory of symmetric groups. Weyl 1939, Chapter IV treats the important topic now known as Schur–Weyl duality, which is an important application of the place-permutation action.
3. Hungerford 1974, Chapter II, Section 4
4. See e.g., Section 2 of James 1978.