Very basic Lie Algebras question on the complex conjugate of the adjoint map
up vote
1
down vote
favorite
$V$ vector space over $mathbb{C}$, $L$ Lie subalgebra (subspace and closed under Lie bracket) of $gl(V)$, linear maps $V to V$. Suppose $d in L$ diagonalisable, show that $overline{ad(d)} = ad(bar{d})$ (bar represents complex conjugate).
I have that $d$ is diagonalisable so there exists a basis $B$ of $V$ such that $[d]_B$ is diagonal, where $[d]_B$ is the matrix of $d$ with respect to $B$.
I think I am missing something obvious, we need to show that $forall x in L, overline{ad(d)}(x) = overline{[d, x]} = overline{dx - xd}$ is equal to $bar{d}x - xbar{d} = [bar{d}, x] = ad(bar{d})$ but I just can't think of how to show $overline{dx - xd} = bar{d}x - xbar{d}$.
I thought we could work with matrices but I run into the same problem, I'm sure I'm missing something obvious.
Any hints or help appreciated, thanks.
linear-algebra lie-algebras
add a comment |
up vote
1
down vote
favorite
$V$ vector space over $mathbb{C}$, $L$ Lie subalgebra (subspace and closed under Lie bracket) of $gl(V)$, linear maps $V to V$. Suppose $d in L$ diagonalisable, show that $overline{ad(d)} = ad(bar{d})$ (bar represents complex conjugate).
I have that $d$ is diagonalisable so there exists a basis $B$ of $V$ such that $[d]_B$ is diagonal, where $[d]_B$ is the matrix of $d$ with respect to $B$.
I think I am missing something obvious, we need to show that $forall x in L, overline{ad(d)}(x) = overline{[d, x]} = overline{dx - xd}$ is equal to $bar{d}x - xbar{d} = [bar{d}, x] = ad(bar{d})$ but I just can't think of how to show $overline{dx - xd} = bar{d}x - xbar{d}$.
I thought we could work with matrices but I run into the same problem, I'm sure I'm missing something obvious.
Any hints or help appreciated, thanks.
linear-algebra lie-algebras
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
$V$ vector space over $mathbb{C}$, $L$ Lie subalgebra (subspace and closed under Lie bracket) of $gl(V)$, linear maps $V to V$. Suppose $d in L$ diagonalisable, show that $overline{ad(d)} = ad(bar{d})$ (bar represents complex conjugate).
I have that $d$ is diagonalisable so there exists a basis $B$ of $V$ such that $[d]_B$ is diagonal, where $[d]_B$ is the matrix of $d$ with respect to $B$.
I think I am missing something obvious, we need to show that $forall x in L, overline{ad(d)}(x) = overline{[d, x]} = overline{dx - xd}$ is equal to $bar{d}x - xbar{d} = [bar{d}, x] = ad(bar{d})$ but I just can't think of how to show $overline{dx - xd} = bar{d}x - xbar{d}$.
I thought we could work with matrices but I run into the same problem, I'm sure I'm missing something obvious.
Any hints or help appreciated, thanks.
linear-algebra lie-algebras
$V$ vector space over $mathbb{C}$, $L$ Lie subalgebra (subspace and closed under Lie bracket) of $gl(V)$, linear maps $V to V$. Suppose $d in L$ diagonalisable, show that $overline{ad(d)} = ad(bar{d})$ (bar represents complex conjugate).
I have that $d$ is diagonalisable so there exists a basis $B$ of $V$ such that $[d]_B$ is diagonal, where $[d]_B$ is the matrix of $d$ with respect to $B$.
I think I am missing something obvious, we need to show that $forall x in L, overline{ad(d)}(x) = overline{[d, x]} = overline{dx - xd}$ is equal to $bar{d}x - xbar{d} = [bar{d}, x] = ad(bar{d})$ but I just can't think of how to show $overline{dx - xd} = bar{d}x - xbar{d}$.
I thought we could work with matrices but I run into the same problem, I'm sure I'm missing something obvious.
Any hints or help appreciated, thanks.
linear-algebra lie-algebras
linear-algebra lie-algebras
edited May 15 '16 at 20:10
asked May 15 '16 at 15:50
D. P
1236
1236
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
up vote
1
down vote
accepted
Here is a counterexample. Let $L=mathfrak{gl}_2(mathbb{C})$ and $d=begin{pmatrix} 1 & 0 cr 0 & i end{pmatrix}$, $x=begin{pmatrix} 0 & i cr 0 & 0 end{pmatrix}$. Then we have
$$
overline{[d,x]}=overline{dx-xd}=begin{pmatrix} 0 & 1-i cr 0 & 0 end{pmatrix},
$$
but
$$
[overline{d},x]=overline{d}x-xoverline{d}=begin{pmatrix} 0 & i-1 cr 0 & 0 end{pmatrix}.
$$
Do you have a link for the question ?
Thanks for the reply, the sheet has another question missing a criteria so this might be a similar issue. The sheet is located at www2.warwick.ac.uk/fac/sci/maths/undergrad/ughandbook/lecturers/… but I don't think you can access it unless you are a student or staff at Warwick. A screenshot of the sheet (question 1) is here: imgur.com/fDSr0Sx , question 2b is missing the non-degenerate criteria so perhaps question 1 is missing a criteria (could you think of any that apply?). I might have miscalculated $overline{ad(d)}$ but that is all I can think of.
– D. P
May 16 '16 at 12:18
I will accept your answer once I determine if the question is incorrect or not by the way, just want it to remain unanswered for now in case someone else has an insight too. Thanks.
– D. P
May 16 '16 at 12:21
1
You can come up with more examples like this, which differ not only by a sign, but are completely different, e.g. with $x=begin{pmatrix} 0 & 1+i cr 0 & 0 end{pmatrix}$, and some diagonal $d$.
– Dietrich Burde
May 16 '16 at 13:52
Oh I believe you don't get me wrong, I was just unsure if I had interpreted the question's idea of the commutator wrong. I'll email my lecturer, thanks for the help.
– D. P
May 16 '16 at 15:45
1
You are welcome!
– Dietrich Burde
May 16 '16 at 15:50
add a comment |
up vote
1
down vote
The equality you want to prove is $overline{ad(d)} = adoverline{(d)}$ which is not equivalent to $overline{dx - xd} = bar{d}x - xbar{d}$.
If $d = text{diag}(lambda_1, dots, lambda_n)$, then $ad(d) = text{diag}(lambda_i - lambda_j)$, where $1 leq i,j leq n$. More precisely, $ad(d)$ has eigenvalues $lambda_i - lambda_j$ corresponding to eigenvectors $E_{ij}$. Therefore $$overline{ad(d)} = overline{text{diag}(lambda_i - lambda_j)} = text{diag}(overline{lambda_i - lambda_j}) = text{diag}(overline{lambda_i} - overline{lambda_j}) = ad(overline{d}).$$
New contributor
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
Here is a counterexample. Let $L=mathfrak{gl}_2(mathbb{C})$ and $d=begin{pmatrix} 1 & 0 cr 0 & i end{pmatrix}$, $x=begin{pmatrix} 0 & i cr 0 & 0 end{pmatrix}$. Then we have
$$
overline{[d,x]}=overline{dx-xd}=begin{pmatrix} 0 & 1-i cr 0 & 0 end{pmatrix},
$$
but
$$
[overline{d},x]=overline{d}x-xoverline{d}=begin{pmatrix} 0 & i-1 cr 0 & 0 end{pmatrix}.
$$
Do you have a link for the question ?
Thanks for the reply, the sheet has another question missing a criteria so this might be a similar issue. The sheet is located at www2.warwick.ac.uk/fac/sci/maths/undergrad/ughandbook/lecturers/… but I don't think you can access it unless you are a student or staff at Warwick. A screenshot of the sheet (question 1) is here: imgur.com/fDSr0Sx , question 2b is missing the non-degenerate criteria so perhaps question 1 is missing a criteria (could you think of any that apply?). I might have miscalculated $overline{ad(d)}$ but that is all I can think of.
– D. P
May 16 '16 at 12:18
I will accept your answer once I determine if the question is incorrect or not by the way, just want it to remain unanswered for now in case someone else has an insight too. Thanks.
– D. P
May 16 '16 at 12:21
1
You can come up with more examples like this, which differ not only by a sign, but are completely different, e.g. with $x=begin{pmatrix} 0 & 1+i cr 0 & 0 end{pmatrix}$, and some diagonal $d$.
– Dietrich Burde
May 16 '16 at 13:52
Oh I believe you don't get me wrong, I was just unsure if I had interpreted the question's idea of the commutator wrong. I'll email my lecturer, thanks for the help.
– D. P
May 16 '16 at 15:45
1
You are welcome!
– Dietrich Burde
May 16 '16 at 15:50
add a comment |
up vote
1
down vote
accepted
Here is a counterexample. Let $L=mathfrak{gl}_2(mathbb{C})$ and $d=begin{pmatrix} 1 & 0 cr 0 & i end{pmatrix}$, $x=begin{pmatrix} 0 & i cr 0 & 0 end{pmatrix}$. Then we have
$$
overline{[d,x]}=overline{dx-xd}=begin{pmatrix} 0 & 1-i cr 0 & 0 end{pmatrix},
$$
but
$$
[overline{d},x]=overline{d}x-xoverline{d}=begin{pmatrix} 0 & i-1 cr 0 & 0 end{pmatrix}.
$$
Do you have a link for the question ?
Thanks for the reply, the sheet has another question missing a criteria so this might be a similar issue. The sheet is located at www2.warwick.ac.uk/fac/sci/maths/undergrad/ughandbook/lecturers/… but I don't think you can access it unless you are a student or staff at Warwick. A screenshot of the sheet (question 1) is here: imgur.com/fDSr0Sx , question 2b is missing the non-degenerate criteria so perhaps question 1 is missing a criteria (could you think of any that apply?). I might have miscalculated $overline{ad(d)}$ but that is all I can think of.
– D. P
May 16 '16 at 12:18
I will accept your answer once I determine if the question is incorrect or not by the way, just want it to remain unanswered for now in case someone else has an insight too. Thanks.
– D. P
May 16 '16 at 12:21
1
You can come up with more examples like this, which differ not only by a sign, but are completely different, e.g. with $x=begin{pmatrix} 0 & 1+i cr 0 & 0 end{pmatrix}$, and some diagonal $d$.
– Dietrich Burde
May 16 '16 at 13:52
Oh I believe you don't get me wrong, I was just unsure if I had interpreted the question's idea of the commutator wrong. I'll email my lecturer, thanks for the help.
– D. P
May 16 '16 at 15:45
1
You are welcome!
– Dietrich Burde
May 16 '16 at 15:50
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
Here is a counterexample. Let $L=mathfrak{gl}_2(mathbb{C})$ and $d=begin{pmatrix} 1 & 0 cr 0 & i end{pmatrix}$, $x=begin{pmatrix} 0 & i cr 0 & 0 end{pmatrix}$. Then we have
$$
overline{[d,x]}=overline{dx-xd}=begin{pmatrix} 0 & 1-i cr 0 & 0 end{pmatrix},
$$
but
$$
[overline{d},x]=overline{d}x-xoverline{d}=begin{pmatrix} 0 & i-1 cr 0 & 0 end{pmatrix}.
$$
Do you have a link for the question ?
Here is a counterexample. Let $L=mathfrak{gl}_2(mathbb{C})$ and $d=begin{pmatrix} 1 & 0 cr 0 & i end{pmatrix}$, $x=begin{pmatrix} 0 & i cr 0 & 0 end{pmatrix}$. Then we have
$$
overline{[d,x]}=overline{dx-xd}=begin{pmatrix} 0 & 1-i cr 0 & 0 end{pmatrix},
$$
but
$$
[overline{d},x]=overline{d}x-xoverline{d}=begin{pmatrix} 0 & i-1 cr 0 & 0 end{pmatrix}.
$$
Do you have a link for the question ?
edited May 16 '16 at 10:45
answered May 16 '16 at 10:29
Dietrich Burde
76.8k64286
76.8k64286
Thanks for the reply, the sheet has another question missing a criteria so this might be a similar issue. The sheet is located at www2.warwick.ac.uk/fac/sci/maths/undergrad/ughandbook/lecturers/… but I don't think you can access it unless you are a student or staff at Warwick. A screenshot of the sheet (question 1) is here: imgur.com/fDSr0Sx , question 2b is missing the non-degenerate criteria so perhaps question 1 is missing a criteria (could you think of any that apply?). I might have miscalculated $overline{ad(d)}$ but that is all I can think of.
– D. P
May 16 '16 at 12:18
I will accept your answer once I determine if the question is incorrect or not by the way, just want it to remain unanswered for now in case someone else has an insight too. Thanks.
– D. P
May 16 '16 at 12:21
1
You can come up with more examples like this, which differ not only by a sign, but are completely different, e.g. with $x=begin{pmatrix} 0 & 1+i cr 0 & 0 end{pmatrix}$, and some diagonal $d$.
– Dietrich Burde
May 16 '16 at 13:52
Oh I believe you don't get me wrong, I was just unsure if I had interpreted the question's idea of the commutator wrong. I'll email my lecturer, thanks for the help.
– D. P
May 16 '16 at 15:45
1
You are welcome!
– Dietrich Burde
May 16 '16 at 15:50
add a comment |
Thanks for the reply, the sheet has another question missing a criteria so this might be a similar issue. The sheet is located at www2.warwick.ac.uk/fac/sci/maths/undergrad/ughandbook/lecturers/… but I don't think you can access it unless you are a student or staff at Warwick. A screenshot of the sheet (question 1) is here: imgur.com/fDSr0Sx , question 2b is missing the non-degenerate criteria so perhaps question 1 is missing a criteria (could you think of any that apply?). I might have miscalculated $overline{ad(d)}$ but that is all I can think of.
– D. P
May 16 '16 at 12:18
I will accept your answer once I determine if the question is incorrect or not by the way, just want it to remain unanswered for now in case someone else has an insight too. Thanks.
– D. P
May 16 '16 at 12:21
1
You can come up with more examples like this, which differ not only by a sign, but are completely different, e.g. with $x=begin{pmatrix} 0 & 1+i cr 0 & 0 end{pmatrix}$, and some diagonal $d$.
– Dietrich Burde
May 16 '16 at 13:52
Oh I believe you don't get me wrong, I was just unsure if I had interpreted the question's idea of the commutator wrong. I'll email my lecturer, thanks for the help.
– D. P
May 16 '16 at 15:45
1
You are welcome!
– Dietrich Burde
May 16 '16 at 15:50
Thanks for the reply, the sheet has another question missing a criteria so this might be a similar issue. The sheet is located at www2.warwick.ac.uk/fac/sci/maths/undergrad/ughandbook/lecturers/… but I don't think you can access it unless you are a student or staff at Warwick. A screenshot of the sheet (question 1) is here: imgur.com/fDSr0Sx , question 2b is missing the non-degenerate criteria so perhaps question 1 is missing a criteria (could you think of any that apply?). I might have miscalculated $overline{ad(d)}$ but that is all I can think of.
– D. P
May 16 '16 at 12:18
Thanks for the reply, the sheet has another question missing a criteria so this might be a similar issue. The sheet is located at www2.warwick.ac.uk/fac/sci/maths/undergrad/ughandbook/lecturers/… but I don't think you can access it unless you are a student or staff at Warwick. A screenshot of the sheet (question 1) is here: imgur.com/fDSr0Sx , question 2b is missing the non-degenerate criteria so perhaps question 1 is missing a criteria (could you think of any that apply?). I might have miscalculated $overline{ad(d)}$ but that is all I can think of.
– D. P
May 16 '16 at 12:18
I will accept your answer once I determine if the question is incorrect or not by the way, just want it to remain unanswered for now in case someone else has an insight too. Thanks.
– D. P
May 16 '16 at 12:21
I will accept your answer once I determine if the question is incorrect or not by the way, just want it to remain unanswered for now in case someone else has an insight too. Thanks.
– D. P
May 16 '16 at 12:21
1
1
You can come up with more examples like this, which differ not only by a sign, but are completely different, e.g. with $x=begin{pmatrix} 0 & 1+i cr 0 & 0 end{pmatrix}$, and some diagonal $d$.
– Dietrich Burde
May 16 '16 at 13:52
You can come up with more examples like this, which differ not only by a sign, but are completely different, e.g. with $x=begin{pmatrix} 0 & 1+i cr 0 & 0 end{pmatrix}$, and some diagonal $d$.
– Dietrich Burde
May 16 '16 at 13:52
Oh I believe you don't get me wrong, I was just unsure if I had interpreted the question's idea of the commutator wrong. I'll email my lecturer, thanks for the help.
– D. P
May 16 '16 at 15:45
Oh I believe you don't get me wrong, I was just unsure if I had interpreted the question's idea of the commutator wrong. I'll email my lecturer, thanks for the help.
– D. P
May 16 '16 at 15:45
1
1
You are welcome!
– Dietrich Burde
May 16 '16 at 15:50
You are welcome!
– Dietrich Burde
May 16 '16 at 15:50
add a comment |
up vote
1
down vote
The equality you want to prove is $overline{ad(d)} = adoverline{(d)}$ which is not equivalent to $overline{dx - xd} = bar{d}x - xbar{d}$.
If $d = text{diag}(lambda_1, dots, lambda_n)$, then $ad(d) = text{diag}(lambda_i - lambda_j)$, where $1 leq i,j leq n$. More precisely, $ad(d)$ has eigenvalues $lambda_i - lambda_j$ corresponding to eigenvectors $E_{ij}$. Therefore $$overline{ad(d)} = overline{text{diag}(lambda_i - lambda_j)} = text{diag}(overline{lambda_i - lambda_j}) = text{diag}(overline{lambda_i} - overline{lambda_j}) = ad(overline{d}).$$
New contributor
add a comment |
up vote
1
down vote
The equality you want to prove is $overline{ad(d)} = adoverline{(d)}$ which is not equivalent to $overline{dx - xd} = bar{d}x - xbar{d}$.
If $d = text{diag}(lambda_1, dots, lambda_n)$, then $ad(d) = text{diag}(lambda_i - lambda_j)$, where $1 leq i,j leq n$. More precisely, $ad(d)$ has eigenvalues $lambda_i - lambda_j$ corresponding to eigenvectors $E_{ij}$. Therefore $$overline{ad(d)} = overline{text{diag}(lambda_i - lambda_j)} = text{diag}(overline{lambda_i - lambda_j}) = text{diag}(overline{lambda_i} - overline{lambda_j}) = ad(overline{d}).$$
New contributor
add a comment |
up vote
1
down vote
up vote
1
down vote
The equality you want to prove is $overline{ad(d)} = adoverline{(d)}$ which is not equivalent to $overline{dx - xd} = bar{d}x - xbar{d}$.
If $d = text{diag}(lambda_1, dots, lambda_n)$, then $ad(d) = text{diag}(lambda_i - lambda_j)$, where $1 leq i,j leq n$. More precisely, $ad(d)$ has eigenvalues $lambda_i - lambda_j$ corresponding to eigenvectors $E_{ij}$. Therefore $$overline{ad(d)} = overline{text{diag}(lambda_i - lambda_j)} = text{diag}(overline{lambda_i - lambda_j}) = text{diag}(overline{lambda_i} - overline{lambda_j}) = ad(overline{d}).$$
New contributor
The equality you want to prove is $overline{ad(d)} = adoverline{(d)}$ which is not equivalent to $overline{dx - xd} = bar{d}x - xbar{d}$.
If $d = text{diag}(lambda_1, dots, lambda_n)$, then $ad(d) = text{diag}(lambda_i - lambda_j)$, where $1 leq i,j leq n$. More precisely, $ad(d)$ has eigenvalues $lambda_i - lambda_j$ corresponding to eigenvectors $E_{ij}$. Therefore $$overline{ad(d)} = overline{text{diag}(lambda_i - lambda_j)} = text{diag}(overline{lambda_i - lambda_j}) = text{diag}(overline{lambda_i} - overline{lambda_j}) = ad(overline{d}).$$
New contributor
New contributor
answered Dec 2 at 2:17
Ra1le
112
112
New contributor
New contributor
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.
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.
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%2f1786320%2fvery-basic-lie-algebras-question-on-the-complex-conjugate-of-the-adjoint-map%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