How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Tensor-train rounding
Definition
Work in exact arithmetic over . The input is a valid TT core list for a tensor of order and exactly one of rank caps or absolute tail tolerances .
-
Left orthogonalize without truncation. For , reshape core into a matrix with rows and columns . Compute an exact compact SVD , replace by the reshape of , and absorb into the next core along their common bond. Omitting zero singular directions is exact. The resulting cores are left-isometric.
-
Truncate from right to left. For , reshape the current into a matrix with rows and columns , and compute an exact compact SVD . If its positive singular values are , choose for rank caps, or the least with for tolerances. Record . Replace by the reshape of the first rows of and absorb into the previous core.
If , the represented tensor becomes zero; set all remaining internal ranks to zero and their unperformed tails to zero. If the input represents zero, return the all-zero-rank representation and zero tails immediately. The output is the rounded core list and all recorded cut tails. No finite-precision error guarantee is part of this exact-arithmetic procedure.
Depends on
Used by
Dependency tree · two levels
8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ivan V. Oseledets, Tensor-Train Decomposition, SIAM Journal on Scientific Computing 33(5) (2011), §3 (standard reference, not scraped)
- Mi-Song Dupuy, Tensor trains for high-dimensional problems, full lecture notes, Chapter 1, §1.2.4, Algorithm 1.3; §1.2.5 (2026) (standard reference, not scraped)