claimroutineinferred_dep
Tensor identity and axis-by-axis implementation
Tensoring gives the factor identity, implemented one axis at a time
multidimensional identity from the 1D lemma
Statement (paper)
Tensoring gives . Moreover, (expansion) can be implemented by padding the input with zeros outside and then expanding the axes one at a time, applying to each line with valid other coordinates and writing zeros on every other line. Likewise (compression) can be implemented axis by axis in the full box of entries, applying to each -line whose other coordinates are valid and writing its outputs followed by zeros, while every other line is zero and is replaced by a zero line without calling .
In plain English
Tensoring the one-dimensional factorization gives . The expansion and compression can be implemented one axis at a time, applying or only to valid lines and filling the other lines with zeros.
Why it's here
This gives the multidimensional identity from the one-dimensional lemma, since the factors multiply to . It also describes the padded-box, line-by-line procedure whose contraction, error and cost properties are analysed in the following claims. Valid lines get the one-dimensional approximation, and the remaining lines are zero and skip it, which keeps the work proportional to the valid lines.
Classified routine:
Direct tensoring of the one-dimensional factorization from lem-no-sort-resampling, implemented with the standard axis-by-axis (row-column) technique for applying tensor-product operators to multidimensional arrays, as in Harvey–van der Hoeven's Gaussian resampling.
Sources
PaperOpen
- Section
- §8.2 Growing dimension and the padded array
- Page
- —
- Label
—- Line
sections/07-resampling.tex:342
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Tensor identity and linewise expansion/compression" rests on lem:no-sort-resampling