Alphabeta Math
Pipeline-generated
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.

✓ 8 results · all verified · 8 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 8 also cleared it.

Alternating tensor optimization and effective eigenproblems

1 · Prerequisites

2 · Summary

This page specifies normalized finite real or complex matrix-product states together with concrete open-boundary or periodic presentations, finite Hermitian Hamiltonian inputs, and exact one-site or two-site sweeps. Periodic trace presentations are converted exactly to open-boundary TT form before canonical QR sweeps. The local proofs show that mixed canonical environments give an identity local norm and a Hermitian effective Hamiltonian; an exact local ground solve weakly decreases energy before truncation. A normalized-state perturbation estimate and the TT root-sum-square tail bound control the possible post-sweep energy increase. Stationarity is conditional on convergent fixed-rank exact sweeps. No global minimum, polynomial cost, spectral-gap or convergence guarantee is asserted.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite Hermitian ground vectors and a deterministic tie rule

Statement

Let F∈{R,C}, let m≥1, and let A∈Fm×m satisfy A∗=A. Define qA(x):=x∗Axx∗x(x∈Fm∖{0}). Then qA has a minimum λmin⁡, equal to the least eigenvalue of A, and its minimizers are precisely the nonzero vectors in the lowest eigenspace Emin⁡=ker⁡(A−λmin⁡I). There is a deterministic choice of a unit minimizer: let Pmin⁡ be the orthogonal projection onto Emin⁡, scan the standard basis e1,…,em, and take the first j with Pmin⁡ej≠0. Normalize Pmin⁡ej; over C, if z is its first nonzero coordinate, multiply by z‾/∣z∣, and over R multiply by z/∣z∣.

Facts & Assumptions

Given: A real symmetric or complex Hermitian matrix A∈Fm×m with m≥1.

[F1]

Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space: self-adjoint means T∗=T, and every self-adjoint endomorphism is normal.

[F2]

In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose: in an orthonormal basis, self-adjointness is equivalent to the matrix identity A=A∗.

[F3]

The Rayleigh quotient of a nonzero vector for a self-adjoint endomorphism: on a finite-dimensional real inner-product space, RT(x)=⟨Tx,x⟩/⟨x,x⟩ for x≠0.

[F4]

Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces: for a self-adjoint endomorphism of an m-dimensional real inner-product space, the least eigenvalue is the minimum of its Rayleigh quotient over nonzero vectors.

[F5]
[F6]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a normal endomorphism of a finite-dimensional complex inner-product space has an orthonormal eigenbasis.

[F7]

For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥: a subspace of a finite-dimensional inner-product space has an orthogonal complement, and every vector has a unique decomposition into the subspace and its orthogonal complement.

Proof

1.1F2F3F4F5algebra

Suppose F=R. By [F2], A represents a self-adjoint endomorphism in the standard orthonormal basis, and [F3] identifies its Rayleigh quotient with qA. Taking k=m in [F4] gives λmin⁡=min⁡dim⁡W=1max⁡x∈W∖{0}qA(x). On each one-dimensional W, homogeneity gives the same quotient for every nonzero vector, and every nonzero x spans such a W; hence this minimum is exactly min⁡x≠0qA(x). By [F5], write x=∑jcjuj in an orthonormal eigenbasis with real eigenvalues λj; then qA(x)=∑jλjcj2/∑jcj2, which equals λmin⁡ exactly when every nonzero coefficient belongs to the least-eigenvalue eigenspace.

1.2F1F2F6algebra

Suppose F=C. By [F2], A represents a self-adjoint endomorphism in the standard orthonormal basis; by [F1] this endomorphism is normal, so [F6] gives an orthonormal eigenbasis u1,…,um. Every eigenvalue is real because if Auj=λjuj, then uj∗Auj‾=uj∗A∗uj=uj∗Auj, so λj∥uj∥2 is real and ∥uj∥2>0. For x=∑jcjuj≠0, the quotient is the weighted average ∑jλj∣cj∣2/∑j∣cj∣2, so it is at least the least eigenvalue and equals it exactly when all nonzero coefficients lie in its eigenspace.

