Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Sequential tensor-train SVD

Definition

Work in exact arithmetic over F∈{R,C}. The input is a tensor A∈Fn1×⋯×nd with d≥2, and exactly one of:

  • rank caps c1,…,cd−1∈N0; or
  • absolute tail tolerances τ1,…,τd−1∈[0,∞).

At cut k, flatten the current remainder with rows (αk−1,ik) and columns (ik+1,…,id), where α0=1, and compute an exact compact SVD Mk=UkΣkVk∗. Its positive singular values are ordered decreasingly as σ1,…,σs. Under rank caps choose qk=min⁡(ck,s). Under tolerances choose the least qk∈{0,…,s} for which ∑j>qkσj2≤τk2. This set is nonempty because qk=s gives tail zero. Record the discarded tail δk=(∑j>qkσj2)1/2.

Reshape the first qk columns of Uk into core Gk and reshape Σk,1:qkVk,1:qk∗ as the next remainder. After cut d−1, reshape the remaining matrix as Gd. If qk=0, the remainder has zero row dimension; all later ranks and tails are set to zero and the remaining cores are the corresponding empty zero arrays. Thus the zero tensor has all internal ranks zero, a cap zero returns the zero tensor, and a tolerance large enough to select qk=0 does the same. The output is the TT core list and the cut tails (δk). Any SVD tie at a retained cutoff may be resolved by any orthonormal choice within the tied singular subspace.

Depends on

Used by

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