The Setting
The lemma evaluates a family of alternating sums in the algebra of complex matrices. For fixed matrices one forms their product in every order, takes the adjugate of every other factor, and sums over the symmetric group weighted by the sign character. The question, which the library answers for one to four matrices, is which matrix comes out and how it depends on the position at which the alternation of adjugates starts.
The Segment Matrices
The matrix algebra is the algebra of matrices with complex entries.✦ The Pauli-type basis of is the basis , , , given by (1)✦
For an integer , the parity twist is the map from to itself that takes the adjugate when is even and is the identity when is odd: (2)✦
For integers and , the segment matrix is the element of obtained by placing on the positions for each permutation in , twisting each factor by its position, multiplying in the order of the positions and summing with the sign of , where for every : (3)✦
A scaled basis matrix is a nonzero complex multiple of one of , and denotes the set of them: (4)✦
The Claim
Theorem 1. The segment matrices starting at the odd position and at the even position are (5)✦ (6)✦ (7)✦ (8)✦ (9)✦ (10)✦ (11)✦ (12)✦ For every integer with and every integer , the segment matrix depends on only through its parity, (13)✦ and is a scaled basis matrix, (14)✦
In the paper, the result reads: if is the number of even positions among and is when is even and when is odd, then , so that all these matrices are invertible, with equal to for when is odd and to when is even.
What Is Checked
The claim is stated over the algebra with its Pauli-type basis (1), the parity twists of (2), the segment matrices of (3) and the set of scaled basis matrices (4).