Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Universal property of the enveloping algebra

Statement

Let A be a unital associative k-algebra, equipped with its commutator Lie bracket. Every Lie-algebra homomorphism f:gALie extends uniquely to a unital algebra homomorphism f:U(g)A satisfying fιg=f.

Facts & Assumptions

Given: A Lie-algebra map f:gALie into a unital associative k-algebra.

[L1]

A linear map from g extends uniquely to an algebra map from T(g) (Universal property of the tensor algebra).

[L2]
[L3]

The defining relators and canonical map are those of Universal enveloping algebra.

Proof

technique · direct
1.1

By [L1], f extends uniquely to a unital algebra homomorphism F:T(g)A. Since f preserves Lie brackets, F(xyyx[x,y])=f(x)f(y)f(y)f(x)f([x,y])=0 for every defining relator.

L1algebra
2.1

The kernel of F is a two-sided ideal containing all defining relators, hence contains their generated ideal I. By [L2], F factors uniquely as T(g)U(g)fA, and the factor satisfies fιg=f.

step 1.1L2L3
3.1

If G:U(g)A is another unital algebra map with Gιg=f, its composite with T(g)U(g) is an algebra extension of f. It equals F by [L1], and quotient-map surjectivity gives G=f.

step 2.1L1L3algebra
4.1

Thus the required extension exists uniquely; the argument uses only the quotient presentation and not injectivity of ιg.

step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

16 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