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.

Rational Yang–Baxter transfer matrices and Heisenberg charges

1 · Prerequisites

2 · Summary

This page treats the finite homogeneous spin-half XXX chain with the fixed convention R(u)=uI+iP and ordered monodromy Ta(u)=RaN(u)⋯Ra1(u). The local Yang–Baxter identity gives the monodromy RTT relation and commuting transfer matrices, including at singular spectral differences by polynomial continuation. At the regular point, the transfer matrix is t(0)=iNU, with U the oriented cyclic shift; its logarithmic derivative gives the periodic exchange operator and its Pauli normalization. The page then defines regular on-shell Bethe data and proves the eigenvalue formula conditionally for the associated nonzero vectors. The spectral parameter is dimensionless. Singular-root regularization, descendants, completeness, thermodynamic Bethe ansatz, and empirical claims are outside this finite-chain development.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Ordered auxiliary-space monodromy

Definition

Fix an integer N≥3. Let V=C2 with ordered basis e↑,e↓, let VN=V⊗N in left-to-right site order, and let Va=V be an auxiliary copy. For u∈C, define Raj(u)=uIaj+iPaj on Va⊗VN, where Paj swaps the auxiliary factor and site j. Define Ta(u)=RaN(u)⋯Ra1(u),t(u)=tr⁡aTa(u), where products mean composition with the rightmost factor acting first, and tr⁡a is the ordinary finite-dimensional trace over Va. For distinct sites j,k, Pjk swaps those two tensor factors. Define the oriented cyclic shift by U(v1⊗⋯⊗vN)=vN⊗v1⊗⋯⊗vN−1. The spectral parameter u is dimensionless. All operators in this definition are finite-dimensional complex-linear endomorphisms.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Regular point and exchange logarithmic derivative

Statement

Let t(u) and U be the transfer matrix and cyclic shift defined by the ordered monodromy construction. Use the periodic convention PN,N+1:=PN,1. Then t(0)=iNU,i t′(0)t(0)−1=∑j=1NPj,j+1. In particular, t(0) is invertible. The derivative is with respect to the dimensionless complex parameter u.

Facts & Assumptions

Given: An integer N≥3 and the finite-dimensional spaces and operators of Ordered auxiliary-space monodromy.

[F1]

Ordered auxiliary-space monodromy: Ta(u)=RaN(u)⋯Ra1(u), t(u)=tr⁡aTa(u), Raj(u)=uI+iPaj, and U sends v1⊗⋯⊗vN to vN⊗v1⊗⋯⊗vN−1.

Proof

1.1givenF1algebra

At u=0, every factor is Raj(0)=iPaj, so t(0)=iNtr⁡a(PaN⋯Pa1). On an elementary chain tensor ej1⊗⋯⊗ejN, start the auxiliary factor at each basis vector ea in turn. The swaps pass ej1,…,ejN successively to the auxiliary factor and shift the preceding entries one site right; the auxiliary trace retains exactly the term with ea=ejN. The output is therefore ejN⊗ej1⊗⋯⊗ejN−1. These tensors form a basis, hence tr⁡a(PaN⋯Pa1)=U. As U permutes a basis, it is invertible, proving the first identity and invertibility of t(0).

2.1givenF1step 1.1algebra

Differentiate the finite product defining Ta(u) and use Raj′(0)=Iaj. For each m, let Dm=tr⁡a(PaN⋯Pa,m+1Pa,m−1⋯Pa1), with the factor Pam omitted. Following the auxiliary basis vector through the remaining swaps and taking its trace gives, for 2≤m<N, Dm(ej1⊗⋯⊗ejN)=ejN⊗(⨂r=1m−2ejr)⊗ejm⊗ejm−1⊗(⨂r=m+1N−1ejr). An empty tensor block in this display is omitted. For m=N the same calculation gives ejN−1⊗ej1⊗⋯⊗ejN−2⊗ejN; for m=1 it gives ej1⊗ejN⊗ej2⊗⋯⊗ejN−1. In each case this is exactly UPm−1,m applied to the input, with P0,1:=PN,1. Since the elementary tensors form a basis, Dm=UPm−1,m as operators. Thus t′(0)=iN−1∑m=1NUPm−1,m.

