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.
An explicit two-site periodic transfer matrix and permutation Hamiltonian
Example
Take , two sites, and equal inhomogeneities in Finite periodic fundamental evaluation chain and transfer matrix. With the flip of the two quantum factors, direct evaluation gives
Consequently the normalized logarithmic-derivative operator
is . This example is the explicit two-site specialization of the shared finite family The rational spin-1/2 spectral R-matrix; no new spin- spectral matrix is introduced.
Facts & Assumptions
Given: The two-site chain at with equal inhomogeneities , and the transfer-matrix definition and commutativity theorem.
Finite periodic transfer matrices commute: the finite periodic chain satisfies for all complex .
The rational spin-1/2 spectral R-matrix: on the ordered two-dimensional basis, with .
Proof
Set . By [F1] and [F3], . The explicit partial traces are , , and . For the last identity, expand , multiply using , and trace the auxiliary factor to obtain . Therefore .
Substitution gives , and differentiating the polynomial gives . Since , the inverse of is . Thus .
The whole polynomial family commutes by [F2], including this specialization; the calculation above identifies one normalized logarithmic derivative and uses no limiting inverse at a singular spectral difference.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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)