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

An evaluation module for affine sl2

Example

On V=C2, let e=(0100), f=(0010) and h=diag(1,1). For a0 set xmv=amxv and cv=0. This is a level-zero representation of the derived affine algebra and has no compatible action of d.

Facts & Assumptions

Given: The displayed matrices, aC× and V=C2.

[F1]

Evaluation representations are Evaluation module at a nonzero loop parameter.

Verification

1.1

Direct multiplication gives [e,f]=h, [h,e]=2e, [h,f]=2f. Thus these matrices represent sl2, and [amx,any]=am+n[x,y]. This is the image of the affine mode bracket because the added central term acts zero. F1 consequently gives the claimed representation for all positive, zero and negative modes. The central operator is zero, so its level is zero.

F1givenalgebra
2.1

The matrix e is nonzero, so F2 excludes an extension. Explicitly, mode zero would give [D,e]=0, while mode one would give [D,ae]=ae. Bilinearity makes the latter left side zero, but ae0, a contradiction. This holds also at a=1, and negative powers are defined precisely because a0. All vectors and operators are explicit; no AC is used.

F2step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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