PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Low Entry average rating: No information on entry rating
[parent] proof of Cayley's theorem (Proof)

Let $ G$ be a group, and let $ S_G$ be the permutation group of the underlying set $ G$. For each $ g\in G$, define $ \rho_g : G\rightarrow G$ by $ \rho_g (h) = gh$. Then $ \rho_g$ is invertible with inverse $ \rho_{g^{-1}}$, and so is a permutation of the set $ G$.

Define $ \Phi :G\rightarrow S_G$ by $ \Phi (g) = \rho_g$. Then $ \Phi$ is a homomorphism, since

$\displaystyle (\Phi (gh))(x) = \rho_{gh}(x) = ghx = \rho_g(hx) = (\rho_g\circ\rho_h)(x) = ((\Phi (g))(\Phi (h)))(x)$

And $ \Phi$ is injective, since if $ \Phi (g) = \Phi (h)$ then $ \rho_g = \rho_h$, so $ gx = hx$ for all $ x\in X$, and so $ g=h$ as required.

So $ \Phi$ is an embedding of $ G$ into its own permutation group. If $ G$ is finite of order $ n$, then simply numbering the elements of $ G$ gives an embedding from $ G$ to $ S_n$.



"proof of Cayley's theorem" is owned by Evandar.
(view preamble)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: order, finite, embedding, injective, homomorphism, permutation, inverse, invertible, permutation group, group

This is version 2 of proof of Cayley's theorem, born on 2002-03-03, modified 2003-05-29.
Object id is 2751, canonical name is ProofOfCayleysTheorem.
Accessed 4693 times total.

Classification:
AMS MSC20B99 (Group theory and generalizations :: Permutation groups :: Miscellaneous)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)