Ma/CS 6a Class 19: Group Isomorphisms

Size: px
Start display at page:

Download "Ma/CS 6a Class 19: Group Isomorphisms"

Transcription

1 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

2 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 = Rotation 90 (under multiplication mod 3) (under integer addition) 4 2 2

3 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

4 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

5 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: 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

6 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

7 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

8 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

9 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

10 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

11 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

12 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

13 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

14 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

Ma/CS 6a Class 19: Isomorphisms and Subgroups

Ma/CS 6a Class 19: Isomorphisms and Subgroups Ma/CS 6a Class 19: Isomorphisms and Subgroups By Adam Sheffer Reminder: A Group A group consists of a set G and a binary operation, satisfying the following. Closure. For every x, y G, we have x y G. Associativity.

More information

Ma/CS 6a Class 18: Groups

Ma/CS 6a Class 18: Groups Ma/CS 6a Class 18: Groups = Rotation 90 Vertical flip Diagonal flip 2 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, we

More information

4 Powers of an Element; Cyclic Groups

4 Powers of an Element; Cyclic Groups 4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)

More information

Ma/CS 6a Class 28: Latin Squares

Ma/CS 6a Class 28: Latin Squares Ma/CS 6a Class 28: Latin Squares By Adam Sheffer Latin Squares A Latin square is an n n array filled with n different symbols, each occurring exactly once in each row and exactly once in each column. 1

More information

WALLPAPER GROUPS. Julija Zavadlav

WALLPAPER GROUPS. Julija Zavadlav WALLPAPER GROUPS Julija Zavadlav Abstract In this paper we present the wallpaper groups or plane crystallographic groups. The name wallpaper groups refers to the symmetry group of periodic pattern in two

More information

Ma/CS 6a Class 28: Latin Squares

Ma/CS 6a Class 28: Latin Squares Ma/CS 6a Class 28: Latin Squares By Adam Sheffer Latin Squares A Latin square is an n n array filled with n different symbols, each occurring exactly once in each row and exactly once in each column. 1

More information

Ma/CS 6b Class 12: Graphs and Matrices

Ma/CS 6b Class 12: Graphs and Matrices Ma/CS 6b Class 2: Graphs and Matrices 3 3 v 5 v 4 v By Adam Sheffer Non-simple Graphs In this class we allow graphs to be nonsimple. We allow parallel edges, but not loops. Incidence Matrix Consider a

More information

Chapter 3. Introducing Groups

Chapter 3. Introducing Groups Chapter 3 Introducing Groups We need a super-mathematics in which the operations are as unknown as the quantities they operate on, and a super-mathematician who does not know what he is doing when he performs

More information

17 More Groups, Lagrange s Theorem and Direct Products

17 More Groups, Lagrange s Theorem and Direct Products 7 More Groups, Lagrange s Theorem and Direct Products We consider several ways to produce groups. 7. The Dihedral Group The dihedral group D n is a nonabelian group. This is the set of symmetries of a

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

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

Math 312/ AMS 351 (Fall 17) Sample Questions for Final Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply

More information

Ma/CS 6a Class 2: Congruences

Ma/CS 6a Class 2: Congruences Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts

More information

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

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

Examples of Groups

Examples of Groups Examples of Groups 8-23-2016 In this section, I ll look at some additional examples of groups. Some of these will be discussed in more detail later on. In many of these examples, I ll assume familiar things

More information

1. Groups Definitions

1. Groups Definitions 1. Groups Definitions 1 1. Groups Definitions A group is a set S of elements between which there is defined a binary operation, usually called multiplication. For the moment, the operation will be denoted

More information

MATH 430 PART 2: GROUPS AND SUBGROUPS

MATH 430 PART 2: GROUPS AND SUBGROUPS MATH 430 PART 2: GROUPS AND SUBGROUPS Last class, we encountered the structure D 3 where the set was motions which preserve an equilateral triangle and the operation was function composition. We determined

