claimroutineinferred_dep
Three shears interchange the two chunks
Three shears swap the chunks, only the middle one needing the circuit
reduces chunk swap to one circuit shear
Claim·§4.2 Transferring a finite circuit to address permutations·inside propPower-width chunk interchange in O(Ve^τ)
Statement (paper)
Let and denote the contents of the two address chunks, viewed as componentwise values. Then the three updates , , , performed in this order, send to , so they interchange the two chunks. Only the middle update uses the circuit, while the other two target the later group and have linear cost.
In plain English
Applying , then , then sends to , so the two chunks are swapped. Only the middle update needs the circuit; the other two target the later group and cost linear time.
Why it's here
This is the classical swap by three shears: the values go . It reduces the chunk interchange to one circuit-based shear, supplied by the previous claim, plus two cheap linear-cost updates from the affine-update lemma, which gives the recurrence in the next claim.
Classified routine:
This is the classical swap-by-three-shears identity, (H,D)→(H,D−H)→(D,D−H)→(D,H), a direct calculation. The cost accounting follows from the previous claim (circuit shear) and the affine-update lemma.
Uses
Used by
Sources
PaperOpen
- Section
- §4.2 Transferring a finite circuit to address permutations
- Page
- —
- Label
—- Line
sections/04-swap.tex:189
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Three shears interchange the two chunks" rests on claim-prop-power-interchange-2
- infoinferred_depoutline: "Three shears interchange the two chunks" rests on lem:ordered-affine-streams