Alphabeta Math
Pipeline-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.

Yangians, Quantum Affine Algebras, and Transfer Matrices

1 · Prerequisites

2 · Summary

This page develops one exact spectral model: the type-A RTT Yangian Yi(glN) over C, for N≥2, with rational difference parameter and RN(x)=xI+iPN. It does not identify this Yangian with a quantum affine algebra Uq(g^), nor assert results for other ranks, types, or completed universal R-matrices. The normalization relation to the common zI−P convention is recorded explicitly in The rational i-normalization is the standard RTT normalization after rescaling.

All spectral R-matrices here are ordinary finite-dimensional operators. At N=2, The rational spin-1/2 spectral R-matrix and The rational spin-1/2 spectral R-matrix satisfies Yang-Baxter are the single canonical finite C2 carriers; this page reuses those exact definitions in the rank-two specialization and proves the higher-rank permutation identity locally. The existing singular-parameter example remains an example only and is not used as a proof supplier.

Companion: yangians-quantum-affine-and-transfer-matrices-examples.

Reading prerequisites

Proposed reading order: hopf-hecke-and-quantum-symmetry-interfaces, affine-current-algebras-virasoro-and-sugawara, cyclotomic-klr-algebras-and-highest-weight-categorification. These page-level reading prerequisites follow the current plan; only the explicit item links in each proof are logical suppliers. The finite spectral R-matrix comes from the first route, while the affine-current and KLR pages provide surrounding context and do not enter the local proofs below.

Existing library route

RTT algebra and evaluation modules

The type-A RTT Yangian in the rational i-normalization fixes the field, rank, matrix-unit convention, formal-series RTT relation, and spectral normalization. The reusable coefficient identity is derived in The RTT relation has an explicit component commutator form. The RTT Yangian has its standard Hopf structure verifies the coproduct, counit, and formal inverse antipode rather than importing Hopf identities without checking the RTT convention. The evaluation formula on any left glN-module is defined in Evaluation modules of the type-A RTT Yangian and its component RTT relations are checked in The gl_N evaluation formula satisfies RTT.

The parameter change z=iu converts this local Ri(x)=xI+iP convention to R0(z)=zI−P; it also sends an evaluation parameter a to ia (The rational i-normalization is the standard RTT normalization after rescaling). This is a normalization equivalence, not an identification with the separate quantum-affine or shifted finite-W constructions.

Rational intertwiner and finite periodic chain

The type-A rational R-matrix satisfies Yang–Baxter and has exact singular parameters proves the parameterized Yang–Baxter equation in every N≥2, reuses the exact batch-64 result at N=2, and gives the full singular-parameter and rank boundary. The rational R-matrix intertwines two fundamental evaluation orders specializes that identity to two dual-natural evaluation modules and states the intertwiner orientation and invertibility condition.

For a finite chain of dual-natural evaluation sites with arbitrary complex inhomogeneities, Finite periodic fundamental evaluation chain and transfer matrix fixes the ordered monodromy and ordinary untwisted auxiliary trace. The periodic fundamental monodromy satisfies RTT proves RTT by local Yang–Baxter and induction on the number of sites. Finite periodic transfer matrices commute uses the inverse only away from the two singular differences and extends commutation to every pair of parameters by polynomial identity.

One-root Bethe statement and its limit

The gl2 carrier The one-root gl2 Bethe equation cancels the unwanted transfer term derives both RTT commutation formulas and shows exactly how a(v)=d(v) cancels the unwanted one-root term, on a common regular spectral domain realizing the RTT identities and under the nonzero Bethe-vector condition. It makes no completeness claim. The companion page supplies a direct failure case.

The transfer theorem is for a finite algebraic vector space, periodic boundary (ordinary trace, no twist), and the explicit fundamental Lax operators above. It proves commuting transfer matrices only. It does not prove Hermiticity, Yangian invariance of a periodic Hamiltonian, existence of a complete Bethe basis, or continuum/thermodynamic claims.

