Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 A∈Fn1×⋯×nd, d≥2, and let A⟨k⟩ denote its cut-k unfolding. For sequential TT-SVD, let rk be its retained bond size and δk its discarded singular-value tail at cut k. For rounding, let the input TT represent A and use the same notation for the output bond sizes and recorded tails. Then both procedures satisfy ∥A−A^∥F2≤∑k=1d−1δk2. If no positive singular value is discarded, the output is exactly A. In full-rank TT-SVD, rk=rank⁡(A⟨k⟩) for every cut, and these are the minimal possible TT bond sizes among exact representations.

Facts & Assumptions

Given: A finite tensor over R or C, and either its exact sequential TT-SVD or a valid TT representation supplied to the exact rounding procedure.

[F1]

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.

[F2]

Tensor unfoldings preserve the Frobenius inner product: cut unfoldings preserve Frobenius norms and inner products.

[F3]

Best rank-k matrix approximation in Frobenius norm: truncating a matrix SVD at rank r discards an orthogonal component whose squared Frobenius norm is the sum of the squared omitted singular values.

[F4]

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.

[F5]

Tensor-train rounding: exact left orthogonalization is followed by right-to-left core SVD truncations, with each omitted tail recorded.

[F6]

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

1.1F1algebra

Any TT representation with bond size rk factors the cut unfolding as A⟨k⟩=LkRk: the columns of Lk are the contracted first k cores indexed by the bond αk, and the rows of Rk are the contracted remaining cores with that same bond index. This is a matrix product through an inner dimension rk, so rank⁡(A⟨k⟩)≤rk.

1.2F1F2F3F5F6algebra

For rounding, let Cℓ be the contraction of cores ℓ+1,…,d, with row index the bond after core ℓ and column index the suffix (iℓ+1,…,id); the empty suffix gives Cd=[1]. Put Rℓ=Cℓ∗. Backward induction from Cd shows CℓCℓ∗=I: if Gℓ+1(R) is the right matricization of core Gℓ+1 and Cℓ+1Cℓ+1∗=I, then Cℓ=Gℓ+1(R)(Inℓ+1⊗Cℓ+1), so CℓCℓ∗=Gℓ+1(R)(Inℓ+1⊗Cℓ+1Cℓ+1∗)Gℓ+1(R)∗=Gℓ+1(R)Gℓ+1(R)∗=I by right-isometry. Forward induction similarly gives orthonormal columns for each prefix interface: L0=[1] and Lj=(Lj−1⊗Inj)Gj(L). Since Lj−1∗Lj−1=I, (Lj−1⊗Inj)∗(Lj−1⊗Inj)=I, so Lj∗Lj=Gj(L)∗Gj(L)=I. When the right-to-left sweep processes cut k, cores 1,…,k still have that left gauge and cores k+2,…,d have the right gauge. The current cut unfolding is LkMk+1J, where Mk+1 is core Gk+1 reshaped with row index the incoming bond and column index (ik+1,αk+1), and J=Ink+1⊗Rk+1∗. Since Rk+1∗Rk+1=I, JJ∗=I. The local SVD truncation replaces Mk+1 by Mk+1VqVq∗, where Vq has the retained right singular vectors, so the full unfolding changes from LkMk+1J to LkMk+1VqVq∗J=(LkMk+1J)(J∗VqVq∗J). Since JJ∗=I and Vq∗Vq=I, J∗VqVq∗J is the orthogonal projection onto Tk=ran⁡(J∗Vq), a subspace of the suffix modes k+1,…,d. Thus the resulting tensor is the projection onto Sk=Fn1×⋯×nk⊗Tk. With E=Mk+1(I−VqVq∗), the global residual norm satisfies ∥LkEJ∥F2=tr⁡(J∗E∗Lk∗LkEJ)=tr⁡(E∗EJJ∗)=∥E∥F2=δk2. At the next cut k−1, the right interface Rk has orthonormal columns spanning Tk. Its local embedding is Ink⊗Rk, so every newly retained suffix vector lies in ran⁡(Ink⊗Rk)=Fnk⊗Tk. Hence Sk−1⊆Sk.

2.1F4F6step 1.1algebra

In full-rank TT-SVD, set Q0=[1] and recursively Qk=(Qk−1⊗Ink)Uk using the left singular vectors retained at cut k. Since Qk−1∗Qk−1=I and Uk∗Uk=I, the columns of every Qk are orthonormal. Substituting each exact SVD of the current remainder into the preceding factorization gives A⟨k⟩=QkΣkVk∗ for each cut. The retained singular values are all positive, so this factorization has rank rk. By step 1.1 no exact TT can have a smaller bond, proving the full-rank characterization.

3.1F2F3F4F6step 2.1algebra

For TT-SVD, let S0=Fn1×⋯×nd and, after truncating cut k, let Sk=ran⁡(Qk)⊗Fnk+1×⋯×nd. The retained prefix matrices satisfy ran⁡(Qk)⊆ran⁡(Qk−1⊗Ink), hence Sk⊆Sk−1. At step k, the current unfolding is (Qk−1⊗Ink)Mk. If Uq contains the retained left singular vectors, the new unfolding is (Qk−1⊗Ink)UqUq∗Mk, the orthogonal projection of the current tensor onto Sk. The discarded matrix Mk−UqUq∗Mk has squared Frobenius norm δk2 by [F3]; left multiplication by the isometry Qk−1⊗Ink preserves that norm by direct expansion of the Frobenius inner product, equivalently [F2].

4.1step 3.1step 1.2algebra∎

In either algorithm, let A0=A and let Aj be the approximation after the jth 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 ej=Aj−1−Aj is orthogonal to every later increment, which lies in the retained subspace at step j. Telescoping gives A−A^=∑jej, an orthogonal sum, and each ∥ej∥F is the recorded tail for that cut. Hence ∥A−A^∥F2=∑k=1d−1δk2. 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 δk=0 and the output is exactly A.

Depends on

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