Algebraic Structures: Group Theory II

Slides:



Advertisements
Similar presentations
Equivalence Relations
Advertisements

Cayley Theorem Every group is isomorphic to a permutation group.
Math 3121 Abstract Algebra I
Groups TS.Nguyễn Viết Đông.
Section 13 Homomorphisms Definition A map  of a group G into a group G’ is a homomorphism if the homomophism property  (ab) =  (a)  (b) Holds for.
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
I. Homomorphisms & Isomorphisms II. Computing Linear Maps III. Matrix Operations VI. Change of Basis V. Projection Topics: Line of Best Fit Geometry of.
Discrete Mathematics Lecture 7 Alexander Bukharovich New York University.
Cosets.
Relations Chapter 9.
Chapter 7 Functions Dr. Curry Guinn. Outline of Today Section 7.1: Functions Defined on General Sets Section 7.2: One-to-One and Onto Section 7.3: The.
MTH-376 Algebra Lecture 1. Instructor: Dr. Muhammad Fazeel Anwar Assistant Professor Department of Mathematics COMSATS Institute of Information Technology.
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Unit – IV Algebraic Structures
By: Hector L Contreras SSGT / USMC
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
Foundations of Discrete Mathematics Chapter 3 By Dr. Dalia M. Gil, Ph.D.
Introduction to Modern Cryptography Sharif University Spring 2015 Data and Network Security Lab Sharif University of Technology Department of Computer.
Lagrange's Theorem. The most important single theorem in group theory. It helps answer: –How large is the symmetry group of a volleyball? A soccer ball?
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFunctions.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Great Theoretical Ideas in Computer Science for Some.
Chapter 9 Functions Let A and B be nonempty sets. A function f from A to B, written f: A  B is a relation from A to B with the property that every element.
What is a set? A set is a collection of objects.
Mathematical Preliminaries
Math 3121 Abstract Algebra I Lecture 5 Finish Sections 6 + Review: Cyclic Groups, Review.
Math 3121 Abstract Algebra I Lecture 10 Finish Section 11 Skip 12 – read on your own Start Section 13.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
Math 3121 Abstract Algebra I
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
1 Discrete and Combinatorial Mathematics R. P. Grimaldi, 5 th edition, 2004 Chapter 5 Relations and Functions.
Math 3121 Abstract Algebra I Lecture 11 Finish Section 13 Section 14.
Chapter 6 Abstract algebra
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas In Computer Science Anupam GuptaCS Fall 2006 Lecture 15Oct 17, 2006Carnegie Mellon University Algebraic Structures: Groups,
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Math 3121 Abstract Algebra I Lecture 14 Sections
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
6.3.2 Cyclic groups §1.Order of an element §Definition 13: Let G be a group with an identity element e. We say that a is of order n if a n =e, and for.
SECTION 8 Groups of Permutations Definition A permutation of a set A is a function  ϕ : A  A that is both one to one and onto. If  and  are both permutations.
 Example: [Z m ;+,*] is a field iff m is a prime number  [a] -1 =?  If GCD(a,n)=1,then there exist k and s, s.t. ak+ns=1, where k, s  Z.  ns=1-ak.
SECTION 10 Cosets and the Theorem of Lagrange Theorem Let H be a subgroup of G. Let the relation  L be defined on G by a  L b if and only if a -1 b 
Equivalence Relations Lecture 45 Section 10.3 Fri, Apr 8, 2005.
Great Theoretical Ideas in Computer Science.
DEFINITION A function f : A  B is onto B (called a surjection) iff Rng(f) = B. We write f : A  B to indicate that f is a surjection. Look at the illustration.
Group A set G is called a group if it satisfies the following axioms. G 1 G is closed under a binary operation. G 2 The operation is associative. G 3 There.
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
FUNCTIONS.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Math 3121 Abstract Algebra I
Relations, Functions, and Matrices
Garis-garis Besar Perkuliahan
Unit-III Algebraic Structures
CS480 Cryptography and Information Security
Great Theoretical Ideas in Computer Science
Groups and Applications
Great Theoretical Ideas In Computer Science
Math 3121 Abstract Algebra I
Number Theory and Modular Arithmetic
CS201: Data Structures and Discrete Mathematics I
Math 3121 Abstract Algebra I
Great Theoretical Ideas in Computer Science
Great Theoretical Ideas in Computer Science
Theorem 6.29: Any Field is an integral domain
Algebraic Structures: Group Theory
Counting I: Choice Trees and Correspondences
Presentation transcript:

Algebraic Structures: Group Theory II Great Theoretical Ideas In Computer Science Victor Adamchik Danny Sleator CS 15-251 Spring 2010 Lecture 17 Mar. 17, 2010 Carnegie Mellon University Algebraic Structures: Group Theory II

