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 checks commute and have two global relations
Statement
All star and plaquette checks of Toric star and plaquette checks commute. The product of all stars is the identity, and the product of all plaquettes is the identity.
Facts & Assumptions
Given: The periodic torus with and its star and plaquette checks.
Toric star and plaquette checks: is on the four edges incident to , and is on the four edges of .
Pauli commutator is symplectic pairing: two Pauli operators commute when the mod-two symplectic pairing of their binary supports is zero; for an -support and a -support, this pairing is their overlap parity.
Periodic square cellulation of the torus: every edge has two distinct endpoints and borders two distinct faces, with all incidences read modulo .
Proof
For a fixed vertex , the only faces sharing its incident edges are . Their boundaries overlap the star support respectively in , , , and ; every other face has empty overlap. Hence every star-plaquette overlap has even size. By [F2], each star commutes with each plaquette. Two stars commute because all their nonidentity factors are ; two plaquettes commute because all their nonidentity factors are .
By [F3], every edge has exactly two endpoints, so in the product of all stars its factor occurs twice. Since , the total product is . Every edge borders exactly two faces, so the same argument with gives . The first total product is also .
Depends on
Used by
- Finite toric-code Hamiltonian Definition
- Noncontractible toric logical loops Definition
- L=3 torus checks and syndrome calculation Example
- Toric checks decompose into joint syndrome eigenspaces Lemma
- Exact indistinguishability in a contractible disk Theorem
- The periodic toric code encodes two qubits Theorem
Dependency tree · two levels
10 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
- 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)