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.
A degenerate local ground eigenspace has a deterministic tie choice
Example
For two spin- sites let and . Use the initial state with rank-one open-boundary TT cores for , and run one width-two sweep without rank caps. The two-site ground eigenspace is . The deterministic standard-basis projection rule in Finite Hermitian ground vectors and a deterministic tie rule selects .
Facts & Assumptions
Given: The ordered two-site computational basis , the initial core list and width-two no-cap sweep specified above, and the Hamiltonian .
Finite matrix-product states and Hermitian Hamiltonians: a finite Hermitian Hamiltonian acts on the finite tensor-array coefficient space.
Finite Hermitian ground vectors and a deterministic tie rule: among lowest eigenvectors, the rule projects standard basis vectors in order and takes the first nonzero projection.
Finite alternating tensor optimization with effective eigenproblems: the exact local solve uses that deterministic ground-vector rule.
Verification
In the ordered basis, . Its least eigenvalue is and its eigenspace is exactly .
The orthogonal projection onto that eigenspace sends to zero and sends to itself. Hence the first standard basis vector with nonzero projection is ; it is already unit length and has positive first nonzero coordinate. The local solve therefore returns deterministically, with energy .
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.