Scribd
Upload
29 views1 page

Module 1 Lecture 2

The document discusses advanced topics in group theory, including right cosets, permutation groups, and the concept of even and odd permutations. It highlights the properties of the symmetric group S4, including its subgroups and the implications of Lagrange's Theorem. Additionally, it introduces the definition of a field and provides examples, along with a brief mention of vector spaces.

Uploaded by

유인웅
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views1 page

Module 1 Lecture 2

The document discusses advanced topics in group theory, including right cosets, permutation groups, and the concept of even and odd permutations. It highlights the properties of the symmetric group S4, including its subgroups and the implications of Lagrange's Theorem. Additionally, it introduces the definition of a field and provides examples, along with a brief mention of vector spaces.

Uploaded by

유인웅
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

NAP 2019, CLASS #2, MAY 08, 2019

ROGER & SYLVIA WIEGAND

• A little more on right cosets, First Iso Thm, etc. Defined the product AB, where
A and B are subsets of a group G and pointed out that when N C G the product
(Hg1 )(Hg2 ) is just Hg1 g2 .
• Discussion of permutation groups. We seem to be using Sn instead of the book’s
Σn . Sorry, Book! Defined “even” and “odd” permutation in the usual way (parity
in number of transpositions used to express the permutation as a product of trans-
positions. Stated, without proof (because proofs tend to be a bit unpleasant) that
no permutation is both even and odd. Stated that the sign of σ is the parity of the
number of “switches” or “reversals”, that is the number of pairs (i, j) with i < j but
σ(i) > σ(j). This is not a useful definition, but it does give a well-defined notion.
It’s not hard to see that this definition works by showing that composition with
an adjacent transposition either adds 1 or subtracts 1 from the number of switches
(and using the fact, easily proved, that every permutation is a product of adjacent
transpositions). Pointed out that An is the kernel of the sign map from Sn to the
mulitplicative group {±1} and hence has index two. Showed that a k-cycle is the
product of k − 1 transpositions, and hence is even if and only if k is odd.
• Jabbered a bit about subgroups of S4 . Showed that there are 9 subgroups of
order 2. Identified the 4 subgroups of order 6 (copies of S3 ) and noted that none is
contained in A4 thereby showing that the “converse” of Lagrange’s Theorem can
fail. I stated, without proof, that S4 has 30 subgroups. Students are encouraged
to play with S4 . For example, find subgroups H1 , H2 , H3 such that H1 C H2 and
H2 C H3 but H1 is not normal in H3 .
√
• Defined “field” and gave examples: Q, R, C, and Q( 3).
• Started jabbering about vector spaces.

You might also like