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.

Finite alternating tensor optimization with effective eigenproblems

Definition

Work in exact arithmetic over a fixed field F∈{R,C} and order d≥2. The inputs are:

  • a normalized finite MPS/TT state ψ∈Fn1×⋯×nd 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 H on that same tensor-array coefficient space;
  • a positive integer sweep budget M;
  • a window width w∈{1,2}; and
  • optionally, positive integer rank caps c1,…,cd−1.

The procedure is the following.

  1. 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.

  2. For each of M full sweeps, perform one forward pass and one backward pass. For width w, the windows are the d single sites when w=1, or the d−1 adjacent site pairs when w=2. Visit them in increasing order in the forward pass and decreasing order in the backward pass.

  3. 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 E and compute the finite effective matrix Heff=E∗HE.

  4. Apply the exact ground-vector rule of Finite Hermitian ground vectors and a deterministic tie rule to Heff. Let x be the resulting unit eigenvector and replace the center coefficient vector by x. Record its local Rayleigh energy x∗Heffx=λmin⁡ and residual ∥Heffx−λmin⁡x∥2.

  5. 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 X=UΣV∗. In a forward pass replace the first core by the reshape of U and absorb ΣV∗ into the second core. In a backward pass absorb UΣ into the first core and replace the second core by the reshape of V∗. Retain every positive singular direction, so this split changes no tensor entries. For a one-site window, keep that site as the center.

  6. After each complete forward/backward sweep, if rank caps were supplied, apply Tensor-train rounding to the current TT and record its cut tails δ1,…,δd−1 and τ=(∑k=1d−1δk2)1/2. If τ<1, normalize the rounded tensor and continue from it. If τ≥1, 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

Used by

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