Ch. 5: Subgroups & Product Groups!. DEFINITION: A group is a set (denoted G) with an algebraic operation (denoted ) that satisfies the following properties:

Slides:



Advertisements
Similar presentations
Rotating a Square in Space
Advertisements

Building a Conceptual Understanding of Algebra with Algebra Tiles
ALGEBRA TILES Jim Rahn LL Teach, Inc.
Binary Operations Let S be any given set. A binary operation  on S is a correspondence that associates with each ordered pair (a, b) of elements of S.
Ch. 4: The Classification Theorems. THE ALL-OR-HALF THEOREM: If an object has a finite symmetry group, then either all or half of its symmetries are proper.
KRISTEN MCGAHAN Knot Groups. Group: A closed algebraic structure that has a law of composition with three properties Associative- (ab)c=a(bc) for all.
Matrix Algebra Matrix algebra is a means of expressing large numbers of calculations made upon ordered sets of numbers. Often referred to as Linear Algebra.
The Identity and Inverse Properties
Math 344 Winter 07 Group Theory Part 3: Quotient Groups
Math 3121 Abstract Algebra I
Algebraic Structures: Group Theory II
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
Burnside’s lemma and beyond: Permutations of vertices and color by Lucas Wagner.
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.
MTH070 Elementary Algebra Chapter 1 Review of Real Numbers and Problem Solving Copyright © 2010 by Ron Wallace, all rights reserved.
Scott Vaughen, Professor of Mathematics
By Mariah Sakaeda and Alex Jeppson
Relations Chapter 9.
Chapter 1 Number Sense See page 8 for the vocabulary and key concepts of this chapter.
Basic Concepts of Algebra
Sets and Expressions Number Sets
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Always, Sometimes, or Never True Solve for X Name The Property Algebra
Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
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?
6.3 Permutation groups and cyclic groups  Example: Consider the equilateral triangle with vertices 1 , 2 , and 3. Let l 1, l 2, and l 3 be the angle bisectors.
Unit 1 Integers, Exponents, Scientific Notation Lessons 1-6.
Chapter 9. Section 9.1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and.
Lesson 1 Using properties of real numbers. A set is a collection of objects  If all the members of one set are also members of a second set, then the.
Great Theoretical Ideas in Computer Science for Some.
Ch. 6: Permutations!.
Transformations. Congruent Similar Image vs Pre-image Pre-image: the figure before a transformation is applied. Image: The figure resulting from a transformation.
Mathematical Proofs. Chapter 1 Sets 1.1 Describing a Set 1.2 Subsets 1.3 Set Operations 1.4 Indexed Collections of Sets 1.5 Partitions of Sets.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
Pythagorean Theorem – Prove It! Converse of Pythagorean Theorem 1.) Is a triangle with side measures of 30, 40, and 50 units a right triangle? Prove it!
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
Chapter 8 Integers.
Chapter 2 Real Numbers and algebraic expressions ©2002 by R. Villar All Rights Reserved Re-engineered by Mistah Flynn 2015.
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Great Theoretical Ideas in Computer Science.
Jeanine “Joni” Pinkney Central Washington University
Ch. 3: Isomorphism. Eventual Goal: Classify all of the ways in which… (1) bounded objects (2) border patterns (3) wallpaper patterns …can be symmetric.
Great Theoretical Ideas In Computer Science Anupam GuptaCS Fall 2006 Lecture 15Oct 17, 2006Carnegie Mellon University Algebraic Structures: Groups,
Types of factoring put the title 1-6 on the inside of your foldable and #7 on the back separating them into sum and cubes 1.Greatest Common Factor 2.Difference.
SECTION 9 Orbits, Cycles, and the Alternating Groups Given a set A, a relation in A is defined by : For a, b  A, let a  b if and only if b =  n (a)
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.
1 Finding a decomposition of a graph T into isomorphic copies of a graph G is a classical problem in Combinatorics. The G-decomposition of T is balanced.
Great Theoretical Ideas in Computer Science.
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.
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Algebra 2 Properties of Real Numbers Lesson 1-2 Goals Goal To graph and order real numbers. To Identity properties of real numbers. Rubric Level 1 –
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
Chapter 7 Algebraic Structures
Relations Chapter 9.
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
CS480 Cryptography and Information Security
Great Theoretical Ideas in Computer Science
Basic Rules Of ALGEBRA.
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
Great Theoretical Ideas in Computer Science
Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.
Great Theoretical Ideas in Computer Science
Algebraic Structures: Group Theory
Arab Open University Faculty of Computer Studies Dr
PHY 745 Group Theory 11-11:50 AM MWF Olin 102 Plan for Lecture 1:
Presentation transcript:

