Group Theorems: Lagrange, Sylow, Cauchy

Math Online Tom Circle

1. Lagrange Theorem:
Order of subgroup H divides order of Group G

Converse false:
having h | g does not imply there exists a subgroup H of order h.
Example: Z3 = {0,1,2} is not subgroup of Z6
although o(Z3)= 3 which divides o(Z6)= 6

However,
if h = p (prime number),
=>
2. Cauchy Theorem: if p | g
then G contains an element x (so a subgroup) of order p.
ie.
$latex x^{p} = e $ ∀x∈ G

3. Sylow Theorem :
for p prime,
if p^n | g
=> G has a subgroup H of order p^n:
$latex h= p^{n}$

Conclusion: h | g
Lagrange (h) => Sylow (h=p^n) => Cauchy (h= p, n=1)

Trick to Remember:

g = kh (god =kind holy)
=> h | g
g : order of group G
h : order of subgroup H…

View original post 83 more words

Advertisements

About tomcircle

Math amateur
This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.