How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Poincaré–Birkhoff–Witt theorem
Statement
Let be a Lie algebra with a supplied basis equipped with a supplied total order. Then
including the empty product, form a basis of . Equivalently, the symbol map
is an isomorphism of graded algebras.
Facts & Assumptions
Given: A Lie algebra with a specified totally ordered basis .
Ordered monomials span (PBW spanning by ordered monomials).
Those monomials are linearly independent (PBW linear independence via the ordered-monomial model).
The ordered commutative monomials form a basis of (Ordered monomial basis of a symmetric algebra).
The graded symbol map is that of PBW symbol map from the symmetric algebra.
Proof
By [L1] and [L2], the ordered monomials are simultaneously spanning and linearly independent, hence form a basis of .
To verify the reverse implication in the stated equivalence, suppose that is a graded-algebra isomorphism. The ordered commutative monomials form a basis of by [L3]. For spanning, use induction on : if , surjectivity of expresses its class modulo as a finite linear combination of the classes of ordered length- monomials. Subtracting the same combination in leaves an element of , to which the induction hypothesis applies. For independence, take a finite relation among ordered monomials and let be its largest occurring length. Its degree- class is the image under the injective map of the corresponding combination of distinct ordered commutative monomials, so all degree- coefficients vanish; descending induction eliminates the rest. Thus the graded isomorphism implies the ordered-monomial basis assertion as well, including degree zero and the empty product.
The degree-preserving straightening result [L1] shows that every element of is spanned by ordered monomials of length at most ; their linear independence follows from [L2]. Hence they form a basis of , and has as a basis their classes of length exactly .
In degree , sends each ordered commutative basis monomial from [L3] to the class of the identically ordered PBW monomial from step 2.1. It is therefore a bijection in every degree.
Since is a graded algebra homomorphism by [L4] and is bijective on every graded component by step 3.1, it is a graded-algebra isomorphism. When is empty, both bases consist only of the empty monomial, so the boundary case is included.
Depends on
Used by
Dependency tree · two levels
11 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Pavel Etingof, MIT 18.745 Lie Groups and Lie Algebras I (standard reference, not scraped)
- Alexander Kirillov Jr., An Introduction to Lie Groups and Lie Algebras (standard reference, not scraped)