Alphabeta Math
PropositionStatement: 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 Yangian has its standard Hopf structure

Statement

For the algebra of The type-A RTT Yangian in the rational i-normalization, the coefficientwise assignments into the ordinary algebraic tensor product

Δ(tij(u))=∑k=1Ntik(u)⊗tkj(u),ϵ(tij(u))=δij,S(T0(u))=T0(u)−1

define a coassociative coproduct, counit, and antipode. Thus they make Yi(glN) a Hopf algebra. The inverse is the formal matrix inverse at u=∞.

Facts & Assumptions

Given: An integer N≥2, the RTT Yangian presentation, and the proposed maps above.

[F1]

The type-A RTT Yangian in the rational i-normalization: T0(u)=I+O(u−1) satisfies R12(u−v)T1(u)T2(v)=T2(v)T1(u)R12(u−v), with proposed coproduct matrix product Δ(T0(u))=T0[1](u)T0[2](u), counit ϵ(T0(u))=I, and antipode formula S(T0(u))=T0(u)−1.

Proof

1.1givenF1algebra

Each coefficient of T[1](u)T[2](u) is a finite sum: the coefficient of u−n uses only the finitely many pairs of exponents adding to n and the finite index sum 1≤k≤N. Thus the proposed coproduct lands in the ordinary algebraic tensor product. For two independent Yangian factors, write Ts[r] for the matrix acting on auxiliary leg s∈{1,2} and coefficient factor r∈{1,2}. Then T1[2] commutes with T2[1], and T1[1] commutes with T2[2], because each pair acts on disjoint tensor factors. Reordering these pairs and applying the RTT relation first in coefficient factor 1 and then in factor 2 gives R12T1[1]T1[2]T2[1]T2[2]=T2[1]T2[2]T1[1]T1[2]R12. The middle matrix product is precisely the RTT relation for Δ(T), so Δ preserves the defining relation and extends to a unital algebra homomorphism.

2.1givenF1step 1.1algebra

Iterating the matrix product yields (Δ⊗id)Δ(T)=T[1]T[2]T[3]=(id⊗Δ)Δ(T), so the coproduct is coassociative coefficientwise. Substitution T↦I sends the RTT relation to R=R, so it defines a unital counit homomorphism; it also gives (ϵ⊗id)Δ(T)=T=(id⊗ϵ)Δ(T) and ϵ(1)=1.

2.2givenF1step 1.1algebra

Since T(u)=I+O(u−1), recursively solving T(u)T(u)−1=I gives a unique right inverse; solving in the reverse order gives a left inverse, and associativity makes them equal. Each inverse coefficient is a finite polynomial in the coefficients of T−I, because only products of at most n positive-degree terms contribute to u−n. Write A=T1(u) and B=T2(v). In RAB=BAR, multiply on the left by A−1B−1=(BA)−1 and on the right by B−1A−1=(AB)−1 to obtain A−1B−1R=RB−1A−1. Define an anti-homomorphism on the free generator algebra by sending the coefficient matrix T(u) entrywise to this inverse matrix. Applying it to the defining RTT relator reverses coefficient multiplication, so its image is RB−1A−1=A−1B−1R, exactly the same identity. Hence it preserves the RTT ideal and descends to the quotient, with S(T(u))=T(u)−1.

3.1givenF1step 1.1step 2.2algebra∎

The two matrix inverse identities give ∑kS(tik(u))tkj(u)=δij=∑ktik(u)S(tkj(u)), the left and right antipode identities on generators. For the left identity on a product xy, use Δ(xy)=∑x(1)y(1)⊗x(2)y(2) and anti-multiplicativity of S to obtain ∑S(y(1))S(x(1))x(2)y(2)=ϵ(x)∑S(y(1))y(2)=ϵ(x)ϵ(y)1; the right identity follows from ∑x(1)y(1)S(y(2))S(x(2)). Induction on word length and linearity extend both identities to the generated algebra, giving m(S⊗id)Δ=ηϵ=m(id⊗S)Δ.

Depends on

Used by

Cited to discharge well-definedness by The type-A RTT Yangian in the rational i-normalization.

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