0 Up votes0 Down votes

2 views3 pagesMaths

Feb 10, 2017

© © All Rights Reserved

PDF, TXT or read online from Scribd

Maths

© All Rights Reserved

2 views

Maths

© All Rights Reserved

- Ayres F., Jaisingh L. Schaums Outline of Theory and Problems of Abstract Algebra (2ed., MGH,2004)(310s)_MAa
- group-app[1]
- [Nathan Jacobson] Basic Algebra I Second Edition(Z-lib.org)-Halaman-16-22,72-74
- 10.1.1.108.9108
- Math Stackexchange Com
- UCLA Recursion
- paper_math_june_2009.pdf
- Ayres F., Jaisingh L. Schaums Outline of Theory and Problems of Abstract Algebra (2ed., MGH,2004)
- mathgen-221816293
- k - Mirrors and Kscopes
- Permutations_&_Combinations_Concepts-252.pdf
- 0810.2457
- QUESTION_BANK_OF_DISCRETE_MATHEMATICS.pdf
- 1875077303M.sc Maths I Year
- MainRaulo
- Thesis_Semifinal.pdf
- EE720 - quiz3
- coursesIII
- Combinatorics - Lecture 1 (Basics of Counting, Pigeonhole Principle, Permunation and Combination)_2
- Part 2 Mathematical Background.pptx

You are on page 1of 3

Recall the Cayley (Group) Table for Z/4Z you saw in Section 5:

0 1 2 3

0 0 1 2 3

1 1 2 3 0

2 2 3 0 1

3 3 0 1 2

What do you notice about each column in this table? About each row? Each column/row contains

all of the values 0 4 rearranged, or permuted, in some way. So, each row corresponds to some

permutation of our group elements and we can use this idea to define a map from G to SG , the

group of all permutations of G.

Thus it should be clear that every finite group is isomorphic to a subgroup of some symmetric

group (using the method presented above), but in fact something much stronger holds. Cayleys

theorem states that this property holds not only for finite groups, but for every group (regardless of

order).

This is a classic result in group theory and a very intriguing one with this in hand, if we can

fully understand the structure and properties of Sn and its subgroups, then we will automatically

understand the structure and properties of every group! However, due to the sheer size of Sn this

becomes problematic. For instance, a refinement of Cayleys theorem states that any group G is

isomorphic to a subgroup of S|G| , but the size of S|G| is |G|!, so trying to use S|G| to answer any

question you might have about G means working with a group that factorially larger (note, factorial

growth is faster than exponential growth!).

Definition

Let f : A B be a function and let H A. The image of H under f is

{f (h) : h H} and is denoted by f [H].

Lemma 8.15

Let G and G0 be groups and let : G G0 be an injective function such that

(xy) = (x)(y) for all x, y G. Then [G] is a subgroup of G0 and provides

an isomorphism of G with [G].

Note, a function : G G0 between two groups satisfying (xy) = (x)(y) is called a homomor-

phism. You may have briefly seen this in Section 3 when you were discussing isomorphisms (an

isomorphism is a bijective homomorphism) and you will explore their properties more in Section 13.

Further, something much more general actually holds. The injectivity requirement can be re-

moved to give an isomorphism between a subgroup of G and [G], which is known as the First

Isomorphism Theorem (for groups); which will be seen in Section 32.

Proof. To show that [G] G0 we need to show that [G] is closed and contains inverses and the

identity element.

First, let x0 , y 0 [G] G0 , then by definition there exist some x, y G such that (x) = x0 and

(y) = y 0 . Using this and the homomorphism property, we see that

x0 y 0 = (x)(y) = (xy),

1

again using the homomorphism property. Now, since G0 is a group we have right-cancellation im-

plying e0 = (e), and thus e0 [G].

Therefore, we have that [G] G0 . The fact that G = [G] is trivial since, by assumption,

is injective and satisfies the homomorphism property, and surjectivity follows from the definition of

[G].

Cayleys Theorem

Every group is isomorphic to a group of permutations.

Proof. Let G be a group, since any subgroup of a symmetric group is a group of permutations, if we

can define an injective homomorphism : G SG then by Lemma 8.15 the result will follow.

Recall the map `g : G G defined by `g (x) = gx for all x G defined last class (this is the left-

multiplication by g map), which we saw to be bijective and provide a permutation of the elements

of G.

First, suppose that (g) = (g 0 ), then `g = `g0 as functions mapping G to G. For functions to