The RTT arguments use finite-dimensional auxiliary matrix spaces and formal series. The evaluation theorem allows arbitrary left glN-modules as coefficient spaces, including infinite-dimensional ones; the Bethe lemma likewise allows representations whose spaces need not be finite-dimensional, provided their operators admit the stated common spectral realization. The periodic-chain definition separately fixes a finite-dimensional quantum space. Tensor bases for the finite-dimensional auxiliary spaces and their finite tensor powers are explicitly indexed; no proof relies on the TikZ notation diagrams.

Canonical suppliers and reuse boundaries

Conventions, diagrams, and sources

Apply the definition and diagram contracts and prerequisite and repair holds before treating any proposed result as a supplier. All diagrammatic operations require defined domains, codomains, orientations, coefficients, and algebraic verification. Existing carriers keep their canonical identities and placements. Physics-only mathematical carriers require the supported same-ID resolver route specified in those contracts; links here do not establish that route.

Full page contract: placement inventory (entry yangians-quantum-affine-and-transfer-matrices). The original audited research inventory and its historical audit receipt remain unchanged.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The type-A RTT Yangian in the rational i-normalization

Definition

Fix an integer N≥2, the field C, and the ordered vector-space basis e1,…,eN of VN=CN. For 1≤i,j≤N, write Eij for the matrix unit at zero-based position (i−1,j−1) of Matrix units Eij and the Kronecker delta, with es the column supported at coordinate s−1; thus Eijes=δjsei. This reindexes the supplier by 1,…,N, and glN(C) means MN(C) with the commutator bracket. Tensor products are over C and use the fixed finite tensor convention of The rational spin-1/2 spectral R-matrix; the elementary tensors form the basis supplied by The elementary tensors of two bases form the product basis of the tensor product.

Define the flip PN∈End⁡(VN⊗VN) by PN(ea⊗eb)=eb⊗ea, and set RN(x)=xI+iPN, where i2=−1. For VN⊗3, P12,P13,P23 swap the indicated positions and Rab(x)=xI+iPab. Products mean composition, with the rightmost factor applied first.

Let tij(r) for 1≤i,j≤N and r≥1 be generators, and put tij(u)=δij+∑r≥1tij(r)u−r and T0(u)=∑i,jEij(0)⊗tij(u). On two auxiliary copies of VN, define T1(u)=∑i,jEij⊗I⊗tij(u) and T2(v)=∑i,jI⊗Eij⊗tij(v), with the third tensor position the coefficient space. The RTT Yangian Yi(glN) is the unital associative C-algebra on these generators modulo the coefficientwise formal-series relation

R12(u−v)T1(u)T2(v)=T2(v)T1(u)R12(u−v).

Here the relation means that every coefficient vanishes after expanding each tij at u=v=∞.

The normalization is rational and difference-form. At N=2 its R-family is exactly the existing finite supplier The rational spin-1/2 spectral R-matrix; this definition uses that carrier for the rank-two instance and introduces no second C2 model.

The proposed coproduct and counit are Δ(tij(u))=∑ktik(u)⊗tkj(u) and ϵ(tij(u))=δij. The formal antipode is S(T0(u))=T0(u)−1. Their well-definedness and Hopf identities are proved in The RTT Yangian has its standard Hopf structure ↗.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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)Δ.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Evaluation modules of the type-A RTT Yangian

Definition

Let N≥2, let glN(C)=MN(C) with commutator bracket, and use the 1≤i,j≤N convention of The type-A RTT Yangian in the rational i-normalization: Eij is the matrix unit at zero-based position (i−1,j−1) in Matrix units Eij and the Kronecker delta. For a left glN-module W with action ρ and a parameter a∈C, define the candidate evaluation module W(a) by the generating-series action

tij(u)⟼δijIW−iρ(Eij)u−a,

where (u−a)−1=u−1∑r≥0(a/u)r is expanded at u=∞. The map defines a Yangian module by The gl_N evaluation formula satisfies RTT ↗. The rational expression has at most a simple pole at u=a; the formal series is always defined.

