answersLogoWhite

0

Cayley's theorem:Let (G,$) be a group. For each g Є G, let Jg be a permutation of G such that

Jg(x) = g$x

J, then, is a function from g to Jg, J: g --> Jg and is an isomorphism from (G,$) onto a permutation group on G.

Proof:We already know, from another established theorem that I'm not going to prove here, that an element invertible for an associative composition is cancellable for that composition, therefore Jg is a permutation of G. Given another permutation, Jh = Jg, then h = h$x = Jh(x) = Jg(x) = g$x = g, meaning J is injective.

Now for the fun part!

For every x Є G, a composition of two permutations is as follows:

(Jg â—‹ Jh)(x) = Jg(Jh(x)) = Jg(h$x) = g$(h$x) = (g$h)$x = Jg$h(x)

Therefore Jg ○ Jh = Jg$h(x) for all g, h Є G

That means that the set Ђ = {Jg: g Є G} is a stable subset of the permutation subset of G, written as ЖG, and J is an isomorphism from G onto Ђ. Consequently, Ђ is a group and therefore is a permutation group on G.

Q.E.D.

User Avatar

Wiki User

14y ago

What else can I help you with?

Related Questions

What is Cayley's Theorem?

Cayley's Theorem states that every group G is isomorphic to a subgroup of the symmetric group on G.


What this theorem states?

It states NOTHING!


What states the Pythagorean theorem?

Pythagoras' theorem states that for any right angle triangle that the square of its hypotenuse is equal to the sum of its squared sides.


How do you count spanning trees in a graph?

Cayleys formula states that for a complete graph on nvertices, the number of spanning trees is n^(n-2). For a complete bipartite graph we can use the formula p^q-1 q^p-1. for the number of spanning trees. A generalization of this for any graph is Kirchhoff's theorem or Kirchhoff's matrix tree theorem. This theorem looks at the Laplacian matrix of a graph. ( you may need to look up what that is with some examples). For graphs with a small number of edges and vertices, you can find all the spanning trees and this is often quicker. There are also algorithms such as depth-first and breadth-first for finding spanning trees.


What is the factor theorem?

In algebra, the factor theorem is a theorem linking factors and zeros of a polynomial. It is a special case of the polynomial remainder theorem.The factor theorem states that a polynomial has a factor if and only if


What is the triangle sum theorem?

The theorem that states every triangle's angles add up to 180 degrees


What does factor theorem mean?

In algebra, the factor theorem is a theorem linking factors and zeros of a polynomial. It is a special case of the polynomial remainder theorem.The factor theorem states that a polynomial has a factor if and only if


What is the four right angles theorem?

The theorem states "If two angles are both supplementary and congruent, then they are right angles."


This theorem states that in a right triangle the square of the length of the hypotenuse is equal to the sum of the squares of the lengths of the legs?

pythagorean theorem.


What theorem states that in a right triangle the square of the length of the hypotenuse is equal to the sum of the squares of the lengths of the legs?

the Pythagorean Theorem


Which theorem states that the measure of an exterior angle in a triangle is the sum of its remote interior angle measures?

exterior angle theorem


What is the theorem that states a right triangle the sum of the squares of the leg lengths is equal to the square of the hypotenuse length?

It is Pythagoras' theorem