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.
Convergent fixed-rank exact sweeps are coordinatewise stationary
Statement
Fix a finite Hermitian Hamiltonian 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 , 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.
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.
Canonical MPS environments are isometric and the effective Hamiltonian is Hermitian: each local center embedding is isometric and its effective Hamiltonian is Hermitian.
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
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 . 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 and .
For every sweep index and every unit vector in this fixed center coefficient space, the exact update at the chosen window gives by [F1] and [F3]. Taking the limit as preserves the inequality because matrix multiplication is continuous, giving for every unit . Thus the limiting center minimizes its local Rayleigh quotient and, by [F3], is a lowest eigenvector.
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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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.3–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)