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.
Free Lie construction for finite Kac Moody generators
Statement
For a finite-dimensional complex space with specified basis, the quotient of formal bracket words by bilinearity, antisymmetry and Jacobi is the free Lie algebra on . Its natural map into is injective, with image the Lie subalgebra generated by , and .
Facts & Assumptions
Given: A finite basis of V and the formal bracket-word quotient F(V).
PBW injects a countably based Lie algebra into its enveloping algebra. (PBW for countably presented Kac Moody Lie algebras).
Maps out of the tensor quotient are determined by maps on generators respecting the bracket relations. (The universal enveloping algebra as a tensor quotient).
Proof
Evaluate a formal bracket recursively under any linear map . Bilinearity, antisymmetry and Jacobi vanish on evaluation because they hold in . Thus evaluation factors uniquely through a Lie homomorphism . The quotient itself has an antisymmetric bilinear bracket satisfying Jacobi by its defining relations. Bracket words form a countable spanning list, so first independent words supply a basis.
The linear inclusion gives an associative map . Conversely step 1.1 applied to the commutator Lie algebra of gives , hence an associative map by the tensor-quotient relations. Both composites fix . The algebra is generated by ; is also generated by because each bracket word is an associative commutator polynomial. Therefore the composites are identities.
PBW for the basis selected in step 1.1 injects into . Composing with the isomorphism of step 2.1 proves injectivity into . Every element of its image is a linear combination of bracket words, and every such word is in the image, proving the image description.
Sources
Source comparison: Kleshchev, §1.3, Theorem 1.3.3(ii), pp.14–16; explicit universal-property construction.
Depends on
Used by
Dependency tree · one level
2 results within one dependency step 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
- Kleshchev, Lectures on Infinite Dimensional Lie Algebras — §1.3, Theorem 1.3.3(ii), pp.14–16; explicit universal-property construction (standard reference, not scraped)