3. (Inverses) For every a  S there is b  S such that: Group A group G is a pair (S,), where S is a set and  is a binary operation on S such that: 1.  is associative 2. (Identity) There exists an element e  S such that: e  a = a  e = a, for all a  S 3. (Inverses) For every a  S there is b  S such that: a  b = b  a = e

Review order of a group G = size of the group G order of an element g = (smallest n>0 s.t. gn = e) g is a generator if order(g) = order(G)

Let x be an element of G. The order of x divides the order of G Orders Theorem: Let x be an element of G. The order of x divides the order of G

Orders: example (Z10: +) {0,1,2,3,4,5,6,7,8,9} smallest n>0 such that gn = e 1 10 5 10 5 2

Subgroups Let G be a group. A non-empty set H G is a subgroup if it forms a group under the same operation. Exercise. Does {0,2,4} form a subgroup of Z6 under +? Exercise. Does {2n, nZ} form a subgroup of Q\{0} under *?

Subgroups Let G be a group. A non-empty set H G is a subgroup if it forms a group under the same operation. Exercise. List all subgroups of Z12 under +. Z12 {0} {0,6} {0,4,8} {0,3,6,9} {0,2,4,6,8,10}

Cosets We are going to generalize the idea of congruent classes mod n in (Z,+). a = b (mod n) iff a - b  <n> Theorem. Let H is a subgroup of G. Define a relation: ab iff a  b-1  H. Then  is an equivalence relation.

Cosets Theorem. Let H is a subgroup of G. Define a relation: ab iff a  b-1  H. Then  is an equivalence relation. Proof. Reflexive: aa iff a  a-1 =e  H Symmetric: b  a-1=(a  b-1)-1  H Transitive: a  c-1=(a  b-1)(b  c-1)  H

Cosets The equivalent classes for this relation is called the right cosets of H in G. If H is a subgroup of a group G then for any element g of the group the set of products of the form h  g where hH is a right coset of H denoted by the symbol Hg.

Cosets Exercise. Write down the right coset of the subgroup {0,3,6,9} of Z12 under +. Right coset = {h g | h  H, g  G} {0,3,6,9} + {0,1,2,3,4,5,6,7,8,9,10,11} = [3]+0 = {0,3,6,9} [3]+1 = {1,4,7,10} [3]+2 = {2,5,8,11}

Cosets Theorem. If H is a finite subgroup of G and xG, then |H|=|Hx| Proof. We prove this by finding a bijection between H and Hx. It is onto, because Hx consists of the elements of the form hx, where hH. Assume that there are h1, h2H. . Then h1x= h2x. It follows, h1=h2.

Cosets: partitioning Theorem. If H is a finite subgroup of G, then G = xG Hx. Proof. Cosets are equivalent classes. The two cosets are either equal or disjoint. Since G is finite, there are finitely many such cosets. Every element x of G belongs to the coset determined by it. x = x e  Hx, since eH.

Lagrange’s Theorem Theorem: If G is a finite group, and H is a subgroup then the order of H divides the order of G. In symbols, |H| divides |G|.

Lagrange’s Theorem Theorem: |H| divides |G|. Proof: G is partitioning into cosets. Pick a representative from each coset G = j=1…k Hxj Each coset contains |H| elements. It follows |G| = k |H|. Thus |H| is a divisor of |G|.

Lagrange’s Theorem: what is for? The theorem simplifies the problem of finding all subgroups of a finite group. Consider group of symmetry of square YSQ = { R0, R90, R180, R270, F|, F—, F , F } Except {R0} and Ysq, all other subgroups must have order 2 or 4.

R0 R90 R180 R270 F| F— F F R0 R0 R90 R180 R270 F| F— F F R90 R90 R180 Order 2 R0 R0 R90 R180 R270 F| F— F F R90 R90 R180 R270 R0 F F F| F— R180 R180 R270 R0 R90 F— F| F F R270 R270 R0 R90 R180 F F F— F| F| F| F F— F R0 R180 R90 R270 F— F— F F| F R180 R0 R270 R90 F F F— F F| R270 R90 R0 R180 F F F| F F— R90 R270 R180 R0

R0 R90 R180 R270 F| F— F F R0 R0 R90 R180 R270 F| F— F F R90 R90 R180 Order 4 R0 R0 R90 R180 R270 F| F— F F R90 R90 R180 R270 R0 F F F| F— R180 R180 R270 R0 R90 F— F| F F R270 R270 R0 R90 R180 F F F— F| F| F| F F— F R0 R180 R90 R270 F— F— F F| F R180 R0 R270 R90 F F F— F F| R270 R90 R0 R180 F F F| F F— R90 R270 R180 R0