2.1F2F4F5F6F7step 1.1step 1.2algebra∎

In either field, the least eigenspace is nonzero, so [F7] gives a unique orthogonal decomposition of each vector into its Emin⁡ and Emin⁡⊥ parts; define Pmin⁡ to be the first component. Uniqueness makes Pmin⁡ linear, since sums and scalar multiples of decompositions are the corresponding decompositions. At least one Pmin⁡ej is nonzero, since otherwise linearity and the fact that the standard vectors span Fm would imply Pmin⁡=0, contradicting Emin⁡≠{0}. The first such j is uniquely determined by the fixed basis order. Normalize this projection. Over C, its first nonzero coordinate z is changed to ∣z∣>0 by multiplication by z‾/∣z∣; over R, multiplication by z/∣z∣ makes that coordinate positive. These unit-modulus rescalings preserve the eigenvector and its Rayleigh quotient. The minimizer characterization in steps 1.1 and 1.2 proves the result.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Rayleigh energy perturbation for normalized finite states

Statement

Let H=Fn1×⋯×nd be a finite tensor-array space over F∈{R,C}, let H:H→H be self-adjoint, and let ψ,ϕ∈H satisfy ∥ψ∥F=∥ϕ∥F=1. Then ∣⟨ψ,Hψ⟩F−⟨ϕ,Hϕ⟩F∣≤2∥H∥op∥ψ−ϕ∥F.

Facts & Assumptions

Given: A finite tensor-array space, a self-adjoint endomorphism H, and unit states ψ,ϕ in that space.

[F1]

Finite tensor arrays and the Frobenius inner product: the Frobenius pairing is the finite sum of conjugate-entry times entry, and its induced norm is ∥⋅∥F.

[F2]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: on a nonzero finite-dimensional domain, ∥H∥op=max⁡∥x∥=1∥Hx∥.

[F3]

Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors: the absolute value of an inner product is at most the product of the two vector norms; conjugating or swapping the arguments leaves the modulus unchanged, so the inequality applies to the conjugate-first Frobenius pairing as well.

Proof

1.1givenF2algebra

For every v∈H, ∥Hv∥F≤∥H∥op∥v∥F: this is immediate for v=0, and otherwise follows by applying [F2] to v/∥v∥F and scaling back.

2.1givenF1F2F3F4step 1.1algebra∎

By [F1], expand the difference as ⟨ψ−ϕ,Hψ⟩F+⟨ϕ,H(ψ−ϕ)⟩F. Apply [F3] to both terms, then [F2] and step 1.1 to obtain a bound of ∥ψ−ϕ∥F∥H∥op∥ψ∥F+∥ϕ∥F∥H∥op∥ψ−ϕ∥F=2∥H∥op∥ψ−ϕ∥F. Finally, ⟨ψ,Hψ⟩F‾=⟨Hψ,ψ⟩F=⟨ψ,Hψ⟩F by [F1] and H∗=H from [F4], so the energy values are real.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite matrix-product states and Hermitian Hamiltonians

Definition

Fix a field F∈{R,C}, an order d≥2, and positive physical dimensions n1,…,nd. The finite coefficient space is the tensor-array space H=Fn1×⋯×nd with the Frobenius pairing and lexicographic index conventions of Finite tensor arrays and the Frobenius inner product. A normalized finite state is an array ψ∈H with ∥ψ∥F=1.

An open-boundary matrix-product state (MPS), or tensor train (TT), presentation is a TT core list from Tensor train cores, bond ranks, and canonical gauges with r0=rd=1 whose contraction is ψ. In particular, each core has shape rk−1×nk×rk and the shared internal indices are summed.

