How to represent SU(N) as polynomials of the irreducible representations of SU(2) in complex vector space of...











up vote
0
down vote

favorite












Suppose $S^x$,$S^y$ and $S^z$ are the irreducible representations of $SU(2)$ in a complex vector space, V, of dimension N. By Burnside's theorem, $I$, $S^x$,$S^y$ and $S^z$ for a basis in the ring of endomorphims of V.



Now take $T_k$ as the generators of $SU(N)$. By the definition of $SU(N)$, $T_k$ is a subset of endomorphims in V.



Thus, I expect I should be able to write:



$
T_k=f_k(S^x,S^y,S^z,I)
$



with $f_k$ being a polynomial.



Is this expecation correct. Did I understand Burnside's theorem and the definition of SU(N) correctly?




  • If so, what can I say about $f_k$?

  • What is the highest degree polynomial required?

  • Do I need products like $S^xS^y$ or do monomials in $(S^i)^n$ suffice










share|cite|improve this question






















  • What "Burnside's theorem" are you referring to?
    – Qiaochu Yuan
    Nov 21 at 1:01










  • I didn't know there were multiple: it says that if a moniod of linear transformations acts irreducibly then it is a basis for the ring of endomorphisms, I found it in this paper: arxiv.org/abs/cond-mat/0207106
    – Shane P Kelly
    Nov 21 at 1:07






  • 2




    I don't know this result by that name; for me this is a special case of the Jacobson density theorem (en.wikipedia.org/wiki/Jacobson_density_theorem). In mathematics "Burnside's theorem" refers to a theorem about finite groups: en.wikipedia.org/wiki/Burnside_theorem
    – Qiaochu Yuan
    Nov 21 at 1:18








  • 2




    Your language is somewhat imprecise but you are basically right, if by "polynomial" you mean "noncommutative polynomial" (and "basis" in your second sentence should be "set of generators"). I don't know that there's anything nice to say about the $f_k$ and I would not enjoy attempting to calculate them. You need to make many noncanonical choices to define $f_k$, for example a choice of basis of $mathfrak{su}(2)$, a choice of inner product on $V$, and a choice of basis of $mathfrak{su}(V)$.
    – Qiaochu Yuan
    Nov 21 at 1:20












  • @QiaochuYuan Regarding the two Burnside theorems: the lesser known one does really go by that name too, a great proof is prestented here: core.ac.uk/download/pdf/82680953.pdf
    – Vincent
    Nov 21 at 14:16















up vote
0
down vote

favorite












Suppose $S^x$,$S^y$ and $S^z$ are the irreducible representations of $SU(2)$ in a complex vector space, V, of dimension N. By Burnside's theorem, $I$, $S^x$,$S^y$ and $S^z$ for a basis in the ring of endomorphims of V.



Now take $T_k$ as the generators of $SU(N)$. By the definition of $SU(N)$, $T_k$ is a subset of endomorphims in V.



Thus, I expect I should be able to write:



$
T_k=f_k(S^x,S^y,S^z,I)
$



with $f_k$ being a polynomial.



Is this expecation correct. Did I understand Burnside's theorem and the definition of SU(N) correctly?




  • If so, what can I say about $f_k$?

  • What is the highest degree polynomial required?

  • Do I need products like $S^xS^y$ or do monomials in $(S^i)^n$ suffice










share|cite|improve this question






















  • What "Burnside's theorem" are you referring to?
    – Qiaochu Yuan
    Nov 21 at 1:01










  • I didn't know there were multiple: it says that if a moniod of linear transformations acts irreducibly then it is a basis for the ring of endomorphisms, I found it in this paper: arxiv.org/abs/cond-mat/0207106
    – Shane P Kelly
    Nov 21 at 1:07






  • 2




    I don't know this result by that name; for me this is a special case of the Jacobson density theorem (en.wikipedia.org/wiki/Jacobson_density_theorem). In mathematics "Burnside's theorem" refers to a theorem about finite groups: en.wikipedia.org/wiki/Burnside_theorem
    – Qiaochu Yuan
    Nov 21 at 1:18








  • 2




    Your language is somewhat imprecise but you are basically right, if by "polynomial" you mean "noncommutative polynomial" (and "basis" in your second sentence should be "set of generators"). I don't know that there's anything nice to say about the $f_k$ and I would not enjoy attempting to calculate them. You need to make many noncanonical choices to define $f_k$, for example a choice of basis of $mathfrak{su}(2)$, a choice of inner product on $V$, and a choice of basis of $mathfrak{su}(V)$.
    – Qiaochu Yuan
    Nov 21 at 1:20












  • @QiaochuYuan Regarding the two Burnside theorems: the lesser known one does really go by that name too, a great proof is prestented here: core.ac.uk/download/pdf/82680953.pdf
    – Vincent
    Nov 21 at 14:16













