Proving Graph Theory with Group Permutations | G = Sn and S Set

[TheMathNoob]

Homework Statement

The problem is attached. I don't get this part. Let G = Sn be the group of all permutations of S. S is a set, so how can we permute something in a set?. Neither I know if the 4 power in the S is a typo.

Homework Equations

The Attempt at a Solution

 

[Office_Shredder]

A permutation is just a function from S to S which is a bijection. I agree the 4 looks like a typo, or perhaps is referencing a footnote?

 

[TheMathNoob]

A permutation is just a function from S to S which is a bijection. I agree the 4 looks like a typo, or perhaps is referencing a footnote?

Yes, I have to prove that it is a bijection, but I don't understand how this function acts on the set because as I said, you can't permute things in a set.

 

[Office_Shredder]

You have to prove that \sigma acts as a bijection on the vertices of G. I am telling you that the definition of a permutation on a finite set (how \sigma acts on S, not V) is a function that is a bijection.

For example, suppose that the set is {1,2,3}. Then one permutation f(n) might be f(1) = 2, f(2) = 3, f(3) = 1. Another might be f(1) = 1, f(2) = 3, f(3) = 2.