claimroutineinferred_dep
Z corrections repair the X_a to Y_a route
corrections turn the route into
repairs the exceptional route so all roles carry
Claim·§3.5 The binary phase interface·inside propComplex network edges factor into translation kernels
Statement (paper)
For the pair , the route operator is the tensor of on the coordinates of and elsewhere. Conjugating by using , namely applying before the network at and after the network at , turns this operator into on columns. Hence, up to the scalar sign of the scalar exchange on the physical outputs, which is removed by negating those outputs and sending output role back to role , every role, including every scratch role, carries the required forward tensor product .
In plain English
On the route the operator is on the 27 coordinates of and elsewhere. Applying before the network at and after it at turns this into on columns. After negating the physical outputs and relabeling output role as , every role, scratch roles included, carries .
Why it's here
The previous claim left as the only route not equal to . Since , conjugating by on each of the 27 flipped coordinates turns into at the cost of a factor per coordinate, and the cancels these factors. The remaining scalar sign from the signed exchange is absorbed by negating the outputs, which completes the proof of the proposition's telescoping assertion on every role.
Classified routine:
A direct computation: conjugating C^{-1} by Z gives C up to a factor i per coordinate, and these factors are cancelled by i^{27k}, completing the bookkeeping begun in the preceding telescoping claim (claim-prop-complex-motif-interface-3).
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §3.5 The binary phase interface
- Page
- —
- Label
—- Line
sections/03-motifs.tex:644
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Z sign corrections fix the X_a→Y_a route" rests on claim-prop-complex-motif-interface-3