How to compute a unitary representation of finite group isomorphic to a given rep? The 2019 Stack Overflow Developer Survey Results Are InAll $mathbb C$-representations of a finite group $G$ have a $G$-invariant inner productWhy unitary characters for the dual group in Pontryagin duality if $G$ is not compact?Finite Subgroups of $GL(n,mathbbC)$Describing all $rho$-invariant inner productsGroup representation scalar productRepresentation Theory of the Dihedral Group $D_2n$Explicit formula for invariant inner product of the standard representation of $S_3$Given an irreducible representation, is there a *unique* unitary representation that it is equivalent to?Consider the following representation of $SO_2$. Reduce it to a unitary representation.How can I find an isomorphism between two representations?
How can I create a character who can assume the widest possible range of creature sizes?
What do the Banks children have against barley water?
What do hard-Brexiteers want with respect to the Irish border?
On the insanity of kings as an argument against monarchy
Inline version of a function returns different value than non-inline version
Is domain driven design an anti-SQL pattern?
Should I write numbers in words or as numerals when there are multiple next to each other?
Is bread bad for ducks?
"To split hairs" vs "To be pedantic"
Why could you hear an Amstrad CPC working?
Realistic Alternatives to Dust: What Else Could Feed a Plankton Bloom?
Carnot-Caratheodory metric
How was Skylab's orbit inclination chosen?
Falsification in Math vs Science
What are the motivations for publishing new editions of an existing textbook, beyond new discoveries in a field?
Understanding the implication of what "well-defined" means for the operation in quotient group
Why is the maximum length of OpenWrt’s root password 8 characters?
Where does the "burst of radiance" from Holy Weapon originate?
Why is my p-value correlated to difference between means in two sample tests?
How to answer pointed "are you quitting" questioning when I don't want them to suspect
What is the motivation for a law requiring 2 parties to consent for recording a conversation
Why isn't airport relocation done gradually?
What does "rabbited" mean/imply in this sentence?
"Riffle" two strings
How to compute a unitary representation of finite group isomorphic to a given rep?
The 2019 Stack Overflow Developer Survey Results Are InAll $mathbb C$-representations of a finite group $G$ have a $G$-invariant inner productWhy unitary characters for the dual group in Pontryagin duality if $G$ is not compact?Finite Subgroups of $GL(n,mathbbC)$Describing all $rho$-invariant inner productsGroup representation scalar productRepresentation Theory of the Dihedral Group $D_2n$Explicit formula for invariant inner product of the standard representation of $S_3$Given an irreducible representation, is there a *unique* unitary representation that it is equivalent to?Consider the following representation of $SO_2$. Reduce it to a unitary representation.How can I find an isomorphism between two representations?
$begingroup$
Suppose I am given some representation of a finite group: $rho : G to textGL(n, mathbbC)$. I want to compute a unitary representation $tau$ which is isomorphic to $rho$.
I know about Weyl's trick, where you define a $G$-invariant inner product, $langle v,w rangle = frac1Gsum_g in G langle rho(g)v, rho(g)w rangle_0$ where $langle,rangle_0$ is the dot product (the usual inner product). Then $rho$ is unitary with respect to the new inner product (by relabelling the sum, easy argument).
But how does this help us compute the representation of $tau$ where the images are unitary matrices? By this I mean unitary according to the original inner product.
Here are my thoughts so far: Inner products on $mathbbC^n$ differ by a linear map, $langle v,w rangle = langle Av, w rangle_0$ for some $A in textGL(n, mathbbC)$, positive definite. Also $langle v,w rangle = v^* A^* w$. Maybe at this point I can do the Cholesky decomposition of $A$: $langle v,w rangle = v^* A^* w = v^* L^*L w = langle Lv, Lw rangle_0$. So the new inner product is just the dot product after doing the linear map $L$. And since this inner product is $G$-invariant, doesn't this imply $L$ is $G$-invariant also?
The Cholesky decomposition is problematic though, since in computer algebra systems (like GAP, SageMath), arbitrary square roots in cyclotomic fields (the closest thing to $mathbbC$) are not possible.
Any advice on my approach or better ideas are welcome.
representation-theory computer-algebra-systems computational-algebra
$endgroup$
add a comment |
$begingroup$
Suppose I am given some representation of a finite group: $rho : G to textGL(n, mathbbC)$. I want to compute a unitary representation $tau$ which is isomorphic to $rho$.
I know about Weyl's trick, where you define a $G$-invariant inner product, $langle v,w rangle = frac1Gsum_g in G langle rho(g)v, rho(g)w rangle_0$ where $langle,rangle_0$ is the dot product (the usual inner product). Then $rho$ is unitary with respect to the new inner product (by relabelling the sum, easy argument).
But how does this help us compute the representation of $tau$ where the images are unitary matrices? By this I mean unitary according to the original inner product.
Here are my thoughts so far: Inner products on $mathbbC^n$ differ by a linear map, $langle v,w rangle = langle Av, w rangle_0$ for some $A in textGL(n, mathbbC)$, positive definite. Also $langle v,w rangle = v^* A^* w$. Maybe at this point I can do the Cholesky decomposition of $A$: $langle v,w rangle = v^* A^* w = v^* L^*L w = langle Lv, Lw rangle_0$. So the new inner product is just the dot product after doing the linear map $L$. And since this inner product is $G$-invariant, doesn't this imply $L$ is $G$-invariant also?
The Cholesky decomposition is problematic though, since in computer algebra systems (like GAP, SageMath), arbitrary square roots in cyclotomic fields (the closest thing to $mathbbC$) are not possible.
Any advice on my approach or better ideas are welcome.
representation-theory computer-algebra-systems computational-algebra
$endgroup$
$begingroup$
Once you have the new inner product, apply Gram-Schmidt to the old basis to get a basis which is orthonormal in the new inner product. Conjugating the representation by this change-of-basis matrix should give you what you want.
$endgroup$
– Joppy
Apr 6 at 12:34
$begingroup$
I am actually trying to avoid the Gram-Schmidt process. When working in exact cyclotomic fields, square rooting large real numbers means we have to go to a really big degree cyclotomic field which is really bad for computation time. You are right though, that is a method I didn't think of.
$endgroup$
– pizzaroll
Apr 6 at 14:04
add a comment |
$begingroup$
Suppose I am given some representation of a finite group: $rho : G to textGL(n, mathbbC)$. I want to compute a unitary representation $tau$ which is isomorphic to $rho$.
I know about Weyl's trick, where you define a $G$-invariant inner product, $langle v,w rangle = frac1Gsum_g in G langle rho(g)v, rho(g)w rangle_0$ where $langle,rangle_0$ is the dot product (the usual inner product). Then $rho$ is unitary with respect to the new inner product (by relabelling the sum, easy argument).
But how does this help us compute the representation of $tau$ where the images are unitary matrices? By this I mean unitary according to the original inner product.
Here are my thoughts so far: Inner products on $mathbbC^n$ differ by a linear map, $langle v,w rangle = langle Av, w rangle_0$ for some $A in textGL(n, mathbbC)$, positive definite. Also $langle v,w rangle = v^* A^* w$. Maybe at this point I can do the Cholesky decomposition of $A$: $langle v,w rangle = v^* A^* w = v^* L^*L w = langle Lv, Lw rangle_0$. So the new inner product is just the dot product after doing the linear map $L$. And since this inner product is $G$-invariant, doesn't this imply $L$ is $G$-invariant also?
The Cholesky decomposition is problematic though, since in computer algebra systems (like GAP, SageMath), arbitrary square roots in cyclotomic fields (the closest thing to $mathbbC$) are not possible.
Any advice on my approach or better ideas are welcome.
representation-theory computer-algebra-systems computational-algebra
$endgroup$
Suppose I am given some representation of a finite group: $rho : G to textGL(n, mathbbC)$. I want to compute a unitary representation $tau$ which is isomorphic to $rho$.
I know about Weyl's trick, where you define a $G$-invariant inner product, $langle v,w rangle = frac1Gsum_g in G langle rho(g)v, rho(g)w rangle_0$ where $langle,rangle_0$ is the dot product (the usual inner product). Then $rho$ is unitary with respect to the new inner product (by relabelling the sum, easy argument).
But how does this help us compute the representation of $tau$ where the images are unitary matrices? By this I mean unitary according to the original inner product.
Here are my thoughts so far: Inner products on $mathbbC^n$ differ by a linear map, $langle v,w rangle = langle Av, w rangle_0$ for some $A in textGL(n, mathbbC)$, positive definite. Also $langle v,w rangle = v^* A^* w$. Maybe at this point I can do the Cholesky decomposition of $A$: $langle v,w rangle = v^* A^* w = v^* L^*L w = langle Lv, Lw rangle_0$. So the new inner product is just the dot product after doing the linear map $L$. And since this inner product is $G$-invariant, doesn't this imply $L$ is $G$-invariant also?
The Cholesky decomposition is problematic though, since in computer algebra systems (like GAP, SageMath), arbitrary square roots in cyclotomic fields (the closest thing to $mathbbC$) are not possible.
Any advice on my approach or better ideas are welcome.
representation-theory computer-algebra-systems computational-algebra
representation-theory computer-algebra-systems computational-algebra
edited Apr 6 at 17:36
Alexander Konovalov
5,24222057
5,24222057
asked Apr 6 at 11:25
pizzarollpizzaroll
400110
400110
$begingroup$
Once you have the new inner product, apply Gram-Schmidt to the old basis to get a basis which is orthonormal in the new inner product. Conjugating the representation by this change-of-basis matrix should give you what you want.
$endgroup$
– Joppy
Apr 6 at 12:34
$begingroup$
I am actually trying to avoid the Gram-Schmidt process. When working in exact cyclotomic fields, square rooting large real numbers means we have to go to a really big degree cyclotomic field which is really bad for computation time. You are right though, that is a method I didn't think of.
$endgroup$
– pizzaroll
Apr 6 at 14:04
add a comment |
$begingroup$
Once you have the new inner product, apply Gram-Schmidt to the old basis to get a basis which is orthonormal in the new inner product. Conjugating the representation by this change-of-basis matrix should give you what you want.
$endgroup$
– Joppy
Apr 6 at 12:34
$begingroup$
I am actually trying to avoid the Gram-Schmidt process. When working in exact cyclotomic fields, square rooting large real numbers means we have to go to a really big degree cyclotomic field which is really bad for computation time. You are right though, that is a method I didn't think of.
$endgroup$
– pizzaroll
Apr 6 at 14:04
$begingroup$
Once you have the new inner product, apply Gram-Schmidt to the old basis to get a basis which is orthonormal in the new inner product. Conjugating the representation by this change-of-basis matrix should give you what you want.
$endgroup$
– Joppy
Apr 6 at 12:34
$begingroup$
Once you have the new inner product, apply Gram-Schmidt to the old basis to get a basis which is orthonormal in the new inner product. Conjugating the representation by this change-of-basis matrix should give you what you want.
$endgroup$
– Joppy
Apr 6 at 12:34
$begingroup$
I am actually trying to avoid the Gram-Schmidt process. When working in exact cyclotomic fields, square rooting large real numbers means we have to go to a really big degree cyclotomic field which is really bad for computation time. You are right though, that is a method I didn't think of.
$endgroup$
– pizzaroll
Apr 6 at 14:04
$begingroup$
I am actually trying to avoid the Gram-Schmidt process. When working in exact cyclotomic fields, square rooting large real numbers means we have to go to a really big degree cyclotomic field which is really bad for computation time. You are right though, that is a method I didn't think of.
$endgroup$
– pizzaroll
Apr 6 at 14:04
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%2f3176887%2fhow-to-compute-a-unitary-representation-of-finite-group-isomorphic-to-a-given-re%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%2f3176887%2fhow-to-compute-a-unitary-representation-of-finite-group-isomorphic-to-a-given-re%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
$begingroup$
Once you have the new inner product, apply Gram-Schmidt to the old basis to get a basis which is orthonormal in the new inner product. Conjugating the representation by this change-of-basis matrix should give you what you want.
$endgroup$
– Joppy
Apr 6 at 12:34
$begingroup$
I am actually trying to avoid the Gram-Schmidt process. When working in exact cyclotomic fields, square rooting large real numbers means we have to go to a really big degree cyclotomic field which is really bad for computation time. You are right though, that is a method I didn't think of.
$endgroup$
– pizzaroll
Apr 6 at 14:04