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.

Finite-dimensional Lie algebra

Definition

Let F be either R or C. A finite-dimensional Lie algebra over F is a finite-dimensional F-vector space g together with an F-bilinear map

[ , ]:g×gg

such that, for all X,Y,Zg,

[X,X]=0

and

[X,[Y,Z]]+[Y,[Z,X]]+[Z,[X,Y]]=0.

The first identity is alternation and the second is the Jacobi identity. Over R or C, alternation is equivalent to skew-symmetry. Indeed, bilinearity and alternation give 0=[X+Y,X+Y]=[X,Y]+[Y,X], while skew-symmetry gives 2[X,X]=0 and hence [X,X]=0 because both fields have characteristic zero. For a complex Lie algebra the bracket is required to be complex-bilinear, not merely real-bilinear.

The definition permits the zero bracket. The zero vector space, with its unique bracket, is a zero-dimensional Lie algebra. On a one-dimensional space, every alternating bilinear bracket is zero: any two vectors are scalar multiples of one vector and bilinearity reduces their bracket to [X,X]=0. A vector space is nonempty because it contains zero. No basis is selected by asserting finite-dimensionality, so the definition is choice-free. It is purely algebraic and has no metric, nondegeneracy, manifold-boundary, or endpoint condition.

Depends on

Used by

Dependency tree · two levels

20 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