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 contractible toric disk lifts to the square grid
Statement
Write the torus as with its periodic square cellulation. Let be a nonempty compact embedded topological disk with connected complement. Then the quotient map has a lift on which it is one-to-one and maps homeomorphically onto . Consequently every finite primal or dual edge chain supported in lifts to a finite chain in the infinite square tiling, and cycles lift to cycles.
Facts & Assumptions
Given: The quotient torus , the square cellulation, and a compact embedded disk homeomorphic to the closed unit disk.
Proof
For any , choose an open square about of side length less than . Its translates by distinct vectors in are disjoint, and the quotient map restricts to a homeomorphism from each translate onto the same open neighborhood of . These neighborhoods cover the torus. For a path, pull back this cover to the compact interval, take a finite subcover and a Lebesgue number, and partition the interval into pieces of smaller length. Each piece maps into one such neighborhood; once its initial lift is fixed, the inverse on the unique sheet through that lift defines the lift on the piece. These pieces agree at endpoints, and uniqueness follows from uniqueness of the local inverse. For a homotopy square, use a finite grid of rectangles whose images each lie in one evenly covered neighborhood. Starting from a lifted corner, the local inverses extend across adjacent rectangles; on a common edge two extensions agree because they are lifts agreeing at one endpoint. Thus paths and homotopies lift after their initial data are fixed.
Fix and a lift . For each , lift a path from to starting at . Any two such paths are homotopic relative to their endpoints inside , since the disk is contractible. By the homotopy lifting construction in step 1.1, the lifted endpoint varies continuously through the discrete fiber over , so it is constant during the homotopy. Thus the endpoint is independent of the chosen path. These endpoints define a section of over ; local inverse charts from step 1.1 make the section continuous and one-to-one.
The image is compact because is compact and the section is continuous, hence it is bounded. The square and dual square tilings are locally finite, so only finitely many of their edges meet . The lift preserves local edge incidences by step 1.1. Therefore every finite primal or dual cycle supported in lifts to a finite edge chain with even incidence at each lifted vertex.
Depends on
Used by
Dependency tree · one level
1 result within one dependency step 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)