Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Sequential Schmidt truncation

Definition

Input an integer N≥1, nonzero finite-dimensional complex inner-product spaces H1,…,HN with fixed ordered orthonormal bases, a normalized vector ψ∈H1⊗⋯⊗HN with exact coefficients in those bases, and integer rank caps Dk≥1 for 1≤k<N. For N=1 the cap list is empty. The algorithm performs the following exact finite procedure.

  1. Set the current remainder to ψ(0):=ψ, the retained left space before the first cut to S0:=C, and an empty list of site tensors and discarded squared norms.

  2. For each k=1,…,N−1, reshape the current remainder as a matrix whose row index is the retained left index in Sk−1 together with the physical basis index in Hk, and whose column index is the ordered product basis of Hk+1⊗⋯⊗HN. Compute an exact singular value decomposition. Order the positive singular values nonincreasingly. Within each repeated positive singular value, form a deterministic orthonormal basis of its left singular subspace by projecting the row-coordinate standard basis vectors in lexicographic order and applying Gram–Schmidt, discarding zero residuals; obtain the corresponding right singular vector as M∗u/s for singular value s>0. Retain the first mk:=min⁡(Dk,rk) positive singular directions, where rk is the number of positive singular values, and record δk:=∑j=mk+1rksk,j2 from this current unnormalized remainder. Reshape the retained left singular vectors into a site tensor Akik with left index in Sk−1 and right index in Sk:=Cmk; pass the retained singular values times the adjoints of the retained right singular vectors as the next current remainder ψ(k). Since the input has norm one and Dk≥1, every current remainder is nonzero and each mk≥1.

  3. After the last cut, reshape the remaining array as the final site tensor ANiN, use outer bond dimensions D0=DN=1 with scalar boundary columns ℓ=r=(1), and return the contracted unnormalized open MPS ϕ:=∑i1,…,iNℓ∗A1i1⋯ANiNr ∣i1⟩⊗⋯⊗∣iN⟩∈H1⊗⋯⊗HN, the list (δ1,…,δN−1), and the bond dimensions (m1,…,mN−1). Each ∣ij⟩ runs through the fixed ordered orthonormal basis of Hj. For N>1, the compressed remainder ψ(N−1)∈SN−1⊗HN supplies the entries of ANiN; its retained left index is contracted with the preceding site tensors to form ϕ. For N=1, return ϕ=ψ and empty lists with the same scalar boundaries. If ∥ϕ∥2=0, return a norm-zero flag and do not normalize. Otherwise an optional normalized copy is ϕ/∥ϕ∥; the returned ϕ and discarded norms always refer to the unnormalized sweep output.

All coefficients and SVDs are exact mathematical objects; no floating-point threshold is used. The tie rule fixes a choice even when a rank cap cuts through a degenerate singular-value subspace.

Depends on

Dependency tree · 2 levels

Sources