A periodic MPS presentation consists of positive integers r0,…,rd with rd=r0 and matrices Ak(ik)∈Frk−1×rk for each 1≤ik≤nk. It represents the array ψi1,…,id=tr⁡ ⁣(A1(i1)A2(i2)⋯Ad(id)). A finite MPS/TT state is a normalized array admitting at least one of these exact presentations; a presentation need not be unique or canonical.

A finite Hermitian Hamiltonian input is a linear endomorphism H:H→H whose matrix in the standard lexicographic basis satisfies H∗=H, where ∗ is conjugate transpose as in Finite tensor arrays and the Frobenius inner product. This page uses only that finite-dimensional Hermitian input and makes no claim about how a physical model assembles it. For nonzero ψ, its Rayleigh energy is EH(ψ)=⟨ψ,Hψ⟩F∥ψ∥F2; for a normalized state this equals ⟨ψ,Hψ⟩F.

Diagram

The diagram records the open-boundary chain with a two-site center. Each box is a core or the contracted center tensor, each horizontal wire is a summed virtual bond index, and each vertical open leg is a free physical index. Cores to the left and right of the center are isometric in their respective matricizations when the chain is in mixed canonical gauge. These wire conventions abbreviate the exact finite index sums in the definition and are not used as a proof.

G1¢¢¢Gk¡1Xk;k+1Gk+2¢¢¢Gd®k¡1®k+1i1ik¡1ik;ik+1ik+2id
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A periodic finite MPS has an exact open-boundary TT conversion

Statement

Let a periodic MPS presentation have order d≥2, positive cyclic bond sizes r0,…,rd with rd=r0, and matrices Ak(ik)∈Frk−1×rk. It has an exactly equal open-boundary TT presentation with internal bond sizes sk=rkr0 for 1≤k<d. In the pair index convention (ak,a0), define G1(1,i1,(a1,a0))=(A1(i1))a0,a1, Gk((ak−1,b0),ik,(ak,c0))=δb0c0(Ak(ik))ak−1,ak(2≤k<d, 1≤b0,c0≤r0), where δb0c0=1 for b0=c0 and 0 otherwise, so every middle-core entry with unequal carried indices is zero, and Gd((ad−1,a0),id,1)=(Ad(id))ad−1,a0. For d=2 the middle-core clause is empty.

Facts & Assumptions

Given: A periodic trace MPS presentation over F∈{R,C} with d≥2 and positive cyclic bond sizes.

[F1]

Finite matrix-product states and Hermitian Hamiltonians: the periodic entry is ψi1,…,id=tr⁡(A1(i1)⋯Ad(id)), with Ak(ik) of size rk−1×rk and rd=r0.

[F2]

Tensor train cores, bond ranks, and canonical gauges: an open-boundary TT entry is the sum of the product of its cores over every shared bond index, with boundary ranks one.

Proof

1.1givenF1algebra

Expanding the matrix trace and the matrix products in [F1] gives ψi1,…,id=∑a0=1r0∑a1=1r1⋯∑ad−1=1rd−1(A1(i1))a0,a1⋯(Ad(id))ad−1,a0. This is a finite sum, and remains the same for d=2 with no intermediate factors.

2.1givenF2step 1.1algebra∎

Contract the cores defined in the Statement according to [F2]. Each internal TT bond is a pair (ak,a0), so its summation matches the adjacent physical matrix index ak while carrying the same a0 to the next core. The resulting contraction sums once over a0,a1,…,ad−1 and has exactly the product in step 1.1. Hence every array entry is unchanged, and the TT bond at cut k has rkr0 possible pair indices.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Rank-revealing QR sweeps give exact mixed canonical gauge

Statement

Let a nonzero finite open-boundary TT have order d≥2, and choose a center window [s,t] with 1≤s≤t≤d and t−s+1∈{1,2}. There is an exact rank-revealing QR transformation of its cores that preserves the represented array, makes every core k<s left-isometric and every core k>t right-isometric, and removes exactly the dependent coordinates on each swept bond. No independent column direction is truncated; only exactly dependent directions are removed.