The dual-natural vector space VN∨ has basis f1,…,fN and the candidate action ρ∨(Eij)fk=−δikfj. The following well-definedness theorem verifies that this is a glN-module. On it, the auxiliary matrix of the evaluation series is I+iPN/(u−a), so the unnormalized Lax matrix (u−a)T0(u) is RN(u−a)=(u−a)I+iPN.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The gl_N evaluation formula satisfies RTT

Statement

Let N≥2, let W be a left glN(C)-module with action ρ, and let a∈C. The assignment in Evaluation modules of the type-A RTT Yangian extends to a representation of Yi(glN) on W(a). In particular, the dual-natural action ρ∨(Eij)fk=−δikfj is a glN-representation, and its unnormalized auxiliary Lax matrix equals RN(u−a).

Facts & Assumptions

Given: The RTT Yangian of The type-A RTT Yangian in the rational i-normalization, a glN-module W, its action ρ, and a spectral shift a∈C.

[F1]

The type-A RTT Yangian in the rational i-normalization: RN(x)=xI+iPN, and the defining relation is R12(u−v)T1(u)T2(v)=T2(v)T1(u)R12(u−v).

[F2]

Evaluation modules of the type-A RTT Yangian: the proposed generator action is tij(u)=δijIW−iρ(Eij)/(u−a), and the dual-natural action is Eijfk=−δikfj.

[F3]

The type-A RTT Yangian in the rational i-normalization reindexes Matrix units Eij and the Kronecker delta: for 1≤i,j≤N, Eij is the unit at zero-based position (i−1,j−1) and es is supported at coordinate s−1, so Eijes=δjsei.

[F4]

The RTT relation has an explicit component commutator form: x[tij(u),tkl(v)]=i(tkj(v)til(u)−tkj(u)til(v)) for x=u−v is equivalent to the matrix RTT relation.

Proof

1.1givenF2F3algebra

Let e1,…,eN be the standard column basis. By [F3], Eijes=δjsei, so EijEkles=δjkδlsei=(δjkEil)es for every s. Hence EijEkl=δjkEil and [Eij,Ekl]=δjkEil−δliEkj. On a dual basis vector fs, the explicit commutator is [ρ∨(Eij),ρ∨(Ekl)]fs=δksδilfj−δisδjkfl. The right side is also ρ∨(δjkEil−δliEkj)fs, by the same formula. Thus the dual-natural operators satisfy the matrix-unit bracket and form a glN-representation.

2.1givenF2F4step 1.1algebra

Put x=u−v, U=u−a, and V=v−a. By [F4], the required component identity is the RTT relation to check. Under [F2], its left side is −x(δjkρ(Eil)−δliρ(Ekj))/(UV) by the bracket relation. In the parenthesized difference on the right, the quadratic terms cancel because both are (−i)2ρ(Ekj)ρ(Eil)/(UV). Its linear terms are −iδkjρ(Eil)(U−1−V−1)−iδilρ(Ekj)(V−1−U−1)=ix(δjkρ(Eil)−δliρ(Ekj))/(UV), since V−U=−x. Multiplication by the outer factor i therefore gives the same left side. Thus every component RTT relation holds.

3.1givenF1F2step 1.1step 2.1algebra∎

The component relations are exactly the coefficients of the matrix relation [F1]. Thus the images of every defining relation vanish, so the assignment on the free generators factors through the RTT quotient and defines the representation W(a). For W=VN∨, its auxiliary matrix is I+iPN/(u−a) by the explicit sum ∑i,jEij⊗Eji=PN; multiplying by u−a gives RN(u−a).

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The rational i-normalization is the standard RTT normalization after rescaling

Statement

Let Ri(x)=xI+iPN be the normalization of The type-A RTT Yangian in the rational i-normalization, and define the standard polynomial Yang matrix R0(z)=zI−PN. The change of spectral variable z=iu, with T~(z)=T(−iz), converts the RTT relation for Ri to the standard RTT relation for R0. Under this change the evaluation parameter a becomes ia.

Facts & Assumptions

Given: N≥2, Ri(x)=xI+iPN, the RTT relation, and the evaluation-module formula of Evaluation modules of the type-A RTT Yangian.

[F1]