up vote
0
down vote

favorite









up vote
0
down vote

favorite











Suppose $S^x$,$S^y$ and $S^z$ are the irreducible representations of $SU(2)$ in a complex vector space, V, of dimension N. By Burnside's theorem, $I$, $S^x$,$S^y$ and $S^z$ for a basis in the ring of endomorphims of V.



Now take $T_k$ as the generators of $SU(N)$. By the definition of $SU(N)$, $T_k$ is a subset of endomorphims in V.



Thus, I expect I should be able to write:



$
T_k=f_k(S^x,S^y,S^z,I)
$



with $f_k$ being a polynomial.



Is this expecation correct. Did I understand Burnside's theorem and the definition of SU(N) correctly?




  • If so, what can I say about $f_k$?

  • What is the highest degree polynomial required?

  • Do I need products like $S^xS^y$ or do monomials in $(S^i)^n$ suffice










share|cite|improve this question













Suppose $S^x$,$S^y$ and $S^z$ are the irreducible representations of $SU(2)$ in a complex vector space, V, of dimension N. By Burnside's theorem, $I$, $S^x$,$S^y$ and $S^z$ for a basis in the ring of endomorphims of V.



Now take $T_k$ as the generators of $SU(N)$. By the definition of $SU(N)$, $T_k$ is a subset of endomorphims in V.



Thus, I expect I should be able to write:



$
T_k=f_k(S^x,S^y,S^z,I)
$



with $f_k$ being a polynomial.



Is this expecation correct. Did I understand Burnside's theorem and the definition of SU(N) correctly?




  • If so, what can I say about $f_k$?

  • What is the highest degree polynomial required?

  • Do I need products like $S^xS^y$ or do monomials in $(S^i)^n$ suffice







group-theory representation-theory lie-algebras






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 21 at 0:48









Shane P Kelly

1106




1106












  • What "Burnside's theorem" are you referring to?
    – Qiaochu Yuan
    Nov 21 at 1:01










  • I didn't know there were multiple: it says that if a moniod of linear transformations acts irreducibly then it is a basis for the ring of endomorphisms, I found it in this paper: arxiv.org/abs/cond-mat/0207106
    – Shane P Kelly
    Nov 21 at 1:07






  • 2




    I don't know this result by that name; for me this is a special case of the Jacobson density theorem (en.wikipedia.org/wiki/Jacobson_density_theorem). In mathematics "Burnside's theorem" refers to a theorem about finite groups: en.wikipedia.org/wiki/Burnside_theorem
    – Qiaochu Yuan
    Nov 21 at 1:18








  • 2




    Your language is somewhat imprecise but you are basically right, if by "polynomial" you mean "noncommutative polynomial" (and "basis" in your second sentence should be "set of generators"). I don't know that there's anything nice to say about the $f_k$ and I would not enjoy attempting to calculate them. You need to make many noncanonical choices to define $f_k$, for example a choice of basis of $mathfrak{su}(2)$, a choice of inner product on $V$, and a choice of basis of $mathfrak{su}(V)$.
    – Qiaochu Yuan
    Nov 21 at 1:20












  • @QiaochuYuan Regarding the two Burnside theorems: the lesser known one does really go by that name too, a great proof is prestented here: core.ac.uk/download/pdf/82680953.pdf
    – Vincent
    Nov 21 at 14:16


















  • What "Burnside's theorem" are you referring to?
    – Qiaochu Yuan
    Nov 21 at 1:01










  • I didn't know there were multiple: it says that if a moniod of linear transformations acts irreducibly then it is a basis for the ring of endomorphisms, I found it in this paper: arxiv.org/abs/cond-mat/0207106
    – Shane P Kelly
    Nov 21 at 1:07






  • 2




    I don't know this result by that name; for me this is a special case of the Jacobson density theorem (en.wikipedia.org/wiki/Jacobson_density_theorem). In mathematics "Burnside's theorem" refers to a theorem about finite groups: en.wikipedia.org/wiki/Burnside_theorem
    – Qiaochu Yuan
    Nov 21 at 1:18








  • 2




    Your language is somewhat imprecise but you are basically right, if by "polynomial" you mean "noncommutative polynomial" (and "basis" in your second sentence should be "set of generators"). I don't know that there's anything nice to say about the $f_k$ and I would not enjoy attempting to calculate them. You need to make many noncanonical choices to define $f_k$, for example a choice of basis of $mathfrak{su}(2)$, a choice of inner product on $V$, and a choice of basis of $mathfrak{su}(V)$.
    – Qiaochu Yuan
    Nov 21 at 1:20












  • @QiaochuYuan Regarding the two Burnside theorems: the lesser known one does really go by that name too, a great proof is prestented here: core.ac.uk/download/pdf/82680953.pdf
    – Vincent
    Nov 21 at 14:16
















