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.
Alternating tensor optimization and effective eigenproblems
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor train compression and truncation error
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
Finite Hermitian ground vectors and a deterministic tie rule
Statement
Let , let , and let satisfy . Define Then has a minimum , equal to the least eigenvalue of , and its minimizers are precisely the nonzero vectors in the lowest eigenspace . There is a deterministic choice of a unit minimizer: let be the orthogonal projection onto , scan the standard basis , and take the first with . Normalize ; over , if is its first nonzero coordinate, multiply by , and over multiply by .
Facts & Assumptions
Given: A real symmetric or complex Hermitian matrix with .
Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space: self-adjoint means , and every self-adjoint endomorphism is normal.
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 .
The Rayleigh quotient of a nonzero vector for a self-adjoint endomorphism: on a finite-dimensional real inner-product space, for .
Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces: for a self-adjoint endomorphism of an -dimensional real inner-product space, the least eigenvalue is the minimum of its Rayleigh quotient over nonzero vectors.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a finite-dimensional real self-adjoint endomorphism has an orthonormal eigenbasis.
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.
For a subspace of a finite-dimensional inner product space, : 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
Suppose . By [F2], represents a self-adjoint endomorphism in the standard orthonormal basis, and [F3] identifies its Rayleigh quotient with . Taking in [F4] gives . On each one-dimensional , homogeneity gives the same quotient for every nonzero vector, and every nonzero spans such a ; hence this minimum is exactly . By [F5], write in an orthonormal eigenbasis with real eigenvalues ; then , which equals exactly when every nonzero coefficient belongs to the least-eigenvalue eigenspace.
Suppose . By [F2], represents a self-adjoint endomorphism in the standard orthonormal basis; by [F1] this endomorphism is normal, so [F6] gives an orthonormal eigenbasis . Every eigenvalue is real because if , then , so is real and . For , the quotient is the weighted average , so it is at least the least eigenvalue and equals it exactly when all nonzero coefficients lie in its eigenspace.
In either field, the least eigenspace is nonzero, so [F7] gives a unique orthogonal decomposition of each vector into its and parts; define to be the first component. Uniqueness makes linear, since sums and scalar multiples of decompositions are the corresponding decompositions. At least one is nonzero, since otherwise linearity and the fact that the standard vectors span would imply , contradicting . The first such is uniquely determined by the fixed basis order. Normalize this projection. Over , its first nonzero coordinate is changed to by multiplication by ; over , multiplication by 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.
Rayleigh energy perturbation for normalized finite states
Statement
Let be a finite tensor-array space over , let be self-adjoint, and let satisfy . Then
Facts & Assumptions
Given: A finite tensor-array space, a self-adjoint endomorphism , and unit states in that space.
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 .
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: on a nonzero finite-dimensional domain, .
Cauchy–Schwarz: , 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.
Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space: self-adjointness means .
Proof
For every , : this is immediate for , and otherwise follows by applying [F2] to and scaling back.
By [F1], expand the difference as . Apply [F3] to both terms, then [F2] and step 1.1 to obtain a bound of . Finally, by [F1] and from [F4], so the energy values are real.
Finite matrix-product states and Hermitian Hamiltonians
Definition
Fix a field , an order , and positive physical dimensions . The finite coefficient space is the tensor-array space with the Frobenius pairing and lexicographic index conventions of Finite tensor arrays and the Frobenius inner product. A normalized finite state is an array with .
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 whose contraction is . In particular, each core has shape and the shared internal indices are summed.
A periodic MPS presentation consists of positive integers with and matrices for each . It represents the array 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 whose matrix in the standard lexicographic basis satisfies , 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 for a normalized state this equals .
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.
A periodic finite MPS has an exact open-boundary TT conversion
Statement
Let a periodic MPS presentation have order , positive cyclic bond sizes with , and matrices . It has an exactly equal open-boundary TT presentation with internal bond sizes for . In the pair index convention , define where for and otherwise, so every middle-core entry with unequal carried indices is zero, and For the middle-core clause is empty.
Facts & Assumptions
Given: A periodic trace MPS presentation over with and positive cyclic bond sizes.
Finite matrix-product states and Hermitian Hamiltonians: the periodic entry is , with of size and .
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
Expanding the matrix trace and the matrix products in [F1] gives This is a finite sum, and remains the same for with no intermediate factors.
Contract the cores defined in the Statement according to [F2]. Each internal TT bond is a pair , so its summation matches the adjacent physical matrix index while carrying the same to the next core. The resulting contraction sums once over and has exactly the product in step 1.1. Hence every array entry is unchanged, and the TT bond at cut has possible pair indices.
Rank-revealing QR sweeps give exact mixed canonical gauge
Statement
Let a nonzero finite open-boundary TT have order , and choose a center window with and . There is an exact rank-revealing QR transformation of its cores that preserves the represented array, makes every core left-isometric and every core 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 , 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 , with a selected one-site or two-site center window .
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.
Finite tensor arrays and the Frobenius inner product: the rank of a matrix is the dimension of its column image.
Tensor train cores, bond ranks, and canonical gauges: the left matricization is left-isometric when , and the right matricization is right-isometric when .
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
Let 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 and their count is by [F2]. If , apply [F4] to obtain a matrix with orthonormal columns spanning those retained columns; their Gram–Schmidt coordinates form an upper triangular with nonzero diagonal. If , then and use the empty factorization.
Move the retained column indices to the front by a permutation . Every remaining column lies in the span of , so it equals times its coordinate vector applied to that column. Thus for some , with ; equivalently where . This is an exact rank-revealing thin QR factorization for every rectangular shape.
Starting at the left boundary, apply step 2.1 to each left matricization of cores . Replace the current core matricization by and absorb into the next core. Since , the shared-index contraction in [F1] is unchanged; makes the replaced core left-isometric by [F3]. Induction over the swept cores gives the required left-isometric prefix.
Starting at the right boundary, apply step 2.1 to the adjoint of each right matricization of cores . If , then . Replace the current right matricization by and absorb into the preceding core. The shared-index contraction in [F1] is unchanged, and makes the replaced matricization right-isometric by [F3]. Induction gives the right-isometric suffix and preserves the represented array, while leaving cores untouched. If , the final absorption into core can change the contracted center coefficients; if , there is no right sweep.
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.
Canonical MPS environments are isometric and the effective Hamiltonian is Hermitian
Statement
Let a finite open-boundary TT have order and be in the following mixed gauge about a one-site or two-site center window , where : every core strictly left of is left-isometric and every core strictly right of is right-isometric. The center coefficient array has shape , with boundary ranks interpreted as one, and is its vectorization in the fixed lexicographic order. Hold every core outside fixed. Contracting the fixed prefix and suffix defines a linear embedding from center coefficients to the full tensor space. Then , so . For every finite Hermitian Hamiltonian input , the effective matrix is Hermitian and satisfies
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.
Finite matrix-product states and Hermitian Hamiltonians: a finite Hermitian Hamiltonian input has matrix in the standard lexicographic basis.
Finite tensor arrays and the Frobenius inner product: the Frobenius inner product conjugates the first entry and sums over all coefficient indices.
Tensor train cores, bond ranks, and canonical gauges: left core matricizations satisfy and right core matricizations satisfy .
Proof
Let be the prefix interface through site , with rows indexed by and columns by . Put . For , its recurrence is , where is the left matricization from [F3]. If , then and hence by [F3]. Induction gives . For the suffix, put and contract from right to left: for , , with rows indexed by and columns by . Since implies , the right-isometry in [F3] gives . Induction yields .
By [F1], the full array entries are the finite contractions of the fixed cores with the center coefficients. Expand 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 and from step 1.1. The remaining finite sum is exactly . Hence and .
By [F1], . Therefore . Associativity of finite matrix multiplication gives , as claimed.
An exact local DMRG ground solve does not increase Rayleigh energy
Statement
Let be a normalized finite MPS in mixed canonical gauge about a one-site or two-site center, with . Let be its effective Hermitian matrix, and replace the center by the deterministic unit ground vector of , giving . Then is normalized and 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 , and the current unit center vector .
Canonical MPS environments are isometric and the effective Hamiltonian is Hermitian: , is Hermitian, and .
Finite Hermitian ground vectors and a deterministic tie rule: the selected unit vector minimizes the Rayleigh quotient of the finite Hermitian matrix .
Finite matrix-product states and Hermitian Hamiltonians: a normalized finite state has Frobenius norm one and .
Proof
Since by [F1], the current center state has norm , and the updated state has norm . Thus both are admissible normalized states under [F3].
By [F2], . Use the pullback identity in [F1] on both sides and then [F3] to obtain .
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.
TT discarded weights bound the post-sweep DMRG energy increase
Statement
Let be a normalized finite MPS/TT state with a supplied concrete open-boundary TT core list or periodic trace presentation contracting to , and let 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 , with 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 , obtaining and discarded tails . Put . If , define . Then In particular, No normalized-output claim is made when .
Facts & Assumptions
Given: A supplied open-boundary TT core list or periodic trace presentation of a normalized input state, a finite Hermitian 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 .
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.
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.
Tensor-train rounding: exact TT rounding with rank caps records the omitted singular-value tails .
Exact TT ranks and root-sum-square truncation error: exact TT rounding with tails satisfies .
Rayleigh energy perturbation for normalized finite states: for unit states , .
The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: the Frobenius norm is homogeneous and satisfies the triangle inequality.
The reverse triangle inequality in a normed space: for vectors in a normed space, .
Proof
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 .
The tails are those recorded by [F3]. By [F4], . The triangle inequality [F6] gives , so and is defined.
By [F7], . Also, homogeneity [F6] and give . Therefore
Apply [F5] to the unit states and to get . Combine this with step 1.1 to obtain the claimed bound relative to . The same inequality gives the asserted upper bound on any post-rounding increase.
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.
5 · Examples, counterexamples and false statements
None yet.
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
- Grégoire Misguich, Introduction to matrix-product states and tensor networks, complete lecture notes (2026), §2.7
- Ulrich Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011), §6.3
- Ulrich Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011), §§4.1–4.4
- Grégoire Misguich, Introduction to matrix-product states and tensor networks, complete lecture notes (2026), §§2.1–2.4
- Ivan V. Oseledets, Tensor-Train Decomposition, SIAM Journal on Scientific Computing 33(5) (2011), §1
- Ulrich Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011), §§4.1, 4.6
- Grégoire Misguich, Introduction to matrix-product states and tensor networks, complete lecture notes (2026), §§2.1, 2.4.3
- Ulrich Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011), §§4.1.2, 4.1.3, 4.4
- Grégoire Misguich, Introduction to matrix-product states and tensor networks, complete lecture notes (2026), §§2.4.1–2.4.3
- Ulrich Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011), §§4.2, 4.4, 6.2–6.3
- Grégoire Misguich, Introduction to matrix-product states and tensor networks, complete lecture notes (2026), §§2.4.3, 2.7
- Ulrich Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011), §§6.2–6.4
- Ivan V. Oseledets, Tensor-Train Decomposition, SIAM Journal on Scientific Computing 33(5) (2011), §3
- Mi-Song Dupuy, Tensor trains for high-dimensional problems, lecture notes (March 11, 2026), §§1.2.2, 1.2.4–1.2.5
- Ulrich Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326 (2011), §§4.5, 6.4
- Ivan V. Oseledets, Tensor-Train Decomposition, SIAM Journal on Scientific Computing 33(5) (2011), §§2–3