Proof that the conjugacy class association scheme is an association schemeIf size of each conjugacy class is atmost $2$ then $G'leq Z(G)$On conjugacy class size of finite groups.Conjugacy class of $G$ splitting as Conjugacy class of $Hunlhd G$What is a conjugacy class of reflection?Are Aut-Equivalent classes the same as Conjugacy Classes?Abstract Algebra: Conjugates, Conjugacy Class, and Class EquationConjugacy class trivial proofNormal Group and Conjugacy ClassPartition of a conjugacy class to conjugacy classes of a normal subgroupShow that G has a conjugacy class of size 3.
How much RAM could one put in a typical 80386 setup?
Which country benefited the most from UN Security Council vetoes?
RSA: Danger of using p to create q
How old can references or sources in a thesis be?
What's that red-plus icon near a text?
Is it possible to do 50 km distance without any previous training?
Why can't I see bouncing of a switch on an oscilloscope?
Replacing matching entries in one column of a file by another column from a different file
Is it possible to run Internet Explorer on OS X El Capitan?
When a company launches a new product do they "come out" with a new product or do they "come up" with a new product?
Can I ask the recruiters in my resume to put the reason why I am rejected?
Definite integral giving negative value as a result?
Could an aircraft fly or hover using only jets of compressed air?
Find the result of this dual key cipher
dbcc cleantable batch size explanation
What does "Puller Prush Person" mean?
How to format long polynomial?
How can bays and straits be determined in a procedurally generated map?
Do I have a twin with permutated remainders?
How to draw a waving flag in TikZ
Why is consensus so controversial in Britain?
How is the claim "I am in New York only if I am in America" the same as "If I am in New York, then I am in America?
Convert two switches to a dual stack, and add outlet - possible here?
Perform and show arithmetic with LuaLaTeX
Proof that the conjugacy class association scheme is an association scheme
If size of each conjugacy class is atmost $2$ then $G'leq Z(G)$On conjugacy class size of finite groups.Conjugacy class of $G$ splitting as Conjugacy class of $Hunlhd G$What is a conjugacy class of reflection?Are Aut-Equivalent classes the same as Conjugacy Classes?Abstract Algebra: Conjugates, Conjugacy Class, and Class EquationConjugacy class trivial proofNormal Group and Conjugacy ClassPartition of a conjugacy class to conjugacy classes of a normal subgroupShow that G has a conjugacy class of size 3.
$begingroup$
I was looking at the conjugacy class association scheme (where, given some group $G$, each conjugacy class $C_i$ gets a relation $R_i$, where $R_i=xy^-1in C_i$), and trying to show that it's an association scheme.
Defining a set $S_ij^k(x,y)=(x,g)in R_i,(g,y)in R_j$, one needs to show that $vert S_ij^k(x,y)vert=vert S_ij^k(z,w)vert$ for all pairs $(x,y),(z,w)in R_k$.
The approach that I've seen is that, for any $hin G$, $(xh,yh)in R_k$, so that if $g$ is such that $(x,g)in R_i,(g,y)in R_j$, then $(xh,gh)in R_i,(gh,yh)in R_j$. This gives a bijection between $S_ij^k(x,y)$ and $S_ij^k(xh,yh)$, so for all such pairs in $R_k$, the cardinality of $S_ij^k$ is the same. But if the size of the conjugacy class is more than one, there will definitely be some $y'neq y$ such that $(x,y')in R_k$, and then there is no $h$ such that $(xh,yh)=(x,y')$. So how can I show that $vert S_ij^k(x,y)vert=vert S_ij^k(x,y')vert$?
group-theory combinatorial-designs association-schemes
$endgroup$
add a comment |
$begingroup$
I was looking at the conjugacy class association scheme (where, given some group $G$, each conjugacy class $C_i$ gets a relation $R_i$, where $R_i=xy^-1in C_i$), and trying to show that it's an association scheme.
Defining a set $S_ij^k(x,y)=(x,g)in R_i,(g,y)in R_j$, one needs to show that $vert S_ij^k(x,y)vert=vert S_ij^k(z,w)vert$ for all pairs $(x,y),(z,w)in R_k$.
The approach that I've seen is that, for any $hin G$, $(xh,yh)in R_k$, so that if $g$ is such that $(x,g)in R_i,(g,y)in R_j$, then $(xh,gh)in R_i,(gh,yh)in R_j$. This gives a bijection between $S_ij^k(x,y)$ and $S_ij^k(xh,yh)$, so for all such pairs in $R_k$, the cardinality of $S_ij^k$ is the same. But if the size of the conjugacy class is more than one, there will definitely be some $y'neq y$ such that $(x,y')in R_k$, and then there is no $h$ such that $(xh,yh)=(x,y')$. So how can I show that $vert S_ij^k(x,y)vert=vert S_ij^k(x,y')vert$?
group-theory combinatorial-designs association-schemes
$endgroup$
add a comment |
$begingroup$
I was looking at the conjugacy class association scheme (where, given some group $G$, each conjugacy class $C_i$ gets a relation $R_i$, where $R_i=xy^-1in C_i$), and trying to show that it's an association scheme.
Defining a set $S_ij^k(x,y)=(x,g)in R_i,(g,y)in R_j$, one needs to show that $vert S_ij^k(x,y)vert=vert S_ij^k(z,w)vert$ for all pairs $(x,y),(z,w)in R_k$.
The approach that I've seen is that, for any $hin G$, $(xh,yh)in R_k$, so that if $g$ is such that $(x,g)in R_i,(g,y)in R_j$, then $(xh,gh)in R_i,(gh,yh)in R_j$. This gives a bijection between $S_ij^k(x,y)$ and $S_ij^k(xh,yh)$, so for all such pairs in $R_k$, the cardinality of $S_ij^k$ is the same. But if the size of the conjugacy class is more than one, there will definitely be some $y'neq y$ such that $(x,y')in R_k$, and then there is no $h$ such that $(xh,yh)=(x,y')$. So how can I show that $vert S_ij^k(x,y)vert=vert S_ij^k(x,y')vert$?
group-theory combinatorial-designs association-schemes
$endgroup$
I was looking at the conjugacy class association scheme (where, given some group $G$, each conjugacy class $C_i$ gets a relation $R_i$, where $R_i=xy^-1in C_i$), and trying to show that it's an association scheme.
Defining a set $S_ij^k(x,y)=(x,g)in R_i,(g,y)in R_j$, one needs to show that $vert S_ij^k(x,y)vert=vert S_ij^k(z,w)vert$ for all pairs $(x,y),(z,w)in R_k$.
The approach that I've seen is that, for any $hin G$, $(xh,yh)in R_k$, so that if $g$ is such that $(x,g)in R_i,(g,y)in R_j$, then $(xh,gh)in R_i,(gh,yh)in R_j$. This gives a bijection between $S_ij^k(x,y)$ and $S_ij^k(xh,yh)$, so for all such pairs in $R_k$, the cardinality of $S_ij^k$ is the same. But if the size of the conjugacy class is more than one, there will definitely be some $y'neq y$ such that $(x,y')in R_k$, and then there is no $h$ such that $(xh,yh)=(x,y')$. So how can I show that $vert S_ij^k(x,y)vert=vert S_ij^k(x,y')vert$?
group-theory combinatorial-designs association-schemes
group-theory combinatorial-designs association-schemes
edited Mar 29 at 11:38
azimut
16.5k1052101
16.5k1052101
asked Aug 11 '16 at 18:09
Sam JaquesSam Jaques
875311
875311
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Here's what I came up with: suppose $(x,y)$ and $(x,y')$ are in $R_k$. That means there is some $gin G$ such that $xy^-1=gxy'^-1g^-1$, since they're in the same conjugacy class. Then the function $f:S_ij^k(x,y)rightarrow S_ij^k(x,y')$ defined by $f(a)=g^-1ay^-1gy'$ gets the job done. First, it's injective by basic group multiplication properties. Next, let $ain S_ij^k(x,y)$ (thus $xa^-1in C_i$ and $ay^-1in C_j$) and we have that (using $sim$ to represent equivalence of conjugacy classes):
$$xf(a)^-1=xy'^-1g^-1ya^-1gsim gxy'^-1g^-1ya^-1=xy^-1ya^-1=xz^-1in C_i$$
$$f(a)y'^-1=g^-1ay^-1gy'y'^-1=g^-1ay^-1gsim ay^-1in C_j$$
Thus $f(a)in S_ij^k(x,y')$, as it should be, so for any pairs $(x,y),(x,y')in R_k$, $vert S_ij^k(x,y)vertleq vert S_ij^k(x,y')vert$, and so applying it to all pairs gives that $vert S_ij^k(x,y)vert=S_ij^k(x,y')vert$.
Thus, given an arbitrary pair $(x,y),(x',y')in R_k$, there is some $z$ such that $x=zx'$, and then from the question it's clear that $vert S_ij^k(x,y)vert=vert S_ij^k(zx,zy)vert=vert S_ij^k(x',zy)vert$. From what I just showed above, $vert S_ij^k(x',zy)vert=vert S_ij^k(x',y')vert$, so $vert S_ij^k(x,y)vert=vert S_ij^k(x',y')vert$, and thus the conjugacy class scheme is an association scheme.
$endgroup$
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%2f1889374%2fproof-that-the-conjugacy-class-association-scheme-is-an-association-scheme%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$
Here's what I came up with: suppose $(x,y)$ and $(x,y')$ are in $R_k$. That means there is some $gin G$ such that $xy^-1=gxy'^-1g^-1$, since they're in the same conjugacy class. Then the function $f:S_ij^k(x,y)rightarrow S_ij^k(x,y')$ defined by $f(a)=g^-1ay^-1gy'$ gets the job done. First, it's injective by basic group multiplication properties. Next, let $ain S_ij^k(x,y)$ (thus $xa^-1in C_i$ and $ay^-1in C_j$) and we have that (using $sim$ to represent equivalence of conjugacy classes):
$$xf(a)^-1=xy'^-1g^-1ya^-1gsim gxy'^-1g^-1ya^-1=xy^-1ya^-1=xz^-1in C_i$$
$$f(a)y'^-1=g^-1ay^-1gy'y'^-1=g^-1ay^-1gsim ay^-1in C_j$$
Thus $f(a)in S_ij^k(x,y')$, as it should be, so for any pairs $(x,y),(x,y')in R_k$, $vert S_ij^k(x,y)vertleq vert S_ij^k(x,y')vert$, and so applying it to all pairs gives that $vert S_ij^k(x,y)vert=S_ij^k(x,y')vert$.
Thus, given an arbitrary pair $(x,y),(x',y')in R_k$, there is some $z$ such that $x=zx'$, and then from the question it's clear that $vert S_ij^k(x,y)vert=vert S_ij^k(zx,zy)vert=vert S_ij^k(x',zy)vert$. From what I just showed above, $vert S_ij^k(x',zy)vert=vert S_ij^k(x',y')vert$, so $vert S_ij^k(x,y)vert=vert S_ij^k(x',y')vert$, and thus the conjugacy class scheme is an association scheme.
$endgroup$
add a comment |
$begingroup$
Here's what I came up with: suppose $(x,y)$ and $(x,y')$ are in $R_k$. That means there is some $gin G$ such that $xy^-1=gxy'^-1g^-1$, since they're in the same conjugacy class. Then the function $f:S_ij^k(x,y)rightarrow S_ij^k(x,y')$ defined by $f(a)=g^-1ay^-1gy'$ gets the job done. First, it's injective by basic group multiplication properties. Next, let $ain S_ij^k(x,y)$ (thus $xa^-1in C_i$ and $ay^-1in C_j$) and we have that (using $sim$ to represent equivalence of conjugacy classes):
$$xf(a)^-1=xy'^-1g^-1ya^-1gsim gxy'^-1g^-1ya^-1=xy^-1ya^-1=xz^-1in C_i$$
$$f(a)y'^-1=g^-1ay^-1gy'y'^-1=g^-1ay^-1gsim ay^-1in C_j$$
Thus $f(a)in S_ij^k(x,y')$, as it should be, so for any pairs $(x,y),(x,y')in R_k$, $vert S_ij^k(x,y)vertleq vert S_ij^k(x,y')vert$, and so applying it to all pairs gives that $vert S_ij^k(x,y)vert=S_ij^k(x,y')vert$.
Thus, given an arbitrary pair $(x,y),(x',y')in R_k$, there is some $z$ such that $x=zx'$, and then from the question it's clear that $vert S_ij^k(x,y)vert=vert S_ij^k(zx,zy)vert=vert S_ij^k(x',zy)vert$. From what I just showed above, $vert S_ij^k(x',zy)vert=vert S_ij^k(x',y')vert$, so $vert S_ij^k(x,y)vert=vert S_ij^k(x',y')vert$, and thus the conjugacy class scheme is an association scheme.
$endgroup$
add a comment |
$begingroup$
Here's what I came up with: suppose $(x,y)$ and $(x,y')$ are in $R_k$. That means there is some $gin G$ such that $xy^-1=gxy'^-1g^-1$, since they're in the same conjugacy class. Then the function $f:S_ij^k(x,y)rightarrow S_ij^k(x,y')$ defined by $f(a)=g^-1ay^-1gy'$ gets the job done. First, it's injective by basic group multiplication properties. Next, let $ain S_ij^k(x,y)$ (thus $xa^-1in C_i$ and $ay^-1in C_j$) and we have that (using $sim$ to represent equivalence of conjugacy classes):
$$xf(a)^-1=xy'^-1g^-1ya^-1gsim gxy'^-1g^-1ya^-1=xy^-1ya^-1=xz^-1in C_i$$
$$f(a)y'^-1=g^-1ay^-1gy'y'^-1=g^-1ay^-1gsim ay^-1in C_j$$
Thus $f(a)in S_ij^k(x,y')$, as it should be, so for any pairs $(x,y),(x,y')in R_k$, $vert S_ij^k(x,y)vertleq vert S_ij^k(x,y')vert$, and so applying it to all pairs gives that $vert S_ij^k(x,y)vert=S_ij^k(x,y')vert$.
Thus, given an arbitrary pair $(x,y),(x',y')in R_k$, there is some $z$ such that $x=zx'$, and then from the question it's clear that $vert S_ij^k(x,y)vert=vert S_ij^k(zx,zy)vert=vert S_ij^k(x',zy)vert$. From what I just showed above, $vert S_ij^k(x',zy)vert=vert S_ij^k(x',y')vert$, so $vert S_ij^k(x,y)vert=vert S_ij^k(x',y')vert$, and thus the conjugacy class scheme is an association scheme.
$endgroup$
Here's what I came up with: suppose $(x,y)$ and $(x,y')$ are in $R_k$. That means there is some $gin G$ such that $xy^-1=gxy'^-1g^-1$, since they're in the same conjugacy class. Then the function $f:S_ij^k(x,y)rightarrow S_ij^k(x,y')$ defined by $f(a)=g^-1ay^-1gy'$ gets the job done. First, it's injective by basic group multiplication properties. Next, let $ain S_ij^k(x,y)$ (thus $xa^-1in C_i$ and $ay^-1in C_j$) and we have that (using $sim$ to represent equivalence of conjugacy classes):
$$xf(a)^-1=xy'^-1g^-1ya^-1gsim gxy'^-1g^-1ya^-1=xy^-1ya^-1=xz^-1in C_i$$
$$f(a)y'^-1=g^-1ay^-1gy'y'^-1=g^-1ay^-1gsim ay^-1in C_j$$
Thus $f(a)in S_ij^k(x,y')$, as it should be, so for any pairs $(x,y),(x,y')in R_k$, $vert S_ij^k(x,y)vertleq vert S_ij^k(x,y')vert$, and so applying it to all pairs gives that $vert S_ij^k(x,y)vert=S_ij^k(x,y')vert$.
Thus, given an arbitrary pair $(x,y),(x',y')in R_k$, there is some $z$ such that $x=zx'$, and then from the question it's clear that $vert S_ij^k(x,y)vert=vert S_ij^k(zx,zy)vert=vert S_ij^k(x',zy)vert$. From what I just showed above, $vert S_ij^k(x',zy)vert=vert S_ij^k(x',y')vert$, so $vert S_ij^k(x,y)vert=vert S_ij^k(x',y')vert$, and thus the conjugacy class scheme is an association scheme.
answered Aug 19 '16 at 20:44
Sam JaquesSam Jaques
875311
875311
add a comment |
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%2f1889374%2fproof-that-the-conjugacy-class-association-scheme-is-an-association-scheme%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