Alphabeta Math
TheoremStatement: 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.

Loop and affine GCM presentations are isomorphic

Statement

Let A^ be the untwisted affine GCM of a finite-dimensional complex simple g, with normalized form and realized Cartan h^. The assignments e0fθt,f0eθt1,h0cθ, and the degree-zero assignments for the finite simple triples, together with the identity on h^, extend uniquely to an isomorphism g(A^)g^.

Facts & Assumptions

Given: The normalized finite simple algebra and the displayed assignments.

[F1]

The highest-root data and affine matrix realization are The affine simple root alpha zero is delta minus the highest root.

[F3]

For symmetrizable GCMs the Cartan and Serre relations present the algebra by Serre presentation of a kac moody algebra.

[F4]

Every nonzero ideal meets the Cartan in Kac moody algebra associated to a gcm.

[F5]

Finite simple generation and all root strings, including normalized rank-one triples, are Finite semisimple Cartan, root and string structure.

Proof

1.1

F1 gives [e0,f0]=h0 in the target. F2 gives the Cartan action with weights α0=δθ and α0, as well as commutativity of the Cartan. The finite simple brackets hold by F5. For i>0, [e0,fi] lies at finite weight θαi and [ei,f0] at θ+αi, both absent by highest-root maximality. Their mode degrees are nonzero, so no central term occurs. Thus every mixed relation [ei,fj]=δijhi holds.

F1F2F5algebra
1.2

The finite positive Serre relations follow from finite root strings. For i>0, fθ is a lowest vector for the ith finite triple, of weight θ(hi)=a^i0, because θαi is absent. Its raising string is killed after 1a^i0 applications of adei. Conversely ei is a highest vector for the θ triple, of weight αi(θ)=a^0i, since θ+αi is absent. Its lowering string is killed after 1a^0i applications of adfθ. If θ=αi, this is the adjoint rank-one string eθ,hθ,fθ,0 of length three. In the loop brackets the relevant positive mode degrees never produce a central term, so these are exactly the two Serre relations involving index zero. Interchanging raising and lowering and replacing every mode degree by its negative proves the negative Serre family by the same strings.

F1F2F5algebra
2.1

The matrix is symmetrizable by F1. Steps 1.1–1.2 and F3 therefore give a unique homomorphism φ:g(A^)g^ with the specified images. It fixes the embedded Cartan, so its kernel meets that Cartan trivially. F4 forces the kernel to be zero.

F1F3F4step 1.1step 1.2algebra
3.1

Its image contains g1 by F5. The set J+={xg:xtimφ} is an ideal in g, since [y1,xt]=[y,x]t. It contains the nonzero fθ, hence is all of g by simplicity. Likewise J={x:xt1imφ} contains eθ and is all of g.

F2F5step 2.1givenalgebra
4.1

Nonabelian simplicity gives [g,g]=g, because the derived algebra is a nonzero ideal. If all positive modes of degree k1 lie in the image, then [xt,ytk1]=[x,y]tk for k2; finite sums of these brackets span the degree-k mode. Induction from step 3.1 gives all positive modes. Bracketing degree 1 with degree (k1) gives all negative modes in the same way. The image already contains c,d through the Cartan. Hence it is the full affine algebra. Combined with step 2.1 this proves the isomorphism. All sums, string calculations and selections at a fixed mode are finite, with no AC.

F2step 2.1step 3.1algebra

Depends on

Used by

Dependency tree · two levels

21 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