Metric Spaces
Comprehensive module covering 5 sections in Functional Analysis.
REPOSITORY
BMLABS MATHEMATICS REPOSITORY
mathematics.bmlabs.co.in
Author
Dr. Bivash Majumder
Assistant Professor in Mathematics
Prabhat Kumar College, Contai
Abstract Algebra · Homomorphisms and Isomorphisms of Groups
Learn Permutation Representations and Extended Cayley Theorem.
Understand the central mathematical ideas of Permutation Representations and Extended Cayley Theorem.
Use the key definitions and notation accurately.
Interpret the principal results and their mathematical conditions.
Follow and justify the main proof strategy step by step.
Learning studio
2 concepts
6 guided steps
4 worked items
Learning path
Learning command centre
Progress is stored only in this browser. Academic content remains complete and printable.
2
Definitions
2
Theorems
0
Lemmas
1
Corollaries
3
Proofs
2
Examples
1
Exercises
2
Visual tools
Local progress
Lesson profile
definition
theorem
Let be a group and let be a -set. Let denote the group of all permutations of . For each , define by , and define by . Then is a homomorphism.
definition
theorem
corollary
Let be a finite group and let be a proper subgroup of of index . If does not divide , then contains a nontrivial normal subgroup.
introductory
Interactive concept atlas
20 concepts · 25 relationships · auto mode
Concept map ready to load
The graph engine loads only when this learning map approaches the viewport.
Permutation Representations and Extended Cayley Theorem Concept Map. 20 concepts.
2
Definitions
6
Results
4
Applications
2
Practice
2 practice items
After using orbits and stabilizers to count how a group action moves elements of a set, we now extract a homomorphism from the action itself. Every element sends each point to another point , so it behaves like a permutation of . This observation leads to permutation representations and extended Cayley theorem. A group action therefore converts an abstract group into a subgroup, or at least an image, inside a permutation group. In this lesson we shall prove the action-induced homomorphism, apply it to coset actions, and use the extended Cayley theorem to find normal subgroups.
Let be a group and let be a -set. For each , define a function by
The assignment
is called the permutation representation associated with the action when it is viewed as a homomorphism from into the group of all permutations of .
The action laws force each fixed group element to move the set in a reversible way. The inverse motion is supplied by , because acting by and then by returns every point to where it started. Thus a group action does not merely give arbitrary functions ; it gives bijections of . This is why permutation representations and extended Cayley theorem connect group actions with homomorphisms into permutation groups. Students often miss the order of composition: for a left action, .
Let be a group and let be a -set. Let denote the group of all permutations of . For each , define by , and define by . Then is a homomorphism.
Given that is a group, is a -set, is defined by , and is defined by . To prove that is a homomorphism. [1] To prove that is a permutation of . Let and suppose . Then
Acting by on both sides gives
Therefore is one-to-one. Let . Put . Then
Therefore is onto. Hence . [2] To prove that preserves multiplication. Let and let . Then
Thus . Hence
Therefore is a homomorphism.
Let act on a set , and let be the homomorphism induced by the action. The kernel of the action is
It consists of precisely those group elements that act as the identity permutation on the whole set .
An action is called faithful when its kernel is . In that case, distinct group elements induce distinct permutations of , so is represented inside without collapsing any non-identity element. Cayley's theorem is the most famous example: every group acts faithfully on itself by left multiplication. The extended Cayley theorem weakens this by acting on cosets of a subgroup, where the kernel may be nontrivial but is forced to lie inside that subgroup.
Let be a group and let . Let
be the set of left cosets of in . Then there exists a homomorphism
such that
Given that is a group, , and is the set of left cosets of in . To prove that there exists a homomorphism such that . Define an action of on by
This is well-defined because left multiplication sends a left coset to a left coset. The identity element satisfies
For and ,
Thus acts on . By the action-induced homomorphism theorem, this action gives a homomorphism
Let . Then fixes every left coset in . In particular, it fixes , so
Therefore . Thus . Hence there exists a homomorphism such that .
Let be a finite group and let be a proper subgroup of of index . If does not divide , then contains a nontrivial normal subgroup.
Given that is a finite group, is a proper subgroup of , , and does not divide . To prove that contains a nontrivial normal subgroup. Let . Then . By the extended Cayley theorem, there exists a homomorphism
such that . Since , the group has order . Also , so divides . By the first isomorphism theorem,
If possible let . Then
Thus , and hence divides . This contradicts the hypothesis. Therefore . Since kernels of homomorphisms are normal subgroups, . Hence contains a nontrivial normal subgroup.
Use this calculator for the common finite-group application of the extended Cayley theorem. Enter the order and the index . If does not divide , then the coset action cannot be faithful, so its kernel gives a nontrivial normal subgroup inside . This test does not prove that itself is normal; it detects a normal subgroup contained in .
Interactive calculator
Let be a finite group and let be a subgroup of index , where is the smallest prime dividing . Prove that .
Let be a finite group and let such that , where is the smallest prime dividing . Given that is the smallest prime divisor of . To prove that . Let . Then . The coset action gives a homomorphism
with . Since , the group has order . By the first isomorphism theorem, is isomorphic to a subgroup of . Hence
Since , we have
Thus divides . If , then it has a prime divisor . Since divides , the prime divides . By minimality of , we have . But allows no additional prime factor at least beyond the single factor already present. A contradiction. Therefore , so . Since kernels of homomorphisms are normal subgroups, .
Let be a subgroup of order and index in a finite group . Prove that .
Let be a subgroup of a finite group such that and . Given that and . To prove that . Since , we get
Let act on the set of left cosets of . This gives a homomorphism
such that . Since and does not divide , the kernel cannot be trivial. Therefore
Since and , the only subgroups of are and . Thus
Since kernels of homomorphisms are normal subgroups, .
In a coset action, the kernel is not an arbitrary subgroup. It is a normal subgroup of and it lies inside . This is why the extended Cayley theorem is so useful for proving non-simplicity: a nontrivial kernel immediately supplies a nontrivial normal subgroup.
Questions to consolidate
A permutation representation records how a single group element moves every point of the acted-upon set. Use the inputs to preview the action of an element of on by addition modulo . The output lists the induced permutation as a mapping table. Notice that only the identity element induces the identity permutation in this regular action, which is why this action is faithful.
Visual laboratory
Dynamic Sandbox
Continue learning
Learn how fixed points average over a finite group action to count the number of orbits.