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.
Open strings create endpoint defects
Finite-dimensional example in the exact unperturbed toric-code Hamiltonian; no empirical or perturbative claim.
Example
On a finite connected toric-code cellulation, let be a primal path that visits no vertex twice and has distinct endpoint vertices , and let be a dual path that visits no face twice and has distinct endpoint faces . Acting on any ground vector, the string along flips exactly the endpoint eigenvalues and raises the energy by . The string along flips exactly and raises the energy by .
Example references
Facts & Assumptions
Given: The finite Hamiltonian and open-string conventions of Toric-code edge spins on closed-surface cellulations, together with the path hypotheses in the statement.
Toric-code edge spins on closed-surface cellulations: with ; use the coordinate pairing in , and the dual graph's mod-two incidence map is ; the commuting self-adjoint involutions are and ; the finite edge Hilbert space is ; and is the sum of the positive penalties and .
Verification
The operators are commuting self-adjoint involutions by [F1], so is the orthogonal projection onto their common eigenspace. Expand this finite product. Each term is a tensor-product Pauli with coefficient : factors of the same type multiply without phases, and every vertex operator commutes with every face operator. For the ordinary matrix trace on , the trace of a tensor product is the product of the factor traces. A nonidentity Pauli therefore has trace zero because at least one edge factor is , , or , each of which has trace zero; an identity term has trace . The empty subset contributes one identity term and no term contributes negative trace, so . Thus . Since each penalty is an orthogonal projection and the couplings are positive, for every the quadratic form is . This is zero exactly when every penalty annihilates , equivalently when every stabilizer has eigenvalue . Hence is the common eigenspace and is nonzero, so it contains a ground vector of energy zero.
Let be the edge chain of the primal path . Because the path visits no vertex twice and has distinct endpoints, each internal vertex has even path incidence and the endpoints have odd incidence, so . For each vertex , ; commutes with every . Hence applying to any ground vector flips exactly and from to and leaves every other stabilizer eigenvalue unchanged.
Regard the dual path as a path in the dual graph whose vertices are faces, and let indicate the primal edges crossed by its dual edges. By the definition of the dual incidence map as , the no-repeated-face hypothesis and distinct endpoint faces give . For each face , ; commutes with every . Hence applying to any ground vector flips exactly and and leaves every other stabilizer eigenvalue unchanged.
By step 2.1, the vector has eigenvalue precisely for the two vertex stabilizers at and eigenvalue for every other stabilizer, when is a ground vector. Thus the only nonzero terms in are the penalties , each acting as multiplication by ; its -eigenvalue, and hence its energy increase from the ground eigenvalue zero, is .
By step 2.2, the vector has eigenvalue precisely for and eigenvalue for every other stabilizer, when is a ground vector. Therefore only the two penalties contribute, and its -eigenvalue, hence energy increase from zero, is .
Remarks
The diagram shows one three-edge primal path on a square-torus patch. Red endpoint markers denote the two flipped vertex constraints; blue edges denote the string. It illustrates the parity calculation and is not used in the proof.