The type-A RTT Yangian in the rational i-normalization: Ri(x)=xI+iPN and Ri(u−v)T1(u)T2(v)=T2(v)T1(u)Ri(u−v).

[F2]

Evaluation modules of the type-A RTT Yangian: tij(u)=δijI−iρ(Eij)/(u−a).

Proof

1.1givenF1algebra

Direct substitution gives Ri(−i(z−w))=−i((z−w)I−PN)=−iR0(z−w).

2.1givenF1step 1.1algebra

Substitute u=−iz and v=−iw in the RTT relation [F1]. By step 1.1, each side has the same nonzero scalar factor −i, which cancels; the resulting relation is R0(z−w)T~1(z)T~2(w)=T~2(w)T~1(z)R0(z−w).

3.1givenF2algebra∎

In the evaluation module, substitute u=−iz into [F2]. Since −iz−a=−i(z−ia), one obtains tij(−iz)=δijI+ρ(Eij)/(z−ia). Thus the shifted standard evaluation parameter is exactly ia.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The type-A rational R-matrix satisfies Yang–Baxter and has exact singular parameters

Statement

Let N≥2 and let RN(x)=xI+iPN be as in The type-A RTT Yangian in the rational i-normalization. For all a,b,c∈C, with x=a−b, y=b−c, and z=a−c=x+y,

R12(x)R13(z)R23(y)=R23(y)R13(z)R12(x)

on VN⊗3. Moreover, RN(x)−1=(xI−iPN)/(x2+1) when x∉{i,−i}. At x=i the kernel is ⋀2VN and the rank is N(N+1)/2; at x=−i the kernel is Sym⁡2VN and the rank is N(N−1)/2.

Facts & Assumptions

Given: N≥2, the standard basis of VN, and arbitrary a,b,c∈C.

[F1]

The type-A RTT Yangian in the rational i-normalization: PN(ej⊗ek)=ek⊗ej, RN(x)=xI+iPN, and Pij swaps the indicated tensor positions.

[F2]

The rational spin-1/2 spectral R-matrix: on the ordered basis of C2, P(ej⊗ek)=ek⊗ej and R(x)=xI+iP.

[F3]

The rational spin-1/2 spectral R-matrix satisfies Yang-Baxter: for all complex spectral points, the corresponding un-checked three-leg operators satisfy the parameterized Yang–Baxter identity.

Proof

1.1givenF1F2F3

For N=2, the ordered basis and flip in [F1] are exactly those in [F2], so R2(x)=R(x) on the same C2⊗C2. The un-checked Yang–Baxter identity for this case is [F3].

1.2givenF1algebra

For N≥3, put s=P12, t=P13, and r=P23. Acting on any basis tensor ep⊗eq⊗eℓ, the products st,tr,rs all send (p,q,ℓ) to (q,ℓ,p), while sr,rt,ts all send it to (ℓ,p,q); also str=rts as both send (p,q,ℓ) to (ℓ,q,p). Hence, as operators, with A=st=tr=rs and B=sr=rt=ts, those permutation identities hold on the whole basis.

1.3givenF1algebra

The flip satisfies PN2=I, so direct multiplication gives (xI+iPN)(xI−iPN)=(x2+1)I=(xI−iPN)(xI+iPN). Over C, x2+1≠0 exactly when x∉{i,−i}; division by this scalar gives the stated inverse.

2.1givenF1step 1.1step 1.2algebra

Expanding the left side gives xyzI+i(yz s+xy t+xz r)−(y st+z sr+x tr)−i str; the right side gives xyzI+i(yz s+xy t+xz r)−(x rt+z rs+y ts)−i rts. By step 1.2, the quadratic parts are respectively −((x+y)A+zB) and −(zA+(x+y)B), which agree since x+y=z; the scalar and linear parts match termwise and the cubic terms match by str=rts. This proves the Yang–Baxter identity for all N≥3, and step 1.1 covers N=2.

3.1givenF1step 1.3algebra∎

