Finding some explicit formula for $(ab)^n$ in any $a,b$ in a finite $p$-group.
$begingroup$
If $G$ is a finite $p-$group, let $a$ and $b$ any two elements from $G$.
Is there any formula for $(ab)^n$ involving $a^nb^n$ for any natural number $n$? That is, some formula like $(ab)^n = a^nb^nf(a,b)$ for some function of $a$ and $b$.
Please not those "modulo" some subgroups formulas! Like $$
(ab)^n equiv a^nb^n pmod{H},
$$
where $H leq G$
Thanks in advance.
abstract-algebra group-theory finite-groups p-groups
edited Dec 21 '18 at 17:56
Shaun
9,182113684
asked Dec 18 '18 at 9:27
A.MessabA.Messab
527
$endgroup$
|
show 8 more comments
$begingroup$
If $G$ is a finite $p-$group, let $a$ and $b$ any two elements from $G$.
Is there any formula for $(ab)^n$ involving $a^nb^n$ for any natural number $n$? That is, some formula like $(ab)^n = a^nb^nf(a,b)$ for some function of $a$ and $b$.
Please not those "modulo" some subgroups formulas! Like $$
(ab)^n equiv a^nb^n pmod{H},
$$
where $H leq G$
Thanks in advance.
abstract-algebra group-theory finite-groups p-groups
edited Dec 21 '18 at 17:56
Shaun
9,182113684
asked Dec 18 '18 at 9:27
A.MessabA.Messab
527
$endgroup$
1
$begingroup$
do you mean something like $(ab)^n=a^nb^n$ ?
$endgroup$
– Chinnapparaj R
Dec 18 '18 at 9:29
1
$begingroup$
I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
$endgroup$
– A.Messab
Dec 18 '18 at 10:09
3
$begingroup$
@A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
$endgroup$
– user1729
Dec 18 '18 at 11:48
2
$begingroup$
@user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
$endgroup$
– Tobias Kildetoft
Dec 18 '18 at 11:57
2
$begingroup$
@hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
$endgroup$
– Derek Holt
Dec 21 '18 at 19:41
|
show 8 more comments
$begingroup$
If $G$ is a finite $p-$group, let $a$ and $b$ any two elements from $G$.
Is there any formula for $(ab)^n$ involving $a^nb^n$ for any natural number $n$? That is, some formula like $(ab)^n = a^nb^nf(a,b)$ for some function of $a$ and $b$.
Please not those "modulo" some subgroups formulas! Like $$
(ab)^n equiv a^nb^n pmod{H},
$$
where $H leq G$
Thanks in advance.
abstract-algebra group-theory finite-groups p-groups
edited Dec 21 '18 at 17:56
Shaun
9,182113684
asked Dec 18 '18 at 9:27
A.MessabA.Messab
527
$endgroup$
If $G$ is a finite $p-$group, let $a$ and $b$ any two elements from $G$.
Is there any formula for $(ab)^n$ involving $a^nb^n$ for any natural number $n$? That is, some formula like $(ab)^n = a^nb^nf(a,b)$ for some function of $a$ and $b$.
Please not those "modulo" some subgroups formulas! Like $$
(ab)^n equiv a^nb^n pmod{H},
$$
where $H leq G$
Thanks in advance.
abstract-algebra group-theory finite-groups p-groups
abstract-algebra group-theory finite-groups p-groups
edited Dec 21 '18 at 17:56
Shaun
9,182113684
asked Dec 18 '18 at 9:27
A.MessabA.Messab
527
edited Dec 21 '18 at 17:56
Shaun
9,182113684
asked Dec 18 '18 at 9:27
A.MessabA.Messab
527
edited Dec 21 '18 at 17:56
Shaun
9,182113684
edited Dec 21 '18 at 17:56
Shaun
9,182113684
edited Dec 21 '18 at 17:56
Shaun
9,182113684
9,182113684
asked Dec 18 '18 at 9:27
A.MessabA.Messab
527
asked Dec 18 '18 at 9:27
A.MessabA.Messab
527
asked Dec 18 '18 at 9:27
A.MessabA.Messab
527
527
1
$begingroup$
do you mean something like $(ab)^n=a^nb^n$ ?
$endgroup$
– Chinnapparaj R
Dec 18 '18 at 9:29
1
$begingroup$
I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
$endgroup$
– A.Messab
Dec 18 '18 at 10:09
3
$begingroup$
@A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
$endgroup$
– user1729
Dec 18 '18 at 11:48
2
$begingroup$
@user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
$endgroup$
– Tobias Kildetoft
Dec 18 '18 at 11:57
2
$begingroup$
@hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
$endgroup$
– Derek Holt
Dec 21 '18 at 19:41
|
show 8 more comments
1
$begingroup$
do you mean something like $(ab)^n=a^nb^n$ ?
$endgroup$
– Chinnapparaj R
Dec 18 '18 at 9:29
1
$begingroup$
I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
$endgroup$
– A.Messab
Dec 18 '18 at 10:09
3
$begingroup$
@A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
$endgroup$
– user1729
Dec 18 '18 at 11:48
2
$begingroup$
@user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
$endgroup$
– Tobias Kildetoft
Dec 18 '18 at 11:57
2
$begingroup$
@hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
$endgroup$
– Derek Holt
Dec 21 '18 at 19:41
1
1
$begingroup$
do you mean something like $(ab)^n=a^nb^n$ ?
$endgroup$
– Chinnapparaj R
Dec 18 '18 at 9:29
$begingroup$
do you mean something like $(ab)^n=a^nb^n$ ?
$endgroup$
– Chinnapparaj R
Dec 18 '18 at 9:29
1
1
$begingroup$
I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
$endgroup$
– A.Messab
Dec 18 '18 at 10:09
$begingroup$
I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
$endgroup$
– A.Messab
Dec 18 '18 at 10:09
3
3
$begingroup$
@A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
$endgroup$
– user1729
Dec 18 '18 at 11:48
$begingroup$
@A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
$endgroup$
– user1729
Dec 18 '18 at 11:48
2
2
$begingroup$
@user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
$endgroup$
– Tobias Kildetoft
Dec 18 '18 at 11:57
$begingroup$
@user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
$endgroup$
– Tobias Kildetoft
Dec 18 '18 at 11:57
2
2
$begingroup$
@hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
$endgroup$
– Derek Holt
Dec 21 '18 at 19:41
$begingroup$
@hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
$endgroup$
– Derek Holt
Dec 21 '18 at 19:41
|
show 8 more comments
1 Answer
1
active
oldest
votes
$begingroup$
There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.
Some example formuals are:
If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.
If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).
You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).
*or formulae, if you want to be correct but also sound slightly pretentious :-)
answered Dec 24 '18 at 10:54
user1729user1729
17.1k64193
$endgroup$
$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3044944%2ffinding-some-explicit-formula-for-abn-in-any-a-b-in-a-finite-p-group%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.
Some example formuals are:
If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.
If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).
You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).
*or formulae, if you want to be correct but also sound slightly pretentious :-)
answered Dec 24 '18 at 10:54
user1729user1729
17.1k64193
$endgroup$
$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06
add a comment |
$begingroup$
There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.
Some example formuals are:
If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.
If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).
You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).
*or formulae, if you want to be correct but also sound slightly pretentious :-)
answered Dec 24 '18 at 10:54
user1729user1729
17.1k64193
$endgroup$
$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06
add a comment |
$begingroup$
There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.
Some example formuals are:
If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.
If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).
You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).
*or formulae, if you want to be correct but also sound slightly pretentious :-)
answered Dec 24 '18 at 10:54
user1729user1729
17.1k64193
$endgroup$
There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.
Some example formuals are:
If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.
If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).
You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).
*or formulae, if you want to be correct but also sound slightly pretentious :-)
answered Dec 24 '18 at 10:54
user1729user1729
17.1k64193
answered Dec 24 '18 at 10:54
user1729user1729
17.1k64193
answered Dec 24 '18 at 10:54
user1729user1729
17.1k64193
answered Dec 24 '18 at 10:54
user1729user1729
17.1k64193
17.1k64193
$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06
add a comment |
$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06
$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06
$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3044944%2ffinding-some-explicit-formula-for-abn-in-any-a-b-in-a-finite-p-group%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
do you mean something like $(ab)^n=a^nb^n$ ?
$endgroup$
– Chinnapparaj R
Dec 18 '18 at 9:29
1
$begingroup$
I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
$endgroup$
– A.Messab
Dec 18 '18 at 10:09
3
$begingroup$
@A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
$endgroup$
– user1729
Dec 18 '18 at 11:48
2
$begingroup$
@user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
$endgroup$
– Tobias Kildetoft
Dec 18 '18 at 11:57
2
$begingroup$
@hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
$endgroup$
– Derek Holt
Dec 21 '18 at 19:41