Algebra I: Groups, Subgroups, and Equivalence Relations, Study notes of Algebra

Definitions and examples of algebra, groups, abelian groups, cayley graphs, dihedral groups, subgroups, and equivalence relations. It covers the concepts of group elements, binary operations, associativity, identity elements, inverses, and closure. The document also explains how to determine if a relation is reflexive, symmetric, transitive, and an equivalence relation, and how partitions arise from equivalence relations.

Typology: Study notes

Pre 2010

Uploaded on 08/17/2009

koofers-user-5rc
koofers-user-5rc ๐Ÿ‡บ๐Ÿ‡ธ

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 201 Algebra I Notes
Definition 1. Algebra
The study of structure that comes from endowing operations on the set.
Definition 2. Group
A group is a pair (G, ฯ•)where Gis a set and ฯ•is a binary operation ฯ•:Gร—Gโ†’Gwhich
is associative and there is an element 1โˆˆGsuch that โˆ€xโˆˆG, ฯ•(1, x) = ฯ•(x, 1) = x, and
(โˆ€xโˆˆG)(โˆƒyโˆˆG)(ฯ•(x, y) = ฯ•(y , x) = 1).
Typically, we write aยทbor ab for ฯ•(a, b) and xโˆ’1for the such that ฯ•(x, y) = ฯ•(y , x) = 1.
Example 1. (Z,+),(Q,+),(R,+),(C,+) are groups under addition. (Q\{0},ยท),(R\{0},ยท),(C\
{0},ยท)are groups under multiplication.
Definition 3. Abelian Group A group is abelian if its operation is commutative.
Example 2. Let Sbe a set. Perm(S):= {bijectionsS โ†’S}. Perm(S) is a group under
function composition.
Composition gives a well-defined (closed) operation Perm(S)ร—Perm(S)โ†’Perm(S).
If |S|<โˆž, then |Perm(S)|= (|S|)! If Xis a set with |X|=nthen write Snfor Perm(X)Snis
the symmetric group.
Example 3. S3
write {1,2,3}for the underlying set.
The following is an example of composing two elements in S3.
๎˜’1 2 3
1 3 2 ๎˜“๎˜’ 1 2 3
2 3 1 ๎˜“=๎˜’123
321๎˜“
๎˜’1 2 3
2 3 1 ๎˜“๎˜’ 1 2 3
1 3 2 ๎˜“=๎˜’123
213๎˜“
Definition 4. Cayley Graph
Have one vertex for each group element, arrows indicating what action each group element has
on each other one.
Example 4. (Z,+) = G
...
-2 -1 0 1 2
+1 +1 +1 +1 ...
Thus 1connects the entire group.
1
pf3
pf4

Partial preview of the text

Download Algebra I: Groups, Subgroups, and Equivalence Relations and more Study notes Algebra in PDF only on Docsity!

Math 201 Algebra I Notes

Definition 1. Algebra The study of structure that comes from endowing operations on the set.

Definition 2. Group A group is a pair (G, ฯ•) where G is a set and ฯ• is a binary operation ฯ• : G ร— G โ†’ G which is associative and there is an element 1 โˆˆ G such that โˆ€x โˆˆ G, ฯ•(1, x) = ฯ•(x, 1) = x, and (โˆ€x โˆˆ G)(โˆƒy โˆˆ G)(ฯ•(x, y) = ฯ•(y, x) = 1).

Typically, we write a ยท b or ab for ฯ•(a, b) and xโˆ’^1 for the such that ฯ•(x, y) = ฯ•(y, x) = 1.

Example 1. (Z, +), (Q, +), (R, +), (C, +) are groups under addition. (Q{ 0 }, ยท), (R{ 0 }, ยท), (C
{ 0 }, ยท) are groups under multiplication.

Definition 3. Abelian Group A group is abelian if its operation is commutative.

Example 2. Let S be a set. Perm(S) := {bijectionsS โ†’ S}. Perm(S) is a group under function composition.

Composition gives a well-defined (closed) operation Perm(S) ร— Perm(S) โ†’ Perm(S). If |S| < โˆž, then |Perm(S)| = (|S|)! If X is a set with |X| = n then write Sn for Perm(X) Sn is the symmetric group.

Example 3. S 3 write { 1 , 2 , 3 } for the underlying set. The following is an example of composing two elements in S 3. ( 1 2 3 1 3 2

Definition 4. Cayley Graph Have one vertex for each group element, arrows indicating what action each group element has on each other one.

Example 4. (Z, +) = G

Thus 1 connects the entire group.

Example 5. Cayley Group on S 3

Edge labeled * are under the operation of (23), while all the other edges are under the operation of (123).

Example 6. GLn(R) := group of invertible n ร— n matrices with entries in R under multiplica- tion. GL means general linear group.

Example 7. Let T be a regular nโˆ’gon in R^2 centered at (0, 0). D 2 n := the group of rigid symmetries of T which fix T (as a set).

Definition 5. Dihedral Group The groups described in Example 7 are known as the Dihedral Groups.

Note: D 2 n can be viewed as a subgroup of GLn(R).

The edge 1 โˆ’ 2 can go to 1 โˆ’ 2 , 2 โˆ’ 3 , 3 โˆ’ 4 , 4 โˆ’ 5 , 5 โˆ’ 6 or you can flip it and it can goto 2 โˆ’ 1 , 3 โˆ’ 2 , 4 โˆ’ 3 , 5 โˆ’ 4 , 6 โˆ’ 5. It turns our that S 3 and D 6 are the same group. September 11, 2006

Definition 6. Let H โІ G, then H is a subgroup of G if H is a group in its own right under the operation of G. This is denoted H โ‰ค G.

Theorem 1. In a group G, if H โІ G, H 6 = โˆ… then H โ‰ค G โ‡โ‡’ (โˆ€x, y โˆˆ H)(yโˆ’^1 x โˆˆ H).

If partition {Sฮฑ} arises from an equivalence relation, then we will call each Sฮฑ an equivalence class.

Example 10. In Z, pick m โˆˆ Z and define

a โ‰ก b โ‡โ‡’ m|a โˆ’ b

. Note that mZ โ‰ค Z so that a โ‰ก b โ‡โ‡’ (โˆ’b) + a โˆˆ mZ Group G and subgroup H โ‰ค G define an equivalence relation by x โ‰ก y โ‡โ‡’ yโˆ’^1 x โˆˆ H. Actually, yโˆ’^1 x โˆˆ H โ‡โ‡’ x โˆˆ yH. So, x โ‰ก y โ‡โ‡’ x โˆˆ yH. If H โ‰ค G, then a coset of H is a subset of G of the form yH for some y โˆˆ G.

Theorem 5. The cosets of H in G partition G.