- 5,560
- 24
Well, in 5 years of PF'ing and watching over this forum, I am finally posting my first homework question.
I'm taking a graduate course in Algebra, and it's been 11 years since I took the undergraduate version. So, I'm going back and doing all the homework exercises in my undergrad book. I'm stuck on this one.
S_A is the group of all permutations of a set A under permutation multiplication. B is a subset of A, and b is a particular element of B. Determine whether the given set is sure to be a subgroup of S_A under the induced operation. Here \sigma<b>=\{\sigma(x)|x \in B\}</b>
And the subsets are...
H=\{\sigma\in S_A|\sigma<b>\subseteq B\}</b>
K=\{\sigma\in S_A|\sigma<b>=B\}</b>
Not applicable.
First let's consider H. The elements of H are all of the permutations that send the elements of B to a subset of B. To try to grasp this, I considered an example.
Let A=\{1,2,3,4,5\} and B=\{1,2,3\}. Then choose a permutation \sigma_1 that satisfies the condition of membership in H.
\sigma_1=\left(\begin{array}{ccccc}1 & 2 & 3 & 4 & 5\\3 & 1 & 2 & 5 & 4 \end{array}\right)
When I look at this, I can't see how H could be anything other than K itself. If the image of B under \sigma_1 is anything other than B, then it contains elements of A that do not belong to B. Hence, the image would not be a subset of B.
The answer in the back of the book says that H is not a subgroup of S_A, as it is not closed under taking of inverses. I do not see how that could possibly be right.
I'll leave K alone until I get H sorted out.
Thanks,

Homework Statement
S_A is the group of all permutations of a set A under permutation multiplication. B is a subset of A, and b is a particular element of B. Determine whether the given set is sure to be a subgroup of S_A under the induced operation. Here \sigma<b>=\{\sigma(x)|x \in B\}</b>
And the subsets are...
H=\{\sigma\in S_A|\sigma<b>\subseteq B\}</b>
K=\{\sigma\in S_A|\sigma<b>=B\}</b>
Homework Equations
Not applicable.
The Attempt at a Solution
First let's consider H. The elements of H are all of the permutations that send the elements of B to a subset of B. To try to grasp this, I considered an example.
Let A=\{1,2,3,4,5\} and B=\{1,2,3\}. Then choose a permutation \sigma_1 that satisfies the condition of membership in H.
\sigma_1=\left(\begin{array}{ccccc}1 & 2 & 3 & 4 & 5\\3 & 1 & 2 & 5 & 4 \end{array}\right)
When I look at this, I can't see how H could be anything other than K itself. If the image of B under \sigma_1 is anything other than B, then it contains elements of A that do not belong to B. Hence, the image would not be a subset of B.
The answer in the back of the book says that H is not a subgroup of S_A, as it is not closed under taking of inverses. I do not see how that could possibly be right.
I'll leave K alone until I get H sorted out.
Thanks,
Last edited: