Bootstrapping the $R$-matrix
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
A bootstrap program is presented for algebraically solving the $R$-matrix of a generic integrable quantum spin chain from its Hamiltonian. The Yang-Baxter equation contains an infinite number of seemingly independent constraints on the operator valued coefficients in the expansion of the $R$-matrices with respect to their spectral parameters, with the lowest order one being the Reshetikhin condition. These coefficients can be solved iteratively in a self consistent way using a lemma due to Kennedy, which reconstructs the $R$-matrix after an infinite number of steps. For a generic Hamiltonian, the procedure could fail at any step, making the conditions useful as an integrability test. However, at least for the most common examples, they always turn out to be satisfied whenever the lowest order condition is. It remains to be understood whether they are indeed implied by the Reshetikhin condition.