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.
Finite alternating tensor optimization with effective eigenproblems
Definition
Work in exact arithmetic over a fixed field and order . The inputs are:
- a normalized finite MPS/TT state together with one concrete presentation of , either an open-boundary TT core list or periodic trace matrices; the supplied presentation must contract to ;
- a finite Hermitian Hamiltonian on that same tensor-array coefficient space;
- a positive integer sweep budget ;
- a window width ; and
- optionally, positive integer rank caps .
The procedure is the following.
-
If the supplied presentation is in periodic trace form, convert it exactly to the open-boundary TT form using A periodic finite MPS has an exact open-boundary TT conversion. Otherwise take the supplied open-boundary core list. Keep the resulting open-boundary core list.
-
For each of full sweeps, perform one forward pass and one backward pass. For width , the windows are the single sites when , or the adjacent site pairs when . Visit them in increasing order in the forward pass and decreasing order in the backward pass.
-
Before each window update, place the TT in mixed canonical gauge about that window using the deterministic rank-revealing QR sweeps of Rank-revealing QR sweeps give exact mixed canonical gauge. Contract the fixed left and right cores to form the isometric center embedding and compute the finite effective matrix .
-
Apply the exact ground-vector rule of Finite Hermitian ground vectors and a deterministic tie rule to . Let be the resulting unit eigenvector and replace the center coefficient vector by . Record its local Rayleigh energy and residual .
-
For a two-site window, reshape the updated center as a matrix with row index (left bond, first physical index) and column index (second physical index, right bond). Compute an exact compact SVD . In a forward pass replace the first core by the reshape of and absorb into the second core. In a backward pass absorb into the first core and replace the second core by the reshape of . Retain every positive singular direction, so this split changes no tensor entries. For a one-site window, keep that site as the center.
-
After each complete forward/backward sweep, if rank caps were supplied, apply Tensor-train rounding to the current TT and record its cut tails and . If , normalize the rounded tensor and continue from it. If , discard that rounded candidate, retain the last normalized unrounded tensor, and record status rounding-skipped. If no rank caps were supplied, do not round.
Return the final normalized TT state, the energy and local-residual records, all accepted discarded-tail records, and status budget-complete or rounding-skipped according to whether any requested rounding was skipped.
Remarks
The local eigenproblem is specified as an exact finite Hermitian ground solve. The procedure makes no finite-precision stability, polynomial-cost, spectral-gap, global-minimizer, or convergence claim. A periodic input is first converted exactly to an open-boundary TT; the canonical environment argument is applied only to that open-boundary representation.
Depends on
- Finite matrix-product states and Hermitian Hamiltonians
- A periodic finite MPS has an exact open-boundary TT conversion
- Rank-revealing QR sweeps give exact mixed canonical gauge
- Canonical MPS environments are isometric and the effective Hamiltonian is Hermitian
- Finite Hermitian ground vectors and a deterministic tie rule
- Tensor-train rounding
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
Used by
- A degenerate local ground eigenspace has a deterministic tie choice Example
- A two-site spin-chain local solve reaches the exact ground state Example
- A two-site TT truncation can increase energy after an exact solve Example
- Convergent fixed-rank exact sweeps are coordinatewise stationary Theorem
- TT discarded weights bound the post-sweep DMRG energy increase Theorem
Dependency tree · two levels
21 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
- Ulrich Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011), §§6.2–6.4 (standard reference, not scraped)
- Grégoire Misguich, Introduction to matrix-product states and tensor networks, complete lecture notes (2026), §2.7 (standard reference, not scraped)
- Ivan V. Oseledets, Tensor-Train Decomposition, SIAM Journal on Scientific Computing 33(5) (2011), §3 (standard reference, not scraped)
- Mi-Song Dupuy, Tensor trains for high-dimensional problems, lecture notes (March 11, 2026), §§1.2.2, 1.2.4–1.2.5 (standard reference, not scraped)