be equal they must equal at every point, and hence `g (e) = `g0 (e) implying g = ge = g 0 e = g 0 ; and

hence is injective.

(gg 0 )(x) = `gg0 (x) = gg 0 x = g(g 0 x) = `g (g 0 (x)) = `g (`g0 (x)) = (g)((g 0 )(x)) = (g)(g 0 )(x).

Thus, is a homomorphism.

= [G] SG and so G is

isomorphic to a group of permutations.

Alternatively, we could have used the right-multiplication by g map, rg , to induce another sub-

group of SG isomorphic to G with one subtle difference. Rather than defining a map (g) = rg we

instead define to be (g) = rg1 .

(gg 0 )(x) = rgg0 (x) = xgg 0 = rg0 (xg) = rg0 (rg (x)) = rg0 rg (x) = (g 0 )(g)(x) 6= (g)(g 0 )(x).

Defining (g) = rg1 solves this commutativity problem and defines a homomorphism.

Definition

The maps and defined above are the left regular representation and right

regular representation of G, respectively.

Note, the left regular representation corresponds to the rows in a Cayley table, while the right

regular representation corresponds to the columns (being careful to choose the correct column since

(g) = rg1 !). For example, using the Cayley table for Z/4Z above we see

0 1 2 3 0 1 2 3

(0) = `0 = , (1) = `1 = , ...

0 1 2 3 1 2 3 0

2

9 Orbits, Cycles, and the Alternating Groups

In your homework you learned about the orbits of a permutation. Recall that if A is a set and

SA , then the orbit of a under is given by

then a b if and only if b = n (a) for some n, i.e., a b iff a and b lie in the same orbit.

Example

Find the orbits of the permutation

1 2 3 4 5 6 7 8

= S8 .

3 8 6 7 4 1 5 2

1 3 6 1 3 6 1 3 .

Hence, the -orbit of 1 is {1, 3, 6}. What would the orbit of 3 be? Of 6? What if we picked a value

not in the orbit of 1? Continuing this we can see the -orbits are

We can graphically represent these orbits in the following way: Each individual cycle above

defines a permutation itself! For example the first cycle corresponds to the permutation

1 2 3 4 5 6 7 8

= .

3 2 6 4 5 1 7 8

We see that has one three-element orbit, {1, 3, 6}, and five one-element orbits, {2}, {4}, {5}, {7}, {8}.

The orbits written in this way lead to a new (and much simplified) notation (called cycle notation)

representing a permutation, namely,

1 2 3 4 5 6 7 8

= = (1 3 6)(2)(4)(5)(7)(8) = (1 3 6).

3 2 6 4 5 1 7 8

- Ayres F., Jaisingh L. Schaums Outline of Theory and Problems of Abstract Algebra (2ed., MGH,2004)(310s)_MAaUploaded byGennc Sadriu
- group-app[1]Uploaded byluca
- [Nathan Jacobson] Basic Algebra I Second Edition(Z-lib.org)-Halaman-16-22,72-74Uploaded byKhalifah
- 10.1.1.108.9108Uploaded bynhtoanhh
- Math Stackexchange ComUploaded byking is king
- UCLA RecursionUploaded byMayank
- paper_math_june_2009.pdfUploaded byAmbika Kannusamy
- Ayres F., Jaisingh L. Schaums Outline of Theory and Problems of Abstract Algebra (2ed., MGH,2004)Uploaded byJonathan Daniel Roldan Campos
- mathgen-221816293Uploaded bysamsmith
- k - Mirrors and KscopesUploaded byelmiselem1996
- Permutations_&_Combinations_Concepts-252.pdfUploaded byphoton gaming
- 0810.2457Uploaded byfulltrout
- QUESTION_BANK_OF_DISCRETE_MATHEMATICS.pdfUploaded bybhattoo07
- 1875077303M.sc Maths I YearUploaded byBhargava Techno Solutions
- MainRauloUploaded byBoyang Qin
- Thesis_Semifinal.pdfUploaded byBenj Cabalona Jr.
- EE720 - quiz3Uploaded byAbhiraj Kanse
- coursesIIIUploaded byHasufin
- Combinatorics - Lecture 1 (Basics of Counting, Pigeonhole Principle, Permunation and Combination)_2Uploaded bySasha Newman
- Part 2 Mathematical Background.pptxUploaded byramshah7777777
- Permutations and CombinationsUploaded byAnnie Kris Buking Andogan
- Arnold Trivium 2 1993Uploaded bykarmatsoi
- CoxetikipdiaUploaded byBoviliha Ern Amteraoux
- - The Algebra Dance - Banach Tarski Paradox.pdfUploaded bycarolina
- CAT Level Permutation and Combination, Probability QuestionsUploaded byKshitija Sahani
- ModularUploaded byGeorge Karagiannidis

