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.
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 for every . No genericity condition on the inhomogeneities is needed. The proof uses invertibility only for 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.
Finite periodic fundamental evaluation chain and transfer matrix: is finite dimensional, is polynomial in , and is the ordinary auxiliary trace.
The periodic fundamental monodromy satisfies RTT: for every .
The type-A rational R-matrix satisfies Yang–Baxter and has exact singular parameters: has a two-sided inverse if .
Proof
Suppose . Multiplying the RTT identity [F2] on the right by , which exists by [F3], gives . Take the ordinary trace over the two auxiliary spaces. For a finite-dimensional auxiliary matrix with coefficients in and an invertible scalar auxiliary matrix , : writing entries, , since scalar entries commute with the coefficients and . Thus the trace of the left side is .
The tensor-space trace of equals , since the two auxiliary factors are independent and the coefficient order is then . The trace of equals by the same index expansion with the coefficient order reversed. Step 1.1 therefore proves whenever .
Each matrix entry of is a polynomial in by [F1]. For every fixed , it vanishes for all but at most two values of by step 2.1, hence is the zero polynomial in ; consequently it vanishes for all . This proves the assertion also at , where the auxiliary is singular.
Depends on
Used by
Cited to discharge well-definedness by The periodic fundamental monodromy satisfies RTT.
Dependency tree · two levels
8 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
- L. D. Faddeev, How Algebraic Bethe Ansatz Works for Integrable Model (standard reference, not scraped)
- F. Loebbert, Lectures on Yangian Symmetry (standard reference, not scraped)
- A. P. Isaev, Lectures on Quantum Groups and Yang-Baxter Equations (standard reference, not scraped)