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
define a coassociative coproduct, counit, and antipode. Thus they make a Hopf algebra. The inverse is the formal matrix inverse at .
Facts & Assumptions
Given: An integer , the RTT Yangian presentation, and the proposed maps above.
The type-A RTT Yangian in the rational i-normalization: satisfies , with proposed coproduct matrix product , counit , and antipode formula .
Proof
Each coefficient of is a finite sum: the coefficient of uses only the finitely many pairs of exponents adding to and the finite index sum . Thus the proposed coproduct lands in the ordinary algebraic tensor product. For two independent Yangian factors, write for the matrix acting on auxiliary leg and coefficient factor . Then commutes with , and commutes with , because each pair acts on disjoint tensor factors. Reordering these pairs and applying the RTT relation first in coefficient factor and then in factor gives . The middle matrix product is precisely the RTT relation for , so preserves the defining relation and extends to a unital algebra homomorphism.
Iterating the matrix product yields , so the coproduct is coassociative coefficientwise. Substitution sends the RTT relation to , so it defines a unital counit homomorphism; it also gives and .
Since , recursively solving 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 , because only products of at most positive-degree terms contribute to . Write and . In , multiply on the left by and on the right by to obtain . Define an anti-homomorphism on the free generator algebra by sending the coefficient matrix entrywise to this inverse matrix. Applying it to the defining RTT relator reverses coefficient multiplication, so its image is , exactly the same identity. Hence it preserves the RTT ideal and descends to the quotient, with .
The two matrix inverse identities give , the left and right antipode identities on generators. For the left identity on a product , use and anti-multiplicativity of to obtain ; the right identity follows from . Induction on word length and linearity extend both identities to the generated algebra, giving .
Depends on
Used by
- A one-root Bethe equation need not produce a complete set of vectors Counterexample
- The rational R-matrix intertwines two fundamental evaluation orders Lemma
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
- A. I. Molev, M. L. Nazarov, and G. I. Olshanski, Yangians and classical Lie algebras (standard reference, not scraped)
- F. Loebbert, Lectures on Yangian Symmetry (standard reference, not scraped)