Permuting subgroups: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
{{subgroup symmrel}} | {{subgroup symmrel}} | ||
<section begin="beginner"/> | |||
==Definition== | ==Definition== | ||
| Line 15: | Line 15: | ||
{{proofat|[[Equivalence of definitions of permuting subgroups]]}} | {{proofat|[[Equivalence of definitions of permuting subgroups]]}} | ||
<section end="beginner"/> | |||
==Relation with other relations== | ==Relation with other relations== | ||
Latest revision as of 23:06, 15 March 2009
This article defines a symmetric relation on the collection of subgroups inside the same group.
Definition
Definition with symbols
Two subgroups and of a group are termed permuting subgroups if the following equivalent conditions hold:
- (the product of subgroups) is a subgroup
- Given elements in and in , there exist elements in and in such that . In other words, .
- . In other words, the commutator of and is contained in their product.
Equivalence of definitions
For full proof, refer: Equivalence of definitions of permuting subgroups
Relation with other relations
Stronger relations
- One is a normalizing subgroup for the other
- Mutually permuting subgroups
- Totally permuting subgroups
- Conjugate-permuting subgroups