You are on page 1of 3

g_1=h_j∙〖h_i〗^(-1)

Because h_j∙〖h_i〗^(-1)∈H, so g_1∈H


This contradiction g_1∉H
Assumption is wrong, then claim is true.
*Construction 2 :
Pick g_2∈G not in H or g_1 H
g_2 H={g_2∙h for all h∈H}
H and g_2 H do not overlap
g_1 H and g_2 H do not overlap
Claim: g_1 H and g_2 H have no element in common
Assume there is an element in g_1 H and g_2 H
This means g_1∙h_i=g_2∙h_j for some h_i and h_j in H
g_1∙h_i=g_2∙h_j
(g_1∙h_i )∙〖h_j〗^(-1)=(g_2∙h_j )∙〖h_j〗^(-1)
g_1∙(h_i∙〖h_j〗^(-1) )=g_2∙(h_j∙〖h_j〗^(-1) )
g_1∙(h_i∙〖h_j〗^(-1) )=g_2∙e
g_1∙(h_i∙〖h_j〗^(-1) )=g_2
g_1∙h_k=g_2
Because g_1∙h_k∈H, so g_2∈g_1 H
This contradiction g_2∉g_1 H
Assumption is wrong, then claim is true.

G is split into non-overlapping left cosets: H,g_1 H,g_2 H,… ,g_n H


Each coset is the same size
Pick a coset gH and suppose it has duplicates
g∙h_1=g∙h_2
g^(-1)∙(g∙h_1 )=g^(-1)∙(g∙h_2 )
h_1=h_2
This contradiction
Each coset has size |H|=d.
G partitioned into cosets
|G|=N,|H|=d
Let’s call the number of cosets = k
Index of H in G=|G:H|=k
So d∙k=n⟹d|n
This means |H| divides |G|
Hence langrange’s theorem is proven.
Jdjdjwbjwkskdnwk
Hsidbwjdijdme
Hdjendjdkekek
Bsjskodje
Hsjeoodkene
Kudune kowe ngerti
Tresnoku nomer siji
Penak e leh mu blenjani janji
Kowe tego nglarani

Usahaku wes ra kurang kurang


Gematiku wes pol polan
Pas aku dolan jebul ketemu kowe neng dalan
Kowe konangan gendak an

Ngomongo... Jalokmu pie?


Tak turutane , tak usahakne
Aku ramasalah... yen kon berjuang dewe
Sing penting kowe bahagia endinge

Reff :
Nanging ngopo , walesanmu neng aku
Kowe luwih milih dek'e
Kowe ninggal aku ninggal tatu
Kurang opo , nek ku mertahanke kowe
Kowe malah ngebot i liane

Pikiren bahagiamu , aku gampang

Hskdodnendjd

You might also like