For each reshaped matrix M, the rank-revealing QR used here scans its columns in their fixed order, retaining a column exactly when it increases the span. It applies Gram–Schmidt to the retained columns, writes all other columns in that orthonormal span, and records the resulting permutation and coefficient factor.

Facts & Assumptions

Given: A nonzero open-boundary TT array over F∈{R,C}, with a selected one-site or two-site center window [s,t].

[F1]

Finite matrix-product states and Hermitian Hamiltonians: an open-boundary MPS/TT presentation is an exact TT core list with one-dimensional boundary bonds; a normalized state is nonzero.

[F2]

Finite tensor arrays and the Frobenius inner product: the rank of a matrix is the dimension of its column image.

[F3]

Tensor train cores, bond ranks, and canonical gauges: the left matricization is left-isometric when Q∗Q=I, and the right matricization is right-isometric when QQ∗=I.

[F4]

Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans: a finite linearly independent list in a real or complex inner-product space has an orthonormal list with the same successive spans, produced by Gram–Schmidt.

Proof

1.1givenF2F4construct

Let M∈Fm×n be any core matricization. Scan its columns in order, starting with an empty list and retaining a column exactly when it is not in the span of those already retained. At termination the retained columns are independent, and every skipped column lies in their final span; hence they span the column image of M and their count is q=rank⁡(M) by [F2]. If q>0, apply [F4] to obtain a matrix Q with orthonormal columns spanning those retained columns; their Gram–Schmidt coordinates form an upper triangular R11 with nonzero diagonal. If q=0, then M=0 and use the empty factorization.

2.1step 1.1algebra

Move the retained column indices to the front by a permutation Π. Every remaining column lies in the span of Q, so it equals Q times its coordinate vector Q∗ applied to that column. Thus MΠ=Q[R11 R12] for some R12, with Q∗Q=Iq; equivalently M=QB where B=[R11 R12]Π∗. This is an exact rank-revealing thin QR factorization for every rectangular shape.

3.1F1F3step 2.1inductionalgebra

Starting at the left boundary, apply step 2.1 to each left matricization of cores 1,…,s−1. Replace the current core matricization M by Q and absorb B into the next core. Since M=QB, the shared-index contraction in [F1] is unchanged; Q∗Q=Iq makes the replaced core left-isometric by [F3]. Induction over the swept cores gives the required left-isometric prefix.

3.2F1F3step 2.1inductionalgebra

Starting at the right boundary, apply step 2.1 to the adjoint M∗ of each right matricization of cores d,…,t+1. If M∗Π=QB, then M=ΠB∗Q∗. Replace the current right matricization by Q∗ and absorb ΠB∗ into the preceding core. The shared-index contraction in [F1] is unchanged, and Q∗Q=Iq makes the replaced matricization right-isometric by [F3]. Induction gives the right-isometric suffix and preserves the represented array, while leaving cores k<s untouched. If t<d, the final absorption into core t can change the contracted center coefficients; if t=d, there is no right sweep.

4.1givenF1step 3.1step 3.2algebra∎

The scan drops only columns already in the span of retained columns, so each bond dimension changes only from its former size to the exact matrix rank. If any swept matricization had rank zero, that core would be zero and the full TT contraction would be zero, contrary to the nonzero-state hypothesis; hence every reduced swept bond has positive dimension. Steps 3.1 and 3.2 establish the exact mixed canonical gauge.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Canonical MPS environments are isometric and the effective Hamiltonian is Hermitian

Statement

