Powering-invariant not implies divisibility-closed: Difference between revisions
(Created page with "{{subgroup property non-implication| stronger = powering-invariant subgroup| weaker = divisibility-invariant subgroup}} ==Statement== It is possible to have a group <mat...") |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{subgroup property non-implication| | {{subgroup property non-implication| | ||
stronger = powering-invariant subgroup| | stronger = powering-invariant subgroup| | ||
weaker = divisibility- | weaker = divisibility-closed subgroup}} | ||
==Statement== | ==Statement== | ||
It is possible to have a [[group]] <math>G</math> and a [[subgroup]] <math>H</math> | It is possible to have a [[group]] <math>G</math> and a [[subgroup]] <math>H</math> such that: | ||
# <math>H</math> is a [[powering-invariant subgroup]] of <math>G</math>: If <math>n</math> is a natural number such that every element of <math>G</math> has a unique <math>n^{th}</math> root, then every element of <math>H</math> has a unique <math>n^{th}</math> root within <math>H</math>. | |||
# <math>H</math> is ''not'' a [[divisibility-closed subgroup]] of <math>G</math>: There exists a natural number <math>n</math> such that every element of <math>G</math> has a <math>n^{th}</math> root (not necessarily unique) but not every element of <math>H</math> has a <math>n^{th}</math> root within <math>H</math>. | |||
==Related facts== | |||
* [[Center not is divisibility-closed]] | |||
==Proof== | ==Proof== | ||
| Line 11: | Line 18: | ||
===Proof idea=== | ===Proof idea=== | ||
The key fact is that any finite subgroup of a group must be powering-invariant, but it need not be divisibility- | The key fact is that any finite subgroup of a group must be powering-invariant, but it need not be divisibility-closed. We will construct an example where the subgroup is finite. | ||
===Proof details=== | ===Proof details=== | ||
For any prime number <math>p</math> | For any prime number <math>p</math>: | ||
* Let <math>G</math> be the <math>p</math>-[[quasicyclic group]]. | |||
* Let <math>H</math> be the subgroup comprising the elements of order 1 or <math>p</math>. | |||
Clearly: | |||
* <math>H</math>, being finite, is powering-invariant (in fact, both <math>G</math> and <math>H</math> are powered over precisely the set of primes other than <math>p</math>). | |||
* However, <math>H</math> is not divisibility-closed: <math>G</math> is <math>p</math>-divisible, but <math>H</math> is not. | |||
Latest revision as of 17:15, 15 February 2013
This article gives the statement and possibly, proof, of a non-implication relation between two subgroup properties. That is, it states that every subgroup satisfying the first subgroup property (i.e., powering-invariant subgroup) need not satisfy the second subgroup property (i.e., divisibility-closed subgroup)
View a complete list of subgroup property non-implications | View a complete list of subgroup property implications
Get more facts about powering-invariant subgroup|Get more facts about divisibility-closed subgroup
EXPLORE EXAMPLES YOURSELF: View examples of subgroups satisfying property powering-invariant subgroup but not divisibility-closed subgroup|View examples of subgroups satisfying property powering-invariant subgroup and divisibility-closed subgroup
Statement
It is possible to have a group and a subgroup such that:
- is a powering-invariant subgroup of : If is a natural number such that every element of has a unique root, then every element of has a unique root within .
- is not a divisibility-closed subgroup of : There exists a natural number such that every element of has a root (not necessarily unique) but not every element of has a root within .
Related facts
Proof
Proof idea
The key fact is that any finite subgroup of a group must be powering-invariant, but it need not be divisibility-closed. We will construct an example where the subgroup is finite.
Proof details
For any prime number :
- Let be the -quasicyclic group.
- Let be the subgroup comprising the elements of order 1 or .
Clearly:
- , being finite, is powering-invariant (in fact, both and are powered over precisely the set of primes other than ).
- However, is not divisibility-closed: is -divisible, but is not.