Cayley's theorem: Difference between revisions

From Groupprops
No edit summary
 
(7 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{semibasic fact}}
{{semibasic fact}}
{{embeddability theorem}}
[[Difficulty level::2| ]]
<section begin="beginner"/>
==Statement==
===In terms of group actions===
Let <math>G</math> be a group. The group multiplication <math>G \times G \to G</math>, defines a [[group action]] of <math>G</math> on itself. In other words, the ''left multiplication'' gives an action of <math>G</math> on itself, with the rule <math>g.h = gh</math>. This action is termed the [[left-regular group action]].
This group action is [[faithful group action|faithful]] -- no non-identity element of <math>G</math> acts trivially.
===In terms of homomorphisms===


==Statement==
Let <math>G</math> be a group. There is a homomorphism from <math>G</math> to <math>\operatorname{Sym}(G)</math> (the [[symmetric group]], i.e., the group of all permutations, on the underlying set of <math>G</math>). Moreover, this homomorphism is injective. Thus, every group can be realized as a subgroup of a symmetric group.
 
==Proof==


===In terms of group actions===
===In terms of group actions===


Let <math>G</math> be a group. The group multiplication <math>G \times G \to G</math>, defines a [[group action]] of <math>G</math> on itself. In other words, the ''left multiplication'' gives an action of <math>G</math> on itself, with the rule <math>g.h = gh</math>.
'''Given''': A group <math>G</math>.
 
'''To prove''': <math>G</math> acts on itself by left multiplication, and this gives an injective homomorphism from <math>G</math> to the symmetric group on <math>G</math>.


Further, this group action is faithful -- no non-identity element of <math>G</math> acts trivially.
'''Proof''': Define the left-regular group action of <math>G</math> on itself by <math>g.h = gh</math>.


This action is termed the [[left-regular group action]].
# This is a group action: <math>e.s = s</math> follows from the fact that <math>e</math> is the identity element, while <math>g.(h.s) = (gh).s</math> follows from associativity.
# The action is faithful; every non-identity element of the group gives a non-identity permutation: Assume that there are <math>g, h \in G</math> such that their action by left multiplication is identical. But then <math>ge = he</math> so <math>g = h</math>. Therefore, the action is faithful.


===In terms of homomorphisms===
Thus, we get a homomorphism from <math>G</math> to <math>\operatorname{Sym}(G)</math>. Since the action is faithful, distinct elements of <math>G</math> go to distinct elements of <math>\operatorname{Sym}(G)</math>, so the map is injective. In particular, <math>G</math> is isomorphic to a subgroup of <math>\operatorname{Sym}(G)</math>.


Let <math>G</math> be a group. The action of <math>G</math> on itself by left multiplication gives a homomorphism from <math>G</math> to <math>\operatorname{Sym}(|G|)</math> (the [[symmetric group]], i.e., the group of all permutations, on the underlying set of <math>G</math>). Moreover, this homomorphism is injective. Thus, every group can be realized as a subgroup of a symmetric group.
<section end="beginner"/>


==Applications==
==Applications==
===Direct applications to embedding in symmetric groups===


* [[Every finite group is a subgroup of a finite simple group]]
* [[Every finite group is a subgroup of a finite simple group]]
* [[Every finite group is a subgroup of a finite complete group]]
* [[Every finite group is a subgroup of a finite complete group]]
* [[Every group is a subgroup of a complete group]]
* [[Finitary symmetric group on countable set is subgroup-universal for finite groups]]
* [[Every group of given order is a permutable complement for symmetric groups]]
===Applications to embedding in other kinds of groups===
* [[Every finite group is a subgroup of a linear group over any field]]
* [[Every finite group is a subgroup of an orthogonal group over any field]]
===Applications to embeddings for particular kinds of finite groups===
* [[Every group of prime power order is a subgroup of an iterated wreath product of groups of order p]]
* [[Every group of prime power order is a subgroup of a group of unipotent upper-triangular matrices]]
* [[Every group of prime power order is a subgroup of a group of unipotent upper-triangular matrices]]

Latest revision as of 20:32, 10 April 2011

This article describes a fact or result that is not basic but it still well-established and standard. The fact may involve terms that are themselves non-basic
View other semi-basic facts in group theory
VIEW FACTS USING THIS: directly | directly or indirectly, upto two steps | directly or indirectly, upto three steps|
VIEW: Survey articles about this

This article gives the statement, and possibly proof, of an embeddability theorem: a result that states that any group of a certain kind can be embedded in a group of a more restricted kind.
View a complete list of embeddability theorems

Statement

In terms of group actions

Let G be a group. The group multiplication G×GG, defines a group action of G on itself. In other words, the left multiplication gives an action of G on itself, with the rule g.h=gh. This action is termed the left-regular group action.

This group action is faithful -- no non-identity element of G acts trivially.

In terms of homomorphisms

Let G be a group. There is a homomorphism from G to Sym(G) (the symmetric group, i.e., the group of all permutations, on the underlying set of G). Moreover, this homomorphism is injective. Thus, every group can be realized as a subgroup of a symmetric group.

Proof

In terms of group actions

Given: A group G.

To prove: G acts on itself by left multiplication, and this gives an injective homomorphism from G to the symmetric group on G.

Proof: Define the left-regular group action of G on itself by g.h=gh.

  1. This is a group action: e.s=s follows from the fact that e is the identity element, while g.(h.s)=(gh).s follows from associativity.
  2. The action is faithful; every non-identity element of the group gives a non-identity permutation: Assume that there are g,hG such that their action by left multiplication is identical. But then ge=he so g=h. Therefore, the action is faithful.

Thus, we get a homomorphism from G to Sym(G). Since the action is faithful, distinct elements of G go to distinct elements of Sym(G), so the map is injective. In particular, G is isomorphic to a subgroup of Sym(G).

Applications

Direct applications to embedding in symmetric groups

Applications to embedding in other kinds of groups

Applications to embeddings for particular kinds of finite groups