-
-
Notifications
You must be signed in to change notification settings - Fork 508
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implement the BGG resolution of a simple finite dimensional Lie algebra representation #37297
Implement the BGG resolution of a simple finite dimensional Lie algebra representation #37297
Conversation
some problems with imports, apparently |
That should take care of all of the failures. |
bae8137
to
5ab8f22
Compare
Needs rebase |
5ab8f22
to
0a2a918
Compare
Documentation preview for this PR (built with commit 9c8d7cf; changes) is ready! 🎉 |
0a2a918
to
7f1f610
Compare
I have made all suggested changes. |
Lint complains |
Fixed, although I don't know why the linter didn't catch that before. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM.
Thank you! |
The goal of this PR is to implement the BGG resolution of a finite dimensional simple Lie algebra representation$L_{\lambda}$ . In order to implement this, we need to implement a number of features:
to_root_vector()
to a method of fundamental weights and cache the inverse Cartan matrix.is_dominant_weight()
method to weight lattice realization elements.is_verma_dominant()
to define a dominant weight in the sense of the Humphreys 2008 reference, which means the Verma module is projective (that is, maximal in its dot action orbit).FiniteDimensionalKacMoodyAlgebras
.@cache_in_parent_method
markedweak_le
for Coxeter groups.We also add methods to compute the contravariant form of a Verma module and add tester methods for them being simple or projective.
It is possible to split this up into smaller parts, but it is natural for them to go together given the final goal.
One major TODO is to speed up the computation of the bases of the simple modules. The main place to optimize this would be to improve the multiplication of the PBW basis code, which for finite dimensional Lie algebras (not necessarily semisimple), this could be improved by using the fixed basis order and using the monomials as vectors to avoid lots of calls for getting the sort order and comparing. In particular, the triangular sorting order for the Chevalley basis implementation has error messages being raised (and caught) for comparing the roots and coroots. This will be done at some point on a separate PR.
📝 Checklist
⌛ Dependencies