easier-twin-check
=================

Exact checks for the page "The puzzle that limits Anthropic's SAT algorithm has an easier twin"
(https://eurekist.com/findings/easier-twin).

Run:   python3 check_twin.py

Needs only Python 3 and its standard library. All arithmetic is exact: integers, fractions, and numbers
a + b i or a + b w (w a cube root of unity) with rational a, b. It takes a few seconds and prints one
PASS line per item and ALL OK at the end.

What it checks
 (1) On two qubits the 64 alternating forms fall into six classes under the symplectic group Sp(4,2), of
     sizes 1, 1, 20, 15, 15, 12, and the six named rearrangements lie in different classes.
 (2) The rearrangement attached to the field with four elements, defined by signs on the Pauli basis,
     moves the entry at (a,b) to (z^2 a + z b, z a + z^2 b), for 4 x 4 and 16 x 16 matrices.
 (3) The explicit splits on the page: I = A + Phi(B) with B of rank 1 and A of rank 1, 5 and 14 at
     n = 4, 16 and 64.
 (4) The partial transpose with one piece of rank 1: rank(SWAP - I) = N(N-1)/2 for N = 2, 4, 8, and the
     minor used in the lower-bound proof has determinant 1 for 20 random integer upper triangular P, Q.
 (5) The sign matrix with one piece of rank 1: the block H[S,T] used in the proof has rank (n - sqrt n)/2
     for n = 4, 16, 64.

What it does not check
 The lower bounds for all sizes rest on the written proofs on the page. The value 55 at n = 256 is a
 numerical result and is not checked here. Nothing here bears on lower bounds for the field with four
 elements, where none is known.