3.1givenF1step 1.1step 2.1algebra∎

From step 1.1, t(0)−1=i−NU−1. The definition of U shows UPm−1,mU−1=Pm,m+1 for 2≤m≤N, while UPN,1U−1=P1,2. Therefore t′(0)t(0)−1=i−1∑m=1NPm,m+1=−i∑m=1NPm,m+1. Multiplication by i proves the claimed logarithmic-derivative identity.

Remarks

The statement uses the ordered monodromy RaN⋯Ra1 and the stated orientation of U. Reversing either convention can change the direction of the cyclic shift and must be accompanied by a corresponding reindexing of the periodic bonds.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

RTT gives commuting periodic transfer matrices

Statement

For every u,v∈C, the transfer matrices t(u),t(v) of the ordered periodic monodromy on VN=(C2)⊗N satisfy [t(u),t(v)]=0. Near u=0, M(u):=t(0)−1t(u) has the analytic matrix logarithm with log⁡M(0)=0. Its Taylor-coefficient matrices commute pairwise and commute with every t(v).

Facts & Assumptions

Given: N≥3, u,v∈C, and the operators of Ordered auxiliary-space monodromy. Write [A,B]=AB−BA.

[F1]

Ordered auxiliary-space monodromy: on V=C2, Raj(z)=zI+iPaj, Ta(z)=RaN(z)⋯Ra1(z), and t(z)=tr⁡aTa(z).

[F2]

Regular point and exchange logarithmic derivative: t(0)=iNU is invertible.

[F3]

The rational Yang–Baxter equation lifts to RTT: Rab(u−v)Ta(u)Tb(v)=Tb(v)Ta(u)Rab(u−v) on Va⊗Vb⊗VN for every u,v∈C.

Proof

1.1givenF1F3algebra

Put s=u−v. Since Pab2=I and the mixed terms cancel, Rab(s)Rab(−s)=−(s2+1)I; hence Rab(s) is invertible for s≠i,−i. By [F3], Tb(v)Ta(u)=Rab(s)Ta(u)Tb(v)Rab(s)−1. The factor Rab acts only on the finite auxiliary space Va⊗Vb, so the ordinary finite trace over that space is cyclic even with operator-valued coefficients on VN. Also tr⁡ab(Ta(u)Tb(v))=t(u)t(v) and tr⁡ab(Tb(v)Ta(u))=t(v)t(u), by expanding each auxiliary matrix in matrix units. Taking tr⁡ab therefore proves [t(u),t(v)]=0 whenever u−v≠±i.

2.1step 1.1algebra

Each entry of t(u) is a polynomial in u, because it is the trace of a finite product of matrices whose entries are linear polynomials. Thus every entry of [t(u),t(v)] is a polynomial in (u,v). For each fixed v, it vanishes for every u except at most v+i and v−i; a one-variable polynomial with infinitely many zeros is zero. This holds for every v, so [t(u),t(v)]=0 for all complex u,v, including the two singular differences.

3.1givenF2step 2.1algebra∎

By [F2], t(0) is invertible; hence M(u)=t(0)−1t(u) is analytic near 0 and M(0)=I. Choose a submultiplicative matrix norm. Continuity of M gives a neighborhood of 0 where ∥M(u)−I∥<1, and there define log⁡M(u)=∑n≥1(−1)n+1(M(u)−I)n/n, a convergent matrix power series. Step 2.1 implies t(u) commutes with t(w) and every t(v); since t(0) is invertible, t(0)−1 commutes with them as well. Thus M(u), M(w), and each t(v) commute. Their logarithmic power series preserve these commutations. Comparing the convergent two-variable Taylor coefficients proves the coefficient matrices commute pairwise and with every t(v).

Diagram

