Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 RTT relation has an explicit component commutator form

Statement

For the presentation in The type-A RTT Yangian in the rational i-normalization, set x=u−v. For every 1≤i,j,k,l≤N, its matrix RTT relation is equivalent coefficientwise to

x[tij(u),tkl(v)]=i(tkj(v)til(u)−tkj(u)til(v)).

Facts & Assumptions

Given: The two-auxiliary-leg RTT matrix relation with RN(x)=xI+iPN.

[F1]

The type-A RTT Yangian in the rational i-normalization: RN(x)=xI+iPN with the auxiliary flip PN(ea⊗eb)=eb⊗ea, and R12(u−v)T1(u)T2(v)=T2(v)T1(u)R12(u−v).

Proof

1.1givenF1algebra

In the coefficient of the auxiliary row (i,k) and column (j,l), the xI part of the left side is xtij(u)tkl(v) and the iP part is itkj(u)til(v), because the flip sends the row (i,k) to (k,i). On the right side the corresponding terms are xtkl(v)tij(u) and itkj(v)til(u), since the flip acts on the column. Thus equality of those matrix entries gives xtij(u)tkl(v)+itkj(u)til(v)=xtkl(v)tij(u)+itkj(v)til(u).

2.1givenF1step 1.1algebra∎

Subtract the two x-terms and move the two i-terms to the other side. The result is exactly the displayed commutator relation. Conversely, if that relation holds for every four indices, the coefficient computation in step 1.1 makes every auxiliary matrix entry of the RTT difference zero, hence the full matrix relation holds.

Depends on

Used by

Dependency tree · two levels

4 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