Blog Archive

Monday, June 3, 2024

Group, review

Group_review

The aim of this blog is that give a brief review and lifting some concepts in group theory.

Pre

One important source of the group comes from a description of the symmetry of an object.

Let C be a locally small category, for example, Set,Top,VectF... and their subcategory.

Let X∈Ob(C),AutC(X) form a group, and this group describe the symmetry of X in C.

Let C′⊂C be a subcategory and X∈Ob(C′) as well, AutC′(X) is a subgroup of AutC(X).

Let D be another category. F:C→D be a functor.

Then F:AutC(X)→AutD(FX) is a group homomorphism.

Hom functor

Let C be a category, HomC(−,−):Cop×C→Set, (X,Y)⟼HomC(X,Y) define a bifunctor.

For the morphism (f,g):(X,Y)→(X′,Y′),

(1)HomC(X,Y)⟶HomC(X′,Y′)ϕ⟼gϕf.

Definition. Bi-Coset.

Let G be a group, H,K⊆G. Then HxK is called bi-coset

Proposition. HxK∩HyK≠∅⟺HxK=HyK.

Proof. If HxK∩HyK≠∅. Let hxk=h′yk′, x=h−1h′yk′k−1∈HyK. Hence HxK⊆HyK. By symmetry, HxK=HyK.

Proposition. For each HxK, pick one element x to represent that, then G=⨆xHxK.

Proof. Obviously.

Definition. Centre

Let G be a group, the centre of G is

(2)Z(G):={z∈G|∀x∈G,zx=xz}

Notice that Z(−):Grp→Ab is a functor.

Definition. Inner automorphism.

Let G be a group, for x∈G,

(3)Adx:G⟶Gg⟼xg:=xgx−1

Give us an element of AutGrp(G)

We call that inner automorphism of G.

Notice that

(4)Ad1=idG,Adxy(g)=xygy−1x−1=Adx∘Ady(g)

Hence we induce a group homomorphism

(5)Ad:G→Aut(G)x⟼Adx

The group of inner automorphism is

(6)Inn(G)

The kernel of Ad is Z(G), since if x∈Z(G), then ∀g∈G,Adx(g)=xgx−1=g.

By the first isomorphism theorem,

(7)Inn(G)≅GZ(G)

Proposition.

(8)Inn(G)◃AutGrp(G)

Proof.

We need to prove that ϕInn(G)ϕ−1=Inn(G).

(9)ϕ∘Adx∘ϕ−1(y)=ϕ(xϕ−1(y)x−1)=ϕ(x)yϕ(x)−1=Adϕ(x)∈Inn(G)◻

Let C,D be two locally small category and let X∈Ob(C),Y∈Ob(D).

Let F,G:C→D be two functors, in particular, let us consider two subcategory AutC(X),AutD(Y).

Assume F(X)=Y=G(X), then F,G induce two group homomorphism from AutC(X) to AutD(Y)​.

Easy to see that AutC(X) and AutD(Y) are two categories. Now let us view F,G:AutC(X)→AutD(Y).

If there exists a natural transformation between F,G, then it should looks like

(10)F(X)→F(f)F(X)g↓↓gG(X)→G(f)G(X)

Here g∈Mor(AutD(Y)), hence invertible. i.e. every natural transformation is natural isomorphism.

(11)Gg=gF⟹G=gFg−1

Definition. centralizers and normalizers.

Let E be a subset of G, the centralizer of E is

(12)ZG(E):={z∈G:∀x∈E,zx=xz}

The nomoralizer of E is

(13)NG(E):={n∈G:Adn(E)=E}

Proposition. Both ZG(E) and NG(E) are subgroups of G.

Proof.

Both ZG(E) and NG(E) is nonempty, since they both involve identity.

Let x,y∈ZG(E),∀a∈E,xya=x(ya)=x(ay)=(xa)y=axy

(14)a=ea=(x−1x)a=x−1(xa)=x−1ax=a⟹x−1a=ax−1

Notice that ZG(E) is not necessary to be an abelian group.

For example, Suppose that G∉Ab, let E=Z(G), Then ZG(E)={z∈G:∀x∈Z(G),zx=xz}=G

For NG(E), Let x,y∈NG(E),Adxy(E)=Adx∘Ady(E)=E. ◻

Easy to see that

(15)ZG(E)=⋂x∈EZG(x)

Hence

(16)E1⊆E2⟹ZG(E1)⊇ZG(E2)

 

No comments:

Post a Comment

Popular Posts