Given a finite group, does this equation involving group's order, a partition of it and centralizers' orders...
$begingroup$
Let $G$ be a finite group with $|G|=n$. In the case $Z(G)=lbrace e rbrace$, the following equation seems to hold:
begin{equation}
n(n-1)=sum_{substack{lambda_i in lambda(n-1)\ lambda_i>1}}lambda_i^2+sum_{a in G setminus lbrace e rbrace}(|C_G(a)|-1)+sum_{a in G setminus lbrace e rbrace}|C_G(a)|^2([G:C_G(a)]-1)
end{equation}
where $C_G(a)$ is the centralizer of $a$ in $G$ and $lambda(n-1)$ is a partition of the integer $n-1$.
Before anyone wastes time going through my proof's sketch, can some more trained eye than mine acknowledge at a glance whether above equation is:
- trivial (e.g. an identity);
- correct and well-known;
- clearly wrong.
group-theory number-theory
$endgroup$
add a comment |
$begingroup$
Let $G$ be a finite group with $|G|=n$. In the case $Z(G)=lbrace e rbrace$, the following equation seems to hold:
begin{equation}
n(n-1)=sum_{substack{lambda_i in lambda(n-1)\ lambda_i>1}}lambda_i^2+sum_{a in G setminus lbrace e rbrace}(|C_G(a)|-1)+sum_{a in G setminus lbrace e rbrace}|C_G(a)|^2([G:C_G(a)]-1)
end{equation}
where $C_G(a)$ is the centralizer of $a$ in $G$ and $lambda(n-1)$ is a partition of the integer $n-1$.
Before anyone wastes time going through my proof's sketch, can some more trained eye than mine acknowledge at a glance whether above equation is:
- trivial (e.g. an identity);
- correct and well-known;
- clearly wrong.
group-theory number-theory
$endgroup$
2
$begingroup$
With $G=S_3$, I am getting $42$ for the third term in the sum, which is already bigger than $n(n-1)=30$.
$endgroup$
– Derek Holt
Jan 12 at 14:27
$begingroup$
Thank you, I'll double check my proof's sketch.
$endgroup$
– Luca
Jan 12 at 14:36
1
$begingroup$
Surely that can't be true for all partitions, since different partitions should give you different results for the first term...
$endgroup$
– Arnaud D.
Jan 12 at 14:50
$begingroup$
@Arnaud D. Not really, you're right; but indeed I was (and still am) hoping such a partition to be "characteristic" of $G$ itself.
$endgroup$
– Luca
Jan 13 at 10:00
$begingroup$
@Derek Holt. Although I'm still quite confident on 1st and 2nd term, you're right: the 3rd one is completely wrong and I'm working to thoroughly revise it.
$endgroup$
– Luca
Jan 13 at 10:01
add a comment |
$begingroup$
Let $G$ be a finite group with $|G|=n$. In the case $Z(G)=lbrace e rbrace$, the following equation seems to hold:
begin{equation}
n(n-1)=sum_{substack{lambda_i in lambda(n-1)\ lambda_i>1}}lambda_i^2+sum_{a in G setminus lbrace e rbrace}(|C_G(a)|-1)+sum_{a in G setminus lbrace e rbrace}|C_G(a)|^2([G:C_G(a)]-1)
end{equation}
where $C_G(a)$ is the centralizer of $a$ in $G$ and $lambda(n-1)$ is a partition of the integer $n-1$.
Before anyone wastes time going through my proof's sketch, can some more trained eye than mine acknowledge at a glance whether above equation is:
- trivial (e.g. an identity);
- correct and well-known;
- clearly wrong.
group-theory number-theory
$endgroup$
Let $G$ be a finite group with $|G|=n$. In the case $Z(G)=lbrace e rbrace$, the following equation seems to hold:
begin{equation}
n(n-1)=sum_{substack{lambda_i in lambda(n-1)\ lambda_i>1}}lambda_i^2+sum_{a in G setminus lbrace e rbrace}(|C_G(a)|-1)+sum_{a in G setminus lbrace e rbrace}|C_G(a)|^2([G:C_G(a)]-1)
end{equation}
where $C_G(a)$ is the centralizer of $a$ in $G$ and $lambda(n-1)$ is a partition of the integer $n-1$.
Before anyone wastes time going through my proof's sketch, can some more trained eye than mine acknowledge at a glance whether above equation is:
- trivial (e.g. an identity);
- correct and well-known;
- clearly wrong.
group-theory number-theory
group-theory number-theory
asked Jan 12 at 14:07


