Ma/CS 6a Class 19: Group Isomorphisms

Similar documents
Ma/CS 6a Class 19: Isomorphisms and Subgroups

Ma/CS 6a Class 18: Groups

4 Powers of an Element; Cyclic Groups

Ma/CS 6a Class 28: Latin Squares

WALLPAPER GROUPS. Julija Zavadlav

Ma/CS 6a Class 28: Latin Squares

Ma/CS 6b Class 12: Graphs and Matrices

Chapter 3. Introducing Groups

17 More Groups, Lagrange s Theorem and Direct Products

0 Sets and Induction. Sets

Math 312/ AMS 351 (Fall 17) Sample Questions for Final

Ma/CS 6a Class 2: Congruences

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

Examples of Groups

1. Groups Definitions

MATH 430 PART 2: GROUPS AND SUBGROUPS

Ma/CS 6a Class 2: Congruences

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition).

HMMT February 2018 February 10, 2018

Number Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.

Chapter 0: Preliminaries

Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

5 Group theory. 5.1 Binary operations

REMARKS 1.4: (a) In general discussion the operation in a group G is usually written as multiplication and a b is written as ab. (b) If the operation

MATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.

Ma/CS 6b Class 15: The Probabilistic Method 2

Figure 1. Symmetries of an equilateral triangle

Ma/CS 6a Class 4: Primality Testing

Lecture 7 Cyclic groups and subgroups

Discrete Mathematics with Applications MATH236

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.

Discrete Geometry. Problem 1. Austin Mohr. April 26, 2012

Ma/CS 6b Class 24: Error Correcting Codes

Quizzes for Math 401

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Part IV. Rings and Fields

Chapter XI Novanion rings

Isomorphisms. 0 a 1, 1 a 3, 2 a 9, 3 a 7

CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS

Mathematical Foundations of Cryptography

LEGENDRE S THEOREM, LEGRANGE S DESCENT

* 8 Groups, with Appendix containing Rings and Fields.

CONSTRUCTING MULTIPLICATIVE GROUPS MODULO N WITH IDENTITY DIFFERENT FROM ONE

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

Introduction to Arithmetic Geometry Fall 2013 Lecture #24 12/03/2013

Some Basic Logic. Henry Liu, 25 October 2010

An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt

Math 430 Final Exam, Fall 2008

R1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member

Mathematical Thinking in Art?

Discrete Structures for Computer Science

Finite Fields. Mike Reiter

AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS

A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:

On the Shadow Geometries of W (23, 16)

Math 109 HW 9 Solutions

MATH 420 FINAL EXAM J. Beachy, 5/7/97

COUNTING AND SYMMETRY

15 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 2012

To hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G.

Degrees of Regularity of Colorings of the Integers

ISOMORPHISMS KEITH CONRAD

Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems

4.4 Noetherian Rings

MATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4

A Latin Square of order n is an n n array of n symbols where each symbol occurs once in each row and column. For example,

International Mathematics TOURNAMENT OF THE TOWNS

Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions

Lecture 11 - Basic Number Theory.

Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm

Ma/CS 6b Class 20: Spectral Graph Theory

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis

Algebraic Methods in Combinatorics

Lecture 2: Groups. Rajat Mittal. IIT Kanpur

(A B) 2 + (A B) 2. and factor the result.

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

4. Congruence Classes

Lecture 6: Finite Fields

2MA105 Algebraic Structures I

Group Theory. PHYS Southern Illinois University. November 15, PHYS Southern Illinois University Group Theory November 15, / 7

Math Exam 1 Solutions October 12, 2010

MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM

COMP Intro to Logic for Computer Scientists. Lecture 15

Commutative Rings and Fields

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

Abstract Algebra Part I: Group Theory

Abstract Algebra, HW6 Solutions. Chapter 5

Algebraic Methods in Combinatorics

Math 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby

Properties of Real Numbers

NOTES ON FINITE FIELDS

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

Lecture 2: Lattices and Bases

Group. Orders. Review. Orders: example. Subgroups. Theorem: Let x be an element of G. The order of x divides the order of G

Mat 311 Test 1, 2019 Solutions

