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

Contragredient algebra has a triangular decomposition

Statement

The Cartan map is injective and g~=n~hn~+. Each half is free on its indicated generators. This is a Q-graded weight decomposition with zero part h and all other degrees in ±(Q+{0}).

Facts & Assumptions

Given: The contragredient relations and a minimal realization.

[F1]

The presentation and its homogeneous degrees are fixed. (Contragredient lie algebra before the maximal ideal quotient).

[F2]

The free Lie algebra embeds as bracket words in the tensor algebra. (Free Lie construction for finite Kac Moody generators).

Proof

1.1

On T(Cn) with letters vj, let Fj be left concatenation and let Hh multiply a word of degree β by (λβ)(h), for any fixed λh. Define Ei1=0 and Ei(vja)=vjEi(a)+δijHhi(a). Thus [Ei,Fj]=δijHhi directly, the Hh commute, and [Hh,Fj]=αj(h)Fj. Every term of Ei(a) has weight equal to the weight of a plus αi, by induction on word length (the extra term occurs only when i=j). Hence [Hh,Ei]=αi(h)Ei. All defining relations hold and give a representation for each λ.

F1given
2.1

A negative bracket word acts by left multiplication by the same tensor commutator word. Its value on 1 is that word. The composite of the free negative Lie algebra with this evaluation is the injection of F2, so its map into n~ is injective as well as surjective. Also Hh1=λ(h) for every λ, so a Cartan element killed by the presentation must be zero. The assignment eifi, fiei, hh preserves each relation: for example [fi,ej]=δijhi. Its square is the identity. It proves freeness of the positive half too.

F1F2step 1.1
3.1

Jacobi gives [fi,[ej,u]]=δij[hi,u]+[ej,[fi,u]]. Induction on the length of the positive word u therefore gives [fi,n~+]h+n~+. The analogous inclusion holds with signs reversed. The span S=n~+h+n~+ is consequently stable under brackets with every generator, so iterated brackets span only S and S=g~.

F1step 2.1
4.1

If u+h+u+=0, evaluation on 1 in step 1.1 gives u(1)+λ(h)1=0. The first term has positive tensor length, so both terms vanish. Varying λ kills h, and F2 kills u. Then u+=0 as well. Homogeneity of the defining ideal gives a direct grading; Jacobi gives [h,x]=β(h)x in degree β. Independence of the αi identifies distinct degrees with distinct weights. Thus the displayed grading has exactly the asserted signs and zero part.

F1F2step 1.1step 2.1step 3.1

Sources

Source comparison: Kleshchev, Theorem 1.3.3, pp.13–16; full tensor-module argument.

Depends on

Used by

Cited to discharge well-definedness by Contragredient lie algebra before the maximal ideal quotient.

Dependency tree · two levels

6 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