Like everything else in Lie groups, first start with the matrix as discussed at Section "Lie algebra of a matrix Lie group".
Intuitively, a Lie algebra is a simpler object than a Lie group. Without any extra structure, groups can be very complicated non-linear objects. But a Lie algebra is just an algebra over a field, and one with a restricted bilinear map called the Lie bracket, that has to also be alternating and satisfy the Jacobi identity.
Another important way to think about Lie algebras, is as infinitesimal generators.
Because of the Lie group-Lie algebra correspondence, we know that there is almost a bijection between each Lie group and the corresponding Lie algebra. So it makes sense to try and study the algebra instead of the group itself whenever possible, to try and get insight and proofs in that simpler framework. This is the key reason why people study Lie algebras. One is philosophically reminded of how normal subgroups are a simpler representation of group homomorphisms.
To make things even simpler, because all vector spaces of the same dimension on a given field are isomorphic, the only things we need to specify a Lie group through a Lie algebra are:Note that the Lie bracket can look different under different basis of the Lie algebra however. This is shown for example at Physics from Symmetry by Jakob Schwichtenberg (2015) page 71 for the Lorentz group.
- the dimension
- the Lie bracket
As mentioned at Lie Groups, Physics, and Geometry by Robert Gilmore (2008) Chapter 4 "Lie Algebras", taking the Lie algebra around the identity is mostly a convention, we could treat any other point, and things are more or less equivalent.
Development ceased in 2021 and was taken up by a not-for-profit as Farama Gymnasium.
P for quantum computing!
Heck, we know nothing about this class yet related to non quantum classes!
- conjectured not to intersect with NP-complete, because if it were, all NP-complete problems could be solved efficiently on quantum computers, and none has been found so far as of 2020.
- conjectured to be larger than P, but we don't have a single algorithm provenly there:
- it is believed that the NP complete ones can't be solved
- if they were neither NP-complete nor P, it would imply P != NP
- we just don't know if it is even contained inside NP!
This is apparently where past exam papers can be found. Paywalled of course.
The paywall is stupid however, as they seem to provide past papers upon request, e.g.
This adds to the mess of having a different location for material per department. Presumably this exists because the central university authority wants to centralize examinations to have better control over degree requirements. If only they would also do the same for all materials and end the mess.
- something about finding a unitary representation of the poincare group
Cannot update a component while rendering a different component warning in React Updated 2025-03-28 +Created 1970-01-01
The last value we will likely every know for the busy beaver function! BB(6) is likely completely out of reach forever.
By 2023, it had basically been decided by the The Busy Beaver Challenge as mentioned at: discuss.bbchallenge.org/t/the-30-to-34-ctl-holdouts-from-bb-5/141, pending only further verification. It is going to be one of those highly computational proofs that will be needed to be formally verified for people to finally settle.
As that project beautifully puts it, as of 2023 prior to full resolution, this can be considered the:on the Busy beaver scale.
simplest open problem in mathematics
Fizeau's determination of the speed of light with a rotating cogwheel Updated 2025-03-28 +Created 1970-01-01
Unlisted articles are being shown, click here to show only listed articles.