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 , the positive Serre relations are and , with the two analogous negative relations. The algebra is and its six roots are .
Facts & Assumptions
Given: The symmetric A2 matrix with D=I.
The separate half presentations and triangular decomposition follow from Serre generation. (Serre presentation of a kac moody algebra).
Verification
Set . The two positive relations say . Hence the span of 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 , the Cartan has dimension two, so F1 gives .
Take , , , , and . The identity gives , , , and zero second brackets , with the analogous negative zeros. For a diagonal , . Thus , give . All presentation relations hold, so F1 gives a homomorphism.
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.
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
- Kleshchev, Lectures on Infinite Dimensional Lie Algebras — Example 1.5.2, pp.20–21; complete A2 matrix calculation (standard reference, not scraped)