Let a finite open-boundary TT have order d≥2 and be in the following mixed gauge about a one-site or two-site center window J=[k,k+w−1], where w∈{1,2}: every core strictly left of J is left-isometric and every core strictly right of J is right-isometric. The center coefficient array has shape rk−1×nk×⋯×nk+w−1×rk+w−1, with boundary ranks interpreted as one, and x is its vectorization in the fixed lexicographic order. Hold every core outside J fixed. Contracting the fixed prefix and suffix defines a linear embedding E from center coefficients to the full tensor space. Then E∗E=I, so ∥Ex∥F=∥x∥2. For every finite Hermitian Hamiltonian input H, the effective matrix Heff:=E∗HE is Hermitian and satisfies ⟨Ex,HEx⟩F=x∗Heffx.

Facts & Assumptions

Given: A finite open-boundary TT, a one-site or two-site center in mixed canonical gauge, and a self-adjoint finite Hamiltonian.

[F1]

Finite matrix-product states and Hermitian Hamiltonians: a finite Hermitian Hamiltonian input has matrix H∗=H in the standard lexicographic basis.

[F2]

Finite tensor arrays and the Frobenius inner product: the Frobenius inner product conjugates the first entry and sums over all coefficient indices.

[F3]

Tensor train cores, bond ranks, and canonical gauges: left core matricizations satisfy L∗L=I and right core matricizations satisfy RR∗=I.

Proof

1.1givenF3inductionalgebra

Let Lj be the prefix interface through site j, with rows indexed by (i1,…,ij) and columns by αj. Put L0=[1]. For j<k, its recurrence is Lj=(Lj−1⊗Inj)Gj(L), where Gj(L) is the left matricization from [F3]. If Lj−1∗Lj−1=I, then (Lj−1⊗I)∗(Lj−1⊗I)=I⊗I and hence Lj∗Lj=Gj(L)∗Gj(L)=I by [F3]. Induction gives Lk−1∗Lk−1=I. For the suffix, put Rd+1=[1] and contract from right to left: for j>k+w−1, Rj=Gj(R)(Inj⊗Rj+1), with rows indexed by αj−1 and columns by (ij,…,id). Since Rj+1Rj+1∗=I implies (I⊗Rj+1)(I⊗Rj+1)∗=I⊗I, the right-isometry in [F3] gives RjRj∗=Gj(R)Gj(R)∗=I. Induction yields Rk+wRk+w∗=I.

2.1F1F2step 1.1algebra

By [F1], the full array entries are the finite contractions of the fixed cores with the center coefficients. Expand ⟨Ex,Ey⟩F using the conjugate-first finite sum in [F2], and first sum over the physical prefix and suffix indices. Those sums replace the interface factors by L∗L=I and RR∗=I from step 1.1. The remaining finite sum is exactly ⟨x,y⟩F. Hence E∗E=I and ∥Ex∥F=∥x∥2.

3.1F1algebra∎

By [F1], H∗=H. Therefore Heff∗=(E∗HE)∗=E∗H∗E=E∗HE=Heff. Associativity of finite matrix multiplication gives ⟨Ex,HEx⟩F=x∗E∗HEx=x∗Heffx, as claimed.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

An exact local DMRG ground solve does not increase Rayleigh energy

Statement

Let ψ0=Ex0 be a normalized finite MPS in mixed canonical gauge about a one-site or two-site center, with ∥x0∥2=1. Let Heff=E∗HE be its effective Hermitian matrix, and replace the center by the deterministic unit ground vector x∗ of Heff, giving ψ∗=Ex∗. Then ψ∗ is normalized and EH(ψ∗)≤EH(ψ0). This claim is before any bond truncation.

Facts & Assumptions

Given: The finite-state and Hermitian-Hamiltonian conventions, an isometric one-site or two-site center embedding E, and the current unit center vector x0.

[F1]

Canonical MPS environments are isometric and the effective Hamiltonian is Hermitian: E∗E=I, Heff=E∗HE is Hermitian, and ⟨Ex,HEx⟩F=x∗Heffx.

[F2]

