Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-14
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 g be a Lie algebra with a supplied basis B equipped with a supplied total order. Then

ιg(b1)ιg(bn)(b1bn),

including the empty product, form a basis of U(g). Equivalently, the symbol map

σ:S(g)grU(g)

is an isomorphism of graded algebras.

Facts & Assumptions

Given: A Lie algebra with a specified totally ordered basis B.

[L1]

Ordered monomials span U(g) (PBW spanning by ordered monomials).

[L2]

Those monomials are linearly independent (PBW linear independence via the ordered-monomial model).

[L3]

The ordered commutative monomials form a basis of S(g) (Ordered monomial basis of a symmetric algebra).

[L4]

The graded symbol map is that of PBW symbol map from the symmetric algebra.

Proof

technique · direct
1.1

By [L1] and [L2], the ordered monomials are simultaneously spanning and linearly independent, hence form a basis of U(g).

L1L2
1.2

To verify the reverse implication in the stated equivalence, suppose that σ is a graded-algebra isomorphism. The ordered commutative monomials form a basis of S(g) by [L3]. For spanning, use induction on n: if uFnU(g), surjectivity of σn expresses its class modulo Fn1 as a finite linear combination of the classes of ordered length-n monomials. Subtracting the same combination in U(g) leaves an element of Fn1, to which the induction hypothesis applies. For independence, take a finite relation among ordered monomials and let n be its largest occurring length. Its degree-n class is the image under the injective map σn of the corresponding combination of distinct ordered commutative monomials, so all degree-n 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.

L3L4algebra
2.1

The degree-preserving straightening result [L1] shows that every element of FnU(g) is spanned by ordered monomials of length at most n; their linear independence follows from [L2]. Hence they form a basis of Fn, and Fn/Fn1 has as a basis their classes of length exactly n.

L1L2step 1.1algebra
3.1

In degree n, σ 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.

step 2.1L3L4
4.1

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 B is empty, both bases consist only of the empty monomial, so the boundary case is included.

step 1.1step 3.1L4

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