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.
Two TT truncations realize the root-sum-square bound
Example
Let have nonzero entries , , and , with all other entries zero. Apply sequential TT-SVD with rank cap one at both cuts.
Verification
Given: The tensor and cap tuple above.
[F1] Finite tensor arrays and the Frobenius inner product: the cut- unfolding groups the first indices into rows, the remaining indices into columns, and a reindexing preserves Frobenius norm.
[F2] Sequential tensor-train SVD: each step keeps the leading singular vectors up to its rank cap and records the discarded tail norm.
[F3] Exact TT ranks and root-sum-square truncation error: the total TT-SVD error is bounded by the root sum of squared cut tails.
With columns ordered by , the first unfolding is . Its rows are orthogonal with norms and , so the leading singular value is and the first discarded tail is . The retained left vector is , and the remainder reshaped as a matrix is .
The second remainder has singular values and , hence its rank-one truncation discards and returns the tensor . The omitted entries of are and , which are orthogonal and have squared norms and . Therefore , realizing equality in [F3].
Depends on
Used by
Nothing in the library uses this result yet.
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, Theorem 2.2 (standard reference, not scraped)
- Mi-Song Dupuy, Tensor trains for high-dimensional problems, full lecture notes, Chapter 1, §1.2.4 (2026) (standard reference, not scraped)