Finite Hermitian ground vectors and a deterministic tie rule: the selected unit vector x∗ minimizes the Rayleigh quotient of the finite Hermitian matrix Heff.

[F3]

Finite matrix-product states and Hermitian Hamiltonians: a normalized finite state has Frobenius norm one and EH(ψ)=⟨ψ,Hψ⟩F.

Proof

1.1givenF1F3algebra

Since E∗E=I by [F1], the current center state ψ0=Ex0 has norm ∥x0∥2=1, and the updated state ψ∗=Ex∗ has norm ∥x∗∥2=1. Thus both are admissible normalized states under [F3].

2.1F1F2F3step 1.1algebra∎

By [F2], x∗∗Heffx∗≤x0∗Heffx0. Use the pullback identity in [F1] on both sides and then [F3] to obtain EH(ψ∗)≤EH(ψ0).

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

TT discarded weights bound the post-sweep DMRG energy increase

Statement

Let ψ0 be a normalized finite MPS/TT state with a supplied concrete open-boundary TT core list or periodic trace presentation contracting to ψ0, and let H be a finite Hermitian Hamiltonian on the same coefficient space. Run Finite alternating tensor optimization with effective eigenproblems for one full forward/backward sweep of a fixed width w∈{1,2}, with M=1 and no rank caps, from that presentation using exact local solves and exact SVD splits; call its normalized unrounded output ψ∗. Apply exact TT rounding with rank caps c1,…,cd−1∈N0, obtaining ψ~ and discarded tails δ1,…,δd−1. Put τ=(∑k=1d−1δk2)1/2. If τ<1, define ϕ=ψ~/∥ψ~∥F. Then EH(ϕ)≤EH(ψ0)+4∥H∥opτ. In particular, EH(ϕ)−EH(ψ∗)≤4∥H∥opτ. No normalized-output claim is made when τ≥1.

Facts & Assumptions

Given: A supplied open-boundary TT core list or periodic trace presentation of a normalized input state, a finite Hermitian H on the same coefficient space, the exact one-sweep no-rank-cap execution and subsequent exact TT rounding described above, and total discarded-tail bound τ<1.

[F1]

Finite alternating tensor optimization with effective eigenproblems: one sweep consists of finitely many exact local ground solves, exact SVD splits, and optional TT rounding only after the completed sweep.

[F2]

An exact local DMRG ground solve does not increase Rayleigh energy: each exact local solve before truncation weakly decreases the global Rayleigh energy and preserves normalization.

[F3]

Tensor-train rounding: exact TT rounding with rank caps records the omitted singular-value tails δk.

[F4]

Exact TT ranks and root-sum-square truncation error: exact TT rounding with tails δk satisfies ∥ψ∗−ψ~∥F2≤∑kδk2.

[F5]

Rayleigh energy perturbation for normalized finite states: for unit states ψ,ϕ, ∣EH(ψ)−EH(ϕ)∣≤2∥H∥op∥ψ−ϕ∥F.

[F6]

The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: the Frobenius norm is homogeneous and satisfies the triangle inequality.

[F7]

The reverse triangle inequality in a normed space: for vectors x,y in a normed space, ∣∥x∥−∥y∥∣≤∥x−y∥.

Proof

1.1givenF1F2induction

There are finitely many local updates in the sweep. Each exact local solve preserves normalization and weakly decreases energy by [F2]; each intervening exact SVD split preserves the represented tensor and therefore its norm and energy by [F1]. Induction over this finite sequence shows that every intermediate state stays normalized and its energy does not exceed the preceding one. Hence EH(ψ∗)≤EH(ψ0).

1.2givenF3F4F6algebra

The tails δk are those recorded by [F3]. By [F4], e:=∥ψ∗−ψ~∥F≤τ. The triangle inequality [F6] gives 1=∥ψ∗∥F≤e+∥ψ~∥F, so ∥ψ~∥F≥1−e≥1−τ>0 and ϕ is defined.