Ch. 5: Subgroups & Product Groups!

DEFINITION: A group is a set (denoted G) with an algebraic operation (denoted ) that satisfies the following properties: (1) G has an “identity” (denoted I) which has no effect on other members; that is, AI = A and IA = A for all members, A, of G. (2) Each member, A, of G has an inverse in G (usually denoted A –1 ), which combines with it in either order to give the identity: AA –1 = I and A –1 A = I. (3) The associative property holds: (AB)C = A(BC) for all triples A,B,C of members of G. DEFINITION: A group is a set (denoted G) with an algebraic operation (denoted ) that satisfies the following properties: (1) G has an “identity” (denoted I) which has no effect on other members; that is, AI = A and IA = A for all members, A, of G. (2) Each member, A, of G has an inverse in G (usually denoted A –1 ), which combines with it in either order to give the identity: AA –1 = I and A –1 A = I. (3) The associative property holds: (AB)C = A(BC) for all triples A,B,C of members of G. Here are three examples of groups: (1) The numbers (under addition). The identity is 0 The inverse of 35 is -35. (3) The 8 symmetries of a square (under composition). The identity is I The inverse of R 90 is R 270. The inverse of H is H. (2) The numbers (under multiplication). The identity is 1 The inverse of 35 is 1/35.

D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } includes: *IR 90 R 180 R 270 IIR 90 R 180 R 270 R 90 R 180 R 270 I R 180 R 270 IR 90 R 270 IR 90 R 180 *HVDD’ HIR 180 R 90 R 270 VR 180 IR 270 R 90 DR 270 R 90 IR 180 D’R 90 R 270 R 180 I { H, V, D, D ’ } “the flips” Which color forms a self-contained group on its own? { I, R 90, R 180, R 270 } “the rotations”

D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } includes: *IR 90 R 180 R 270 IIR 90 R 180 R 270 R 90 R 180 R 270 I R 180 R 270 IR 90 R 270 IR 90 R 180 *HVDD’ HIR 180 R 90 R 270 VR 180 IR 270 R 90 DR 270 R 90 IR 180 D’R 90 R 270 R 180 I “The rotations” is a group on its own (called C 4 ); This is a Cayley table “the flips” is NOT a group on its own; This is NOT a Cayley table { H, V, D, D ’ } “the flips” { I, R 90, R 180, R 270 } “the rotations”

D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } includes: *IR 90 R 180 R 270 IIR 90 R 180 R 270 R 90 R 180 R 270 I R 180 R 270 IR 90 R 270 IR 90 R 180 *HVDD’ HIR 180 R 90 R 270 VR 180 IR 270 R 90 DR 270 R 90 IR 180 D’R 90 R 270 R 180 I If you color some of the members of a group, under what conditions will the colored collection form a self-contained group on its own? { H, V, D, D ’ } “the flips” { I, R 90, R 180, R 270 } “the rotations”

If you list all the members of G, and color some of them red, then the red ones form a subgroup (a self-contained group on its own) if… (1) You colored the identity red. (2) When any pair of red members are combined, the answer is red. (3) The inverse of any red member is red. D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } includes:

DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. If you list all the members of G, and color some of them red, then the red ones form a subgroup (a self-contained group on its own) if… (1) You colored the identity red. (2) When any pair of red members are combined, the answer is red. (3) The inverse of any red member is red.

EXAMPLE: In D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } Do the red members {I, R 180, H, V} form a subgroup? DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H.

EXAMPLE: In D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } Do the red members {I, R 180, H, V} form a subgroup? YES! This subgroup is called D 2. Think of it as the symmetry group of the “striped square” DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H.

In the symmetry group of the W-border pattern, Do the translations alone form a subgroup? DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. W W W W W W W W

In the symmetry group of the W-border pattern, Do the translations alone form a subgroup? YES! DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. W W W W W W W W

