2 views

Original Title: Maths

Uploaded by mohan

- SIAM News 2005 Robinson
- Ex 6 Solutions
- numbertheorymth621md-2015
- Graph Isomorphism as Hsp
- Percentage Tricks
- Lorentz-Representaions.pdf
- Maths
- What is Information, Hillman.pdf
- MATH 3130 Guelph Midterm 1 2017
- Geometry of the 4x4 Square
- J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker and R.A. Wilson - Atlas of Finite Groups
- hw
- 7thsemrep
- n-Linear Algebra Type 1 and Its Applications, by W. B. Vasantha Kandasamy & Florentin Smarandache
- INJECTIVE MONOIDS
- Gs2013 Qp Mth
- Tesseract
- Jealous Husbands
- 8 Bit Data Multiplication
- MP LAB MANUAL Saw Tooth Gen

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

- SIAM News 2005 RobinsonUploaded byfralalala2011
- Ex 6 SolutionsUploaded bySanjeev Shukla
- numbertheorymth621md-2015Uploaded byArvin Jeffrey Ngo
- Graph Isomorphism as HspUploaded byOmar Shehab
- Percentage TricksUploaded bygullipalli srinivasa rao
- Lorentz-Representaions.pdfUploaded byelius2138726
- MathsUploaded bysunil
- What is Information, Hillman.pdfUploaded byMon0id
- MATH 3130 Guelph Midterm 1 2017Uploaded byShane Nikkelen
- Geometry of the 4x4 SquareUploaded bym759
- J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker and R.A. Wilson - Atlas of Finite GroupsUploaded byOkomm
- hwUploaded byTruong Dang
- 7thsemrepUploaded byDILLIP
- n-Linear Algebra Type 1 and Its Applications, by W. B. Vasantha Kandasamy & Florentin SmarandacheUploaded byAnonymous 0U9j6BLllB
- INJECTIVE MONOIDSUploaded byjojo2k
- Gs2013 Qp MthUploaded bySanjeev Shukla
- TesseractUploaded bySteven Wei
- Jealous HusbandsUploaded byrbruma

- 8 Bit Data MultiplicationUploaded bymohan
- MP LAB MANUAL Saw Tooth GenUploaded bymohan
- 8 Bit DivisionUploaded bymohan
- 8086 QuestionsUploaded bymohan
- Square WaveformUploaded bymohan
- Block Diagram of 8051Uploaded bymohan
- 8086 Pin ConfigUploaded bymohan
- Architectural Diagram of 8086Uploaded bymohan
- Addition of Two 8Uploaded bymohan
- Architechture or Functional Block Diagram of 8085Uploaded bymohan
- Ready pinUploaded bymohan
- Ready pinUploaded bymohan
- Smallest Element in an ArrayUploaded bymohan
- Architechture or Functional Block Diagram of 8085Uploaded bymohan
- Bluetooth Based Home Automation System Using CellphoneUploaded bymohan
- Guest KlnitUploaded bymohan
- Lab ManualUploaded bymohan
- Convolution.docxUploaded bymohan
- Convolution.docxUploaded bymohan
- lab manualUploaded bymohan
- Eeem301 PaperUploaded bymohan
- EC6504_MM_Rejinpaul_Important_QuestionsUploaded bymohan
- Interfacing 8253 Timer With 8085Uploaded bymohan
- Largest Number in an Array of DataUploaded bymohan
- DspUploaded bymohan
- 261827816-Interacting-and-Non-Interacting-System.pdfUploaded byjanurang
- 8255Uploaded bymohan
- 8255Uploaded bymohan
- 78988622-Opcode-Sheet-for-8085-Microprocessor-With-Description.docxUploaded bymohan
- Gsm Based Home Security SystemUploaded bypkrishna_4

- Topology Exercises and Sol1Uploaded byChris Walsh
- Sh en Tao PhysicsUploaded bygnimmelf
- Taylor SeriesUploaded byminhthangbk
- Element of Homotopy TheoryUploaded byalfredtarski276
- Cubical Homology in Digital ImagesUploaded bySEP-Publisher
- Some Topology Problems and SolutionsUploaded byM2C7r6
- Hopf Degree TheoremUploaded byWill Black
- Wikipedia - Covariance and Contravariance of VectorsUploaded bycarlosgm
- De Rham Cohomology - Wikipedia, The Free EncyclopediaUploaded byAlbert Quaeda
- A Problem Course in Module TheoryUploaded byPurbayan Chakraborty
- Student Note - SequenceUploaded bypirawin92
- An Introduction to Effectus TheoryUploaded byJohn Bird
- ALG2 HW1Uploaded byBin Chen
- Smarandache Semirings, Semifields,Semi Vector SpacesUploaded byfurrysammy17
- Sequences Lecture Notes (1)Uploaded bysuryav123
- Topology and DataUploaded byLukas Strnad
- hwk5Uploaded byovomaltino54
- Metric spacesUploaded bytomdavis777
- mon1varUploaded byCatana Paul
- 76_Sample_Chapter Kunci M2K3 No 9Uploaded byRachmat Hidayat
- MAT301 Assignment4 SolUploaded byHongyi Zhao
- rudin solutions Chapter 1Uploaded byJavier Mtz T
- Manifold and Differential FormsUploaded byBharat Mahajan
- Galois InverseUploaded bygermanschultze
- LinearAlgebraIUploaded byDilip Kumar
- On The Darboux Vector Belonging To Involute Curve A Different ViewUploaded byMia Amalia
- SteinitzUploaded byAlfredo Sotelo Pejerrey
- Shui-Nee Chow, Chengzhi Li, Duo Wang-Normal Forms and Bifurcation of Planar Vector Fields-Cambridge University Press (2009).pdfUploaded byDede Santos
- Series of FunctionsUploaded bySuperheavy Rockshow Go't
- Introduction to Functional Analysis MITUploaded bypranavsinghps