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.
Toric cycle classes are determined by two winding parities
Statement
Let be the space of primal edge chains with even incidence at every vertex, and let be the span of the face boundaries. Then , the quotient has dimension two, and the two winding parities give coordinates on that quotient. The same statement holds for dual edge chains, with dual face boundaries (the stars around primal vertices) in place of primal face boundaries. The horizontal loop has winding pair , and the vertical loop has pair ; their dual counterparts give the corresponding basis of the dual quotient.
Facts & Assumptions
Given: The periodic square cellulation for . Here with addition modulo two, and is the coordinate vector space on a finite set .
Periodic square cellulation of the torus: there are vertices and faces and edges, with horizontal and vertical edges indexed periodically.
Toric incidence maps have exactly one relation each: the span of face boundaries has dimension , and the vertex-edge and dual incidence graphs are connected.
Proof
The primal vertex-edge graph has the explicit spanning tree . The horizontal edges form a path through row zero, and each other row is attached to that path by one vertical column path; hence is connected and has no cycle. For each edge , add to the unique tree path between its endpoints. This gives a cycle containing and no other edge outside . These cycles are independent because the coefficient of each non-tree edge in a linear combination is its own coefficient. They span : subtract from any cycle the corresponding to its non-tree edges; the remainder is an even-incidence chain supported on the tree, and a nonempty finite forest has a leaf of odd degree, so the remainder is zero. Thus .
Every face boundary has even incidence at each vertex, so . By [F2], . For a cycle , define and , with all sums in . Summing the even-incidence equations over column shows ; summing over row shows . Thus the two parities are independent of the chosen cuts. Each face boundary crosses every such cut zero or two times, so both parities vanish on .
The horizontal fundamental loop has , and the vertical fundamental loop has . Therefore no nonzero combination of these loops lies in . A basis of together with is an independent family of cycles, which is the dimension of from step 1.1. It is therefore a basis of , proving that the winding map identifies with . The dual square cellulation has the same coordinate graph and incidence counts, so the identical argument proves its two winding coordinates.
Depends on
Used by
- Noncontractible toric logical loops Definition
- Toric code distance is L Theorem
Dependency tree · two levels
3 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.
Sources
- Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill, Topological quantum memory (standard reference, not scraped)
- Alexei Kitaev, Fault-tolerant quantum computation by anyons (standard reference, not scraped)