Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

Two TT truncations realize the root-sum-square bound

Example

Let A∈R2×2×2 have nonzero entries A111=3, A122=1, and A212=2, with all other entries zero. Apply sequential TT-SVD with rank cap one at both cuts.

Verification

Given: The tensor and cap tuple (1,1) above.

[F1] Finite tensor arrays and the Frobenius inner product: the cut-k unfolding groups the first k indices into rows, the remaining indices into columns, and a reindexing preserves Frobenius norm.

[F2] Sequential tensor-train SVD: each step keeps the leading singular vectors up to its rank cap and records the discarded tail norm.

[F3] Exact TT ranks and root-sum-square truncation error: the total TT-SVD error is bounded by the root sum of squared cut tails.

1.1F1F2givenalgebra

With columns ordered by (i2,i3)=(1,1),(1,2),(2,1),(2,2), the first unfolding is (30010200). Its rows are orthogonal with norms 10 and 2, so the leading singular value is 10 and the first discarded tail is δ1=2. The retained left vector is (1,0)T, and the remainder Σ1V1∗ reshaped as a 2×2 matrix is (3001).

2.1F2F3step 1.1algebra∎

The second remainder has singular values 3 and 1, hence its rank-one truncation discards δ2=1 and returns the tensor A^=3e1⊗e1⊗e1. The omitted entries of A−A^ are e1⊗e2⊗e2 and 2e2⊗e1⊗e2, which are orthogonal and have squared norms 1 and 4. Therefore ∥A−A^∥F=5=δ12+δ22, realizing equality in [F3].

Depends on

Used by

Nothing in the library uses this result yet.

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