OctoInform Beta

OpenAI preprint, September 2026 · §5. Cyclic support of the bands · §5

Lemma 5.1 [Path contraction]: The contraction of the path generator uu with X0⊗⋯⊗X2rX_0 \otimes \cdots \otimes X_{2r} is (−1)r(-1)^r times the (0,0)(0,0) entry of X0adj⁡(X1)X2⋯X2rX_0 \operatorname{adj}(X_1) X_2 \cdots X_{2r}

Contracting the path generator gives a matrix entry.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The width-two band consists of two tensor layers of ℂ2\mathbb{C}^2 on the same positions. Regrouped by position they form one word space over pair letters, a pair letter being a first-layer letter together with a second-layer letter, and a complex 2×22 \times 2 matrix, its rows indexed by the first-layer letter and its columns by the second-layer letter, is a vector of the pair-letter space at one position. A list of matrices, one for each position, then gives a pure tensor of the word space, the vector whose coefficient on a word is the product of the entries of the matrices at the letters of that word.

For a natural number rr, on 2r+12r + 1 positions the band holds a distinguished vector uu, the path generator, whose coefficients are read along overlapping triples of positions. The question is what the contraction of uu with the pure tensor of 2r+12r + 1 matrices X0,…,X2rX_0, \dots, X_{2r} is, the contraction of two vectors being the sum over words of the products of their coefficients, as a function of the matrices.

Matrices and the Adjugate Twist

The algebra Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) consists of the complex 2×22 \times 2 matrices, with rows and columns indexed by {0,1}\{0, 1\}. For a,b∈{0,1}a, b \in \{0, 1\}, the matrix unit EabE_{ab} is the matrix with entry 11 in row aa and column bb and 00 elsewhere. The symplectic matrix JJ is the element (01−10)\bigl(\begin{smallmatrix} 0 & 1 \\ -1 & 0 \end{smallmatrix}\bigr) of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}).✦ The adjugate adj⁡X\operatorname{adj} X of a matrix XX is the transpose of its cofactor matrix, adj⁡(pqst)=(t−q−sp)\operatorname{adj} \bigl(\begin{smallmatrix} p & q \\ s & t \end{smallmatrix}\bigr) = \bigl(\begin{smallmatrix} t & -q \\ -s & p \end{smallmatrix}\bigr).

