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.
Sequential tensor-train SVD
Definition
Work in exact arithmetic over . The input is a tensor with , and exactly one of:
- rank caps ; or
- absolute tail tolerances .
At cut , flatten the current remainder with rows and columns , where , and compute an exact compact SVD . Its positive singular values are ordered decreasingly as . Under rank caps choose . Under tolerances choose the least for which . This set is nonempty because gives tail zero. Record the discarded tail
Reshape the first columns of into core and reshape as the next remainder. After cut , reshape the remaining matrix as . If , the remainder has zero row dimension; all later ranks and tails are set to zero and the remaining cores are the corresponding empty zero arrays. Thus the zero tensor has all internal ranks zero, a cap zero returns the zero tensor, and a tolerance large enough to select does the same. The output is the TT core list and the cut tails . Any SVD tie at a retained cutoff may be resolved by any orthonormal choice within the tied singular subspace.
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), §2 (standard reference, not scraped)
- Mi-Song Dupuy, Tensor trains for high-dimensional problems, full lecture notes, Chapter 1, §§1.2.1, 1.2.4 (2026) (standard reference, not scraped)