claimroutineinferred_dep
Full procedures include layout conjugation
Conjugating by gives and procedures
identifies the full operators and storage positions
Claim·§6.2 A layout on which the parallel layers apply·inside lemCost and accuracy of synthetic transform
Statement (paper)
Writing and for the exact logical forward and opposite procedures, executing each operation on named slots after conjugates it by . Hence the full exact operator of the forward procedure is , and that of the opposite procedure is . In particular, the forward entry with frequency address is stored at .
In plain English
Conjugating each logical operation by the layout permutation makes the forward procedure realize and the opposite procedure realize . In particular, the forward entry with frequency address ends up stored at position .
Why it's here
The parallel layers act on named slots of the layout produced by , so each logical step is run as . Composing this with the single application of (or ) from the layout-permutation claim makes the conjugating factors cancel, which gives the full operators and the storage location of each output entry that the cost lemma's later steps need.
Classified routine:
Direct bookkeeping: conjugating each logical step by the layout permutation L and composing with the single application of L from the earlier layout-permutation claim, so the intermediate L^{-1}L factors cancel.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §6.2 A layout on which the parallel layers apply
- Page
- —
- Label
—- Line
sections/06-transforms.tex:422
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Full procedures implement LBF^- and F^+B^{-1}L^{-1}" rests on claim-lem-synthetic-transform-cost-1
- infoinferred_depoutline: "Full procedures implement LBF^- and F^+B^{-1}L^{-1}" rests on lem:synthetic-characters