Alphabeta Math
TheoremStatement: 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.

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)

Depends on

Dependency tree · 2 levels

Sources