The operators P+=(I+PN)/2 and P−=(I−PN)/2 are complementary projectors because PN2=I. Their images have bases ej⊗ej, ej⊗ek+ek⊗ej and ej⊗ek−ek⊗ej for j<k, respectively, so their dimensions are N(N+1)/2 and N(N−1)/2. On these subspaces RN(x) acts by x+i and x−i; therefore at x=i it has kernel im⁡P−=⋀2VN, and at x=−i it has kernel im⁡P+=Sym⁡2VN, with the ranks stated.

Diagram

Each arrow is a composite endomorphism of VN⊗3, with its rightmost factor applied first. The diagram records the two sides of the equation just proved; the equality follows from the basis-permutation calculation in the proof, not from the diagram.

V¬3NV¬3NR12(x)R13(z)R23(y)R23(y)R13(z)R12(x)
LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The rational R-matrix intertwines two fundamental evaluation orders

Statement

Let N≥2, a,b∈C, and let Wa=Wb=VN∨ carry the evaluation actions with parameters a and b from Evaluation modules of the type-A RTT Yangian. On the same ordered space Wa⊗Wb, write ρΔ for the coproduct action and ρΔop for the action obtained by using Δop=σ∘Δ, where σ(x⊗y)=y⊗x. Their auxiliary generating matrices are respectively T0a(u)T0b(u) and T0b(u)T0a(u). Identify the indexed dual bases with the standard basis when defining Rab=RN(a−b)=(a−b)I+iPN on this space. For every generating-series coefficient,

ρΔ(tij(u))Rab=RabρΔop(tij(u)).

Thus Rab is an intertwining linear map; it is an isomorphism when a−b∉{i,−i}. At the two exceptional differences the same intertwining identity holds, but the map is singular as described in The type-A rational R-matrix satisfies Yang–Baxter and has exact singular parameters.

Facts & Assumptions

Given: The Hopf coproduct, the two evaluation modules, and the rational spectral R-matrix with its spectral Yang–Baxter equation.

[F1]

The RTT Yangian has its standard Hopf structure: Δ(T(u))=T[1](u)T[2](u) is a coassociative coproduct; applying the tensor flip to Δ reverses the two matrix factors.

[F2]

The gl_N evaluation formula satisfies RTT: for any glN-module and parameter c, tij(u)=δij−iρ(Eij)/(u−c) defines a Yangian action; on VN∨ its auxiliary Lax matrix is RN(u−c).

[F3]

The type-A rational R-matrix satisfies Yang–Baxter and has exact singular parameters: R12(x)R13(x+y)R23(y)=R23(y)R13(x+y)R12(x), and RN(d) is invertible exactly when d∉{i,−i}.

[F4]

Evaluation modules of the type-A RTT Yangian: VN∨(a) has the dual-natural action and its auxiliary series is I+iPN/(u−a), whose polynomial Lax matrix is RN(u−a).

Proof

1.1givenF1F2F4algebra

On the same ordered space Wa⊗Wb, the coproduct action has auxiliary matrix T0(u)=T0a(u)T0b(u) by [F1]. The opposite coproduct reverses those two matrix factors, giving T0b(u)T0a(u). Multiplying both by the scalar (u−a)(u−b) gives the polynomial products L0a(u−a)L0b(u−b) and L0b(u−b)L0a(u−a), since [F2] and [F4] give L0c(u−c)=R0c(u−c) for c=a,b.

2.1givenF2F3step 1.1algebra

Apply the spectral Yang–Baxter identity [F3] on auxiliary space 0 and quantum spaces a,b, using their indexed-basis identifications and spectral points u,a,b. It gives L0a(u−a)L0b(u−b)Rab(a−b)=Rab(a−b)L0b(u−b)L0a(u−a). Since (u−a)(u−b) is nonzero and invertible in the scalar Laurent-series field at infinity, cancel it from the two polynomial Lax products in step 1.1. The resulting identity is the claimed intertwining relation for T0(u), and equality of its matrix entries gives it for each tij(u) coefficient.

3.1givenF3step 2.1algebra∎

If a−b∉{i,−i}, [F3] makes Rab invertible, so the intertwiner is an isomorphism. At a−b=i its kernel is antisymmetric, and at a−b=−i its kernel is symmetric, by [F3]; the identity in step 2.1 still holds because the Yang–Baxter identity is polynomial and no inverse was used.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Finite periodic fundamental evaluation chain and transfer matrix