In the symmetry group of the W-border pattern, Do the translations alone form a subgroup? What about the vertical flips alone? YES! DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. W W W W W W W W

In the symmetry group of the W-border pattern, Do the translations alone form a subgroup? What about the vertical flips alone? YES! NO! DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. W W W W W W W W

In the additive group of integers, Z = {…,-8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, …}, Do the even numbers, E = {…, -8, -6, -4, -2, 0, 2, 4, 6, 8, …} form a subgroup? What about the odd numbers? DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H.

In the additive group of integers, Z = {…,-8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, …}, Do the even numbers, E = {…, -8, -6, -4, -2, 0, 2, 4, 6, 8, …} form a subgroup? What about the odd numbers? YES! NO! DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H.

In the cyclic group, C 10 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} do the even numbers, E = {0, 2, 4, 6, 8} form a subgroup? DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H.

In the cyclic group, C 10 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} do the even numbers, E = {0, 2, 4, 6, 8} form a subgroup? YES! DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H.

In the cyclic group, C 10 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} do the even numbers, E = {0, 2, 4, 6, 8} form a subgroup? YES! DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. In the cyclic group, C 9 = {0, 1, 2, 3, 4, 5, 6, 7, 8} do the even numbers, E = {0, 2, 4, 6, 8} form a subgroup?

In the cyclic group, C 10 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} do the even numbers, E = {0, 2, 4, 6, 8} form a subgroup? YES! DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. In the cyclic group, C 9 = {0, 1, 2, 3, 4, 5, 6, 7, 8} do the even numbers, E = {0, 2, 4, 6, 8} form a subgroup? NO!

C 12 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11} DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. Oops, your little brother colored the 2 with his red crayon. To fix it, what else must you color red to make it a subgroup? Oops, your little brother colored the 2 with his red crayon. To fix it, what else must you color red to make it a subgroup?

C 12 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11} DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. Oops, your little brother colored the 2 with his red crayon. To fix it, what else must you color red to make it a subgroup? Oops, your little brother colored the 2 with his red crayon. To fix it, what else must you color red to make it a subgroup? = “the subgroup of C 12 generated by 2”

C 12 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11} DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. Oops, your little brother colored the 5 with his red crayon. To fix it, what else must you color red to make it a subgroup? Oops, your little brother colored the 5 with his red crayon. To fix it, what else must you color red to make it a subgroup?

C 12 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11} DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. Oops, your little brother colored the 5 with his red crayon. To fix it, what else must you color red to make it a subgroup? Oops, your little brother colored the 5 with his red crayon. To fix it, what else must you color red to make it a subgroup? = “the subgroup of C 12 generated by 5”

Z = {…-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, …} DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. Oops, your little brother colored the 2 with his red crayon. To fix it, what else must you color red to make it a subgroup? Oops, your little brother colored the 2 with his red crayon. To fix it, what else must you color red to make it a subgroup?

Z = {…-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, …} DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. Oops, your little brother colored the 2 with his red crayon. To fix it, what else must you color red to make it a subgroup? Oops, your little brother colored the 2 with his red crayon. To fix it, what else must you color red to make it a subgroup? = “the subgroup of Z generated by 2”

Z = {…-10, -9, -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, …} DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: Suppose that G is a group. A collection, H, of G’s members is called a subgroup if it forms a self-contained group on its own, which means that it satisfies all three of these requirements: (Identity) H must include the identity of G. (Products) If A and B are in H, then AB must be in H. (Inverses) The inverse of anything in H must be in H. DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) = “the subgroup of Z generated by 2”

DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } Find the subgroup of D 4 generated by each of its 8 members. = ?

DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } Find the subgroup of D 4 generated by each of its 8 members. = { I } = { I, R 90, R 180, R 270 } = { I, R 180 } = { I, R 270, R 180, R 90 } = { I, H } = { I, V } = { I, D } = { I, D’ } the same

DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } Find the subgroup of D 4 generated by each of its 8 members. THEOREM: If G is a finite group, and A is a member of G, then = { I, A, AA, AAA, AAAA, …} (this list starts repeating as soon as one of these expressions equals I, and not before). THEOREM: If G is a finite group, and A is a member of G, then = { I, A, AA, AAA, AAAA, …} (this list starts repeating as soon as one of these expressions equals I, and not before). (you don’t need to worry about inverses)

DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) DEFINITION: If G is a group, and A is a member of G, then, = {…, A –1 A –1 A –1, A –1 A –1, A –1, I, A, AA, AAA,…} is called the subgroup of G generated by A. (it contains A and A –1 combined with themselves any number of times.) D 4 = {I, R 90, R 180, R 270, H, V, D, D ’ } Find the subgroup of D 4 generated by each of its 8 members. THEOREM: If G is a finite group, and A is a member of G, then = { I, A, AA, AAA, AAAA, …} (this list starts repeating as soon as one of these expressions equals I, and not before). THEOREM: If G is a finite group, and A is a member of G, then = { I, A, AA, AAA, AAAA, …} (this list starts repeating as soon as one of these expressions equals I, and not before). DEFINITION: If A is a member of a finite group, then the order of A is the size of the subgroup. Find order of each member of D 4.

In the group C 10 = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }, find: = What is the order of each member of this group?

In the group C 10 = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }, find: = {0, 2, 4, 6, 8} (the evens) = {0, 3, 6, 9, 2, 5, 8, 1, 4, 7} (all of C 10 ) = {0, 4, 8, 2, 6} (the evens – the same as ) = {0, 5}. 2 has order 5 3 has order 10 4 has order 5 5 has order 2

In the group C 10 = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }, find: = {0, 2, 4, 6, 8} (the evens) = {0, 3, 6, 9, 2, 5, 8, 1, 4, 7} (all of C 10 ) = {0, 4, 8, 2, 6} (the evens – the same as ) = {0, 5}. 2 has order 5 3 has order 10 4 has order 5 5 has order 2

Product Groups

G 1 ×G 2 means all of the possible ways of pairing together a member of the first group with a member of the second group (wrapped in parentheses and separated by a comma) It is called the product of G 1 & G 2 EXAMPLE: If G 1 = { A, B, C } and G 2 = { 1, 2, 3, 4 }, then: G 1 ×G 2 = { (A,1), (A,2), (A,3), (A,4), (B,1), (B,2), (B,3), (B,4), (C,1), (C,2), (C,3), (C,4) }

G 1 ×G 2 means all of the possible ways of pairing together a member of the first group with a member of the second group (wrapped in parentheses and separated by a comma) It is called the product of G 1 & G 2 EXAMPLE: If G 1 = { A, B, C } and G 2 = { 1, 2, 3, 4 }, then: G 1 ×G 2 = { (A,1), (A,2), (A,3), (A,4), (B,1), (B,2), (B,3), (B,4), (C,1), (C,2), (C,3), (C,4) } 1234 A (A,1)(A,1)(A,2)(A,2)(A,3)(A,3)(A,4)(A,4) B (B,1)(B,1)(B,2)(B,2)(B,3)(B,3)(B,4)(B,4) C (C,1)(C,1)(C,2)(C,2)(C,3)(C,3)(C,4)(C,4) In this example G 1 ×G 2 has 12 members, because the members of can be arranged into a 3x4 table. GENERAL RULE: The size of the product of two finite groups equals the product of their sizes GENERAL RULE: The size of the product of two finite groups equals the product of their sizes

The Cayley table of G 1 ×G 2 Just combine the G 1 -part and the G 2 -part separately! EXAMPLE: In D 4 ×Z, compute (H,6) (V,8) = ( ??, ?? ) Recall: Z = {…, –3, –2, –1, 0, 1, 2, 3, …} = the additive group of integers.

The Cayley table of G 1 ×G 2 Just combine the G 1 -part and the G 2 -part separately! EXAMPLE: In D 4 ×Z, compute (H,6) (V,8) = ( R 180, 14 ) = 14 in Z H*V = R 180 in D 4

The product of C 3 = { 0, 1, 2 } and C 2 = { 0, 1} has the following six members: C 3 ×C 2 = {(0,0), (0,1), (1,0), (1,1), (2,0), (2,1)}. What does the Cayley table look like?