The domain and codomain are Va⊗Vb⊗VN. The two arrows label the endomorphisms in the RTT supplier The rational Yang–Baxter equation lifts to RTT; composition is right-to-left. The diagram records that operator identity and adds no premise to the proof.

Va¬Vb¬VNVa¬Vb¬VNRab(u¡v)Ta(u)Tb(v)Tb(v)Ta(u)Rab(u¡v)
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Logarithmic derivative is periodic exchange

Statement

Use the periodic convention PN,N+1:=PN,1. The rational transfer matrix satisfies i t′(0)t(0)−1=∑j=1NPj,j+1. Consequently, for real J,c, the finite matrix HN:=J∑j=1NPj,j+1+cI is Hermitian and commutes with every t(u). If HN is interpreted as a physical energy in the stated QSM convention, J and c are in joules. For the Pauli matrices X=(0110),Y=(0−ii0),Z=(100−1), the adjacent swap on V⊗V is P=I+X⊗X+Y⊗Y+Z⊗Z2.

Facts & Assumptions

Given: N≥3, real scalars J,c, and the ordered monodromy of Ordered auxiliary-space monodromy. A real scalar multiple of a matrix is taken over C.

[F1]

Ordered auxiliary-space monodromy: Pjk swaps sites j,k on VN; the definition of Paj is the flip of the auxiliary factor and site j.

[F2]

Regular point and exchange logarithmic derivative: t(0) is invertible and i t′(0)t(0)−1=∑j=1NPj,j+1 with periodic bonds.

[F3]

RTT gives commuting periodic transfer matrices: [t(u),t(v)]=0 for every u,v∈C.

Proof

1.1givenF2F3algebra

Fix u∈C. Differentiate [t(u),t(v)]=0 from [F3] with respect to v at v=0; the entries are polynomials, so this gives [t(u),t′(0)]=0. Also [t(u),t(0)]=0. Since t(0) is invertible by [F2], multiplying t(u)t(0)=t(0)t(u) on the left and right by t(0)−1 shows [t(u),t(0)−1]=0. Therefore t(u) commutes with t′(0)t(0)−1.

2.1givenF2step 1.1algebra

Substitute [F2] into step 1.1 and multiply by the scalar iJ. The sum ∑jPj,j+1 therefore commutes with every t(u), and so does HN=J∑jPj,j+1+cI, since scalar multiples of the identity commute with all endomorphisms.

3.1givenF1algebra∎

Each Pj,j+1 is a real permutation matrix with Pj,j+12=I; therefore Pj,j+1∗=Pj,j+1−1=Pj,j+1, so the real linear combination HN is Hermitian. On the ordered basis ∣↑↑⟩,∣↑↓⟩,∣↓↑⟩,∣↓↓⟩ of V⊗V, the swap P fixes the first and fourth vectors and exchanges the middle two. Direct multiplication of the displayed Pauli matrices gives 12(I+X⊗X+Y⊗Y+Z⊗Z)∣↑↑⟩=∣↑↑⟩,12(I+X⊗X+Y⊗Y+Z⊗Z)∣↓↓⟩=∣↓↓⟩,12(I+X⊗X+Y⊗Y+Z⊗Z)∣↑↓⟩=∣↓↑⟩,12(I+X⊗X+Y⊗Y+Z⊗Z)∣↓↑⟩=∣↑↓⟩. These four vectors form a basis, so the displayed Pauli operator equals P.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Regular on-shell Bethe data without a completeness assumption

Definition

For the ordered monodromy on VN with V=C2, define the shifted site operator Laj(u):=Raj(u−i/2), shifted monodromy TaL(u):=LaN(u)⋯La1(u), and shifted transfer matrix τ(u):=tr⁡aTaL(u). In the ordered auxiliary basis e↑,e↓, write TaL(u)=(A(u)B(u)C(u)D(u))a,Ω:=e↑⊗N. For an integer M with 0≤M≤N, a regular on-shell Bethe datum is a tuple of finite complex numbers λ1,…,λM satisfying all of the following conditions:

  1. The roots are pairwise distinct, none equals i/2 or −i/2, and no difference λj−λk for j≠k equals i or −i.
  2. For each j=1,…,M, (λj+i/2λj−i/2)N=∏k≠jλj−λk+iλj−λk−i.
  3. The associated vector Ψ(λ1,…,λM):=B(λ1)⋯B(λM)Ω is nonzero.

