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.
Periodic square cellulation of the torus
Definition
Fix an integer and write . The periodic square cellulation has vertices , horizontal edges from to , vertical edges from to , and faces , for . Every index is read modulo . The boundary of consists of . Equivalently, this is the quotient of the unit square tiling of by translations in .
The cellulation has vertices, edges, and faces. The condition ensures that the four edges in each star and face are distinct, and that every edge has two distinct endpoints and two distinct incident faces. The vertex-edge graph joins vertices joined by an edge. The face-adjacency graph joins faces sharing an edge; both graphs are connected.
Facts & Assumptions
Given: An integer and coordinate indices in .
Verification
The horizontal and vertical edges are indexed by two disjoint copies of , so there are edges; the vertex and face sets each have indices. At the four incident edges are . Their endpoints are distinct because .
The faces adjacent to are and , and the faces adjacent to are and . These pairs are distinct for ; each displayed face boundary has four distinct edges. Thus the stated incidences define a square cellulation without repeated incidences.
Repeated horizontal and vertical steps modulo connect any pair of vertices. The same coordinate moves connect any pair of face indices through shared edges. Therefore both graphs defined above are connected.
Used by
- Noncontractible toric logical loops Definition
- Toric star and plaquette checks Definition
- L=3 torus checks and syndrome calculation Example
- A contractible toric disk lifts to the square grid Lemma
- Toric checks commute and have two global relations Lemma
- Toric cycle classes are determined by two winding parities Lemma
- Toric incidence maps have exactly one relation each Lemma
- Exact indistinguishability in a contractible disk Theorem
- The periodic toric code encodes two qubits Theorem
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Alexei Kitaev, Fault-tolerant quantum computation by anyons (standard reference, not scraped)
- Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill, Topological quantum memory (standard reference, not scraped)