- temperature sensorsUploaded byDasuki Fahmi
- Shortcut KeysUploaded bymohan
- Op Code SheetUploaded bymohan
- ElectronicsUploaded bymohan
- basic electronicsUploaded byVijay Preetham
- Motorola 68000Uploaded bymohan
- PLC-1Uploaded bymohan
- 592f07d2082d5Uploaded bymohan
- std-12-commerce-economics.pdfUploaded byRiddhi Khadloya
- Basic Assembly Language Programming ConceptsUploaded byDev Jha
- Delta Ia-plc Dvp-plc Pm en 20140804Uploaded byAli Padaryam
- How to Receive Arduino Sensor Data on Your AndroidUploaded bymarius_danila8736
- 974354580e95d9f99f8147bc8b8ba62b079c.pdfUploaded bymohan
- Bluetooth Based Home Automation System Using CellphoneUploaded bymohan
- Architechture or Functional Block Diagram of 8085Uploaded bymohan
- 8 Bit DivisionUploaded bymohan
- 8 Bit Data MultiplicationUploaded bymohan
- Block Diagram of 8051Uploaded bymohan
- 8086 QuestionsUploaded bymohan
- Architectural Diagram of 8086Uploaded bymohan
- Architechture or Functional Block Diagram of 8085Uploaded bymohan
- Smallest Element in an ArrayUploaded bymohan
- Ready pinUploaded bymohan
- Addition of Two 8Uploaded bymohan
- 8086 Pin ConfigUploaded bymohan
- MP LAB MANUAL Saw Tooth GenUploaded bymohan
- Square WaveformUploaded bymohan
- DspUploaded bymohan
- Interfacing 8253 Timer With 8085Uploaded bymohan

- 4400 Algebra 2 Point 5Uploaded bysticker592
- Functional analysis and economic theoryUploaded byAlEx Hernandez
- format IJET-1.docUploaded byprabhabathi devi
- endre_pap__auth-_complex_analysis_through_exambookzz-org.pdfUploaded byKrisTina Jovanovic
- BSc Sem5&6 Syllabus 2016-17Uploaded byChandraprakash Shah
- "Fuckin' Concrete Contemporary Abstract Algebra Introduction..." by Nicolas Bourbaki JuniorUploaded byNicolasBourbakiJr
- ej2Uploaded byPatricia Calvo Pérez
- Algebra+Homotopy=OperadUploaded byMilan Glendza
- Galois Theory YOSHIDAUploaded byHuy Le
- KatjaUploaded byKaspar Hauser
- SOME ELEMENTARY ALGEBRAIC CONSIDERATIONS INSPIRED BY SMARANDACHE'S FUNCTION (II)Uploaded byRyanElias
- 61solnUploaded byMohan Rao
- Gallian Ch 15Uploaded bywoodbrent7
- Greg Kuperberg- Spiders for Rank 2 Lie AlgebrasUploaded bySteam29
- Boolian AlgebraUploaded byltcdrar
- Elements-Halmos.pdfUploaded byIgor Pavlov
- Companion to Lang's Algebra (G. Bergman)Uploaded byJoseph Heavner
- alg1Uploaded byrapsjade
- MAT301 Assignment4 SolUploaded byHongyi Zhao
- 70Uploaded byromarcin
- aisiitUploaded byB.s. Jnyaneshwar
- Krautzberger Idem Potent Filters and Ultra FiltersUploaded byDiego Leonardo Lugo Ojeda
- Linear Algebra Lecture NotesUploaded byMichael Steele
- 4494526Uploaded byJason Yin
- UG MATHUploaded byDEEP
- Provas resolvidas.pdfUploaded byMauro Calefi
- Charles R. Gallistel-The Organization of Learning -MIT Press (1993)Uploaded byeleni13121975
- [William_J._Gilbert,_W._Keith_Nicholson]_Modern_al(BookFi).pdfUploaded byNaca Maja
- Bijection and Isomorphism on Graph of Sn(123; 132) from One of (n − 1) Length Binary StringsUploaded byijcsis
- Douglas Hofstadter - Godel Escher Bach Chapter 02a Meaning and Form in MathematicsUploaded byIgor Bojceski

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.