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 , nonzero finite-dimensional complex inner-product spaces with fixed ordered orthonormal bases, a normalized vector with exact coefficients in those bases, and integer rank caps for . For the cap list is empty. The algorithm performs the following exact finite procedure.
-
Set the current remainder to , the retained left space before the first cut to , and an empty list of site tensors and discarded squared norms.
-
For each , reshape the current remainder as a matrix whose row index is the retained left index in together with the physical basis index in , and whose column index is the ordered product basis of . 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 for singular value . Retain the first positive singular directions, where is the number of positive singular values, and record from this current unnormalized remainder. Reshape the retained left singular vectors into a site tensor with left index in and right index in ; pass the retained singular values times the adjoints of the retained right singular vectors as the next current remainder . Since the input has norm one and , every current remainder is nonzero and each .
-
After the last cut, reshape the remaining array as the final site tensor , use outer bond dimensions with scalar boundary columns , and return the contracted unnormalized open MPS , the list , and the bond dimensions . Each runs through the fixed ordered orthonormal basis of . For , the compressed remainder supplies the entries of ; its retained left index is contracted with the preceding site tensors to form . For , return and empty lists with the same scalar boundaries. If , 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.