Context
Parity words are exact affine charts. Their seams, response quotients, integral cokernels, and 2-adic inverse limits show precisely where finite compatibility differs from membership in the ordinary nonnegative integers.
Proof or evidence
The checker covers 32,766 words, 98,305 swaps, and 65,658 fundamental-cycle sums.
Verification notes
The affine word, residue-cylinder, seam, response, integral, positive, 2-adic, selector, rotation, and fixed-weight arguments were reconstructed. An independent implementation checked 131,070 parity words, 98,304 seams, 98,305 swaps, 8,800 primitive necklaces, and all selectors through depth four, including the 001 and all-ones hostile examples.
Limitations
- On the fine graph the label is an exact coboundary; after slope collapse it is vertical loss, not automatically quotient cohomology.