More information

Ma/CS 6a Class 2: Congruences

Ma/CS 6a Class 2: Congruences Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts

More information

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

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations

More information

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

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 2.1 Exercise (6). Let G be an abelian group. Prove that T = {g G g < } is a subgroup of G.

More information

HMMT February 2018 February 10, 2018

HMMT February 2018 February 10, 2018 HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18

More information

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.

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. Appendix A Number Axioms P. Danziger 1 Number Axioms 1.1 Groups Definition 1 A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b and c S 0. (Closure) 1. (Associativity)

More information

Chapter 0: Preliminaries

Chapter 0: Preliminaries Chapter 0: Preliminaries Adam Sheffer March 28, 2016 1 Notation This chapter briefly surveys some basic concepts and tools that we will use in this class. Graduate students and some undergrads would probably

More information

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

Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay 1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together

More information

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 2070BC Term 2 Weeks 1 13 Lecture Notes Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic

More information

5 Group theory. 5.1 Binary operations

5 Group theory. 5.1 Binary operations 5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1

More information

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

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 FIRST-YEAR GROUP THEORY 1 DEFINITIONS AND EXAMPLES It is highly desirable that you buy, or in some other way have access to a copy of, the following book which will be referred to in these notes as Jordan

More information

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

MATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology. MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number

More information

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

Ma/CS 6b Class 15: The Probabilistic Method 2 Ma/CS 6b Class 15: The Probabilistic Method 2 By Adam Sheffer Reminder: Random Variables A random variable is a function from the set of possible events to R. Example. Say that we flip five coins. We can

More information

Figure 1. Symmetries of an equilateral triangle

Figure 1. Symmetries of an equilateral triangle 1. Groups Suppose that we take an equilateral triangle and look at its symmetry group. There are two obvious sets of symmetries. First one can rotate the triangle through 120. Suppose that we choose clockwise

More information

Ma/CS 6a Class 4: Primality Testing

Ma/CS 6a Class 4: Primality Testing Ma/CS 6a Class 4: Primality Testing By Adam Sheffer Reminder: Euler s Totient Function Euler s totient φ(n) is defined as follows: Given n N, then φ n = x 1 x < n and GCD x, n = 1. In more words: φ n is

More information

Lecture 7 Cyclic groups and subgroups

Lecture 7 Cyclic groups and subgroups Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:

More information

Discrete Mathematics with Applications MATH236

Discrete Mathematics with Applications MATH236 Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet

More information

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

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed. Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply

More information

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

Discrete Geometry. Problem 1. Austin Mohr. April 26, 2012 Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T

More information

Ma/CS 6b Class 24: Error Correcting Codes

Ma/CS 6b Class 24: Error Correcting Codes Ma/CS 6b Class 24: Error Correcting Codes By Adam Sheffer Communicating Over a Noisy Channel Problem. We wish to transmit a message which is composed of 0 s and 1 s, but noise might accidentally flip some

More information

Quizzes for Math 401

Quizzes for Math 401 Quizzes for Math 401 QUIZ 1. a) Let a,b be integers such that λa+µb = 1 for some inetegrs λ,µ. Prove that gcd(a,b) = 1. b) Use Euclid s algorithm to compute gcd(803, 154) and find integers λ,µ such that

More information

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

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

Part IV. Rings and Fields

Part IV. Rings and Fields IV.18 Rings and Fields 1 Part IV. Rings and Fields Section IV.18. Rings and Fields Note. Roughly put, modern algebra deals with three types of structures: groups, rings, and fields. In this section we

More information

Chapter XI Novanion rings

Chapter XI Novanion rings Chapter XI Novanion rings 11.1 Introduction. In this chapter we continue to provide general structures for theories in physics. J. F. Adams proved in 1960 that the only possible division algebras are at

More information

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