6 Permutations Very little of this section comes from PJE.

Section II.1. Free Abelian Groups

Ma/CS 6a Class 4: Primality Testing

Transcription:

Ma/CS 6a Class 19: Group Isomorphisms By Adam Sheffer A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G x y G. Associativity. For every x, y, z G x y z = x y z. Identity. There exists e G, such that for every x G e x = x e = x. Inverse. For every x G there exists x 1 G such that x x 1 = x 1 x = e. 1

Reminder: What We Already Know About Groups Given a group with a set G: For a, b G, the equation ax = b has a unique solution. The identity is unique. For each a G, there is a unique inverse a 1. The multiplication table of G is a Latin square. Reminder: Orders The order of a group is the number of elements in its set G. The order of an element a G is the least positive integer k that satisfies a k = 1. 2 2 5 Rotation 90 (under multiplication mod 3) (under integer addition) 4 2 2

Symmetries of a Tiling Given a repetitive tiling of the plane, its symmetries are the transformations of the plane that Map the tiling to itself (ignoring colors). Preserve distances. These are combinations of translations, rotations, and reflections. Example: Square Tiling What are the symmetries of the square tiling? Translations in various directions. Rotations around a vertex by 0, 90, 180, 270. Rotations around the center of a square by 0, 90, 180, 270. Reflections across vertical, horizontal and diagonal lines. Rotations around the center of an edge by 180. Translation + reflection. 3

Wallpaper Groups Given a tiling, its set of symmetries is a group called a wallpaper group (not accurate. We ignore an extra condition). Closure. Composing two symmetries results in a transformation that preserves distances and takes the tiling to itself. Associativity. Holds. Identity. The no operation element. Inverse. Since symmetries are bijections from the plane to itself, inverses are well defined. Wallpaper Groups There are exactly 17 different wallpaper groups. Every repetitive tilings of the plane belongs to one of these 17 classes. Two tilings of the same class have the same symmetries. 4

Reminder: A Group of 2 2 Matrices 2 2 matrices of the form α β where α 1,2 and β 0,1,2. The operation is matrix multiplication mod 3. The group is of order 6: 1 1 1 2 2 0 2 1 2 2 The Multiplication Table I = 1 0 X = 2 0 R = 1 1 Y = 2 1 S = 1 2 Z = 2 2 I R S X Y Z I I R S X Y Z R R S I Y Z X S S I R Z X Y X X Z Y I S R Y Y X Z R I S Z Z Y X S R I 5

Symmetries of a Triangle The six symmetries of the equilateral triangle form a group (under composition). Another Multiplication Table i r s x y z i r s x y z i i r s x y z r r s i y z x s s i r z x y x x z y i s r y y x z r i s z z y x s r i 6

i r s x y z i i r s x y z r r s i y z x s s i r z x y x x z y i s r y y x z r i s z z y x s r i I R S X Y Z I I R S X Y Z R R S I Y Z X S S I R Z X Y X X Z Y I S R Y Y X Z R I S Z Z Y X S R I Isomorphisms G 1, G 2 two groups of the same order. A bijection β: G 1 G 2 is an isomorphism if for every a, b G 1, we have β ab = β a β b. ( = after reordering, we have the same multiplication tables) When such an isomorphism exists, G 1 and G 2 are said to be isomorphic, and we write G 1 G 2. 7

Isomorphism Over the Reals Problem. Prove that the following groups are isomorphic: The set of real numbers R under addition. The set of positive real numbers R + under multiplication. Proof. Use the functions e x : R R + and log x : R + R as bijections between the two sets. For x, y R we have e x+y = e x e y. For x, y R +, we have log xy = log x + log y. Isomorphism Between Z 4 and Z 5 +? Problem. Are the following two groups isomorphic? The set Z 4 = {0,1,2,3} under addition mod 4. The set Z 5 + = 1,2,3,4 under multiplication mod 5. Solution. Yes. Use the following bijection of Z 4 Z 5 +. 0 1 1 2 2 4 3 3 8

