Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The a2 serre relations

Example

For A=(2112), the positive Serre relations are [e1,[e1,e2]]=0 and [e2,[e2,e1]]=0, with the two analogous negative relations. The algebra is sl3(C) and its six roots are ±α1,±α2,±(α1+α2).

Facts & Assumptions

Given: The symmetric A2 matrix with D=I.

[F1]

The separate half presentations and triangular decomposition follow from Serre generation. (Serre presentation of a kac moody algebra).

Verification

1.1

Set z=[e1,e2]. The two positive relations say [e1,z]=[e2,z]=0. Hence the span of e1,e2,z is a Lie subalgebra containing the positive generators and equals the positive half. The same argument gives at most three dimensions for the negative half. Since detA=3, the Cartan has dimension two, so F1 gives dimg8.

F1given
1.2

Take e1=E12, e2=E23, f1=E21, f2=E32, h1=E11E22 and h2=E22E33. The identity [Eab,Ecd]=δbcEadδdaEcb gives [e1,e2]=E13, [f2,f1]=E31, [ei,fj]=δijhi, and zero second brackets [E12,E13]=[E23,E13]=0, with the analogous negative zeros. For a diagonal h=diag(t1,t2,t3), [h,Eab]=(tatb)Eab. Thus α1=t1t2, α2=t2t3 give (αj(hi))ij=A. All presentation relations hold, so F1 gives a homomorphism.

F1given
2.1

The six off-diagonal matrix units and the two displayed diagonal matrices are independent and span all traceless matrices. Step 1.2 therefore gives a surjection onto an eight-dimensional algebra; step 1.1 makes it an isomorphism. The diagonal commutator formula assigns the six weights stated in the example to these six units; the diagonal subspace has weight zero. Thus the root list is exhaustive, with each root multiplicity one.

step 1.1step 1.2

Sources

Source comparison: Kleshchev, Example 1.5.2, pp.20–21; complete A2 matrix calculation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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