Isomorphisms and Isomorphic Groups (10/9) We can now say what we mean by two groups being “the same” even though their operations and elements may look.

Slides:



Advertisements
Similar presentations
Discrete Mathematics II
Advertisements

An Aside from Number Theory: The Euler Phi-function (9/20/13) Definition. The Euler Phi-function of a positive integer n, denoted  (n) is the number of.
Cayley’s Theorem & Automorphisms (10/16) Cayley’s Theorem. Every group is isomorphic to some permutation group. This says that in some sense permutation.
Section 11 Direct Products and Finitely Generated Abelian Groups One purpose of this section is to show a way to use known groups as building blocks to.
Cayley Theorem Every group is isomorphic to a permutation group.
Math 3121 Abstract Algebra I
 Definition 16: Let H be a subgroup of a group G, and let a  G. We define the left coset of H in G containing g,written gH, by gH ={g*h| h  H}. Similarity.
Algebraic Structures: Group Theory II
GROUPS WITH MANY ABELIAN SUBGROUPS. Groups in which every non-abelian subgroup has finite index (joint work with Francesco de Giovanni, Carmela Musella.
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Chapter 3: Finite Groups; Subgroups  Terminology and Notation  Subgroup Tests  Examples of Subgroups.
Foundations of Network and Computer Security J J ohn Black Lecture #10 Sep 18 th 2009 CSCI 6268/TLEN 5550, Fall 2009.
Discrete Structures Chapter 5 Relations and Functions Nurul Amelina Nasharuddin Multimedia Department.
Is ℤ 6 a cyclic group? (a) Yes (b) No. How many generators are there of ℤ 6 ?
Let G be a group. Define  : G ® G by  ( x ) = x. The First Isomorphism Theorem says: (a) j(ab) = j(a)j(b)(b) j is onto. (c) G  G(d) G  {e} (e) G/{e}
Find all subgroups of the Klein 4- Group. How many are there?
I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry.
2. Groups Basic Definitions Covering Operations Symmetric Groups
Cyclic Groups. Definition G is a cyclic group if G = for some a in G.
9.3 Representing Graphs and Graph Isomorphism
Function: Definition A function is a correspondence from a first set, called the domain, to a second set, called the range, such that each element in the.
Some Groups of Mathematical Crystallography Part Deux.
2. Basic Group Theory 2.1 Basic Definitions and Simple Examples 2.2 Further Examples, Subgroups 2.3 The Rearrangement Lemma & the Symmetric Group 2.4 Classes.
Unit – IV Algebraic Structures
Tell me what you can about a group of order n Mike Krebs, Cal State LA This talk will (soon) be available by following the link for “Research and Talks”
Mathematics Class VII Chapter 1 Integers.
External Direct Products (11/4) Definition. If G 1, G 2,..., G n are groups, then their external direct product G 1  G 2 ...  G n is simply the set.
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.
Groups Definition A group  G,  is a set G, closed under a binary operation , such that the following axioms are satisfied: 1)Associativity of  :
Cyclic Groups (9/25) Definition. A group G is called cyclic if there exists an element a in G such that G =  a . That is, every element of G can be written.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Chapter 2: Groups Definition and Examples of Groups
Chapter 6: Isomorphisms
FUNCTIONS.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
The Hamiltonicity of Subgroup Graphs Immanuel McLaughlin Andrew Owens.
Math 3121 Abstract Algebra I Lecture 5 Finish Sections 6 + Review: Cyclic Groups, Review.
Math 3121 Abstract Algebra I Lecture 10 Finish Section 11 Skip 12 – read on your own Start Section 13.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
Math 3121 Abstract Algebra I
Cosets and Lagrange’s Theorem (10/28)
Bell Work: Simplify: √500,000,000. Answer: 10,000√5.
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
Sets Definition: 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.
Math 3121 Abstract Algebra I Lecture 11 Finish Section 13 Section 14.
Chapter 6 Abstract algebra
Questions on Direct Products (11/6) How many elements does D 4  Z 4 have? A. 4B. 8C. 16D. 32E. 64 What is the largest order of an element in D 4  Z 4.
Normal Subgroups and Factor Groups (11/11) Definition. A subgroup H of a group G is called normal if for every a  G, the left coset aH is the same set.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Math 3121 Abstract Algebra I Lecture 14 Sections
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.
Joseph DiMuro, 12/6/11. An introductory challenge 
SECTION 10 Cosets and the Theorem of Lagrange Theorem Let H be a subgroup of G. Let the relation  L be defined on G by a  L b if and only if a -1 b 
Section 2.1. Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the.
Garis-garis Besar Perkuliahan
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.
MTH376: Algebra For Master of Mathematics By Dr. M. Fazeel Anwar Assistant Professor Department of Mathematics, CIIT Islamabad 1.
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.
Relations and Functions
Abstract Algebra I.
Groups and Applications
Math 3121 Abstract Algebra I
Chapter 2: Groups Definition and Examples of Groups
Section 10.2 Finite Mathematical Systems
PHY 745 Group Theory 11-11:50 AM MWF Olin 102 Plan for Lecture 1:
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Presentation transcript:

Isomorphisms and Isomorphic Groups (10/9) We can now say what we mean by two groups being “the same” even though their operations and elements may look different. For example, we have been saying all along that D 3 and S 3 are “the same” even though their elements are labeled quite differently. The same is true, for example, of Z (under + of course) and the subgroup  2  of Q + (under times). What do they have in common? What is their basic structure? What about the subgroup {R 0, R 180, H, V} of D 4 and the subgroup {(1), (1 2), (4 5), (1 2)(4 5)} of S 5 ? What basic structure do they share?

Isomorphisms Definition. Let G and G be groups. A function  from G to G is call an isomorphism if:  is one-to-one and onto, and for all a and b in G,  (a b) =  (a)  (b). This latter condition says that  is “operation preserving”, or that it “respects the two operations”. Note that on the left the operation is occurring in G, but on the right it is occurring in G.

Examples of Isomorphisms Find an isomorphism from D 3 to S 3. Find an isomorphism from Z to 2Z. And so, in infinite groups, a group can be isomorphic of a proper subgroup of itself! Why is this not possible among finite groups? Find an isomorphism of Z to  2  in Q +. Let G =  a  be an abstract infinite cyclic group. Find an isomorphism from Z to G. Find an isomorphism of Z 4 to U(10). (Try to) find an isomorphism of Z 4 to U(8). If |G|  | G|, can an isomorphism between them exist?

Isomorphic Groups Definition. Two groups G and G are said to be isomorphic if there exists an isomorphism between them. So what examples do we already have of isomorphic groups? How do you show that two groups are isomorphic? Answer: Display an explicit isomorphism between them! How do you show that two groups are not isomorphic? Answer: Find a group-theoretic property that they do not share. For example: Order of groupsOrders of elements in the groups Cyclic versus non-cyclic Abelian versus non-abelian Numbers of subgroup of different orders Etc.

Examples of Non-Isomorphic Groups Why are the follow pairs of groups not isomorphic? Z 4 and Z 8 Z 4 and U(8) Z 8 and D 4 S 4 and Z 24 S 4 and D 12 In D 4,  R 90  and {R 0, R 180, H, V}. Z and Q + Q + and R + R and GL(2, R) Q + and Q*