Definition

Fix N≥2, a chain length m≥1, and inhomogeneities a1,…,am∈C. The quantum space is the finite-dimensional vector space H=(VN∨)⊗m, where each factor is the dual-natural evaluation module with its own parameter aj from Evaluation modules of the type-A RTT Yangian; well-definedness is supplied by The gl_N evaluation formula satisfies RTT. Let V0=VN be an auxiliary copy. Identify the ordered bases ei and fi when defining P0j(ep⊗fq)=eq⊗fp, with all other quantum factors unchanged, and put

L0j(u)=(u−aj)I+iP0j=R0j(u−aj),M0(u)=L01(u)L02(u)⋯L0m(u).

Products are composition with the rightmost factor applied first. The un-twisted periodic transfer matrix is the polynomial τ(u)=tr⁡0M0(u)∈End⁡C(H)[u], where tr⁡0 is the ordinary matrix trace over the auxiliary basis and does not act on H. This definition asserts neither Bethe completeness nor Yangian invariance of a periodic Hamiltonian.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The periodic fundamental monodromy satisfies RTT

Statement

For the chain in Finite periodic fundamental evaluation chain and transfer matrix, let 0,0′ be two auxiliary copies and define M0′(v) by the same ordered product as M0(u). For all u,v∈C,

R00′(u−v)M0(u)M0′(v)=M0′(v)M0(u)R00′(u−v).

Facts & Assumptions

Given: A finite chain with the local Lax operators and order specified in Finite periodic fundamental evaluation chain and transfer matrix, and the polynomial spectral Yang–Baxter identity.

[F1]

Finite periodic fundamental evaluation chain and transfer matrix: M0(u)=∏j=1mL0j(u) in increasing site order, L0j(u)=R0j(u−aj), and different quantum sites are distinct tensor factors.

[F2]

The type-A rational R-matrix satisfies Yang–Baxter and has exact singular parameters: the polynomial R-matrix satisfies the spectral Yang–Baxter identity for all complex parameters.

Proof

1.1givenF1F2algebra

On a fixed site j, apply [F2] to auxiliary spectral points u,v and the site parameter aj. By the indexed-basis convention of [F1], the local relation is R00′(u−v)L0j(u)L0′j(v)=L0′j(v)L0j(u)R00′(u−v). If j≠k, then L0j(u) and L0′k(v) act on disjoint auxiliary and quantum tensor factors, so their coefficients commute and their operators commute.

1.2IHF1given

Assume it holds for m−1, and write M0(m)=M0(m−1)L0m and M0′(m)=M0′(m−1)L0′m.

2.1basestep 1.1

For m=1, the required equation is exactly step 1.1.

3.1F1step 1.1step 1.2inductiondischarge-induction: step 2.1algebra∎

Moving L0m past M0′(m−1) is valid by step 1.1. The induction hypothesis gives RM0(m)M0′(m)=M0′(m−1)M0(m−1)RL0mL0′m. Apply the local relation at site m, then commute L0′m past M0(m−1) because they act on distinct sites. The result is M0′(m)M0(m)R, proving the induction step and the claim for every finite m.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite periodic transfer matrices commute

Statement

For every finite chain in Finite periodic fundamental evaluation chain and transfer matrix, its ordinary un-twisted transfer matrices satisfy [τ(u),τ(v)]=0 for every u,v∈C. No genericity condition on the inhomogeneities is needed. The proof uses invertibility only for u−v∉{i,−i} and then extends the resulting polynomial identity to all spectral pairs.

Facts & Assumptions

Given: The finite-dimensional periodic chain, its polynomial monodromy and trace, and the monodromy RTT relation.

[F1]

Finite periodic fundamental evaluation chain and transfer matrix: H is finite dimensional, M0(u) is polynomial in u, and τ(u)=tr⁡0M0(u) is the ordinary auxiliary trace.

[F2]