An Isomorphism? Are the following two groups isomorphic? Nonzero real numbers under multiplication. Rational numbers under addition. What would such an isomorphism satisfy? The identity 1 corresponds to the identity 0. In both cases most elements have an infinite order. While 1 2 is the identity, no nonzero rational satisfies a + a = 0. Not isomorphic! Cyclic Groups A group G is cyclic if there exists an element x G such that every member of G is a power of x. We say that x generates G. What is the order of x? G. An infinite group G is cyclic if there exists an element x G such that G =, x 2, x 1, 1, x, x 2, x 3, 9

Cyclic Groups? Are the following groups cyclic? Integers under addition. Yes! It is generated by the integer 1. The symmetries of the triangle. No. There are no generators. Cyclic Groups? Are the following groups cyclic? The positive reals R + under multiplication. No. There is no generator. The aforementioned group of elements of the α β form. No. Because it is isomorphic to the triangle symmetry group. 10

Finite Cyclic Groups Any cyclic group of a finite order m with generator g can be written as 1, g, g 2,, g m 1. For integers q and 0 r < m, we have g qm+r = g r. Where did we already encounter such a group? Integers mod m under addition. The generator is 1 and the group is 0,1,2,, m 1. Isomorphic Cyclic Groups Claim. All of the cyclic groups of a finite order m are isomorphic. We refer to this group as C m. Proof. Consider two such cyclic groups G 1 = 1, g, g 2, g 3,, g m 1, G 2 = 1, h, h 2, h 3,, h m 1. Consider the bijection β: G 1 G 2 satisfying β g i = h i. This is an isomorphism since β g i g j = β g i+j = h i+j = h i h j = β g i β g j. 11

Direct Product G 1, G 2 - two groups with identities 1 1, 1 2. The direct product G 1 G 2 consists of the ordered pairs a, b where a G 1 and b G 2. The direct product is a group: The group operation is a, b c, d = ac, bd. The identity element is 1 1, 1 2. The inverse a, b 1 is a 1, b 1. The order of G 1 G 2 is G 1 G 2. Direct Product Example Problem. Is C 6 isomorphic to C 2 C 3? Solution. Write C 2 = 1, g and C 3 = 1, h, h 2. Then C 2 C 3 consists of 1,1, 1, h, 1, h 2, g, 1, g, h, (g, h 2 ). C 2 C 3 is isomorphic to C 6 iff it is cyclic. It is cyclic, since it is generated by g, h. g, h 1 = g, h, g, h 2 = 1, h 2, g, h 3 = g, 1, g, h 4 = 1, h, g, h 5 = g, h 2, g, h 6 = 1,1, 12

Another Direct Product Example Problem. Is C 8 isomorphic to C 2 C 4? Solution. Write C 2 = 1, g and C 4 = 1, h, h 2, h 3. Then C 2 C 4 consists of { 1,1, 1, h, 1, h 2, 1, h 3, g, 1, g, h, g, h 2, g, h 3 }. C 2 C 4 is isomorphic to C 8 iff it is cyclic. It is not. The orders of the elements are 1,4,2,4,2,4,2,4, respectively. Cyclic Inner Products of Cyclic Groups Claim. If m, n are relatively prime positive integers, then C m C n C mn. Proof. Write C m = 1, g, g 2,, g m 1 and C n = 1, h, h 2,, h n 1. It suffices to prove that g, h generates C m C n. g, h k = 1,1 if and only if m k and n k. GCD m, n = 1 implies LCM m, n = mn (see example assignment). Thus, the order of g, h is mn. 13

Cyclic Inner Products of Cyclic Groups Claim. If m, n are relatively prime positive integers, then C m C n C mn. Proof. Write C m = 1, g, g 2,, g m 1 and C n = 1, h, h 2,, h n 1. We proved that g, h is of order mn. It remains to show that for every 0 i < j < mn, we have g, h i g, h j. If g, h i = g, h j, multiplying both sides by g, h i implies g, h j i = 1,1. Contradiction to the order of g, h! So g, h generates mn distinct elements. The End: Alhambra Alhmbra is a palace and fortress complex located in Granada, Spain. The Islamic art on the walls is claimed to contain all 17 wallpaper groups. Mathematicians like to visit the palace and look for as many types as they can find. 14