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.

Tensor-train rounding

Definition

Work in exact arithmetic over F∈{R,C}. The input is a valid TT core list for a tensor of order d≥2 and exactly one of rank caps c1,…,cd−1∈N0 or absolute tail tolerances τ1,…,τd−1∈[0,∞).

  1. Left orthogonalize without truncation. For k=1,…,d−1, reshape core Gk into a matrix with rows (αk−1,ik) and columns αk. Compute an exact compact SVD M=UΣV∗, replace Gk by the reshape of U, and absorb ΣV∗ into the next core along their common bond. Omitting zero singular directions is exact. The resulting cores G1,…,Gd−1 are left-isometric.

  2. Truncate from right to left. For k=d,d−1,…,2, reshape the current Gk into a matrix Mk with rows αk−1 and columns (ik,αk), and compute an exact compact SVD Mk=UkΣkVk∗. If its positive singular values are σ1≥⋯≥σs>0, choose qk−1=min⁡(ck−1,s) for rank caps, or the least qk−1∈{0,…,s} with ∑j>qk−1σj2≤τk−12 for tolerances. Record δk−1=(∑j>qk−1σj2)1/2. Replace Gk by the reshape of the first qk−1 rows of Vk∗ and absorb Uk,1:qΣk,1:q into the previous core.

If qk−1=0, the represented tensor becomes zero; set all remaining internal ranks to zero and their unperformed tails to zero. If the input represents zero, return the all-zero-rank representation and zero tails immediately. The output is the rounded core list and all recorded cut tails. No finite-precision error guarantee is part of this exact-arithmetic procedure.

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