The periodic fundamental monodromy satisfies RTT: R00′(u−v)M0(u)M0′(v)=M0′(v)M0(u)R00′(u−v) for every u,v.

[F3]

The type-A rational R-matrix satisfies Yang–Baxter and has exact singular parameters: RN(d) has a two-sided inverse if d∉{i,−i}.

Proof

1.1givenF1F2F3algebra

Suppose u−v∉{i,−i}. Multiplying the RTT identity [F2] on the right by R00′(u−v)−1, which exists by [F3], gives R00′M0(u)M0′(v)R00′−1=M0′(v)M0(u). Take the ordinary trace over the two auxiliary spaces. For a finite-dimensional auxiliary matrix X with coefficients in End⁡(H) and an invertible scalar auxiliary matrix R, tr⁡(RXR−1)=tr⁡(X): writing entries, ∑i,j,kRijXjk(R−1)ki=∑j,kXjk∑i(R−1)kiRij=∑jXjj, since scalar entries commute with the coefficients and R−1R=I. Thus the trace of the left side is tr⁡00′(M0(u)M0′(v)).

2.1givenF1step 1.1algebra

The tensor-space trace of M0(u)M0′(v) equals τ(u)τ(v), since the two auxiliary factors are independent and the coefficient order is u then v. The trace of M0′(v)M0(u) equals τ(v)τ(u) by the same index expansion with the coefficient order reversed. Step 1.1 therefore proves [τ(u),τ(v)]=0 whenever u−v∉{i,−i}.

3.1givenF1step 2.1algebra∎

Each matrix entry of [τ(u),τ(v)] is a polynomial in u,v by [F1]. For every fixed v, it vanishes for all but at most two values of u by step 2.1, hence is the zero polynomial in u; consequently it vanishes for all u,v. This proves the assertion also at u−v=±i, where the auxiliary R is singular.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The one-root gl2 Bethe equation cancels the unwanted transfer term

Statement

In Yi(gl2) write A(u)=t11(u), B(u)=t12(u), and D(u)=t22(u). Let H be a representation equipped with a common spectral domain D⊆C on which the represented series A(u),B(u),D(u) have defined, regular operator values and the component RTT identities from [F1] hold pointwise for u,v∈D with u≠v. Let Ω∈H and scalar-valued functions a,d, regular on D, satisfy A(u)Ω=a(u)Ω and D(u)Ω=d(u)Ω on D. For v∈D with B(v)Ω≠0, if the one-root Bethe equation a(v)=d(v) holds, then for every u∈D∖{v} the vector B(v)Ω is an eigenvector of A(u)+D(u) with eigenvalue

Λv(u)=u−v−iu−va(u)+u−v+iu−vd(u).

This one-root cancellation gives no completeness conclusion.

Facts & Assumptions

Given: The RTT presentation for N=2, a representation with common spectral domain D as specified in the statement, and a vector satisfying the displayed vacuum eigenvalue conditions there.

[F1]

The RTT relation has an explicit component commutator form: x[tij(u),tkl(v)]=i(tkj(v)til(u)−tkj(u)til(v)) for x=u−v.

Proof

1.1givenF1algebra

For u,v∈D with x=u−v≠0, apply [F1] to (i,j,k,l)=(1,2,1,1) and interchange u,v; rearranging gives A(u)B(v)=x−ixB(v)A(u)+ixB(u)A(v). Applying [F1] to (i,j,k,l)=(2,2,1,2) gives D(u)B(v)=x+ixB(v)D(u)−ixB(u)D(v). The common-domain assumption supplies these pointwise identities, and all divisions are by the nonzero scalar x.

2.1givenstep 1.1algebra∎

Apply these identities to Ω and use its eigenvalue conditions on D. The coefficient of B(u)Ω in (A(u)+D(u))B(v)Ω is i(a(v)−d(v))/x, which vanishes under a(v)=d(v). The remaining coefficient of B(v)Ω is exactly Λv(u), so the claimed eigenvector identity follows; nonzero-ness of B(v)Ω makes it an eigenvector rather than merely a zero-vector identity.

5 · Examples, counterexamples and false statements

None yet.

Sources