Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

Killing form of sl2

Example

Let k have characteristic zero and put g=sl2(k). For

e=(0100),f=(0010),h=(100−1),

one has K(h,h)=8, K(e,f)=K(f,e)=4, and all other basis pairings are zero. Thus K is nondegenerate.

Facts & Assumptions

Given: The displayed matrices over a characteristic-zero field.

[L1]

The Killing form is K(x,y)=tr⁡(ad⁡xad⁡y) (Killing form).

[L2]

A finite-dimensional characteristic-zero Lie algebra is semisimple exactly when its Killing form is nondegenerate (Cartan's semisimplicity criterion).

Verification

technique · direct matrix calculation
1.1givenalgebra

In the ordered basis (e,f,h), the relations [h,e]=2e, [h,f]=−2f, and [e,f]=h give ad⁡e=(00−2000010),ad⁡f=(000002−100),ad⁡h=(2000−20000).

2.1L1step 1.1algebra

Squaring the last matrix gives trace 8. Multiplying the first two matrices in either order gives trace 4. Their squares have trace zero, and multiplying either by ad⁡h in either order also has trace zero. By [L1], these are precisely the claimed pairings.

3.1L2step 2.1algebra∎

The Gram matrix has determinant det⁡(040400008)=−128. Characteristic zero makes this scalar nonzero, so K is nondegenerate. In particular [L2] recovers semisimplicity. Every basis pairing was calculated, including the zero pairings, and no choice principle is used.

Depends on

Used by

Dependency tree · two levels

7 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