For a natural number qq, the adjugate twist DqD_q is the map of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) to itself given by Dq(X)={adj⁡X,q even,X,q odd.D_q(X) = \begin{cases} \operatorname{adj} X, & q \text{ even}, \\ X, & q \text{ odd}. \end{cases}(1)✦ For natural numbers nn and pp, the twisted product Πp\Pi_p of matrices X0,…,Xn−1∈Mat2(ℂ)X_0, \dots, X_{n-1} \in \mathrm{Mat}_2(\mathbb{C}) is the product of their twists in order, the index of the twist rising from pp: Πp(X0,…,Xn−1)=Dp(X0)Dp+1(X1)⋯Dp+n−1(Xn−1).\Pi_p(X_0, \dots, X_{n-1}) = D_p(X_0)\, D_{p+1}(X_1) \cdots D_{p+n-1}(X_{n-1}).(2)✦ With p=1p = 1 and n=2r+1n = 2r + 1 this is X0adj⁡(X1)X2⋯adj⁡(X2r−1)X2rX_0 \operatorname{adj}(X_1)\, X_2 \cdots \operatorname{adj}(X_{2r-1})\, X_{2r}, the adjugate standing at the odd positions.

Letters, Words and the Path Generator

The four-letter alphabet is the set {0,1,2,3}\{0, 1, 2, 3\} of pair letters of the width-two band✦: a letter xx is the pair (a,b)(a, b) of bits a,b∈{0,1}a, b \in \{0, 1\} with x=2a+bx = 2a + b. The matrix unit of a letter x=(a,b)x = (a, b) is Ex=EabE_x = E_{ab}.✦

A word ww of length nn is a sequence of letters w0,…,wn−1w_0, \dots, w_{n-1}, written wp=(ap,bp)w_p = (a_p, b_p), and the word space on nn positions is the space of complex functions on these words, the coefficient functions of the tensors of (ℂ4)⊗n(\mathbb{C}^4)^{\otimes n}. We write ⟨v,v′⟩\langle v, v' \rangle for the contraction of two vectors v,v′v, v' of the word space, the sum of v(w)v′(w)v(w)\, v'(w) over all words ww. For matrices X0,…,Xn−1∈Mat2(ℂ)X_0, \dots, X_{n-1} \in \mathrm{Mat}_2(\mathbb{C}), the coefficients of their pure tensor X0⊗⋯⊗Xn−1X_0 \otimes \cdots \otimes X_{n-1} are (X0⊗⋯⊗Xn−1)(w)=∏p=0n−1(Xp)apbp.(X_0 \otimes \cdots \otimes X_{n-1})(w) = \prod_{p=0}^{n-1} (X_p)_{a_p b_p}.(3)✦

The positions 0,…,2r0, \dots, 2r of a word of length 2r+12r + 1 form rr overlapping triples (2i,2i+1,2i+2)(2i, 2i + 1, 2i + 2) with 0≤i<r0 \le i < r; the triple ii has left position 2i2i✦, middle position 2i+12i + 1✦ and right position 2i+22i + 2.✦ For r≥0r \ge 0, the path generator uu is the vector of the word space on the positions 0,…,2r0, \dots, 2r whose coefficient on a word ww vanishes unless a0=0a_0 = 0 and b2r=0b_{2r} = 0, and is otherwise the product over the triples of the entry of JJ between the second bits at the left and middle positions and the entry of JJ between the first bits at the middle and right positions: u(w)=δa00δb2r0∏i=0r−1Jb2ib2i+1Ja2i+1a2i+2.u(w) = \delta_{a_0 0}\, \delta_{b_{2r} 0} \prod_{i=0}^{r-1} J_{b_{2i} b_{2i+1}}\, J_{a_{2i+1} a_{2i+2}}.(4)✦

The Claim

Theorem 1. Let r≥0r \ge 0 and let X0,…,X2rX_0, \dots, X_{2r} be complex 2×22 \times 2 matrices. The contraction of the path generator uu with their pure tensor is (−1)r(-1)^r times the (0,0)(0,0) entry of their twisted product: ⟨u,X0⊗⋯⊗X2r⟩=(−1)rΠ1(X0,…,X2r)00.\langle u, X_0 \otimes \cdots \otimes X_{2r} \rangle = (-1)^r\, \Pi_1(X_0, \dots, X_{2r})_{00}.(5)✦ Moreover, for a letter x=(a,b)x = (a, b) and indices i,j∈{0,1}i, j \in \{0, 1\}, the adjugate of the matrix unit ExE_x has the entries (adj⁡Ex)ij=−JibJaj.(\operatorname{adj} E_x)_{ij} = -J_{ib}\, J_{aj}.(6)✦ For a word ww of length 2r+12r + 1 with letters wp=(ap,bp)w_p = (a_p, b_p), the twisted product of the matrix units of its letters is a multiple of the matrix unit Ea0b2rE_{a_0 b_{2r}}, Π1(Ew0,…,Ew2r)=(−1)r(∏i=0r−1Jb2ib2i+1Ja2i+1a2i+2)Ea0b2r,\Pi_1(E_{w_0}, \dots, E_{w_{2r}}) = (-1)^r \Bigl(\prod_{i=0}^{r-1} J_{b_{2i} b_{2i+1}}\, J_{a_{2i+1} a_{2i+2}}\Bigr) E_{a_0 b_{2r}},(7)✦ and its (0,0)(0,0) entry is (−1)r(-1)^r times the coefficient of uu on ww: Π1(Ew0,…,Ew2r)00=(−1)ru(w).\Pi_1(E_{w_0}, \dots, E_{w_{2r}})_{00} = (-1)^r\, u(w).(8)✦

In the paper, the result reads: for arbitrary X1,…,XK∈Mat2(ℂ)X_1, \dots, X_K \in \mathrm{Mat}_2(\mathbb{C}), ⟨u,X1⊗⋯⊗XK⟩=(−1)m−1[X1adj⁡(X2)X3adj⁡(X4)⋯XK−2adj⁡(XK−1)XK]11\langle u, X_1 \otimes \cdots \otimes X_K \rangle = (-1)^{m-1} [X_1 \operatorname{adj}(X_2)\, X_3 \operatorname{adj}(X_4) \cdots X_{K-2} \operatorname{adj}(X_{K-1})\, X_K]_{11}, with matrices, rows and columns numbered from 11, so that its KK, mm, XkX_k and (1,1)(1,1) entry are the page’s 2r+12r + 1, r+1r + 1, Xk−1X_{k-1} and (0,0)(0,0) entry.

What Is Checked

The claim is stated over the algebra Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) with its matrix units, the symplectic matrix JJ and the adjugate, the adjugate twists DqD_q and the twisted product Π1\Pi_1, the four-letter alphabet with the bits and the matrix unit of each letter, the pure tensor of matrices, the contraction, and the path generator uu with its triples of positions.

Beyond the claim, the library proves that each adjugate twist DqD_q is a linear map of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}), so that the twisted product Πp\Pi_p is multilinear in its nn arguments.