Validating Logic in a Group Theory Problem

Click For Summary

Homework Help Overview

The discussion revolves around a group theory problem involving the relationship between a normal subgroup \( A \) and its commutator subgroup \( A' \). The original poster seeks to prove that if \( A \lhd B \), then \( A' \neq A \), and presents a series of logical steps to support this claim.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • The original poster outlines a sequence of logical steps and seeks validation for the reasoning from line (3) to (4). Participants question the validity of these steps, particularly the implications of normality and commutativity in the context of subgroup definitions.

Discussion Status

Participants are actively engaging with the original poster's logic, with some expressing doubt about the assumptions made. There is a focus on clarifying definitions and exploring the implications of normal subgroups, with no clear consensus reached yet.

Contextual Notes

Some participants note the importance of the constraint that \( A \) is not simply the trivial group, which may affect the validity of the original poster's claims. Additionally, there are references to external resources for further clarification on group properties.

A.Magnus
Messages
138
Reaction score
0
To make a very long story short, in a group theory problem I am working on, I need to prove this:

##A \lhd B \Rightarrow A'\neq A##,
where ##A## and ##B## are finite and ##A'## is called the commutator subgroup:

##\begin{align}
A' :&= [A, A] \\
&= \langle [x, y] \mid x, y \in A \rangle \\
&= \langle x^{-1}y^{-1}xy \rangle
\end{align}##.
Here are the lines I made out: Since ##A## is a normal subgroup, therefore it is commutative. For ##\forall x, \forall y \in A##,

##\begin{align}
xy &= yx && (1)\\
y^{-1}xy &= x && (2)\\
y^{-1}xy &\in A && (3)\\
x^{-1}y^{-1}xy &\notin A && (4)\\
\langle x^{-1}y^{-1}xy \rangle &\neq A && (5)\\
\langle [x, y] \rangle &\neq A && (6)\\
[A, A] &\neq A && (7)\\
A' &\neq A && (8)
\end{align}##.​

With this posting, I am very interested to know if the logic from line (3) to (4) and to (5) are valid, and if they are not, I would love to learn how they should be instead. Thank you for your time and help.
 
Physics news on Phys.org
I can think of no basis at all for your step (3) to (4). Indeed, isn't the term on the left in (4) the identity element?
A.Magnus said:
Since A is a normal subgroup, therefore it is commutative.
Are you sure? A long time since I studied groups, but that doesn't sound familiar.
 
haruspex said:
I can think of no basis at all for your step (3) to (4). Indeed, isn't the term on the left in (4) the identity element?
Honestly I am so doubtful of this logic that I decided to put it up here as a question. Do you have any other suggestion then?
 
A.Magnus said:
Honestly I am so doubtful of this logic that I decided to put it up here as a question. Do you have any other suggestion then?
Why do you think what you are trying to prove is even true?
Isn't the trivial group consisting of the identity {1} a normal subgroup of B? And is it not equal to its own commutator subgroup?
 
haruspex said:
Are you sure? A long time since I studied groups, but that doesn't sound familiar.
What I am trying to imply is that since the definition of normal subgroup goes like this:
##N \lhd G \Leftrightarrow \forall n \in N, \forall g \in G, ng = gn##,​
does this imply that ##n## is then abelian? Let me know and thanks.
 
A.Magnus said:
What I am trying to imply is that since the definition of normal subgroup goes like this:
##N \lhd G \Leftrightarrow \forall n \in N, \forall g \in G, ng = gn##,​
does this imply that ##n## is then abelian? Let me know and thanks.
No, that's not the definition of a normal subgroup. g-1ng is an element of N, but not necessarily n.
http://en.wikipedia.org/wiki/Normal_subgroup
 
haruspex said:
Why do you think what you are trying to prove is even true?
Isn't the trivial group consisting of the identity {1} a normal subgroup of B? And is it not equal to its own commutator subgroup?
Let me type in the whole question so that you can see it as a big picture, give me about 5 minutes, if you will. Thanks.
 
haruspex said:
Why do you think what you are trying to prove is even true?
Isn't the trivial group consisting of the identity {1} a normal subgroup of B? And is it not equal to its own commutator subgroup?
I typed in the original question couple of days on MSE here, but I did not get any help perhaps because I typed in the question way TOO LONG, therefore nobody gets interested and therefore it is lost forever, and there is no way to resuscitate it back from dead. I would love to get any idea from you. Thanks.
 