What "Burnside's theorem" are you referring to?
– Qiaochu Yuan
Nov 21 at 1:01




What "Burnside's theorem" are you referring to?
– Qiaochu Yuan
Nov 21 at 1:01












I didn't know there were multiple: it says that if a moniod of linear transformations acts irreducibly then it is a basis for the ring of endomorphisms, I found it in this paper: arxiv.org/abs/cond-mat/0207106
– Shane P Kelly
Nov 21 at 1:07




I didn't know there were multiple: it says that if a moniod of linear transformations acts irreducibly then it is a basis for the ring of endomorphisms, I found it in this paper: arxiv.org/abs/cond-mat/0207106
– Shane P Kelly
Nov 21 at 1:07




2




2




I don't know this result by that name; for me this is a special case of the Jacobson density theorem (en.wikipedia.org/wiki/Jacobson_density_theorem). In mathematics "Burnside's theorem" refers to a theorem about finite groups: en.wikipedia.org/wiki/Burnside_theorem
– Qiaochu Yuan
Nov 21 at 1:18






I don't know this result by that name; for me this is a special case of the Jacobson density theorem (en.wikipedia.org/wiki/Jacobson_density_theorem). In mathematics "Burnside's theorem" refers to a theorem about finite groups: en.wikipedia.org/wiki/Burnside_theorem
– Qiaochu Yuan
Nov 21 at 1:18






2




2




Your language is somewhat imprecise but you are basically right, if by "polynomial" you mean "noncommutative polynomial" (and "basis" in your second sentence should be "set of generators"). I don't know that there's anything nice to say about the $f_k$ and I would not enjoy attempting to calculate them. You need to make many noncanonical choices to define $f_k$, for example a choice of basis of $mathfrak{su}(2)$, a choice of inner product on $V$, and a choice of basis of $mathfrak{su}(V)$.
– Qiaochu Yuan
Nov 21 at 1:20






Your language is somewhat imprecise but you are basically right, if by "polynomial" you mean "noncommutative polynomial" (and "basis" in your second sentence should be "set of generators"). I don't know that there's anything nice to say about the $f_k$ and I would not enjoy attempting to calculate them. You need to make many noncanonical choices to define $f_k$, for example a choice of basis of $mathfrak{su}(2)$, a choice of inner product on $V$, and a choice of basis of $mathfrak{su}(V)$.
– Qiaochu Yuan
Nov 21 at 1:20














@QiaochuYuan Regarding the two Burnside theorems: the lesser known one does really go by that name too, a great proof is prestented here: core.ac.uk/download/pdf/82680953.pdf
– Vincent
Nov 21 at 14:16




@QiaochuYuan Regarding the two Burnside theorems: the lesser known one does really go by that name too, a great proof is prestented here: core.ac.uk/download/pdf/82680953.pdf
– Vincent
Nov 21 at 14:16















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',
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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007109%2fhow-to-represent-sun-as-polynomials-of-the-irreducible-representations-of-su2%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007109%2fhow-to-represent-sun-as-polynomials-of-the-irreducible-representations-of-su2%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Ellipse (mathématiques)

Quarter-circle Tiles

Mont Emei