How to find normal subgroups from a character table?

Multi tool use
$begingroup$
I know that normal subgroups are the union of some conjugacy classes
Conjugacy classes are represented by the the columns in a matrix
How could we use character values in the table to determine normal subgroups?
abstract-algebra representation-theory normal-subgroups characters
$endgroup$
add a comment |
$begingroup$
I know that normal subgroups are the union of some conjugacy classes
Conjugacy classes are represented by the the columns in a matrix
How could we use character values in the table to determine normal subgroups?
abstract-algebra representation-theory normal-subgroups characters
$endgroup$
add a comment |
$begingroup$
I know that normal subgroups are the union of some conjugacy classes
Conjugacy classes are represented by the the columns in a matrix
How could we use character values in the table to determine normal subgroups?
abstract-algebra representation-theory normal-subgroups characters
$endgroup$
I know that normal subgroups are the union of some conjugacy classes
Conjugacy classes are represented by the the columns in a matrix
How could we use character values in the table to determine normal subgroups?
abstract-algebra representation-theory normal-subgroups characters
abstract-algebra representation-theory normal-subgroups characters
asked May 17 '16 at 6:57
thinkerthinker
632518
632518
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is quite well-known and can be found in books on representation theory. Here is an explanation, which is far from being original.
First fact : $N$ is a normal subgroup of a finite group $G$ if and only if there exists a character $chi$ of $G$ such that $N = ker chi := {g in G | chi(g)=chi(1)}$. Indeed, if $N$ is normal then $G$ acts on the complex algebra $mathbf{C}[G/N] = displaystyle bigoplus_{gN in G/N} mathbf{C} e_{gN}$ by $h cdot e_{gN}=e_{hgN}$. This is a linear representation of $G$ (coming from the regular representation of $G/N$). Let $chi$ be its character. It is easy to check that $chi(h) = 0$ if $h notin N$ and $chi(h) = mathrm{Card}(G/N) = chi(1)$ if $h in N$. So $N = ker chi$. Conversely, using the fact that a character is constant on every conjugacy class, any subgroup of the form $ker chi$ is normal.
Second fact : if $rho : G to mathrm{GL}(V)$ is the representation associated to the character $chi$ then $ker rho = ker chi$. The inclusion $subseteq$ is trivial. Conversely, assume $chi(g) = chi(1) = dim V$. Since the eigenvalues of $rho(g)$ are roots of $1$ and $chi(g)$ is the sum of the eigenvalues (with multiplicities), these eigenvalues are forced to be all equal to $1$. So $rho(g) = mathrm{id}_V$, that is to say $g in ker rho$.
Third fact : if $chi = displaystyle sum_{i=1}^r n_i chi_i$ (where the $chi_i$ are pairwise distinct irreducible characters and $n_i geq 1$) then $ker chi = displaystyle bigcap_{i=1}^r ker chi_i$. Writing $rho, rho_1,ldots,rho_r$ for the corresponding representations, $rho$ is the direct sum of copies of $rho_1,ldots,rho_r$ so $ker rho = displaystyle bigcap_{i=1}^r ker rho_i$. Then apply the second fact.
Conclusion : with your character table, you can read the subgroups $N_i:=ker chi_i$. Then the normal subgroups of $G$ are exactly the intersections of some $N_i$.
$endgroup$
$begingroup$
Good summary! I've always had trouble retaining this, even after a couple readings of texts. This makes it easier.
$endgroup$
– rschwieb
May 17 '16 at 16:29
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%2f1788618%2fhow-to-find-normal-subgroups-from-a-character-table%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$
This is quite well-known and can be found in books on representation theory. Here is an explanation, which is far from being original.
First fact : $N$ is a normal subgroup of a finite group $G$ if and only if there exists a character $chi$ of $G$ such that $N = ker chi := {g in G | chi(g)=chi(1)}$. Indeed, if $N$ is normal then $G$ acts on the complex algebra $mathbf{C}[G/N] = displaystyle bigoplus_{gN in G/N} mathbf{C} e_{gN}$ by $h cdot e_{gN}=e_{hgN}$. This is a linear representation of $G$ (coming from the regular representation of $G/N$). Let $chi$ be its character. It is easy to check that $chi(h) = 0$ if $h notin N$ and $chi(h) = mathrm{Card}(G/N) = chi(1)$ if $h in N$. So $N = ker chi$. Conversely, using the fact that a character is constant on every conjugacy class, any subgroup of the form $ker chi$ is normal.
Second fact : if $rho : G to mathrm{GL}(V)$ is the representation associated to the character $chi$ then $ker rho = ker chi$. The inclusion $subseteq$ is trivial. Conversely, assume $chi(g) = chi(1) = dim V$. Since the eigenvalues of $rho(g)$ are roots of $1$ and $chi(g)$ is the sum of the eigenvalues (with multiplicities), these eigenvalues are forced to be all equal to $1$. So $rho(g) = mathrm{id}_V$, that is to say $g in ker rho$.
Third fact : if $chi = displaystyle sum_{i=1}^r n_i chi_i$ (where the $chi_i$ are pairwise distinct irreducible characters and $n_i geq 1$) then $ker chi = displaystyle bigcap_{i=1}^r ker chi_i$. Writing $rho, rho_1,ldots,rho_r$ for the corresponding representations, $rho$ is the direct sum of copies of $rho_1,ldots,rho_r$ so $ker rho = displaystyle bigcap_{i=1}^r ker rho_i$. Then apply the second fact.
Conclusion : with your character table, you can read the subgroups $N_i:=ker chi_i$. Then the normal subgroups of $G$ are exactly the intersections of some $N_i$.
$endgroup$
$begingroup$
Good summary! I've always had trouble retaining this, even after a couple readings of texts. This makes it easier.
$endgroup$
– rschwieb
May 17 '16 at 16:29
add a comment |
$begingroup$
This is quite well-known and can be found in books on representation theory. Here is an explanation, which is far from being original.
First fact : $N$ is a normal subgroup of a finite group $G$ if and only if there exists a character $chi$ of $G$ such that $N = ker chi := {g in G | chi(g)=chi(1)}$. Indeed, if $N$ is normal then $G$ acts on the complex algebra $mathbf{C}[G/N] = displaystyle bigoplus_{gN in G/N} mathbf{C} e_{gN}$ by $h cdot e_{gN}=e_{hgN}$. This is a linear representation of $G$ (coming from the regular representation of $G/N$). Let $chi$ be its character. It is easy to check that $chi(h) = 0$ if $h notin N$ and $chi(h) = mathrm{Card}(G/N) = chi(1)$ if $h in N$. So $N = ker chi$. Conversely, using the fact that a character is constant on every conjugacy class, any subgroup of the form $ker chi$ is normal.
Second fact : if $rho : G to mathrm{GL}(V)$ is the representation associated to the character $chi$ then $ker rho = ker chi$. The inclusion $subseteq$ is trivial. Conversely, assume $chi(g) = chi(1) = dim V$. Since the eigenvalues of $rho(g)$ are roots of $1$ and $chi(g)$ is the sum of the eigenvalues (with multiplicities), these eigenvalues are forced to be all equal to $1$. So $rho(g) = mathrm{id}_V$, that is to say $g in ker rho$.
Third fact : if $chi = displaystyle sum_{i=1}^r n_i chi_i$ (where the $chi_i$ are pairwise distinct irreducible characters and $n_i geq 1$) then $ker chi = displaystyle bigcap_{i=1}^r ker chi_i$. Writing $rho, rho_1,ldots,rho_r$ for the corresponding representations, $rho$ is the direct sum of copies of $rho_1,ldots,rho_r$ so $ker rho = displaystyle bigcap_{i=1}^r ker rho_i$. Then apply the second fact.
Conclusion : with your character table, you can read the subgroups $N_i:=ker chi_i$. Then the normal subgroups of $G$ are exactly the intersections of some $N_i$.
$endgroup$
$begingroup$
Good summary! I've always had trouble retaining this, even after a couple readings of texts. This makes it easier.
$endgroup$
– rschwieb
May 17 '16 at 16:29
add a comment |
$begingroup$
This is quite well-known and can be found in books on representation theory. Here is an explanation, which is far from being original.
First fact : $N$ is a normal subgroup of a finite group $G$ if and only if there exists a character $chi$ of $G$ such that $N = ker chi := {g in G | chi(g)=chi(1)}$. Indeed, if $N$ is normal then $G$ acts on the complex algebra $mathbf{C}[G/N] = displaystyle bigoplus_{gN in G/N} mathbf{C} e_{gN}$ by $h cdot e_{gN}=e_{hgN}$. This is a linear representation of $G$ (coming from the regular representation of $G/N$). Let $chi$ be its character. It is easy to check that $chi(h) = 0$ if $h notin N$ and $chi(h) = mathrm{Card}(G/N) = chi(1)$ if $h in N$. So $N = ker chi$. Conversely, using the fact that a character is constant on every conjugacy class, any subgroup of the form $ker chi$ is normal.
Second fact : if $rho : G to mathrm{GL}(V)$ is the representation associated to the character $chi$ then $ker rho = ker chi$. The inclusion $subseteq$ is trivial. Conversely, assume $chi(g) = chi(1) = dim V$. Since the eigenvalues of $rho(g)$ are roots of $1$ and $chi(g)$ is the sum of the eigenvalues (with multiplicities), these eigenvalues are forced to be all equal to $1$. So $rho(g) = mathrm{id}_V$, that is to say $g in ker rho$.
Third fact : if $chi = displaystyle sum_{i=1}^r n_i chi_i$ (where the $chi_i$ are pairwise distinct irreducible characters and $n_i geq 1$) then $ker chi = displaystyle bigcap_{i=1}^r ker chi_i$. Writing $rho, rho_1,ldots,rho_r$ for the corresponding representations, $rho$ is the direct sum of copies of $rho_1,ldots,rho_r$ so $ker rho = displaystyle bigcap_{i=1}^r ker rho_i$. Then apply the second fact.
Conclusion : with your character table, you can read the subgroups $N_i:=ker chi_i$. Then the normal subgroups of $G$ are exactly the intersections of some $N_i$.
$endgroup$
This is quite well-known and can be found in books on representation theory. Here is an explanation, which is far from being original.
First fact : $N$ is a normal subgroup of a finite group $G$ if and only if there exists a character $chi$ of $G$ such that $N = ker chi := {g in G | chi(g)=chi(1)}$. Indeed, if $N$ is normal then $G$ acts on the complex algebra $mathbf{C}[G/N] = displaystyle bigoplus_{gN in G/N} mathbf{C} e_{gN}$ by $h cdot e_{gN}=e_{hgN}$. This is a linear representation of $G$ (coming from the regular representation of $G/N$). Let $chi$ be its character. It is easy to check that $chi(h) = 0$ if $h notin N$ and $chi(h) = mathrm{Card}(G/N) = chi(1)$ if $h in N$. So $N = ker chi$. Conversely, using the fact that a character is constant on every conjugacy class, any subgroup of the form $ker chi$ is normal.
Second fact : if $rho : G to mathrm{GL}(V)$ is the representation associated to the character $chi$ then $ker rho = ker chi$. The inclusion $subseteq$ is trivial. Conversely, assume $chi(g) = chi(1) = dim V$. Since the eigenvalues of $rho(g)$ are roots of $1$ and $chi(g)$ is the sum of the eigenvalues (with multiplicities), these eigenvalues are forced to be all equal to $1$. So $rho(g) = mathrm{id}_V$, that is to say $g in ker rho$.
Third fact : if $chi = displaystyle sum_{i=1}^r n_i chi_i$ (where the $chi_i$ are pairwise distinct irreducible characters and $n_i geq 1$) then $ker chi = displaystyle bigcap_{i=1}^r ker chi_i$. Writing $rho, rho_1,ldots,rho_r$ for the corresponding representations, $rho$ is the direct sum of copies of $rho_1,ldots,rho_r$ so $ker rho = displaystyle bigcap_{i=1}^r ker rho_i$. Then apply the second fact.
Conclusion : with your character table, you can read the subgroups $N_i:=ker chi_i$. Then the normal subgroups of $G$ are exactly the intersections of some $N_i$.
edited Jan 10 at 6:59
dcw
246
246
answered May 17 '16 at 13:59
BrLBrL
996159
996159
$begingroup$
Good summary! I've always had trouble retaining this, even after a couple readings of texts. This makes it easier.
$endgroup$
– rschwieb
May 17 '16 at 16:29
add a comment |
$begingroup$
Good summary! I've always had trouble retaining this, even after a couple readings of texts. This makes it easier.
$endgroup$
– rschwieb
May 17 '16 at 16:29
$begingroup$
Good summary! I've always had trouble retaining this, even after a couple readings of texts. This makes it easier.
$endgroup$
– rschwieb
May 17 '16 at 16:29
$begingroup$
Good summary! I've always had trouble retaining this, even after a couple readings of texts. This makes it easier.
$endgroup$
– rschwieb
May 17 '16 at 16:29
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%2f1788618%2fhow-to-find-normal-subgroups-from-a-character-table%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
NzLocws z0 HCmrOWLh 6atds MxPm 06VxF6zTK5ZgUMlvm,jMRdkFA YB6uciGnZh,PjJAy16Rtsea