Isomorphisms. 0 a 1, 1 a 3, 2 a 9, 3 a 7 Isomorphisms Consider the following Cayley tables for the groups Z 4, U(), R (= the group of symmetries of a nonsquare rhombus, consisting of four elements: the two rotations about the center, R 8, and

More information

CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS

CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS (1) For a positive integer n, an n-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second

More information

Mathematical Foundations of Cryptography

Mathematical Foundations of Cryptography Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography

More information

LEGENDRE S THEOREM, LEGRANGE S DESCENT

LEGENDRE S THEOREM, LEGRANGE S DESCENT LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +

More information

* 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields. * 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

More information

CONSTRUCTING MULTIPLICATIVE GROUPS MODULO N WITH IDENTITY DIFFERENT FROM ONE

CONSTRUCTING MULTIPLICATIVE GROUPS MODULO N WITH IDENTITY DIFFERENT FROM ONE CONSTRUCTING MULTIPLICATIVE GROUPS MODULO N WITH IDENTITY DIFFERENT FROM ONE By: AlaEddin Douba 35697 Advisor: Dr. Ayman Badawi MTH 490: Senior Project INTRODUCTION The numbering system consists of different

More information

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.

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. Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms

More information

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

Introduction to Arithmetic Geometry Fall 2013 Lecture #24 12/03/2013 18.78 Introduction to Arithmetic Geometry Fall 013 Lecture #4 1/03/013 4.1 Isogenies of elliptic curves Definition 4.1. Let E 1 /k and E /k be elliptic curves with distinguished rational points O 1 and

More information

Some Basic Logic. Henry Liu, 25 October 2010

Some Basic Logic. Henry Liu, 25 October 2010 Some Basic Logic Henry Liu, 25 October 2010 In the solution to almost every olympiad style mathematical problem, a very important part is existence of accurate proofs. Therefore, the student should be

More information

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

An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt An Introduction to Proof-based Mathematics Harvard/MIT ESP: Summer HSSP Isabel Vogt Class Objectives Binary Operations Groups Axioms Closure Associativity Identity Element Unique Inverse Abelian Groups

More information

Math 430 Final Exam, Fall 2008

Math 430 Final Exam, Fall 2008 IIT Dept. Applied Mathematics, December 9, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 430 Final Exam, Fall 2008 Grades should be posted Friday 12/12. Have a good break, and don t forget

More information

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

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 Chapter R Review of basic concepts * 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 Ex: Write the set of counting numbers

More information

Mathematical Thinking in Art?

Mathematical Thinking in Art? Mathematical Thinking in Art? Since start of semester, we have looked at a number of examples from various cultures that (at least possibly) suggest mathematical thinking at work: Calendars linear and

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #10: Sequences and Summations Based on materials developed by Dr. Adam Lee Today s Topics Sequences

More information

Finite Fields. Mike Reiter

Finite Fields. Mike Reiter 1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements

More information

AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS

AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize

More information

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

A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under

More information

On the Shadow Geometries of W (23, 16)

On the Shadow Geometries of W (23, 16) On the of W (23, 16) Assaf Goldberger 1 Yossi Strassler 2 Giora Dula 3 1 School of Mathematical Sciences Tel-Aviv University 2 Dan Yishay 3 Department of Computer Science and Mathematics Netanya College

More information

Math 109 HW 9 Solutions

Math 109 HW 9 Solutions Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we

More information

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

MATH 420 FINAL EXAM J. Beachy, 5/7/97 MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only

More information

COUNTING AND SYMMETRY

COUNTING AND SYMMETRY COUNTING AND SYMMETRY INTERMEDIATE GROUP NOVEMBER 6, 2016 Warm Up Problem 1. Examine the figure below. (1) How many lines of symmetry does the figure have? (2) How many symmetries does the figure have?

More information

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

15 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 2012 1 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 01 1. Let f be the function such that f(x) = { x if x 1 x if x > 1 What is the total length of the graph of f(f(...f(x)...)) from x =

More information

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.

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. Homework #6. Due Thursday, October 14th Reading: For this homework assignment: Sections 3.3 and 3.4 (up to page 167) Before the class next Thursday: Sections 3.5 and 3.4 (pp. 168-171). Also review the

More information

Degrees of Regularity of Colorings of the Integers

Degrees of Regularity of Colorings of the Integers Degrees of Regularity of Colorings of the Integers Alan Zhou MIT PRIMES May 19, 2012 Alan Zhou (MIT PRIMES) Degree of Regularity May 19, 2012 1 / 15 Background Original problem: For a given homogeneous

More information

ISOMORPHISMS KEITH CONRAD

ISOMORPHISMS KEITH CONRAD ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition

More information

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

Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)

More information

4.4 Noetherian Rings

4.4 Noetherian Rings 4.4 Noetherian Rings Recall that a ring A is Noetherian if it satisfies the following three equivalent conditions: (1) Every nonempty set of ideals of A has a maximal element (the maximal condition); (2)

More information

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

MATH 25 CLASS 21 NOTES, NOV Contents. 2. Subgroups 2 3. Isomorphisms 4 MATH 25 CLASS 21 NOTES, NOV 7 2011 Contents 1. Groups: definition 1 2. Subgroups 2 3. Isomorphisms 4 1. Groups: definition Even though we have been learning number theory without using any other parts

More information

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,

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, 1 Latin Squares 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, A B C D E B C A E D C D E A B D E B C A E A D B C is a Latin square

More information

International Mathematics TOURNAMENT OF THE TOWNS

International Mathematics TOURNAMENT OF THE TOWNS International Mathematics TOURNAMENT OF THE TOWNS Senior A-Level Paper Fall 2008. 1. A standard 8 8 chessboard is modified by varying the distances between parallel grid lines, so that the cells are rectangles

More information

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

Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall 2015 Midterm Exam Review Solutions Practice exam questions: 1. Let V 1 R 2 be the subset of all vectors whose slope

More information

Lecture 11 - Basic Number Theory.

Lecture 11 - Basic Number Theory. Lecture 11 - Basic Number Theory. Boaz Barak October 20, 2005 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that a divides b,

More information

Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm

Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we

More information

Ma/CS 6b Class 20: Spectral Graph Theory

Ma/CS 6b Class 20: Spectral Graph Theory Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x

More information

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

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.

More information

Algebraic Methods in Combinatorics

Algebraic Methods in Combinatorics Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets

More information

Lecture 2: Groups. Rajat Mittal. IIT Kanpur

Lecture 2: Groups. Rajat Mittal. IIT Kanpur Lecture 2: Groups Rajat Mittal IIT Kanpur These notes are about the first abstract mathematical structure we are going to study, groups. You are already familiar with set, which is just a collection of

More information

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

(A B) 2 + (A B) 2. and factor the result. Transformational Geometry of the Plane (Master Plan) Day 1. Some Coordinate Geometry. Cartesian (rectangular) coordinates on the plane. What is a line segment? What is a (right) triangle? State and prove

More information

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

φ(xy) = (xy) n = x n y n = φ(x)φ(y) Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =

More information

4. Congruence Classes

4. Congruence Classes 4 Congruence Classes Definition (p21) The congruence class mod m of a Z is Example With m = 3 we have Theorem For a b Z Proof p22 = {b Z : b a mod m} [0] 3 = { 6 3 0 3 6 } [1] 3 = { 2 1 4 7 } [2] 3 = {

More information

Lecture 6: Finite Fields

Lecture 6: Finite Fields CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going

More information

2MA105 Algebraic Structures I

2MA105 Algebraic Structures I 2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 7 Cosets once again Factor Groups Some Properties of Factor Groups Homomorphisms November 28, 2011

More information

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

Group Theory. PHYS Southern Illinois University. November 15, PHYS Southern Illinois University Group Theory November 15, / 7 Group Theory PHYS 500 - Southern Illinois University November 15, 2016 PHYS 500 - Southern Illinois University Group Theory November 15, 2016 1 / 7 of a Mathematical Group A group G is a set of elements

More information

Math Exam 1 Solutions October 12, 2010

Math Exam 1 Solutions October 12, 2010 Math 415.5 Exam 1 Solutions October 1, 1 As can easily be expected, the solutions provided below are not the only ways to solve these problems, and other solutions may be completely valid. If you have

More information

MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM

MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through

More information

COMP Intro to Logic for Computer Scientists. Lecture 15

COMP Intro to Logic for Computer Scientists. Lecture 15 COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Types of proofs Direct proof of x F x Show that F x holds for arbitrary x, then use universal generalization. Often, F x is of the form

More information

Commutative Rings and Fields

Commutative Rings and Fields Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two

More information

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

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. 2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say

More information

Abstract Algebra Part I: Group Theory

Abstract Algebra Part I: Group Theory Abstract Algebra Part I: Group Theory From last time: Let G be a set. A binary operation on G is a function m : G G G Some examples: Some non-examples Addition and multiplication Dot and scalar products

More information

Abstract Algebra, HW6 Solutions. Chapter 5

Abstract Algebra, HW6 Solutions. Chapter 5 Abstract Algebra, HW6 Solutions Chapter 5 6 We note that lcm(3,5)15 So, we need to come up with two disjoint cycles of lengths 3 and 5 The obvious choices are (13) and (45678) So if we consider the element

More information

Algebraic Methods in Combinatorics

Algebraic Methods in Combinatorics Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei

More information

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

Math 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby Math 8: Advanced Number Theory Samit Dasgupta and Gary Kirby April, 05 Contents Basics of Number Theory. The Fundamental Theorem of Arithmetic......................... The Euclidean Algorithm and Unique

More information

Properties of Real Numbers

Properties of Real Numbers Pre-Algebra Properties of Real Numbers Identity Properties Addition: Multiplication: Commutative Properties Addition: Multiplication: Associative Properties Inverse Properties Distributive Properties Properties

More information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

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

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)

More information

Lecture 2: Lattices and Bases

Lecture 2: Lattices and Bases CSE 206A: Lattice Algorithms and Applications Spring 2007 Lecture 2: Lattices and Bases Lecturer: Daniele Micciancio Scribe: Daniele Micciancio Motivated by the many applications described in the first

More information

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

Group. Orders. Review. Orders: example. Subgroups. Theorem: Let x be an element of G. The order of x divides the order of G Victor Adamchik Danny Sleator Great Theoretical Ideas In Computer Science Algebraic Structures: Group Theory II CS 15-251 Spring 2010 Lecture 17 Mar. 17, 2010 Carnegie Mellon University Group A group G

More information

Mat 311 Test 1, 2019 Solutions

Mat 311 Test 1, 2019 Solutions Mat 311 Test 1, 2019 Solutions Question One 1.1 There exist integers x and y such that ax + cy =1sincegcd(a, c) =1. Thus (ax)b +(cy)b = b, implying a(xb)+(bc)y = b. Since a a(xb) and a (bc)y, thena [a(xb)+(bc)y].

More information

6 Permutations Very little of this section comes from PJE.

6 Permutations Very little of this section comes from PJE. 6 Permutations Very little of this section comes from PJE Definition A permutation (p147 of a set A is a bijection ρ : A A Notation If A = {a b c } and ρ is a permutation on A we can express the action

More information

Section II.1. Free Abelian Groups

Section II.1. Free Abelian Groups II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof

More information

Ma/CS 6a Class 4: Primality Testing

Ma/CS 6a Class 4: Primality Testing Ma/CS 6a Class 4: Primality Testing By Adam Sheffer Send anonymous suggestions and complaints from here. Email: adamcandobetter@gmail.com Password: anonymous2 There aren t enough crocodiles in the presentations

More information