Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 type-A quantum algebra and its tensor-action formulas

Definition

Let F=Q(q) with q an indeterminate, let N≥1, and put Ki=LiLi+1−1 for 1≤i<N. Start with the free associative F-algebra on Lj,Lj−1 (1≤j≤N) and Ei,Fi (1≤i<N), and quotient by the two-sided ideal generated by the following relations:

  1. LjLj−1=Lj−1Lj=1 and LjLk=LkLj for all j,k.
  2. LjEiLj−1=qδj,i−δj,i+1Ei and LjFiLj−1=q−δj,i+δj,i+1Fi.
  3. [Ei,Fj]=δij(Ki−Ki−1)/(q−q−1).
  4. [Ei,Ej]=[Fi,Fj]=0 when ∣i−j∣>1.
  5. For ∣i−j∣=1, Ei2Ej−(q+q−1)EiEjEi+EjEi2=0 and Fi2Fj−(q+q−1)FiFjFi+FjFi2=0.

Here [x,y]=xy−yx. The free algebra and quotient construction are those of The free associative R-algebra on a set and descent of relations; this definition asserts existence of the presented associative algebra, not the well-definedness of structural maps on its quotient.

On VN with ordered basis e1,…,eN, prescribe the candidate matrices Ljea=qδjaea,Eiea=δa,i+1ei,Fiea=δa,iei+1. Prescribe candidate coproduct and counit values by Δ(Lj)=Lj⊗Lj,Δ(Ei)=Ei⊗Ki+1⊗Ei,Δ(Fi)=Fi⊗1+Ki−1⊗Fi, and ϵ(Lj±1)=1, ϵ(Ei)=ϵ(Fi)=0. The following relation-descent lemma proves that these assignments define the vector representation and bialgebra structure, and hence the tensor actions used below.

Depends on

Used by

Dependency tree · two levels

48 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