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.
Finite square-lattice cycles are boundaries
Statement
In the infinite square lattice, every finitely supported edge chain over whose incidence at each vertex is even is the boundary of a finitely supported collection of square faces. The same conclusion holds for the translated dual square lattice.
Facts & Assumptions
Given: Finitely supported coefficients on the horizontal and vertical edges of the integer square lattice, satisfying the cycle equations
for every . All sums below are finite because the coefficients have finite support.
Proof
For each row , sum the cycle equations over . The horizontal terms cancel in pairs, giving , where . Finite support gives for all sufficiently large , so for every . Define a face coefficient in . For fixed , this coefficient is zero for sufficiently large by finite support and for sufficiently negative because then it equals . It is also zero for all but finitely many rows. Hence is a finitely supported face chain.
The vertical edge belongs to the boundaries of and , so its coefficient in is . Thus and the given chain agree on every vertical edge.
The horizontal edge belongs to the boundaries of and . Its coefficient in is . The cycle equation at replaces each summand by ; summing over telescopes to because the sequence is finitely supported. Thus and the given chain agree on every horizontal edge, proving . Translating the dual square lattice by identifies it with the same integer grid, so the identical construction proves the dual assertion.
Used by
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
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)