propositionroutine
Bit network matrix interface and rank sum
Bit network swaps via XOR gates with rank sum
supplies bit circuit with rank sum for shear interchange
Proposition·
prop:bit-motif-interface·§3.4 The rational matrix interfaceStatement (paper)
The bit network has wires, uses only pointwise XOR gates,
and sends its input vector to the permutation of that vector.
Its rational matrices are common to all incidences of a gate and obey
The sum of the rational ranks of all edge differences is
In plain English
The bit network has wires, uses only pointwise XOR gates, and maps its input vector to the permutation of that vector. Its rational matrices are shared across all incidences of a gate, satisfy for every input role , and the total rational rank of the edge differences is .
Why it's here
This packages the bit network into the form the rational-matrix framework needs: the net effect is the swap permutation from the scalar motif lemma, with identity differences along the input-to-output pairing. The rank sum comes from the edge residual lemma's rank-budget identity, and the strict bound is the numerical fact that later steps, such as the shear-frame circuit argument, rely on.}
Classified routine:
Direct packaging of the scalar motif lemma (three-stage XOR swap) and the edge residual rank-budget identity into the rational-matrix interface. The rank sum is an explicit numerical evaluation of that identity.
Uses
Used by
Sources
PaperOpen
- Section
- §3.4 The rational matrix interface
- Page
- —
- Label
prop:bit-motif-interface- Line
sections/03-motifs.tex:492
Leannot aligned
Phase 2 aligns this node to a Lean declaration.