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.
Exact TT ranks and root-sum-square truncation error
Statement
Let , , and let denote its cut- unfolding. For sequential TT-SVD, let be its retained bond size and its discarded singular-value tail at cut . For rounding, let the input TT represent and use the same notation for the output bond sizes and recorded tails. Then both procedures satisfy If no positive singular value is discarded, the output is exactly . In full-rank TT-SVD, for every cut, and these are the minimal possible TT bond sizes among exact representations.
Facts & Assumptions
Given: A finite tensor over or , and either its exact sequential TT-SVD or a valid TT representation supplied to the exact rounding procedure.
Tensor train cores, bond ranks, and canonical gauges: a TT core list contracts over adjacent bond indices; its left and right matricizations specify the isometric gauges.
Tensor unfoldings preserve the Frobenius inner product: cut unfoldings preserve Frobenius norms and inner products.
Best rank-k matrix approximation in Frobenius norm: truncating a matrix SVD at rank discards an orthogonal component whose squared Frobenius norm is the sum of the squared omitted singular values.
Sequential tensor-train SVD: each left-to-right step retains the leading singular vectors of the current cut remainder and records the omitted singular-value tail.
Tensor-train rounding: exact left orthogonalization is followed by right-to-left core SVD truncations, with each omitted tail recorded.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every finite-dimensional real or complex linear map has an exact SVD with orthonormal singular-vector bases.
Proof
Any TT representation with bond size factors the cut unfolding as : the columns of are the contracted first cores indexed by the bond , and the rows of are the contracted remaining cores with that same bond index. This is a matrix product through an inner dimension , so .
For rounding, let be the contraction of cores , with row index the bond after core and column index the suffix ; the empty suffix gives . Put . Backward induction from shows : if is the right matricization of core and , then , so by right-isometry. Forward induction similarly gives orthonormal columns for each prefix interface: and . Since , , so . When the right-to-left sweep processes cut , cores still have that left gauge and cores have the right gauge. The current cut unfolding is , where is core reshaped with row index the incoming bond and column index , and . Since , . The local SVD truncation replaces by , where has the retained right singular vectors, so the full unfolding changes from to . Since and , is the orthogonal projection onto , a subspace of the suffix modes . Thus the resulting tensor is the projection onto . With , the global residual norm satisfies . At the next cut , the right interface has orthonormal columns spanning . Its local embedding is , so every newly retained suffix vector lies in . Hence .
In full-rank TT-SVD, set and recursively using the left singular vectors retained at cut . Since and , the columns of every are orthonormal. Substituting each exact SVD of the current remainder into the preceding factorization gives for each cut. The retained singular values are all positive, so this factorization has rank . By step 1.1 no exact TT can have a smaller bond, proving the full-rank characterization.
For TT-SVD, let and, after truncating cut , let . The retained prefix matrices satisfy , hence . At step , the current unfolding is . If contains the retained left singular vectors, the new unfolding is , the orthogonal projection of the current tensor onto . The discarded matrix has squared Frobenius norm by [F3]; left multiplication by the isometry preserves that norm by direct expansion of the Frobenius inner product, equivalently [F2].
In either algorithm, let and let be the approximation after the th truncation in execution order. By steps 3.1 and 1.2, each step is an orthogonal projection onto a retained subspace nested inside the preceding one. Therefore is orthogonal to every later increment, which lies in the retained subspace at step . Telescoping gives , an orthogonal sum, and each is the recorded tail for that cut. Hence . If a zero-rank truncation occurs, the output becomes zero and the unperformed tails are zero, so this same argument includes that branch. If no positive singular value is discarded, every and the output is exactly .
Depends on
- Finite tensor arrays and the Frobenius inner product
- Tensor train cores, bond ranks, and canonical gauges
- Tensor unfoldings preserve the Frobenius inner product
- Best rank-k matrix approximation in Frobenius norm
- Sequential tensor-train SVD
- Tensor-train rounding
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
Used by
Dependency tree · two levels
12 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–3 (standard reference, not scraped)
- Mi-Song Dupuy, Tensor trains for high-dimensional problems, full lecture notes, Chapter 1, §§1.2.1–1.2.5 (2026) (standard reference, not scraped)