Alphabeta Math
PropositionStatement: Literature-sourcedProof: 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.

Evaluation modules have level zero and do not extend canonically over d

Statement

Every evaluation module has c acting zero. If its finite g-action is nonzero, it has no compatible action of d. If the finite action is zero, every DEnd(V) defines an extension by letting d act as D. In that case D=0 is a natural choice, but the relations do not determine D when V0; for V=0 there is exactly one endomorphism. Thus evaluation gives a module for the derived affine algebra and does not in general extend to the full affine algebra.

Facts & Assumptions

Given: An evaluation module at a0.

[F1]

Modes act as amρ(x) and c acts zero by Evaluation module at a nonzero loop parameter.

[F2]

A full extension must satisfy [d,xm]=mxm by Degree derivation and full untwisted affine algebra.

[F3]

The scalar central-action meaning of level, including the zero-module qualification, is Null root, central coroot, and affine level.

Proof

1.1

F1 gives the zero central action, hence level zero in F3's scalar-action sense. A proposed operator D for d must satisfy [D,ρ(x)]=0 by F2 at mode m=0. At mode m=1 it must satisfy [D,aρ(x)]=aρ(x). The left side is a[D,ρ(x)]=0, so a0 forces ρ(x)=0 for every x. Thus a nonzero finite action cannot extend.

F1F2F3algebra
2.1

Conversely, if ρ=0, all loop and central actions are zero. For every D and every m, both sides of [D,amρ(x)]=mamρ(x) vanish; also [D,0]=0 for c and [D,D]=0 for d. The original loop relations already hold by F1, so this verifies every full-algebra relation. When V0, the operators 0 and idV are distinct compatible actions, proving nonuniqueness. When V=0 its only endomorphism is zero. These computations prove both directions of the exact extension criterion and use no AC.

F1F2step 1.1algebra

Depends on

Used by

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