LucaLuca
19719
19719
2
$begingroup$
With $G=S_3$, I am getting $42$ for the third term in the sum, which is already bigger than $n(n-1)=30$.
$endgroup$
– Derek Holt
Jan 12 at 14:27
$begingroup$
Thank you, I'll double check my proof's sketch.
$endgroup$
– Luca
Jan 12 at 14:36
1
$begingroup$
Surely that can't be true for all partitions, since different partitions should give you different results for the first term...
$endgroup$
– Arnaud D.
Jan 12 at 14:50
$begingroup$
@Arnaud D. Not really, you're right; but indeed I was (and still am) hoping such a partition to be "characteristic" of $G$ itself.
$endgroup$
– Luca
Jan 13 at 10:00
$begingroup$
@Derek Holt. Although I'm still quite confident on 1st and 2nd term, you're right: the 3rd one is completely wrong and I'm working to thoroughly revise it.
$endgroup$
– Luca
Jan 13 at 10:01
add a comment |
2
$begingroup$
With $G=S_3$, I am getting $42$ for the third term in the sum, which is already bigger than $n(n-1)=30$.
$endgroup$
– Derek Holt
Jan 12 at 14:27
$begingroup$
Thank you, I'll double check my proof's sketch.
$endgroup$
– Luca
Jan 12 at 14:36
1
$begingroup$
Surely that can't be true for all partitions, since different partitions should give you different results for the first term...
$endgroup$
– Arnaud D.
Jan 12 at 14:50
$begingroup$
@Arnaud D. Not really, you're right; but indeed I was (and still am) hoping such a partition to be "characteristic" of $G$ itself.
$endgroup$
– Luca
Jan 13 at 10:00
$begingroup$
@Derek Holt. Although I'm still quite confident on 1st and 2nd term, you're right: the 3rd one is completely wrong and I'm working to thoroughly revise it.
$endgroup$
– Luca
Jan 13 at 10:01
2
2
$begingroup$
With $G=S_3$, I am getting $42$ for the third term in the sum, which is already bigger than $n(n-1)=30$.
$endgroup$
– Derek Holt
Jan 12 at 14:27
$begingroup$
With $G=S_3$, I am getting $42$ for the third term in the sum, which is already bigger than $n(n-1)=30$.
$endgroup$
– Derek Holt
Jan 12 at 14:27
$begingroup$
Thank you, I'll double check my proof's sketch.
$endgroup$
– Luca
Jan 12 at 14:36
$begingroup$
Thank you, I'll double check my proof's sketch.
$endgroup$
– Luca
Jan 12 at 14:36
1
1
$begingroup$
Surely that can't be true for all partitions, since different partitions should give you different results for the first term...
$endgroup$
– Arnaud D.
Jan 12 at 14:50
$begingroup$
Surely that can't be true for all partitions, since different partitions should give you different results for the first term...
$endgroup$
– Arnaud D.
Jan 12 at 14:50
$begingroup$
@Arnaud D. Not really, you're right; but indeed I was (and still am) hoping such a partition to be "characteristic" of $G$ itself.
$endgroup$
– Luca
Jan 13 at 10:00
$begingroup$
@Arnaud D. Not really, you're right; but indeed I was (and still am) hoping such a partition to be "characteristic" of $G$ itself.
$endgroup$
– Luca
Jan 13 at 10:00
$begingroup$
@Derek Holt. Although I'm still quite confident on 1st and 2nd term, you're right: the 3rd one is completely wrong and I'm working to thoroughly revise it.
$endgroup$
– Luca
Jan 13 at 10:01
$begingroup$
@Derek Holt. Although I'm still quite confident on 1st and 2nd term, you're right: the 3rd one is completely wrong and I'm working to thoroughly revise it.
$endgroup$
– Luca
Jan 13 at 10:01
add a comment |
0
active
oldest
votes
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%2f3070935%2fgiven-a-finite-group-does-this-equation-involving-groups-order-a-partition-of%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3070935%2fgiven-a-finite-group-does-this-equation-involving-groups-order-a-partition-of%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
2
$begingroup$
With $G=S_3$, I am getting $42$ for the third term in the sum, which is already bigger than $n(n-1)=30$.
$endgroup$
– Derek Holt
Jan 12 at 14:27
$begingroup$
Thank you, I'll double check my proof's sketch.
$endgroup$
– Luca
Jan 12 at 14:36
1
$begingroup$
Surely that can't be true for all partitions, since different partitions should give you different results for the first term...
$endgroup$
– Arnaud D.
Jan 12 at 14:50
$begingroup$
@Arnaud D. Not really, you're right; but indeed I was (and still am) hoping such a partition to be "characteristic" of $G$ itself.
$endgroup$
– Luca
Jan 13 at 10:00
$begingroup$
@Derek Holt. Although I'm still quite confident on 1st and 2nd term, you're right: the 3rd one is completely wrong and I'm working to thoroughly revise it.
$endgroup$
– Luca
Jan 13 at 10:01