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.
HOSVD quasioptimality for multilinear rank
Statement
Let and let be the truncated HOSVD with mode-rank caps . Then where is the set of tensors whose th unfolding has rank at most .
Facts & Assumptions
Given: A finite tensor, mode-rank caps , and the HOSVD output.
Tucker format, multilinear rank, and mode products: imposes the matrix rank bound in every mode.
Tensor unfoldings preserve the Frobenius inner product: mode unfoldings preserve Frobenius norms.
Best rank-k matrix approximation in Frobenius norm: the mode- truncated SVD has squared residual equal to its discarded singular-value tail and minimizes this residual over matrices of rank at most .
Higher-order SVD truncation: the HOSVD reconstruction is the product of the mode-wise orthogonal projections onto the leading left singular subspaces.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every mode unfolding has an exact SVD with orthonormal singular vectors.
Proof
Let be the orthogonal projection used in mode , and let denote its action on that mode. The projections commute for distinct modes, since they act on different tensor indices. By [F4], . The telescoping identity gives . For , the th summand lies in the kernel of , while the th lies in its range. These summands are orthogonal, so their squared norms add.
Each is an orthogonal projection and hence a contraction: its range and kernel are orthogonal, so applying it cannot increase the squared norm. Consequently, . By [F2], is the Frobenius error of truncating to rank .
Fix any . Its mode- unfolding has rank at most by [F1], so [F3] implies . Substitute this bound for each in step 2.1 to obtain . Since it holds for every , taking the infimum and square roots proves the claim.
Depends on
- Finite tensor arrays and the Frobenius inner product
- Tucker format, multilinear rank, and mode products
- Tensor unfoldings preserve the Frobenius inner product
- Best rank-k matrix approximation in Frobenius norm
- Higher-order SVD truncation
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- Lieven De Lathauwer, Bart De Moor, and Joos Vandewalle, A Multilinear Singular Value Decomposition, SIAM Journal on Matrix Analysis and Applications 21(4) (2000), §5, Property 10 (standard reference, not scraped)
- Tamara G. Kolda and Brett W. Bader, Tensor Decompositions and Applications, SIAM Review 51(3) (2009), §4.2 (standard reference, not scraped)