Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 A∈Fn1×⋯×nd and let A^ be the truncated HOSVD with mode-rank caps r1,…,rd. Then ∥A−A^∥F≤dinf⁡B∈Tr∥A−B∥F, where Tr is the set of tensors whose kth unfolding has rank at most rk.

Facts & Assumptions

Given: A finite tensor, mode-rank caps 0≤rk≤nk, and the HOSVD output.

[F1]

Tucker format, multilinear rank, and mode products: Tr imposes the matrix rank bound rank⁡B(k)≤rk in every mode.

[F2]

Tensor unfoldings preserve the Frobenius inner product: mode unfoldings preserve Frobenius norms.

[F3]

Best rank-k matrix approximation in Frobenius norm: the mode-k truncated SVD has squared residual equal to its discarded singular-value tail and minimizes this residual over matrices of rank at most rk.

[F4]

Higher-order SVD truncation: the HOSVD reconstruction is the product of the mode-wise orthogonal projections onto the leading left singular subspaces.

Proof

1.1F4F5algebra

Let Pk=UkUk∗ be the orthogonal projection used in mode k, and let Pk denote its action on that mode. The projections Pk commute for distinct modes, since they act on different tensor indices. By [F4], A^=P1⋯PdA. The telescoping identity gives A−A^=∑k=1dP1⋯Pk−1(I−Pk)A. For k<ℓ, the kth summand lies in the kernel of Pk, while the ℓth lies in its range. These summands are orthogonal, so their squared norms add.

2.1F2step 1.1algebra

Each Pj is an orthogonal projection and hence a contraction: its range and kernel are orthogonal, so applying it cannot increase the squared norm. Consequently, ∥A−A^∥F2=∑k=1d∥P1⋯Pk−1(I−Pk)A∥F2≤∑k=1d∥(I−Pk)A∥F2. By [F2], ∥(I−Pk)A∥F is the Frobenius error of truncating A(k) to rank rk.

3.1F1F2F3step 2.1algebra∎

Fix any B∈Tr. Its mode-k unfolding has rank at most rk by [F1], so [F3] implies ∥(I−Pk)A∥F≤∥A(k)−B(k)∥F=∥A−B∥F. Substitute this bound for each k in step 2.1 to obtain ∥A−A^∥F2≤d∥A−B∥F2. Since it holds for every B∈Tr, taking the infimum and square roots proves the claim.

Depends on

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