Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck passjudge 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.

Adjoint representation of a Lie algebra

Definition

Let g be a finite-dimensional Lie algebra over F{R,C}. For Xg, its adjoint endomorphism is

adXEndF(g),adX(Y)=[X,Y].

Bilinearity of the bracket makes adX linear in Y and makes the assignment XadX linear in X. Moreover, the Jacobi identity in Finite-dimensional Lie algebra gives, for every Zg,

[adX,adY](Z)=[X,[Y,Z]][Y,[X,Z]]=[[X,Y],Z]=ad[X,Y](Z).

Consequently

ad:ggl(g),XadX,

is a Lie-algebra homomorphism into the commutator Lie algebra of endomorphisms, where here a Lie-algebra homomorphism means a linear map that preserves the bracket. A linear homomorphism from a Lie algebra into the commutator Lie algebra of endomorphisms is called a representation, and this particular one is the adjoint representation of g. The later general definition of Lie-algebra representations uses exactly this convention but is not a prerequisite for the construction above.

For the zero algebra this is the unique map between zero spaces. Every one-dimensional Lie algebra over the stated fields has zero bracket, so its adjoint representation is zero. Degenerate adjoint maps are allowed; no faithfulness is asserted. The construction is algebraic, boundaryless and endpoint-free, uses no metric or choice principle, and contains no biconditional.

Depends on

Used by

Dependency tree · two levels

5 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