Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 rational Yang–Baxter equation lifts to RTT

Statement

For the ordered periodic monodromies Ta(u):=RaN(u)⋯Ra1(u),Tb(v):=RbN(v)⋯Rb1(v), the finite-dimensional operator identity Rab(u−v)Ta(u)Tb(v)=Tb(v)Ta(u)Rab(u−v) holds on Va⊗Vb⊗VN for every u,v∈C.

Facts & Assumptions

Given: N≥3, u,v∈C, the spaces and ordered monodromies defined above, and the parameterized Yang–Baxter identity on three copies of V=C2.

[F1]

Ordered auxiliary-space monodromy: each Raj(u) acts only on the auxiliary factor and site j, and Ta(u)=RaN(u)⋯Ra1(u).

[F2]

The rational spin-1/2 spectral R-matrix satisfies Yang-Baxter: with x,y,z∈C, R12(x−y)R13(x−z)R23(y−z) equals R23(y−z)R13(x−z)R12(x−y) on V⊗3.

Proof

1.1givenF2algebra

In [F2] take x=u, y=v, z=0 and label the three factors 1=a, 2=b, 3=n. For each site n this gives Rab(u−v)Ran(u)Rbn(v)=Rbn(v)Ran(u)Rab(u−v). This identity acts on Va⊗Vb⊗Vn and as the identity on every other site.

2.1givenF1step 1.1algebra

Write Rab=Rab(u−v), Ran=Ran(u) and Rbn=Rbn(v). For 1≤n≤N set Ta(n)(u):=Ran(u)⋯Ra1(u) and Tb(n)(v):=Rbn(v)⋯Rb1(v). The case n=1 of the desired identity is step 1.1. Suppose it holds for n−1. Operators Ta(n−1) commute with Rbn(v), and Ran(u) commutes with Tb(n−1), because their auxiliary and physical tensor factors are disjoint. Therefore RabTa(n)Tb(n)=RabRanRbnTa(n−1)Tb(n−1)=RbnRanRabTa(n−1)Tb(n−1)=RbnRanTb(n−1)Ta(n−1)Rab=Tb(n)Ta(n)Rab, where the second equality is step 1.1 at site n, the third is the induction hypothesis, and the final equality uses the other disjoint-site commutation. The argument holds for each n up to N, proving the claimed RTT identity.

3.1step 2.1algebra∎

Taking n=N in step 2.1 gives the stated monodromy relation with Ta(N)=Ta and Tb(N)=Tb. No invertibility assumption on Rab(u−v) is used, so the identity also holds at its singular spectral differences.

Depends on

Dependency tree · 2 levels

Sources