Cayley’s Theorem & Automorphisms (10/16) Cayley’s Theorem. Every group is isomorphic to some permutation group. This says that in some sense permutation.

Slides:

Advertisements

Similar presentations

1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.

Advertisements

Factors, Primes & Composite Numbers

Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13

Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13

Title Subtitle.

DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.

Reductions Complexity ©D.Moshkovitz.

Tintu David Joy. Agenda Motivation Better Verification Through Symmetry-basic idea Structural Symmetry and Multiprocessor Systems Mur ϕ verification system.

Evaluating Limits Analytically

ABC Technology Project

Cayley Tables (9/9) If a group G is finite, we can (theoretically at least) write down the whole operation table, or Cayley table of G. We always put the.

© 2010 Pearson Education, Inc. All rights reserved

CENG536 Computer Engineering Department Çankaya University.

THE WELL ORDERING PROPERTY Definition: Let B be a set of integers. An integer m is called a least element of B if m is an element of B, and for every x.

BIOLOGY AUGUST 2013 OPENING ASSIGNMENTS. AUGUST 7, 2013  Question goes here!

Equivalent Fractions: Addition

Limits (Algebraic) Calculus Fall, What can we do with limits?

Algebra II Chapter 10 Section 3.

Chapter 5 Test Review Sections 5-1 through 5-4.

25 seconds left…...

Chapter Algorithms 3.2 The Growth of Functions

We will resume in: 25 Minutes.

Lecture 15 Functions CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

1 Unit 1 Kinematics Chapter 1 Day

Euler’s Identity Glaisher’s Bijection. Let be a partition of n into odd parts If you have two i-parts i+i in the partition, merge them to form a 2i-part.

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.

Number Factors and Multiples Saturday, 09 September 2006 ©RSH.

Questions on Normal Subgroups and Factor Groups (11/13) Let G be a group and let H be a subgroup of G. If H is normal in G, then for every a  G and h.

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.

Even and Odd Permutations (10/2) Theorem. Every cycle, and hence every permutation, can be written as product of (usually non-disjoint) 2-cycles. Example.

Math 3121 Abstract Algebra I

Section 13 Homomorphisms Definition A map  of a group G into a group G’ is a homomorphism if the homomophism property  (ab) =  (a)  (b) Holds for.

Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.

Symmetric Group Sym(n) As we know a permutation  is a bijective mapping of a set A onto itself:  : A  A. Permutations may be multiplied and form the.

Chapter 3: Finite Groups; Subgroups  Terminology and Notation  Subgroup Tests  Examples of Subgroups.

Permutations and Inverses. Definition Let A be a set. If f : A  A is a 1-1 correspondence then f is called a permutation of A. Notation: S(A): the set.

Section 4.1 Finite Permutation Groups Permutation of a Set Let A be the set { 1, 2, …, n }. A permutation on A is a function f : A  A that is both one-to-one.

GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,

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.

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.

General linear groups, Permutation groups & representation theory.

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.

Permutation Groups Part 1. Definition A permutation of a set A is a function from A to A that is both one to one and onto.

Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.

Chapter 6: Isomorphisms

Test Corrections You may correct the in-class portion of your test. You will get back 1/2 of the points you lost if you submit correct answers. This work.

Chapter 5: Permutation Groups  Definitions and Notations  Cycle Notation  Properties of Permutations.

Math 3121 Abstract Algebra I Lecture 10 Finish Section 11 Skip 12 – read on your own Start Section 13.

Cosets and Lagrange’s Theorem (10/28)

Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.

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.

Section 14 Factor Groups Factor Groups from Homomorphisms. Theorem Let  : G  G’ be a group homomorphism with kernel H. Then the cosets of H form a factor.

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)

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.

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 

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.

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.

Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.

Math 3121 Abstract Algebra I

Groups and Applications

GROUPS & THEIR REPRESENTATIONS: a card shuffling approach

Chapter 2: Groups Definition and Examples of Groups

Homomorphisms (11/20) Definition. If G and G’ are groups, a function  from G to G’ is called a homomorphism if it is operation preserving, i.e., for all.

Presentation transcript:

Cayley’s Theorem & Automorphisms (10/16) Cayley’s Theorem. Every group is isomorphic to some permutation group. This says that in some sense permutation groups are “universal” in group theory. If we understood permutation groups completely, then we would understand all abstract groups completely. Sadly, permutation groups tend to be quite complicated!

A specific implementation of Cayley Let G be an abstract group. Here is one way to get an isomorphism between G and a group of permutations: Given a  G, let T a be the permutation of the elements of G created by left multiplication by a (i.e., T a (x) = a x for all x  G). We must verify that T a is indeed a permutation. Now G’ = {T a : a  G} and let  : G  G’ be the obvious:  (a) = T a. We must verify that  is an isomorphism. G’ is called the left regular representation of G. Example: Write down, in cycle notation, the left regular representation of U(10).

Automorphisms An automorphism of a group G is an isomorphism of G to itself. One automorphism which always exists for any group is the identity automorphism which takes every element to itself. Note that any cyclic group G, any isomorphism from G is completely determined by where it sends a generator. For example, the standard isomorphism from Z to 2Z is set by knowing that 1 goes to 2. So, what are the automorphisms of Z? How about Z 5 ? Z 6 ? How many automorphisms do you think Z n has?

The group Aut(G) Definition. If G is a group, Aut(G) is the set of all automorphisms of G. Note the Aut(G) always has at least one element. Theorem. For all groups G, Aut(G) is itself a group under function composition. So, what group is Aut(Z) isomorphic to? Want to guess what Aut(Z n ) is isomorphic to? Note: In general, Aut(G) is not easy to determine.

The group Inn(G) This will seem familiar from the take-home portion of Test #1. Definition. If a  G, let  a : G  G be given by  a (x) = a x a -1 for all x  G. (“Conjugation by a”)  a is called the inner automorphism of G induced by a. Must verify that these are indeed automorphisms of G. Definition. The set of all inner automorphisms of G is denoted Inn(G). Theorem. Inn(G) is itself a group under function composition. Note that if G is abelian, then Inn(G) is just the trivial group. Example: Determine Inn(D 3 ).

Assignment for Friday Finish reading Chapter 6. Do this carefully as this material is “non-trivial”. On pages 138-9, do Exercises 3, 10, 11, 12, 15, 21, 22, 25.