Normal Subgroups Proof with defined order

In summary, a normal subgroup is a subgroup of a group that is closed under conjugation by all elements of the larger group. It is defined as a subgroup that is invariant under conjugation and can be proved using relevant theorems and properties of groups. The order of a normal subgroup is the number of elements in the subgroup and one example of a proof with defined order is showing that the set of even integers is a normal subgroup of the group of integers under addition.
  • #1
tiger4
7
0

Homework Statement



Let G be a group and H normal with G. Prove that if |H| = 2, then H is a subgroup of Z(G).

Homework Equations


The Attempt at a Solution



Since H is a subgroup, it must contain the identity, call it e. Call the non-identity element of H h. Thus, H = {h, e}. Since H contains its own inverses, h^2 = e (if h^2 = h, then h would have to be the identity).

Anyway, by the normality of H, we know that for any element g of G, gH = Hg. That is to say,
{gh, ge} = {hg, eg}, which means that
{gh, g} = {hg, g}

since h is not the identity, we know that gh≠g and hg≠g. Thus, in order for Hg and gH to be equal, we must have that gh = hg for an arbitrary element g. Thus, we have shown that H is a subgroup of Z(G).

a.) Is this right?
b.) If someone could clean up any loose ends, that would be great. My teacher is extremely picky on homework.
 
Last edited:
Physics news on Phys.org
  • #2


a.) Yes, your proof is correct.
b.) Here are some possible ways to clean up the proof:

- Instead of saying "Since H is a subgroup, it must contain the identity, call it e," you could say "Since H is a subgroup, it must contain the identity element, denoted by e."
- In the line "Thus, in order for Hg and gH to be equal, we must have that gh = hg for an arbitrary element g," you could add a bit more explanation. For example, you could say "Since H is a subgroup of G and H is normal, we know that for any element g of G, gH = Hg. This means that for any element h in H, gh must be equal to hg."
- In the line "since h is not the identity, we know that gh≠g and hg≠g," you could add a reason for why this is true. For example, you could say "Since |H| = 2, h is not equal to the identity element e. Therefore, gh cannot be equal to g, and hg cannot be equal to g."
 

FAQ: Normal Subgroups Proof with defined order

1. What is a normal subgroup?

A normal subgroup is a subgroup of a group that is invariant under conjugation by elements of the larger group. This means that if an element of the larger group is multiplied by an element of the normal subgroup and then multiplied by the inverse of that element, the result will still be in the normal subgroup.

2. How is a normal subgroup defined?

A normal subgroup is defined as a subgroup that is closed under conjugation by all elements of the larger group. In other words, for any element g in the larger group and any element n in the normal subgroup, the element gng^-1 is also in the normal subgroup.

3. How do you prove that a subgroup is normal?

To prove that a subgroup is normal, you can use the definition of a normal subgroup as well as any other relevant theorems or properties of groups. One common method is to show that the subgroup is invariant under conjugation by all elements of the larger group.

4. What is the order of a normal subgroup?

The order of a normal subgroup is the number of elements in the subgroup. This is usually denoted by |H|, where H is the normal subgroup.

5. Can you give an example of a normal subgroup proof with defined order?

Yes, one example is proving that the set of even integers is a normal subgroup of the group of integers under addition. To do this, we can show that for any even integer n and any integer g, the element gng^-1 is also an even integer. This can be done by realizing that gng^-1 = 2m, where m is an integer, and thus gng^-1 is also an even integer.

Similar threads

Replies
2
Views
1K
Replies
2
Views
1K
Replies
6
Views
1K
Replies
7
Views
1K
Replies
4
Views
1K
Back
Top