For M=0 the root tuple and products are empty and Ψ=Ω. This definition records regular solutions and nonzero vectors only; it makes no claim of completeness, covers no singular-root regularization, and does not include descendants generated from other reference vectors.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Regular Bethe data give transfer-family eigenpairs

Statement

Let VN=(C2)⊗N, N≥3, with auxiliary copy Va=C2, Raj(u)=uI+iPaj, where Paj swaps the auxiliary factor with site j, and Laj(u)=Raj(u−i/2). Define TaL(u)=LaN(u)⋯La1(u), τ(u)=tr⁡aTaL(u), and the auxiliary entries TaL(u)=(A(u)B(u)C(u)D(u))a in the ordered basis e↑,e↓. Put Ω=e↑⊗N. Suppose finite roots λ1,…,λM, 0≤M≤N, are pairwise distinct, avoid ±i/2, have no pairwise difference equal to ±i, satisfy (λj+i/2λj−i/2)N=∏k≠jλj−λk+iλj−λk−i(1≤j≤M), and give the nonzero vector Ψ=∏j=1MB(λj)Ω. For u∉{λ1,…,λM} its eigenvalue is Λ(u)=(u+i/2)N∏j=1Mu−λj−iu−λj+(u−i/2)N∏j=1Mu−λj+iu−λj. The apparent poles cancel, so Λ extends to a polynomial and the eigenvector identity holds for every u∈C. This result asserts no converse, singular-root regularization, descendant construction, or completeness.

Facts & Assumptions

Given: N≥3, 0≤M≤N, finite pairwise distinct roots λ1,…,λM satisfying the displayed exclusions and Bethe equations, and the associated vector Ψ≠0.

[F1]

Ordered auxiliary-space monodromy: Raj(u)=uI+iPaj and the ordered monodromy is the product RaN(u)⋯Ra1(u).

[F2]

Regular on-shell Bethe data without a completeness assumption: Laj(u)=Raj(u−i/2), TaL(u)=LaN(u)⋯La1(u) has auxiliary entries A,B,C,D, Ω=e↑⊗N, the roots are regular and pairwise distinct, their Bethe equations hold, and Ψ=∏jB(λj)Ω≠0.

[F3]

The rational Yang–Baxter equation lifts to RTT: for all x,y∈C, Rab(x−y)Ta(x)Tb(y)=Tb(y)Ta(x)Rab(x−y).

Proof

1.1givenF1F3algebra

Apply [F3] at x=u−i/2 and y=v−i/2. Since the two shifts cancel in x−y, the shifted monodromies obey Rab(u−v)TaL(u)TbL(v)=TbL(v)TaL(u)Rab(u−v). All operators act on finite-dimensional auxiliary and chain tensor factors.

1.2givenF1F2algebra

On a single site with the site vector e↑, direct application of Laj(u)=(u−i/2)I+iPaj gives the auxiliary matrix Laj(u)e↑=((u+i/2)e↑ie↓0(u−i/2)e↑)a. It is upper triangular; multiplying these local matrices in the prescribed site order keeps the product upper triangular on Ω=e↑⊗N. Its diagonal entries multiply, so C(u)Ω=0,A(u)Ω=a(u)Ω,D(u)Ω=d(u)Ω,a(u)=(u+i/2)N,d(u)=(u−i/2)N.

2.1givenF1F2step 1.1algebra

