Processing math: 100%

Tuesday, 22 January 2013

Normalizers and the Conjugacy-Class equation

Definition The normalizer NG(S) of a subset S of a group G is the set of all aG such that Sa=S.

Theorem NG(S)G.
proof: Clearly 1NG(S). Let a,b in NG(S) then Sab=(Sa)b=Sb=S so ab is too. Since the group is finite we have inverses too (make n big enough so that an=1 then a1=an1). Alternative (more sensible) argument: S1=Saa1=Sa1.

Theorem If HG then HNG(H).
proof: We have already seen that it's a group, we just need to show nNG(H),nH=Hn but that's immediate by the definition of normalizer.

Corollary When HG, G=NG(H) implies HG.

Definition Another equivalence relation, conjugacy is defined by xy if there exists some g such that xg=y.

Lemma Central elements partition the group into trivial conjugacy classes.
proof: Let aZ(G) then ga=a1ga=g for all g so every such conjugacy class is a single element.

Lemma The number of conjugates of x (including x) is [G:NG(x)].
proof: orbit stabilizer.

Theorem (Conjugacy Class Equation) |G|=|Z(G)|+x[G:NG(x)]
where the sum is taken over representatives of the non-singleton conjugacy classes.
proof: This is really just a corollary of the lemma plus the information that center elements have trivial conjugacy classes, but we discuss it a bit more anyway. In the abelian case G=Z(G) and there are non non-singleton conjugacy classes so the result is immediate. In the general case GZ(G) are the elements which the conjugacy relation partitions into non-singleton sets - the relation proved in the previous lemma gives the equality.

No comments:

Post a Comment