The product of C 3 = { 0, 1, 2 } and C 2 = { 0, 1} has the following six members: C 3 ×C 2 = {(0,0), (0,1), (1,0), (1,1), (2,0), (2,1)}. Fill in the red and green separately: (0,0)(0,0)(0,1)(0,1)(1,0)(1,0)(1,1)(1,1)(2,0)(2,0)(2,1)(2,1) (0,0)(0,0)(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, ) (0,1)(0,1)(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, ) (1,0)(1,0)(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, ) (1,1)(1,1)(, )(, )(, )(, )(2,1)(2,1)(, )(, )(, )(, )(, )(, ) (2,0)(2,0)(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, ) (2,1)(2,1)(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, )(, ) (1,1) (1,0) = (2,1) because… 1+1 = 2 in C 3 and……… 1+0 = 1 in C 2.

The product of C 3 = { 0, 1, 2 } and C 2 = { 0, 1} has the following six members: C 3 ×C 2 = {(0,0), (0,1), (1,0), (1,1), (2,0), (2,1)}. Fill in the red and green separately: (0,0)(0,0)(0,1)(0,1)(1,0)(1,0)(1,1)(1,1)(2,0)(2,0)(2,1)(2,1) (0,0)(0,0)(0, )(0, )(0, )(0, )(1, )(1, )(1, )(1, )(2, )(2, )(2, )(2, ) (0,1)(0,1)(0, )(0, )(0, )(0, )(1, )(1, )(1, )(1, )(2, )(2, )(2, )(2, ) (1,0)(1,0)(1, )(1, )(1, )(1, )(2, )(2, )(2, )(2, )(0, )(0, )(0, )(0, ) (1,1)(1,1)(1, )(1, )(1, )(1, )(2,1)(2,1)(2, )(2, )(0, )(0, )(0, )(0, ) (2,0)(2,0)(2, )(2, )(2, )(2, )(0, )(0, )(0, )(0, )(1, )(1, )(1, )(1, ) (2,1)(2,1)(2, )(2, )(2, )(2, )(0, )(0, )(0, )(0, )(1, )(1, )(1, )(1, ) (1,1) (1,0) = (2,1) because… 1+1 = 2 in C 3 and……… 1+0 = 1 in C 2.

The product of C 3 = { 0, 1, 2 } and C 2 = { 0, 1} has the following six members: C 3 ×C 2 = {(0,0), (0,1), (1,0), (1,1), (2,0), (2,1)}. The Cayley table looks like this: (0,0)(0,0)(0,1)(0,1)(1,0)(1,0)(1,1)(1,1)(2,0)(2,0)(2,1)(2,1) (0,0)(0,0)(0,0)(0,0)(0,1)(0,1)(1,0)(1,0)(1,1)(1,1)(2,0)(2,0)(2,1)(2,1) (0,1)(0,1)(0,1)(0,1)(0,0)(0,0)(1,1)(1,1)(1,0)(1,0)(2,1)(2,1)(2,0)(2,0) (1,0)(1,0)(1,0)(1,0)(1,1)(1,1)(2,0)(2,0)(2,1)(2,1)(0,0)(0,0)(0,1)(0,1) (1,1)(1,1)(1,1)(1,1)(1,0)(1,0)(2,1)(2,1)(2,0)(2,0)(0,1)(0,1)(0,0)(0,0) (2,0)(2,0)(2,0)(2,0)(2,1)(2,1)(0,0)(0,0)(0,1)(0,1)(1,0)(1,0)(1,1)(1,1) (2,1)(2,1)(2,1)(2,1)(2,0)(2,0)(0,1)(0,1)(0,0)(0,0)(1,1)(1,1)(1,0)(1,0) (1,1) (1,0) = (2,1) because… 1+1 = 2 in C 3 and……… 1+0 = 1 in C 2.

Some symmetry groups are product groups in disguise. Explain why D 2 = the symmetry group of this cross …is isomorphic to C 2 ×C 2.

Some symmetry groups are product groups in disguise. Recall that C 2 = {0,1} = the symmetry group of an oriented 2-gon *NY NNY YYN Another reasonable notation is: 0 = “N” = “No rotate” 1 = “Y” = “Yes rotate” Another reasonable notation is: 0 = “N” = “No rotate” 1 = “Y” = “Yes rotate” or… Explain why D 2 = the symmetry group of this cross …is isomorphic to C 2 ×C 2. Cayley table:

Some symmetry groups are product groups in disguise. Explain why D 2 = the symmetry group of this cross …is isomorphic to C 2 ×C 2. I ↔ (0,0) H ↔ (1,0) V ↔ (0,1) R 180 ↔ (1,1) I ↔ (0,0) H ↔ (1,0) V ↔ (0,1) R 180 ↔ (1,1) An isomorphism: Easy to check that this dictionary translates a correct Cayley into a correct Cayley table…

Some symmetry groups are product groups in disguise. Explain why D 2 = the symmetry group of this cross …is isomorphic to C 2 ×C 2. I ↔ (0,0) H ↔ (1,0) V ↔ (0,1) R 180 ↔ (1,1) I ↔ (0,0) H ↔ (1,0) V ↔ (0,1) R 180 ↔ (1,1) An isomorphism: Easy to check that this dictionary translates a correct Cayley into a correct Cayley table… …but what is the visual meaning?

Some symmetry groups are product groups in disguise. Explain why D 2 = the symmetry group of this cross …is isomorphic to C 2 ×C 2. I ↔ (0,0) H ↔ (1,0) V ↔ (0,1) R 180 ↔ (1,1) I ↔ (0,0) H ↔ (1,0) V ↔ (0,1) R 180 ↔ (1,1) Are the ends of the green rectangle exchanged? (0=NO, 1=YES) Doesn’t exchange any ends Exchanges red ends but not green ends Exchanges green ends but not red ends Exchanges red ends and green ends An isomorphism: Are the ends of the red rectangle exchanged? (0=NO, 1=YES)

Some symmetry groups are product groups in disguise. Explain why D 2 = the symmetry group of this cross …is isomorphic to C 2 ×C 2. I ↔ (0,0) H ↔ (1,0) V ↔ (0,1) R 180 ↔ (1,1) I ↔ (0,0) H ↔ (1,0) V ↔ (0,1) R 180 ↔ (1,1) An isomorphism: Which viewpoint is simpler… V*H=R 180 Exchanging red ends and then green ends results in both ends being exchanged.

Some symmetry groups are product groups in disguise. B B B B B B B B B B B B B B B B B B B B B Explain why the symmetry group of the B-border pattern …is isomorphic to Z×C 2.

Some symmetry groups are product groups in disguise. Recall: Z = {…, –3, –2, –1, 0, 1, 2, 3, …} = the additive group of integers. B B B B B B B B B B B B B B B B B B B B B Explain why the symmetry group of the B-border pattern …is isomorphic to Z×C 2.

Some symmetry groups are product groups in disguise. Explain why the symmetry group of the B-border pattern …is isomorphic to Z×C 2. B B B B B B B B B B B B B B B B B B B B B Here are few symmetries: (T –5,YES) “translate 5 letters left and flip” (T 8,NO) “translate 8 letters right and do not flip”

Some symmetry groups are product groups in disguise. Explain why the symmetry group of the B-border pattern …is isomorphic to Z×C 2. B B B B B B B B B B B B B B B B B B B B B Here are few symmetries: (T –5,YES) “translate 5 letters left and flip” (T 8,NO) “translate 8 letters right and do not flip” Composing them is easy: (T –5,YES) * (T 8,NO) = (??,???).

Some symmetry groups are product groups in disguise. Explain why the symmetry group of the B-border pattern …is isomorphic to Z×C 2. B B B B B B B B B B B B B B B B B B B B B Here are few symmetries: (T –5,YES) “translate 5 letters left and flip” (T 8,NO) “translate 8 letters right and do not flip” Composing them is easy: (T –5,YES) * (T 8,NO) = (T 3,YES).

Some symmetry groups are product groups in disguise. Explain why the symmetry group of the B-border pattern …is isomorphic to Z×C 2. B B B B B B B B B B B B B B B B B B B B B Here are few symmetries: (T –5,YES) “translate 5 letters left and flip” (T 8,NO) “translate 8 letters right and do not flip” Composing them is easy: (T –5,YES) * (T 8,NO) = (T 3,YES). (–5,1) (8,0) = (3,1) We’re really working in Z×C 2 :

Vocabulary Review subgroup = the subgroup generated by A the order of a member of a group product group subgroup = the subgroup generated by A the order of a member of a group product group Theorem Review The size of the product of two groups equals… In a finite group, = … The size of the product of two groups equals… In a finite group, = …