Ok. In this thread you omitted the key constraint that A is not simply {1}.
Can you show that if Hi/Hi-1 is abelian then Hi-1 = Hi'?
 
  • #10
haruspex said:
Ok. In this thread you omitted the key constraint that A is not simply {1}.
Can you show that if Hi/Hi-1 is abelian then Hi-1 = Hi'?
Is this the direction you are hinting me to pursue: If I can prove that ##H_{i-1} = H'_i##, then it implies ##H_i \neq H'_i##?
 
  • #11
A.Magnus said:
Is this the direction you are hinting me to pursue: If I can prove that ##H_{i-1} = H'_i##, then it implies ##H_i \neq H'_i##?
No, that would be trivial. ##H_{i-1} \neq H_i## by definition, so if ##H_{i-1} = H'_i##, then ##H_i \neq H'_i##.
 
  • #12
haruspex said:
Ok. In this thread you omitted the key constraint that A is not simply {1}.
Can you show that if Hi/Hi-1 is abelian then Hi-1 = Hi'?
Ok, here is what I understand of factor group: If ##b \in H_i## then the factor group ##H_i / H_{i-1} = \{ bH_{i-1} \}##, am I correct? And then since ##H_i / H_{i-1}## is abelian, therefore ##bH_{i-1} = H_{i-1}b##? Am I correct?
 
  • #13
A.Magnus said:
since ##H_i / H_{i-1}## is abelian, therefore ##bH_{i-1} = H_{i-1}b##?
I don't see why. It certainly implies ##bH_{i-1} aH_{i-1} = aH_{i-1} bH_{i-1}## for all a, b in ##H_i##.
Take a look at https://www.proofwiki.org/wiki/Abelian_Quotient_Group
 
  • #14
haruspex said:
I don't see why. It certainly implies ##bH_{i-1} aH_{i-1} = aH_{i-1} bH_{i-1}## for all a, b in ##H_i##.
Take a look at https://www.proofwiki.org/wiki/Abelian_Quotient_Group
Thanks! I think I am about to get it now, I will keep working on it. Thanks again and again.
 
  • #15
haruspex said:
I don't see why. It certainly implies ##bH_{i-1} aH_{i-1} = aH_{i-1} bH_{i-1}## for all a, b in ##H_i##.
Take a look at https://www.proofwiki.org/wiki/Abelian_Quotient_Group

Are you still there? I am continuing the conversation, suppose that ##N## is normal subgroup of ##G## and ##G/H## is abelian:

##\begin{align}
\forall aH,bH &\in G/H \\
aHbH &= bHaH \qquad \qquad &&(1) \\
abH &= baH &&(2) \\
ab(ba)^{−1} &\in H &&(3a) \\
ab(ba)^{−1} &=H &&(3b) \\
\ldots & \ldots \\
aba^{−1}b^{−1} &= H &&(4)\\
[a, b] &= H &&(5)\\
G' &= H &&(6) \\
\end{align} ##
My question is: Which one is correct, the (3a) or (3b)? As you advise, my final goal is ##G' = H##. Please advise and thanks again.

 
  • #16
A.Magnus said:
Are you still there? I am continuing the conversation, suppose that ##N## is normal subgroup of ##G## and ##G/H## is abelian:

##\begin{align}
\forall aH,bH &\in G/H \\
aHbH &= bHaH \qquad \qquad &&(1) \\
abH &= baH &&(2) \\
ab(ba)^{−1} &\in H &&(3a) \\
ab(ba)^{−1} &=H &&(3b) \\
\ldots & \ldots \\
aba^{−1}b^{−1} &= H &&(4)\\
[a, b] &= H &&(5)\\
G' &= H &&(6) \\
\end{align} ##
My question is: Which one is correct, the (3a) or (3b)? As you advise, my final goal is ##G' = H##. Please advise and thanks again.

I assume you mean H, not N.
Clearly 3(b) is not right, but maybe you meant ##<ab(ba)^{−1}> =H##.
My reading of the link I posted is that you can only say ##<ab(ba)^{−1}> \leq H##.
But maybe that's enough to get to the result you are after.
 
  • #17
Thank you for your time and help.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
5K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
12
Views
2K
Replies
5
Views
2K