Lagrange’s Theorem Exercise. Suppose that H and K are subgroups of G and assume that |H| = 9, |K| = 6, |G| < 50. What are the possible values of |G|? LCM(9,6) = 18, so |G|=18 or 36

Isomorphism Mapping between objects, which shows that they are structurally identical. Any property which is preserved by an isomorphism and which is true for one of the objects, is also true of the other.

Isomorphism Example. {1,2,3,…}, or {I, II, III,…}, or {один, два, три,…} Mathematically we want to think about these sets as being the same.

Group Isomorphism Definition. Let G be a group with operation  and H with . An isomorphism of G to H is a bijection f: GH that satisfies f(x  y) = f(x)  f(y) If we replace bijection by injection, such mapping is called a homomorphism.

Group Isomorphism Example. G = (Z, +), H = (even, +) Isomorphism is provided by f(n) = 2 n f(n + m) = 2 (n+m) = (2n)+(2m)=f(n)+f(m)

Group Isomorphism Example. G = (R+, ), H = (R, +) Isomorphism is provided by f(x) = log(x) f(x  y) = log(x  y) = log(x) + log(y) = f(x) + f(y)

Group Isomorphism Theorem. Let G be a group with operation , H with  and they are isomorphic f(x  y) = f(x)  f(y). Then f(eG) = eH Proof. f(eG)= f(eG  eG) = f(eG)  f(eG). On the other hand, f(eG)=f(eG)  eH f(eG)  eH = f(eG)  f(eG)  f(eG) = eH

Group Isomorphism Theorem. Let G be a group with operation , H with  and they are isomorphic f(x  y) = f(x)  f(y). Then f(x-1) = f(x)-1, xG Proof. f(x)  f(x-1) = f(x  x-1) =f(eG) = eH.

Group Isomorphism In order to prove that two groups and are not isomorphic, one needs to demonstrate that there is no isomorphism from onto . Usually, in practice, this is accomplished by finding some property that holds in one group, but not in the other. Examples. (Z4, +) and (Z6, +) They have different orders.

Group Isomorphism Exercise. Verify that (Z4, +) is isomorphic to 1 2 3 * 1 2 3 4

Verify that (Z4, +) is isomorphic to (Z*5, *) Exercise. Verify that (Z4, +) is isomorphic to (Z*5, *) Z4 is generated by 1 as in 0, 1, 2, 3, (then back to 0) Z*5 is generate by 2 as in 1, 2, 4, 3, (then back to 1) 0  1 1  2 2  4 3  3 f(x)= 2x mod 5

Cyclic Groups Definition. Let G be a group and xG. Then <x>={xk | k Z} is a cyclic subgroup generated by x. Examples. (Zn,+) = <1> (Z*5,*) = <2> or <3>

Cyclic Groups Theorem. A group of prime order is cyclic, and furthermore any non-identity element is a generator. Proof. Let |G|=p (prime) and xG. By Lagrange’s theorem, order(x) divides |G|. Since p is prime, there are two divisors 1 and p. Clearly it is not 1, because otherwise x=e.

Cyclic Groups Theorem. Any finite cyclic group of order n is isomorphic to (Zn,+). Any infinite cyclic group is isomorphic to (Z,+) Proof. Let G={x0,x1,x2,…,xn-1}. Mapping is given by f(xk) = k. f(xk xm)=f(xk+m)=k+m=f(xk)+f(xm) (homomorphism) One-to-one: f(xk)=0k=0 and ak=e.

It forms a group under function composition. Permutation Groups If the set is given by A = {1, 2, 3, . . . , n} then let Sn denote the set of all permutations on A. It forms a group under function composition. An element of Sn is represented by We call Sn the symmetric group of degree n and call any subgroup of Sn a permutation group.

Permutation Groups Cayley’s Theorem. Every group is isomorphic to a permutation group. Sketch of proof. Let G be a group with operation . For each xG, we define x:G G given by x(g) = x  g for all gG. This function x is a permutation on G. Next we create a permutation group out of x. Now we define f: G Sn by f(x)= x

Cayley’s Theorem. Every group is isomorphic to a permutation group. We define f: G Sn by f(x)= x One-to-one. Suppose f(a)=f(b). It follows a= b and in particular a(e)= b(e). Thus, a e = b e and then a = b. Onto. It follows from definition of x Homomorphism. f(a b) = ab, f(a)f(b)= aa To prove ab= aa , we write ab(x)=(ab)x=a (bx)=a(bx)=a(b(x))=(ab)(x)

Study Bee Lagrange’s Theorem Cosets Cyclic Group Permutation Group Cayley’s Theorem Study Bee