Repository navigation
feat(Mathematics): The adjoint on su(n). - #1744
Conversation
|
Thank you for this pull-request (PR). If this is your first PR, welcome to the community! Below is what will happen next. Please read carefully if you are not familiar with the process. You may open other PRs while this one is being reviewed, and can stack PRs on top of each other, so don't let these steps slow you down.
Tip: The easiest way to get have a fast review is to submit a PR that is small and self-contained, and has clear documentation explaining why things are the way they are in your chages. If you have any problems or questions, please reach out to the community on the Zulip. |
|
claim |
|
Review claim by @nateabr completed — thanks for the review. |
|
@jstoobysmith is this ready to review? awaiting-author |
|
@nateabr yep, this is now ready :) |
|
-awaiting-author |
nateabr
left a comment
There was a problem hiding this comment.
Have added some comments
|
|
||
| /-- The contraction is the Killing form on the complexified Lie | ||
| algebra, up to a factor of `-1/(2n)`. -/ | ||
| lemma adjointℂContr_eq_killingForm {n : ℕ} (A B : Complexification n) : |
There was a problem hiding this comment.
Maybe this proof should be split into two steps. What we can do is extract the matrix trace part and then prove the hK as a lemma and the current inverse factor can be a corollary.
The killing form proof would read better if it's just the application to the lie algebra
There was a problem hiding this comment.
I think I have done this, although am not 100% sure what you mean here.
There was a problem hiding this comment.
Poor comment from me :(
You have addressed my comment though. I had also asked additionally to maybe extract computing the trace of the operator M ↦ −[A, [B, M]] on all matrices, before using that A and B are traceless.
Though this is not needed as the equivTraceKer makes everything very clear
|
awaiting-author |
|
@nateabr addressed comments -awaiting-author |
nateabr
left a comment
There was a problem hiding this comment.
Happy with the changes. Approved
|
|
||
| /-- The contraction is the Killing form on the complexified Lie | ||
| algebra, up to a factor of `-1/(2n)`. -/ | ||
| lemma adjointℂContr_eq_killingForm {n : ℕ} (A B : Complexification n) : |
There was a problem hiding this comment.
Poor comment from me :(
You have addressed my comment though. I had also asked additionally to maybe extract computing the trace of the operator M ↦ −[A, [B, M]] on all matrices, before using that A and B are traceless.
Though this is not needed as the equivTraceKer makes everything very clear
672c025
Results related to the adjoint representation of
su(n). This is based of the material in #1415.