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 incidence maps have exactly one relation each
Statement
For , the star-support vectors in have span dimension , and their only relation is their total sum. The face-boundary vectors have the same span dimension and their only relation is their total sum. The dual-face incidence statement has the same rank.
Facts & Assumptions
Given: The periodic square cellulation with vertices , edges , and faces .
Periodic square cellulation of the torus: the vertex-edge graph and the face-adjacency graph are connected; every edge has two distinct endpoints and separates two distinct adjacent faces.
Rank-nullity: : for a linear map with finite-dimensional domain, the dimension of its image equals the dimension of its domain minus the dimension of its kernel.
Proof
Define by sending a coordinate vector at a vertex to its star-support vector and extending linearly. The coefficient of an edge joining vertices in is . Thus consists exactly of assignments constant along every edge. By [F1] the vertex graph is connected, so is the one-dimensional space of constant assignments. Since , [F2] gives . The all-vertex sum is zero because each edge has two endpoints, so this is the only star relation.
Define by sending a face coordinate vector to that face's boundary and extending linearly. An edge separating faces has coefficient in . Thus consists exactly of assignments constant along adjacent faces. By [F1] the face-adjacency graph is connected, so is the one-dimensional space of constant assignments. Since , [F2] gives . The all-face sum is zero because each edge borders two faces, so this is the only face-boundary relation. The dual face-adjacency graph has the same square-grid incidence, proving its incidence rank is also .
Depends on
Used by
Dependency tree · two levels
7 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)