2.1givenF6F7step 1.2algebra

By [F7], ∣1−∥ψ~∥F∣≤e. Also, homogeneity [F6] and ϕ=ψ~/∥ψ~∥F give ∥ϕ−ψ~∥F=∣1−∥ψ~∥F∣. Therefore ∥ϕ−ψ∗∥F≤∥ϕ−ψ~∥F+∥ψ~−ψ∗∥F≤2e≤2τ.

3.1givenF5step 1.1step 2.1algebra∎

Apply [F5] to the unit states ϕ and ψ∗ to get EH(ϕ)≤EH(ψ∗)+4∥H∥opτ. Combine this with step 1.1 to obtain the claimed bound relative to ψ0. The same inequality gives the asserted upper bound on any post-rounding increase.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Convergent fixed-rank exact sweeps are coordinatewise stationary

Statement

Fix a finite Hermitian Hamiltonian H on the coefficient space of the states. Consider an infinite sequence obtained by repeatedly applying one full no-truncation sweep of Finite alternating tensor optimization with effective eigenproblems, starting from a supplied concrete open-boundary TT core list or periodic trace presentation representing a normalized state, with fixed bond dimensions and a fixed finite list of one-site or two-site update windows. Assume the canonical core arrays at every stage of each sweep are bounded and converge componentwise in one consistent gauge to a single normalized canonical core tuple. Then the limit is coordinatewise stationary, meaning that for each update window, its limiting center vector minimizes the Rayleigh quotient of the effective Hermitian Hamiltonian over all unit center vectors with the other limiting cores fixed. In particular, each limiting center is a lowest eigenvector of its limiting effective Hamiltonian. This is conditional on the stated convergence; it asserts neither convergence of DMRG nor global minimality.

Facts & Assumptions

Given: A fixed finite Hermitian H, an infinite sequence of exact no-truncation sweeps initialized by a supplied concrete presentation of a normalized state, fixed finite tensor dimensions and bond dimensions, and bounded componentwise convergence of the canonical core arrays at every update stage in a consistent gauge.

[F1]

Finite alternating tensor optimization with effective eigenproblems: each local update is an exact ground solve in the one-site or two-site center space, and no truncation occurs in this branch.

[F2]

Canonical MPS environments are isometric and the effective Hamiltonian is Hermitian: each local center embedding is isometric and its effective Hamiltonian is Hermitian.

[F3]

Finite Hermitian ground vectors and a deterministic tie rule: the quotient minimizers of a finite Hermitian matrix are precisely its least eigenspace, and the selected ground vector is unit.

Proof

1.1givenF1F2algebra

Fix one update window. Each entry of its prefix and suffix interface and of its effective Hamiltonian is a finite sum of products of core entries and fixed entries of H. Therefore these entries depend continuously on the canonical core arrays. By the assumed componentwise convergence at every stage, the center vectors and effective Hamiltonians at this window converge to limits x∗ and Heff,∗.

2.1F1F2F3step 1.1algebra

For every sweep index m and every unit vector y in this fixed center coefficient space, the exact update at the chosen window gives xm∗Heff,mxm≤y∗Heff,my by [F1] and [F3]. Taking the limit as m→∞ preserves the inequality because matrix multiplication is continuous, giving x∗∗Heff,∗x∗≤y∗Heff,∗y for every unit y. Thus the limiting center minimizes its local Rayleigh quotient and, by [F3], is a lowest eigenvector.

3.1givenstep 1.1step 2.1algebra∎

The update-window list is finite. Apply steps 1.1 and 2.1 to each window in that list. Every limiting center is therefore a local Rayleigh minimizer with all other limiting cores fixed, which is exactly coordinatewise stationarity as defined in the Statement. The argument makes no comparison with states outside those local coordinate spaces.

5 · Examples, counterexamples and false statements

None yet.

Sources