In the ordered auxiliary basis ∣↑↑⟩,∣↑↓⟩,∣↓↑⟩,∣↓↓⟩, Rab(x) has diagonal entries x+i,x,x,x+i and the two off-diagonal middle entries i. Comparing the row ∣↑↑⟩ and column ∣↓↑⟩ entries in step 1.1 gives (x+i)B(u)A(v)=iB(v)A(u)+xA(v)B(u),x=u−v. Exchange u,v and solve for A(u)B(v) to obtain A(u)B(v)=f(x)B(v)A(u)+g(x)B(u)A(v) for x≠0, where f(x):=(x−i)/x and g(x):=i/x. The row ∣↑↑⟩, column ∣↓↓⟩ entry gives (x+i)B(u)B(v)=(x+i)B(v)B(u), hence the B operators commute for x≠−i; both sides are polynomial matrices, so this holds also at x=−i. The row ∣↓↑⟩, column ∣↓↓⟩ entry gives xD(u)B(v)+iB(u)D(v)=(x+i)B(v)D(u). Thus for x≠0, D(u)B(v)=h(x)B(v)D(u)+k(x)B(u)D(v), where h(x):=(x+i)/x and k(x):=−i/x.

3.1F2step 2.1step 1.2algebra

For pairwise distinct parameters v1,…,vM and a variable u distinct from them, the exchange relations of step 2.1 imply A(u)∏k=1MB(vk)Ω=a(u)∏k=1Mf(u−vk)∏k=1MB(vk)Ω+∑j=1Ma(vj)g(u−vj)∏k≠jf(vj−vk) B(u)∏k≠jB(vk)Ω,D(u)∏k=1MB(vk)Ω=d(u)∏k=1Mh(u−vk)∏k=1MB(vk)Ω+∑j=1Md(vj)k(u−vj)∏k≠jh(vj−vk) B(u)∏k≠jB(vk)Ω. For M=0 these follow from step 1.2. Suppose they hold for M−1 and move A(u) past the first factor B(v1) using step 2.1, then apply the induction formulas to the remaining M−1 factors. The unwanted coefficient for a fixed j≥2 is the common factor a(vj)∏k≠1,jf(vj−vk) times f(x)g(y)+g(x)g(y−x), with x=u−v1 and y=u−vj. Direct substitution of f(z)=(z−i)/z and g(z)=i/z gives f(x)g(y)+g(x)g(y−x)=g(y)f(x−y); here x−y=vj−v1, the missing factor in the target product. For j=1, the second term of the first exchange gives the displayed coefficient directly. For D, the same induction uses h,k and the identity h(x)k(y)+k(x)k(y−x)=k(y)h(x−y), verified by substituting h(z)=(z+i)/z and k(z)=−i/z. This proves both formulas for all M.

4.1givenF2step 1.2step 3.1algebra

Apply step 3.1 with vj=λj and add its A and D equations. The coefficient of ∏kB(λk)Ω is exactly Λ(u) in the statement. For each j, the combined coefficient of B(u)∏k≠jB(λk)Ω is g(u−λj)[a(λj)∏k≠jf(λj−λk)−d(λj)∏k≠jh(λj−λk)], because k(u−λj)=−g(u−λj). The bracket is zero: after substituting a,d,f,h, its equality is precisely the Bethe equation in [F2], whose denominators are nonzero by the regularity hypotheses. Thus τ(u)Ψ=Λ(u)Ψ for every u outside the finite root set.

5.1givenF2step 4.1algebra∎

Put Q(u)=∏j=1M(u−λj). The numerator of Λ(u) is P(u)=a(u)∏j=1M(u−λj−i)+d(u)∏j=1M(u−λj+i), a polynomial. At u=λj, its value is P(λj)=i[d(λj)∏k≠j(λj−λk+i)−a(λj)∏k≠j(λj−λk−i)]=0 by the same Bethe equation. Since the λj are distinct, each is a simple root of Q, so the factor theorem gives Q∣P and Λ=P/Q is a polynomial. Both τ(u)Ψ and Λ(u)Ψ are then polynomial vector-valued functions agreeing away from finitely many points by step 4.1; their difference has infinitely many zeros and is identically zero. As Ψ≠0 by [F2], this is an eigenvector identity for every u, with no claim that other eigenvectors arise this way.

5 · Examples, experiments and counterexamples

None yet.

Sources